Learning Theory

Optimal Rates for Random Fourier Features NeurIPS 2015 Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays ICML 2015 Optimal Testing for Properties of Distributions NeurIPS 2015 Ranking from Stochastic Pairwise Preferences: Recovering Condorcet Winners and Tournament Solution Sets at the Top ICML 2015 Rationality, Optimism and Guarantees in General Reinforcement Learning JMLR 2015 Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem COLT 2015 Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring NeurIPS 2015 Response-Based Approachability with Applications to Generalized No-Regret Problems JMLR 2015 Rethinking LDA: Moment Matching for Discrete ICA NeurIPS 2015 Revenue Optimization against Strategic Buyers NeurIPS 2015 Risk and Regret of Hierarchical Bayesian Learners ICML 2015 Sample Complexity of Episodic Fixed-Horizon Reinforcement Learning NeurIPS 2015 Sample Complexity of Learning Mahalanobis Distance Metrics NeurIPS 2015 Second-order Quantile Methods for Experts and Combinatorial Games COLT 2015 Simple regret for infinitely many armed bandits ICML 2015 Spectral Norm Regularization of Orthonormal Representations for Graph Transduction NeurIPS 2015 Stochastic Online Greedy Learning with Semi-bandit Feedbacks NeurIPS 2015 Strongly Adaptive Online Learning ICML 2015 Structural Maxent Models ICML 2015 Surrogate regret bounds for generalized classification performance metrics ACML 2015 Testing Closeness With Unequal Sized Samples NeurIPS 2015 The Hedge Algorithm on a Continuum ICML 2015 The Loss Surfaces of Multilayer Networks AISTATS 2015 The Pareto Regret Frontier for Bandits NeurIPS 2015 The Sample Complexity of Learning Linear Predictors with the Squared Loss JMLR 2015