Learning Theory

Improved Algorithms for Conservative Exploration in Bandits AAAI 2020 Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds NeurIPS 2020 Improved PAC-Bayesian Bounds for Linear Regression AAAI 2020 Improved Sample Complexities for Deep Neural Networks and Robust Classification via an All-Layer Margin ICLR 2020 Improved Sleeping Bandits with Stochastic Action Sets and Adversarial Rewards ICML 2020 Improving Sample Complexity Bounds for (Natural) Actor-Critic Algorithms NeurIPS 2020 In Defense of Uniform Convergence: Generalization via Derandomization with an Application to Interpolating Predictors ICML 2020 Inferring learning rules from animal decision-making NeurIPS 2020 Information theoretic limits of learning a sparse rule NeurIPS 2020 Information-Theoretic Local Minima Characterization and Regularization ICML 2020 Information Theoretic Regret Bounds for Online Nonlinear Control NeurIPS 2020 Information-Theoretic Understanding of Population Risk Improvement with Model Compression AAAI 2020 In search of robust measures of generalization NeurIPS 2020 Interference and Generalization in Temporal Difference Learning ICML 2020 Is Long Horizon RL More Difficult Than Short Horizon RL? NeurIPS 2020 It’s Not What Machines Can Learn, It’s What We Cannot Teach ICML 2020 Kernel Alignment Risk Estimator: Risk Prediction from Training Data NeurIPS 2020 Kernel and Rich Regimes in Overparametrized Models COLT 2020 Kernelized information bottleneck leads to biologically plausible 3-factor Hebbian learning in deep networks NeurIPS 2020 k-means++: few more steps yield constant approximation ICML 2020 Landscape Connectivity and Dropout Stability of SGD Solutions for Over-parameterized Neural Networks ICML 2020 Learnability with Indirect Supervision Signals NeurIPS 2020 Learning Adversarial Markov Decision Processes with Bandit Feedback and Unknown Transition ICML 2020 Learning Augmentation Network via Influence Functions CVPR 2020 Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis IJCAI 2020