Efficient algorithms using the multiplicative weights update method
暂无分享,去创建一个
[1] J. Neumann,et al. SOLUTIONS OF GAMES BY DIFFERENTIAL EQUATIONS , 1950 .
[2] J. Robinson. AN ITERATIVE METHOD OF SOLVING A GAME , 1951, Classics in Game Theory.
[3] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[4] S. Golden. LOWER BOUNDS FOR THE HELMHOLTZ FUNCTION , 1965 .
[5] C. Thompson. Inequality with Applications in Statistical Mechanics , 1965 .
[6] J. Cheeger. A lower bound for the smallest eigenvalue of the Laplacian , 1969 .
[7] C. Loan,et al. Nineteen Dubious Ways to Compute the Exponential of a Matrix , 1978 .
[8] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .
[9] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[10] Oliver Vornberger,et al. The Complexity of Testing Whether a Graph is a Superconcentrator , 1981, Inf. Process. Lett..
[11] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[12] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[13] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[14] J. Bourgain. On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .
[15] Noga Alon,et al. lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.
[16] N. Alon. Eigenvalues and expanders , 1986, Comb..
[17] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[18] Bernard Chazelle,et al. Quasi-optimal range searching in spaces of finite VC-dimension , 1989, Discret. Comput. Geom..
[19] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[20] Manfred K. Warmuth,et al. The weighted majority algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.
[21] Farhad Shahrokhi,et al. The maximum concurrent flow problem , 1990, JACM.
[22] N. Littlestone. Mistake bounds and logarithmic linear-threshold learning algorithms , 1990 .
[23] Yinyu Ye,et al. An O(n3L) potential reduction algorithm for linear programming , 1991, Math. Program..
[24] Charles R. Johnson,et al. Topics in Matrix Analysis , 1991 .
[25] R. Ravi,et al. When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.
[26] Éva Tardos,et al. Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[27] Henryk Wozniakowski,et al. Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start , 1992, SIAM J. Matrix Anal. Appl..
[28] A. S. Nemirovsky,et al. Conic formulation of a convex programming problem and duality , 1992 .
[29] J. Kuczy,et al. Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start , 1992 .
[30] D. Matula. A linear time 2 + ε approximation algorithm for edge connectivity , 1993, SODA 1993.
[31] Philip N. Klein,et al. Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts , 1994, SIAM J. Comput..
[32] Robert E. Schapire,et al. Efficient distribution-free learning of probabilistic concepts , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[33] Noga Alon,et al. Random Cayley Graphs and Expanders , 1994, Random Struct. Algorithms.
[34] Neal E. Young,et al. Randomized rounding without solving the linear program , 1995, SODA '95.
[35] Leonid Khachiyan,et al. A sublinear-time randomized approximation algorithm for matrix games , 1995, Oper. Res. Lett..
[36] Nathan Linial,et al. The geometry of graphs and some of its algorithmic applications , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[37] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[38] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[39] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[40] Farid Alizadeh,et al. Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..
[41] David R. Karger,et al. Approximating s – t Minimum Cuts in ~ O(n 2 ) Time , 2007 .
[42] Hsueh-I Lu,et al. Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING , 1996, STOC '96.
[43] Thomas M. Cover,et al. Universal data compression and portfolio selection , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[44] David B. Shmoys,et al. Cut problems and their application to divide-and-conquer , 1996 .
[45] Fan Chung,et al. Spectral Graph Theory , 1996 .
[46] David P. Williamson,et al. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.
[47] Avrim Blum,et al. On-line Algorithms in Machine Learning , 1996, Online Algorithms.
[48] Pravin M. Vaidya,et al. A new algorithm for minimizing convex functions over convex sets , 1996, Math. Program..
[49] Philip M. Long,et al. Prediction, Learning, Uniform Convergence, and Scale-Sensitive Dimensions , 1998, J. Comput. Syst. Sci..
[50] Jochen Könemann,et al. Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[51] Andrew V. Goldberg,et al. Beyond the flow decomposition barrier , 1998, JACM.
[52] Yuval Rabani,et al. An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..
[53] Y. Freund,et al. Adaptive game playing using multiplicative weights , 1999 .
[54] Frank Thomson Leighton,et al. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.
[55] Philip N. Klein,et al. On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms , 1999, SIAM J. Comput..
[56] Lisa Fleischer,et al. Approximating fractional multicommodity flow independent of the number of commodities , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[57] Dean P. Foster,et al. Regret in the On-Line Decision Problem , 1999 .
[58] Bernard Chazelle,et al. The discrepancy method - randomness and complexity , 2000 .
[59] Luca Trevisan,et al. The Approximability of Constraint Satisfaction Problems , 2001, SIAM J. Comput..
[60] P. Bartlett,et al. Function Learning from Interpolation , 2000, Combinatorics, Probability and Computing.
[61] Vijay V. Vazirani,et al. Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.
[62] Shang-Hua Teng,et al. Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.
[63] Andris Ambainis,et al. Dense quantum coding and quantum finite automata , 2002, JACM.
[64] Sudipto Guha,et al. A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.
[65] Rudolf Ahlswede,et al. Strong converse for identification via quantum channels , 2000, IEEE Trans. Inf. Theory.
[66] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[67] Alexander Russell,et al. Random Cayley Graphs are Expanders: a Simple Proof of the Alon-Roichman Theorem , 2004, Electron. J. Comb..
[68] Moses Charikar,et al. Maximizing quadratic programs: extending Grothendieck's inequality , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[69] Rocco A. Servedio,et al. Boosting and Hard-Core Set Construction , 2003, Machine Learning.
[70] R. Khandekar. Lagrangian relaxation based algorithms for convex programming problems , 2004 .
[71] Gunnar Rätsch,et al. Matrix Exponentiated Gradient Updates for On-line Learning and Bregman Projection , 2004, J. Mach. Learn. Res..
[72] Leonard J. Schulman,et al. Improved Expansion of Random Cayley Graphs , 2004, Discret. Math. Theor. Comput. Sci..
[73] Satish Rao,et al. Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.
[74] Noga Alon,et al. Approximating the cut-norm via Grothendieck's inequality , 2004, STOC '04.
[75] Sanjeev Arora,et al. 0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n2) Time , 2004, FOCS.
[76] James R. Lee,et al. On distance scales, embeddings, and efficient relaxations of the cut cone , 2005, SODA '05.
[77] Amit Agarwal,et al. O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.
[78] Sanjeev Arora,et al. Fast algorithms for approximate semidefinite programming using the multiplicative weights update method , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[79] Clifford Stein,et al. Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring , 2005, IPCO.
[80] U. Feige,et al. Spectral techniques applied to sparse random graphs , 2005 .
[81] Anupam Gupta,et al. Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut , 2005, SODA '05.
[82] James R. Lee,et al. Euclidean distortion and the sparsest cut , 2005, STOC '05.
[83] Santosh S. Vempala,et al. Efficient algorithms for online decision problems , 2005, Journal of computer and system sciences (Print).
[84] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[85] Eran Halperin,et al. HAPLOFREQ-Estimating Haplotype Frequencies Efficiently , 2006, J. Comput. Biol..
[86] Manfred K. Warmuth,et al. A Bayesian Probability Calculus for Density Matrices , 2006, UAI.
[87] Manfred K. Warmuth,et al. Randomized PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension , 2006, NIPS.
[88] Daniel A. Spielman,et al. A randomized polynomial-time simplex algorithm for linear programming , 2006, STOC '06.
[89] Marlis Hochbruck,et al. Preconditioning Lanczos Approximations to the Matrix Exponential , 2005, SIAM J. Sci. Comput..
[90] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[91] Sanjeev Arora,et al. A Fast Random Sampling Algorithm for Sparsifying Matrices , 2006, APPROX-RANDOM.
[92] Surender Baswana,et al. Dynamic Algorithms for Graph Spanners , 2006, ESA.
[93] Manfred K. Warmuth,et al. Online kernel PCA with entropic matrix updates , 2007, ICML '07.
[94] Sanjeev Arora,et al. A combinatorial, primal-dual approach to semidefinite programs , 2007, STOC '07.
[95] Manfred K. Warmuth. Winnowing subspaces , 2007, ICML '07.
[96] Scott Aaronson,et al. The learnability of quantum states , 2006, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.
[97] Avi Wigderson,et al. Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications , 2008, Theory Comput..
[98] Satish Rao,et al. Graph partitioning using single commodity flows , 2009, JACM.