Efficient algorithms for online convex optimization and their applications
暂无分享,去创建一个
[1] Philip Wolfe,et al. An algorithm for quadratic programming , 1956 .
[2] John L. Kelly,et al. A new interpretation of information rate , 1956, IRE Trans. Inf. Theory.
[3] D. Blackwell. An analog of the minimax theorem for vector payoffs. , 1956 .
[4] M. Sion. On general minimax theorems , 1958 .
[5] J. Cockcroft. Investment in Science , 1962, Nature.
[6] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[7] Robert M. Bell,et al. Competitive Optimality of Logarithmic Investment , 1980, Math. Oper. Res..
[8] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[9] T. Cover,et al. Asymptotic optimality and asymptotic equipartition properties of log-optimum investment , 1988 .
[10] T. Cover,et al. Game-theoretic optimal portfolios , 1988 .
[11] N. Biggs. GEOMETRIC ALGORITHMS AND COMBINATORIAL OPTIMIZATION: (Algorithms and Combinatorics 2) , 1990 .
[12] Farhad Shahrokhi,et al. The maximum concurrent flow problem , 1990, JACM.
[13] A. Clark,et al. Inference of haplotypes from PCR-amplified samples of diploid populations. , 1990, Molecular biology and evolution.
[14] Fillia Makedon,et al. Fast approximation algorithms for multicommodity flow problems , 1991, STOC '91.
[15] Yinyu Ye,et al. An O(n3L) potential reduction algorithm for linear programming , 1991, Math. Program..
[16] Éva Tardos,et al. Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[17] Henryk Wozniakowski,et al. Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start , 1992, SIAM J. Matrix Anal. Appl..
[18] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[19] Neri Merhav,et al. Universal sequential learning and decision from individual data sequences , 1992, COLT '92.
[20] J. Kuczy,et al. Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start , 1992 .
[21] Dean P. Foster,et al. A Randomization Rule for Selecting Forecasts , 1993, Oper. Res..
[22] Leonid Khachiyan,et al. Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints , 1994, SIAM J. Optim..
[23] 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..
[24] Neal E. Young,et al. Randomized rounding without solving the linear program , 1995, SODA '95.
[25] Leonid Khachiyan,et al. A sublinear-time randomized approximation algorithm for matrix games , 1995, Oper. Res. Lett..
[26] L. Excoffier,et al. Maximum-likelihood estimation of molecular haplotype frequencies in a diploid population. , 1995, Molecular biology and evolution.
[27] Nathan Linial,et al. The geometry of graphs and some of its algorithmic applications , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[28] Yoram Singer,et al. A Comparison of New and Old Algorithms for a Mixture Estimation Problem , 2004, Machine Learning.
[29] K. Kidd,et al. HAPLO: a program using the EM algorithm to estimate the frequencies of multi-site haplotypes. , 1995, The Journal of heredity.
[30] J. Long,et al. An E-M algorithm and testing strategy for multiple-locus haplotypes. , 1995, American journal of human genetics.
[31] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[32] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[33] Farid Alizadeh,et al. Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..
[34] Tjalling J. Ypma,et al. Historical Development of the Newton-Raphson Method , 1995, SIAM Rev..
[35] Hsueh-I Lu,et al. Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING , 1996, STOC '96.
[36] Thomas M. Cover,et al. Universal data compression and portfolio selection , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[37] S. Tishkoff,et al. Molecular haplotyping of genetic markers 10 kb apart by allele-specific long-range PCR. , 1996, Nucleic acids research.
[38] T. Cover. Universal Portfolios , 1996 .
[39] Johan Håstad,et al. Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[40] Avrim Blum,et al. On-line Algorithms in Machine Learning , 1996, Online Algorithms.
[41] Yoram Singer,et al. On‐Line Portfolio Selection Using Multiplicative Updates , 1998, ICML.
[42] Pravin M. Vaidya,et al. A new algorithm for minimizing convex functions over convex sets , 1996, Math. Program..
[43] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.
[44] Manfred K. Warmuth,et al. Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..
[45] 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).
[46] Stephen P. Boyd,et al. Applications of second-order cone programming , 1998 .
[47] Y. Freund,et al. Adaptive game playing using multiplicative weights , 1999 .
[48] Philip N. Klein,et al. On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms , 1999, SIAM J. Comput..
[49] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[50] D. Fudenberg,et al. An Easier Way to Calibrate , 1999 .
[51] Dean P. Foster,et al. Regret in the On-Line Decision Problem , 1999 .
[52] Dan Gusfield,et al. A Practical Algorithm for Optimal Inference of Haplotypes from Diploid Populations , 2000, ISMB.
[53] Fabio Stella,et al. Stochastic Nonstationary Optimization for Finding Universal Portfolios , 2000, Ann. Oper. Res..
[54] Lisa Fleischer,et al. Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..
[55] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[56] N. Schork,et al. Accuracy of haplotype frequency estimation for biallelic loci, via the expectation-maximization algorithm for unphased diploid genotype data. , 2000, American journal of human genetics.
[57] Santosh S. Vempala,et al. Efficient algorithms for universal portfolios , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[58] Dan Gusfield,et al. Inference of Haplotypes from Samples of Diploid Populations: Complexity and Algorithms , 2001, J. Comput. Biol..
[59] S. P. Fodor,et al. Blocks of Limited Haplotype Diversity Revealed by High-Resolution Scanning of Human Chromosome 21 , 2001, Science.
[60] P. Donnelly,et al. A new statistical method for haplotype reconstruction from population data. , 2001, American journal of human genetics.
[61] Russell Schwartz,et al. SNPs Problems, Algorithms and Complexity , 2001 .
[62] Daniel Bienstock,et al. Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice , 2002 .
[63] Dan Gusfield,et al. Haplotyping as perfect phylogeny: conceptual framework and efficient solutions , 2002, RECOMB '02.
[64] Santosh S. Vempala,et al. Simulated annealing in convex bodies and an O*(n/sup 4/) volume algorithm , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[65] Robert E. Schapire,et al. The Boosting Approach to Machine Learning An Overview , 2003 .
[66] S. Vempala,et al. The Geometry of Logconcave Functions and an O* (n 3 ) Sampling Algorithm , 2003 .
[67] Allan Borodin,et al. Can We Learn to Beat the Best Stock , 2003, NIPS.
[68] Martin Zinkevich,et al. Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.
[69] Adam Tauman Kalai,et al. Universal Portfolios With and Without Transaction Costs , 1997, COLT '97.
[70] Daniel Bienstock,et al. Solving fractional packing problems in Oast(1/ε) iterations , 2004, STOC '04.
[71] Santosh S. Vempala,et al. A simple polynomial-time rescaling algorithm for solving linear programs , 2004, STOC '04.
[72] Moses Charikar,et al. Maximizing quadratic programs: extending Grothendieck's inequality , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[73] Ron Shamir,et al. Maximum likelihood resolution of multi-block genotypes , 2004, RECOMB.
[74] Mona Singh,et al. A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies , 2004, INFORMS J. Comput..
[75] Klaus Jansen,et al. Approximation Algorithms for Mixed Fractional Packing and Covering Problems , 2004, WAOA.
[76] Elad Hazan,et al. O(/spl radic/log n) approximation to SPARSEST CUT in O/spl tilde/(n/sup 2/) time , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[77] R. Khandekar. Lagrangian relaxation based algorithms for convex programming problems , 2004 .
[78] Satish Rao,et al. Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.
[79] Yoram Singer,et al. A Comparison of New and Old Algorithms for a Mixture Estimation Problem , 1995, COLT '95.
[80] Noga Alon,et al. Approximating the cut-norm via Grothendieck's inequality , 2004, STOC '04.
[81] Eran Halperin,et al. Haplotype reconstruction from genotype data using Imperfect Phylogeny , 2004, Bioinform..
[82] Amit Agarwal,et al. O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.
[83] 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).
[84] Gábor Lugosi,et al. Internal Regret in On-Line Portfolio Selection , 2005, Machine Learning.
[85] Uriel Feige,et al. Spectral techniques applied to sparse random graphs , 2005, Random Struct. Algorithms.
[86] Anupam Gupta,et al. Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut , 2005, SODA '05.
[87] James R. Lee,et al. Euclidean distortion and the sparsest cut , 2005, STOC '05.
[88] Santosh S. Vempala,et al. Efficient algorithms for online decision problems , 2005, Journal of computer and system sciences (Print).
[89] Elad Hazan,et al. Efficient Algorithms for Online Game Playing and Universal Portfolio Management , 2006, Electron. Colloquium Comput. Complex..
[90] Santosh S. Vempala,et al. Simulated annealing in convex bodies and an O*(n4) volume algorithm , 2006, J. Comput. Syst. Sci..
[91] Elad Hazan. Approximate Convex Optimization by Online Game Playing , 2006, ArXiv.
[92] Eran Halperin,et al. HAPLOFREQ-Estimating Haplotype Frequencies Efficiently , 2006, J. Comput. Biol..
[93] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[94] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[95] Robert E. Schapire,et al. Algorithms for portfolio management based on the Newton method , 2006, ICML.
[96] Elad Hazan,et al. Logarithmic regret algorithms for online convex optimization , 2006, Machine Learning.