Skip to content
conftrace_

Online Learning

1,360 papers

1
24
42
106
80
'5
'10
'15
'20
'25

Papers

Bayesian optimization explains human active search NeurIPS 2013 Beating Bandits in Gradually Evolving Worlds COLT 2013 Bounded regret in stochastic multi-armed bandits COLT 2013 Computing the Stationary Distribution Locally NeurIPS 2013 Concurrent Reinforcement Learning from Customer Interactions ICML 2013 Convergence of Monte Carlo Tree Search in Simultaneous Move Games NeurIPS 2013 Dimension-Free Exponentiated Gradient NeurIPS 2013 Dual Averaging and Proximal Gradient Descent for Online Alternating Direction Multiplier Method ICML 2013 Efficient Online Inference for Bayesian Nonparametric Relational Models NeurIPS 2013 Eluder Dimension and the Sample Complexity of Optimistic Exploration NeurIPS 2013 Estimation Bias in Multi-Armed Bandit Algorithms for Search Advertising NeurIPS 2013 Estimation of Extreme Values and Associated Level Sets of a Regression Function via Selective Sampling COLT 2013 Exploration vs Exploitation vs Safety: Risk-Aware Multi-Armed Bandits ACML 2013 From Bandits to Experts: A Tale of Domination and Independence NeurIPS 2013 Generic Exploration and K-armed Voting Bandits ICML 2013 GOSUS: Grassmannian Online Subspace Updates with Structured-Sparsity ICCV 2013 Horizon-Independent Optimal Prediction with Log-Loss in Exponential Families COLT 2013 How to Hedge an Option Against an Adversary: Black-Scholes Pricing is Minimax Optimal NeurIPS 2013 Information Complexity in Bandit Subset Selection COLT 2013 Learning a set of directions COLT 2013 Learning Policies for Contextual Submodular Prediction ICML 2013 Learning Prices for Repeated Auctions with Strategic Buyers NeurIPS 2013 Learning Trajectory Preferences for Manipulators via Iterative Improvement NeurIPS 2013 Learning Using Local Membership Queries COLT 2013 Localization and Adaptation in Online Learning AISTATS 2013