Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Rakhlin, Alexander "Sasha" - Department of Statistics, University of Pennsylvania
Multitask Learning with Expert Advice Jacob Abernethy1
Online Learning: Random Averages, Combinatorial Parameters, and Learnability
High-Probability Regret Bounds for Bandit Online Linear Optimization Peter L. Bartlett
Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization Jacob Abernethy
Lecture Notes on Online Learning Alexander Rakhlin
Random Walk Approach to Regret Minimization Hariharan Narayanan
Information Complexity of Black-Box Convex Optimization: A New Look via Feedback Information Theory
Beating the Adaptive Bandit with High Probability Jacob Abernethy
Online Discovery of Similarity Mappings Alexander Rakhlin rakhlin@cs.berkeley.edu
No Internal Regret via Neighborhood Watch Dean Foster
Complexity-Based Approach to Calibration with Checking Dean P. Foster
Lower Bounds for Passive and Active Learning Maxim Raginsky
Online Learning: Stochastic and Constrained Adversaries Alexander Rakhlin
