cached image

Alexander Rakhlin - Publications

Affiliations: 
University of California, Berkeley, Berkeley, CA 
Area:
Machine Learning, Online Learning / Expert Advice, Optimization, Statistical Learning Theory, Multitask Learning, Generalization Bounds,
Website:
http://www.eecs.berkeley.edu/%7Erakhlin/

41 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2015 Rakhlin A, Sridharan K. On martingale extensions of Vapnik-Chervonenkis theory with applications to online learning Measures of Complexity: Festschrift For Alexey Chervonenkis. 197-215. DOI: 10.1007/978-3-319-21852-6_15  1
2015 Rakhlin A, Sridharan K, Tewari A. Online learning via sequential complexities Journal of Machine Learning Research. 16: 155-186.  1
2015 Jadbabaie A, Rakhlin A, Shahrampour S, Sridharan K. Online optimization: Competing with dynamic comparators Journal of Machine Learning Research. 38: 398-406.  1
2014 Bartók G, Foster DP, Pál D, Rakhlin A, Szepesvári C. Partial monitoring - Classification, regret bounds, and algorithms Mathematics of Operations Research. 39: 967-997. DOI: 10.1287/moor.2014.0663  1
2014 Rakhlin A, Sridharan K, Tewari A. Sequential complexities and uniform martingale laws of large numbers Probability Theory and Related Fields. 1-43. DOI: 10.1007/s00440-013-0545-5  1
2014 Rakhlin A, Sridharan K. Online nonparametric regression Journal of Machine Learning Research. 35: 1232-1264.  1
2013 Agarwal A, Foster DP, Hsu D, Kakade SM, Rakhlin A. Stochastic convex optimization with bandit feedback Siam Journal On Optimization. 23: 213-240. DOI: 10.1137/110850827  1
2013 Rakhlin A, Sridharan K. On Semi-Probabilistic universal prediction 2013 Ieee Information Theory Workshop, Itw 2013. DOI: 10.1109/ITW.2013.6691289  1
2013 Rakhlin A, Sridharan K. Online learning with predictable sequences Journal of Machine Learning Research. 30: 993-1019.  1
2013 Shahrampour S, Rakhlin A, Jadbabaie A. Online learning of dynamic parameters in social networks Advances in Neural Information Processing Systems 1
2013 Han W, Rakhlin A, Sridharan K. Competing with strategies Journal of Machine Learning Research. 30: 966-992.  1
2013 Rakhlin A, Sridharan K. Optimization, learning, and games with predictable sequences Advances in Neural Information Processing Systems 1
2013 Rakhlin A, Shamir O, Sridharan K. Localization and adaptation in online learning Journal of Machine Learning Research. 31: 516-526.  1
2012 Seshia SA, Rakhlin A. Quantitative analysis of systems using game-theoretic learning Transactions On Embedded Computing Systems. 11. DOI: 10.1145/2331147.2331165  1
2012 Abernethy JD, Hazan E, Rakhlin A. Interior-point methods for full-information and bandit online learning Ieee Transactions On Information Theory. 58: 4164-4175. DOI: 10.1109/TIT.2012.2192096  1
2012 Rakhlin A. Foreword Journal of Computer and System Sciences. 78: 1403. DOI: 10.1016/j.jcss.2011.12.022  1
2012 Rakhlin A, Shamir O, Sridharan K. Relax and randomize: From value to algorithms Advances in Neural Information Processing Systems. 3: 2141-2149.  1
2012 Rakhlin A, Shamir O, Sridharan K. Making gradient descent optimal for strongly convex stochastic optimization Proceedings of the 29th International Conference On Machine Learning, Icml 2012. 1: 449-456.  1
2012 Foster DP, Rakhlin A. No internal regret via neighborhood watch Journal of Machine Learning Research. 22: 382-390.  1
2011 Raginsky M, Rakhlin A. Information-based complexity, feedback and dynamics in convex programming Ieee Transactions On Information Theory. 57: 7036-7056. DOI: 10.1109/TIT.2011.2154375  1
2011 Rakhlin A, Sridharan K, Tewari A. Online learning: Stochastic, constrained, and smoothed adversaries Advances in Neural Information Processing Systems 24: 25th Annual Conference On Neural Information Processing Systems 2011, Nips 2011 1
2011 Raginsky M, Rakhlin A. Lower bounds for passive and active learning Advances in Neural Information Processing Systems 24: 25th Annual Conference On Neural Information Processing Systems 2011, Nips 2011 1
2011 Foster DP, Rakhlin A, Sridharan K, Tewari A. Complexity-based approach to calibration with checking rules Journal of Machine Learning Research. 19: 293-314.  1
2011 Rakhlin A, Sridharan K, Tewari A. Online learning: Beyond regret Journal of Machine Learning Research. 19: 559-594.  1
2010 Raginsky M, Rakhlin A, Yüksel S. Online convex programming and regularization in adaptive control Proceedings of the Ieee Conference On Decision and Control. 1957-1962. DOI: 10.1109/CDC.2010.5717262  1
2010 Rakhlin A, Sridharan K, Tewari A. Online learning: Random averages, combinatorial parameters, and learnability Advances in Neural Information Processing Systems 23: 24th Annual Conference On Neural Information Processing Systems 2010, Nips 2010 1
2010 Narayanan H, Rakhlin A. Random walk approach to regret minimization Advances in Neural Information Processing Systems 23: 24th Annual Conference On Neural Information Processing Systems 2010, Nips 2010 1
2009 Abernethy J, Rakhlin A. Beating the adaptive bandit with high probability Colt 2009 - the 22nd Conference On Learning Theory. DOI: 10.1109/ITA.2009.5044958  1
2009 Raginsky M, Rakhlin A. Information complexity of black-box convex optimization: A new look via feedback information theory 2009 47th Annual Allerton Conference On Communication, Control, and Computing, Allerton 2009. 803-810. DOI: 10.1109/ALLERTON.2009.5394945  1
2009 Abernethy J, Agarwal A, Bartlett PL, Rakhlin A. A stochastic view of optimal regret through minimax duality Colt 2009 - the 22nd Conference On Learning Theory 1
2009 Abernethy J, Rakhlin A. An efficient bandit algorithm for √T-regret in online multiclass prediction? Colt 2009 - the 22nd Conference On Learning Theory 1
2009 Bartlett PL, Hazan E, Rakhlin A. Adaptive online gradient descent Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference 1
2008 Seshia SA, Rakhlin A. Game-theoretic timing analysis Ieee/Acm International Conference On Computer-Aided Design, Digest of Technical Papers, Iccad. 575-582. DOI: 10.1109/ICCAD.2008.4681634  1
2008 Abernethy J, Hazan E, Rakhlin A. Competing in the dark: An efficient algorithm for bandit linear optimization 21st Annual Conference On Learning Theory, Colt 2008. 263-273.  1
2008 Abernethy J, Bartlett PL, Rakhlin A, Tewari A. Optimal strategies and minimax lower bounds for online convex games 21st Annual Conference On Learning Theory, Colt 2008. 415-423.  1
2008 Bartlett PL, Dani V, Hayes TP, Kakade SM, Rakhlin A, Tewari A. High-probability regret bounds for bandit online linear optimization 21st Annual Conference On Learning Theory, Colt 2008. 335-341.  1
2007 Rakhlin A, Abernethy J, Bartlett PL. Online discovery of similarity mappings Acm International Conference Proceeding Series. 227: 767-774. DOI: 10.1145/1273496.1273593  1
2007 Abernethy J, Bartlett P, Rakhlin A. Multitask learning with expert advice Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4539: 484-498.  1
2007 Rakhlin A, Caponnetto A. Stability of K-means clustering Advances in Neural Information Processing Systems. 1121-1128.  1
2006 Caponnetto A, Rakhlin A. Stability properties of empirical risk minimization over Donsker classes Journal of Machine Learning Research. 7: 2565-2583.  1
2005 Rakhlin A, Panchenko D, Mukherjee S. Risk bounds for mixture density estimation Esaim - Probability and Statistics. 9: 220-229. DOI: 10.1051/ps:2005011  1
Show low-probability matches.