Learning Theory

Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses NeurIPS 2020 Reinforcement Learning in Factored MDPs: Oracle-Efficient Algorithms and Tighter Regret Bounds for the Non-Episodic Setting NeurIPS 2020 Reserve Pricing in Repeated Second-Price Auctions with Strategic Bidders ICML 2020 Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits NeurIPS 2020 Rethinking Bias-Variance Trade-off for Generalization of Neural Networks ICML 2020 Rethinking Generalization of Neural Models: A Named Entity Recognition Case Study AAAI 2020 Revisiting the Sample Complexity of Sparse Spectrum Approximation of Gaussian Processes NeurIPS 2020 Risk Bounds for Learning Multiple Components with Permutation-Invariant Losses AISTATS 2020 Risk Bounds for Low Cost Bipartite Ranking UAI 2020 Risk Bounds for Reservoir Computing JMLR 2020 Risk-Sensitive Reinforcement Learning: Near-Optimal Risk-Sample Tradeoff in Regret NeurIPS 2020 Robust Learning from Discriminative Feature Feedback AISTATS 2020 Root-n-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank COLT 2020 Sample complexity and effective dimension for regression on manifolds NeurIPS 2020 Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors ICML 2020 Sample Complexity Bounds for RNNs with Application to Combinatorial Graph Problems (Student Abstract) AAAI 2020 Sample Complexity of Estimating the Policy Gradient for Nearly Deterministic Dynamical Systems AISTATS 2020 Sample Complexity of Reinforcement Learning using Linearly Combined Model Ensembles AISTATS 2020 Sample Complexity of Uniform Convergence for Multicalibration NeurIPS 2020 Sample-Efficient Reinforcement Learning of Undercomplete POMDPs NeurIPS 2020 Scalable and Generalizable Social Bot Detection through Data Selection AAAI 2020 Sequential Transfer in Reinforcement Learning with a Generative Model ICML 2020 SGD with shuffling: optimal rates without component convexity and large epoch requirements NeurIPS 2020 Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithms NeurIPS 2020 Sharper Bounds for Uniformly Stable Algorithms COLT 2020