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
Probabilistic Linear Solvers for Machine Learning
Probabilistic Orientation Estimation with Matrix Fisher Distributions
Probabilistic Time Series Forecasting with Shape and Temporal Diversity
Probably Approximately Correct Constrained Learning
Profile Entropy: A Fundamental Measure for the Learnability and Compressibility of Distributions
Program Synthesis with Pragmatic Communication
Projected Stein Variational Gradient Descent
Projection Efficient Subgradient Method and Optimal Nonsmooth Frank-Wolfe Method
Projection Robust Wasserstein Distance and Riemannian Optimization
Promoting Coordination through Policy Regularization in Multi-Agent Deep Reinforcement Learning
Promoting Stochasticity for Expressive Policies via a Simple and Efficient Regularization Method
Prophet Attention: Predicting Attention with Future Attention
Provable Online CP/PARAFAC Decomposition of a Structured Tensor via Dictionary Learning
Provable Overlapping Community Detection in Weighted Graphs
Provably adaptive reinforcement learning in metric spaces
Provably Consistent Partial-Label Learning
Provably Efficient Exploration for Reinforcement Learning Using Unsupervised Learning
Provably Efficient Neural Estimation of Structural Equation Models: An Adversarial Approach
Provably Efficient Neural GTD for Off-Policy Learning
Provably Efficient Online Hyperparameter Optimization with Population-Based Bandits
Provably Efficient Reinforcement Learning with Kernel and Neural Function Approximations
Provably Efficient Reward-Agnostic Navigation with Linear Value Iteration
Provably Good Batch Off-Policy Reinforcement Learning Without Great Exploration
Provably Good Batch Reinforcement Learning Without Great Exploration
Provably Robust Metric Learning
Proximal Mapping for Deep Regularization
Proximity Operator of the Matrix Perspective Function and its Applications
Pruning Filter in Filter
Pruning neural networks without any data by iteratively conserving synaptic flow
Pushing the Limits of Narrow Precision Inferencing at Cloud Scale with Microsoft Floating Point
PyGlove: Symbolic Programming for Automated Machine Learning
Quantifying and Learning Linear Symmetry-Based Disentanglement
Quantifying Learnability and Describability of Visual Concepts Emerging in Representation Learning
Quantifying the Empirical Wasserstein Distance to a Set of Measures: Beating the Curse of Dimensionality
Quantile Propagation for Wasserstein-Approximate Gaussian Processes
Quantitative Propagation of Chaos for SGD in Wide Neural Networks
Quantized Variational Inference
RandAugment: Practical Automated Data Augmentation with a Reduced Search Space
Randomized tests for high-dimensional regression: A more efficient and powerful solution
Random Reshuffling is Not Always Better
Random Reshuffling: Simple Analysis with Vast Improvements
Random Walk Graph Neural Networks
RANet: Region Attention Network for Semantic Segmentation
Rankmax: An Adaptive Projection Alternative to the Softmax Function
Rational neural networks
Ratio Trace Formulation of Wasserstein Discriminant Analysis
RATT: Recurrent Attention to Transient Tasks for Continual Image Captioning
RD$^2$: Reward Decomposition with Representation Decomposition
REAL-2019: Robot open-Ended Autonomous Learning competition
Real World Games Look Like Spinning Tops

« prev Page 29/39 next »