conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5,312 papers

Papers per year

Papers

Are deep ResNets provably better than linear predictors? NIPS 2019
Updates of Equilibrium Prop Match Gradients of Backprop Through Time in an RNN with Static Input NIPS 2019
Can SGD Learn Recurrent Neural Networks with Provable Generalization? NIPS 2019
An Improved Analysis of Training Over-parameterized Deep Neural Networks NIPS 2019
Algorithm-Dependent Generalization Bounds for Overparameterized Deep Residual Networks NIPS 2019
Private Learning Implies Online Learning: An Efficient Reduction NIPS 2019
Optimal Best Markovian Arm Identification with Fixed Confidence NIPS 2019
Individual Regret in Cooperative Nonstochastic Multi-Armed Bandits NIPS 2019
Logarithmic Regret for Online Control NIPS 2019
Dichotomize and Generalize: PAC-Bayesian Binary Activated Deep Neural Networks NIPS 2019
List-decodable Linear Regression NIPS 2019
On the Hardness of Robust Classification NIPS 2019
Categorized Bandits NIPS 2019
Generalization Bounds for Neural Networks via Approximate Description Length NIPS 2019
A Robust Non-Clairvoyant Dynamic Mechanism for Contextual Auctions NIPS 2019
Strategizing against No-regret Learners NIPS 2019
Triad Constraints for Learning Causal Structure of Latent Variables NIPS 2019
Limiting Extrapolation in Linear Approximate Value Iteration NIPS 2019
On Robustness of Principal Component Regression NIPS 2019
Connections Between Mirror Descent, Thompson Sampling and the Information Ratio NIPS 2019
Fast-rate PAC-Bayes Generalization Bounds via Shifted Rademacher Processes NIPS 2019
Deep ReLU Networks Have Surprisingly Few Activation Patterns NIPS 2019
Thresholding Bandit with Optimal Aggregate Regret NIPS 2019
Limits of Private Learning with Access to Public Data NIPS 2019
Regret Bounds for Learning State Representations in Reinforcement Learning NIPS 2019