NeurIPS 2020

1,908 papers

Top Research Directions

Research directions most represented by NeurIPS 2020 papers.

Clean Accuracy Degradation in Machine Learning Defenses 21
Bypassing the Computational Bottleneck of Adversarial Training 20
Scaling Gaussian Processes Beyond Cubic Complexity 19
Safe Reinforcement Learning via Constrained Markov Decision Processes 17
The Non-Linear Function Approximation Gap in Reinforcement Learning 17
The Mechanics of Benign Overfitting in High Dimensions 15
Optimization and Generalization with Non-Smooth Activations 14
Multi-Agent Learning Under Bandit Feedback 13
Mitigating Gradient Variance in Policy Optimization 13
The Infinite Width Approximation Gap in Deep Learning 12
The Statistical Computational Gap in High Dimensions 12
Scaling Bandit Learning to Large Action Spaces 12
The Function Approximation Gap in Reinforcement Learning Theory 12
Linearizing Deep Learning via the Neural Tangent Kernel 11
Sample Efficient Reinforcement Learning 11

Top Authors

AuthorPapers
Sergey Levine11
Mihaela van der Schaar10
Csaba Szepesvari9
Jinwoo Shin9
Michael W. Mahoney9
Stefano Ermon9
Sung Ju Hwang9
Zhaoran Wang9
Pieter Abbeel8
Zhangyang Wang8
Zhuoran Yang8
Andreas Krause7
Bo Dai7
Dacheng Tao7
Jason D. Lee7
Jun Zhu7
Masashi Sugiyama7
Michael Jordan7
Akshay Krishnamurthy6
Andrea Vedaldi6

Impactful Papers

Papers from NeurIPS 2020 that shaped research clusters.

Foundational

Influential

Papers

Title
Online Agnostic Boosting via Regret Minimization
Online Algorithm for Unsupervised Sequential Selection with Contextual Information
Online Algorithms for Multi-shop Ski Rental with Machine Learned Advice
Online Bayesian Goal Inference for Boundedly Rational Planning Agents
Online Bayesian Persuasion
Online Convex Optimization Over Erdos-Renyi Random Networks
Online Decision Based Visual Tracking via Reinforcement Learning
Online Fast Adaptation and Knowledge Accumulation (OSAKA): a New Approach to Continual Learning
Online Influence Maximization under Linear Threshold Model
Online Learning in Contextual Bandits using Gated Linear Networks
Online learning with dynamics: A minimax perspective
Online Learning with Primary and Secondary Losses
Online Linear Optimization with Many Hints
Online MAP Inference of Determinantal Point Processes
Online Matrix Completion with Side Information
Online Meta-Critic Learning for Off-Policy Actor-Critic Methods
Online Multitask Learning with Long-Term Memory
Online Neural Connectivity Estimation with Noisy Group Testing
Online Non-Convex Optimization with Imperfect Feedback
Online Optimization with Memory and Competitive Control
Online Planning with Lookahead Policies
Online Robust Regression via SGD on the l1 loss
Online Sinkhorn: Optimal Transport distances from sample streams
Online Structured Meta-learning
On Numerosity of Deep Neural Networks
On Power Laws in Deep Ensembles
On ranking via sorting by estimated expected utility
On Regret with Multiple Best Arms
On Reward-Free Reinforcement Learning with Linear Function Approximation
On Second Order Behaviour in Augmented Neural ODEs
On Testing of Samplers
On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problems
On the Convergence of Smooth Regularized Approximate Value Iteration Schemes
On the distance between two neural networks and the stability of learning
On the Equivalence between Online and Private Learnability beyond Binary Classification
On the equivalence of molecular graph convolution and molecular wave function with poor basis set
On the Ergodicity, Bias and Asymptotic Normality of Randomized Midpoint Sampling Method
On the Error Resistance of Hinge-Loss Minimization
On the Expressiveness of Approximate Inference in Bayesian Neural Networks
On the linearity of large non-linear models: when and why the tangent kernel is constant
On the Loss Landscape of Adversarial Training: Identifying Challenges and How to Overcome Them
On the Modularity of Hypernetworks
On the Optimal Weighted $\ell_2$ Regularization in Overparameterized Linear Regression
On the Power of Louvain in the Stochastic Block Model
On the Role of Sparsity and DAG Constraints for Learning Linear DAGs
On the Similarity between the Laplace and Neural Tangent Kernels
On the Stability and Convergence of Robust Adversarial Reinforcement Learning: A Case Study on Linear Quadratic Systems
On the Theory of Transfer Learning: The Importance of Task Diversity
On the Tightness of Semidefinite Relaxations for Certifying Robustness to Adversarial Examples
On the Trade-off between Adversarial and Backdoor Robustness

« prev Page 26/39 next »