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
On the training dynamics of deep networks with $L_2$ regularization
On the universality of deep learning
On the Value of Out-of-Distribution Testing: An Example of Goodhart's Law
On Uniform Convergence and Low-Norm Interpolation Learning
On Warm-Starting Neural Network Training
OOD-MAML: Meta-Learning for Few-Shot Out-of-Distribution Detection and Classification
Open Graph Benchmark: Datasets for Machine Learning on Graphs
Optimal Adaptive Electrode Selection to Maximize Simultaneously Recorded Neuron Yield
Optimal Algorithms for Stochastic Multi-Armed Bandits with Heavy Tailed Rewards
Optimal and Practical Algorithms for Smooth and Strongly Convex Decentralized Optimization
Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions
Optimal Best-arm Identification in Linear Bandits
Optimal Epoch Stochastic Gradient Descent Ascent Methods for Min-Max Optimization
Optimal Iterative Sketching Methods with the Subsampled Randomized Hadamard Transform
Optimal Learning from Verified Training Data
Optimal Lottery Tickets via Subset Sum: Logarithmic Over-Parameterization is Sufficient
Optimally Deceiving a Learning Leader in Stackelberg Games
Optimal Prediction of the Number of Unseen Species with Multiplicity
Optimal Private Median Estimation under Minimal Distributional Assumptions
Optimal Query Complexity of Secure Stochastic Convex Optimization
Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms
Optimal Variance Control of the Score-Function Gradient Estimator for Importance-Weighted Bounds
Optimal visual search based on a model of target detectability in natural images
Optimistic Dual Extrapolation for Coherent Non-monotone Variational Inequalities
Optimization and Generalization Analysis of Transduction through Gradient Boosting and Application to Multi-scale Graph Neural Networks
Optimization and Generalization of Shallow Neural Networks with Quadratic Activation Functions
Optimizing Mode Connectivity via Neuron Alignment
Optimizing Neural Networks via Koopman Operator Theory
OrganITE: Optimal transplant donor organ offering using an individual treatment effect
Organizing recurrent network dynamics by task-computation to enable continual learning
OTLDA: A Geometry-aware Optimal Transport Approach for Topic Modeling
Outlier Robust Mean Estimation with Subgaussian Rates via Stability
Overfitting Can Be Harmless for Basis Pursuit, But Only to a Degree
Over-parameterized Adversarial Training: An Analysis Overcoming the Curse of Dimensionality
PAC-Bayes Analysis Beyond the Usual Bounds
PAC-Bayesian Bound for the Conditional Value at Risk
PAC-Bayes Learning Bounds for Sample-Dependent Priors
Parabolic Approximation Line Search for DNNs
Parameterized Explainer for Graph Neural Network
Parametric Instance Classification for Unsupervised Visual Feature learning
Part-dependent Label Noise: Towards Instance-dependent Label Noise
Partially View-aligned Clustering
Partial Optimal Tranport with applications on Positive-Unlabeled Learning
Passport-aware Normalization for Deep Model Protection
Patch2Self: Denoising Diffusion MRI with Self-Supervised Learning​
Path Integral Based Convolution and Pooling for Graph Neural Networks
Path Sample-Analytic Gradient Estimators for Stochastic Binary Networks
PC-PG: Policy Cover Directed Exploration for Provable Policy Gradient Learning
Penalized Langevin dynamics with vanishing penalty for smooth and log-concave targets
PEP: Parameter Ensembling by Perturbation

« prev Page 27/39 next »