Learning Theory

Opening the Black Box: Automatically Characterizing Software for Algorithm Selection (Student Abstract) AAAI 2020 Open Problem: Information Complexity of VC Learning COLT 2020 Open Problem: Model Selection for Contextual Bandits COLT 2020 Open Problem: Tight Convergence of SGD in Constant Dimension COLT 2020 Optimal Continual Learning has Perfect Memory and is NP-hard ICML 2020 Optimality and Approximation with Policy Gradient Methods in Markov Decision Processes COLT 2020 Optimal Margin Distribution Learning in Dynamic Environments AAAI 2020 Optimal Non-parametric Learning in Repeated Contextual Auctions with Strategic Buyer ICML 2020 Optimal Robust Learning of Discrete Distributions from Batches ICML 2020 Optimistic Policy Optimization with Bandit Feedback ICML 2020 Optimization and Generalization Analysis of Transduction through Gradient Boosting and Application to Multi-scale Graph Neural Networks NeurIPS 2020 Optimization and Generalization of Shallow Neural Networks with Quadratic Activation Functions NeurIPS 2020 Optimizer Benchmarking Needs to Account for Hyperparameter Tuning ICML 2020 Overestimation of Syntactic Representation in Neural Language Models ACL 2020 Overfitting Can Be Harmless for Basis Pursuit, But Only to a Degree NeurIPS 2020 PAC-Bayes Analysis Beyond the Usual Bounds NeurIPS 2020 PAC-Bayes Learning Bounds for Sample-Dependent Priors NeurIPS 2020 PAC Confidence Sets for Deep Neural Networks via Calibrated Prediction ICLR 2020 PAC learning with stable and private predictions COLT 2020 Perception of English Fricatives and Affricates by Advanced Chinese Learners of English Interspeech 2020 Performative Prediction ICML 2020 Perturbation Bounds for Procrustes, Classical Scaling, and Trilateration, with Applications to Manifold Learning JMLR 2020 Phase Transitions for the Information Bottleneck in Representation Learning ICLR 2020 Picking BERT’s Brain: Probing for Linguistic Dependencies in Contextualized Embeddings Using Representational Similarity Analysis COLING 2020 Planning in Markov Decision Processes with Gap-Dependent Sample Complexity NeurIPS 2020