online algorithm

Training Deep Networks without Learning Rates Through Coin Betting NeurIPS 2017 An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives COLT 2016 Combinatorial semi-bandit with known covariance NeurIPS 2016 Community Detection on Evolving Graphs NeurIPS 2016 Dueling Bandits: Beyond Condorcet Winners to General Tournament Solutions NeurIPS 2016 Efficient Algorithms for Adversarial Contextual Learning ICML 2016 Fast Rate Analysis of Some Stochastic Optimization Algorithms ICML 2016 Hardness of Online Sleeping Combinatorial Optimization Problems NeurIPS 2016 Importance Weighting Without Importance Weights: An Efficient Algorithm for Combinatorial Semi-Bandits JMLR 2016 Minimizing the Maximal Loss: How and Why ICML 2016 Multi-scale exploration of convex functions and bandit convex optimization COLT 2016 No-Regret Algorithms for Heavy-Tailed Linear Bandits ICML 2016 No Regret Bound for Extreme Bandits AISTATS 2016 Online and Distributed Bayesian Moment Matching for Parameter Learning in Sum-Product Networks AISTATS 2016 Pricing a Low-regret Seller ICML 2016 Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent NeurIPS 2016 Achieving All with No Parameters: AdaNormalHedge COLT 2015 A Normative Theory of Adaptive Dimensionality Reduction in Neural Networks NeurIPS 2015 Cheap Bandits ICML 2015 Competing with the Empirical Risk Minimizer in a Single Pass COLT 2015 Simple regret for infinitely many armed bandits ICML 2015 Bandit Convex Optimization: Towards Tight Bounds NeurIPS 2014 Bounded Regret for Finite-Armed Structured Bandits NeurIPS 2014 Contextual Bandits with Similarity Information JMLR 2014 Dual online inference for latent Dirichlet allocation ACML 2014