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
Reverse-engineering recurrent neural network solutions to a hierarchical inference task for mice
Revisiting Frank-Wolfe for Polytopes: Strict Complementarity and Sparsity
Revisiting Parameter Sharing for Automatic Neural Channel Number Search
Revisiting the Sample Complexity of Sparse Spectrum Approximation of Gaussian Processes
Reward Propagation Using Graph Convolutional Networks
Reward-rational (implicit) choice: A unifying formalism for reward learning
Rewriting History with Inverse RL: Hindsight Inference for Policy Improvement
Ridge Rider: Finding Diverse Solutions by Following Eigenvectors of the Hessian
Riemannian Continuous Normalizing Flows
Risk-Sensitive Reinforcement Learning: Near-Optimal Risk-Sample Tradeoff in Regret
R-learning in actor-critic model offers a biologically relevant mechanism for sequential decision-making
RL Unplugged: A Collection of Benchmarks for Offline Reinforcement Learning
Robust, Accurate Stochastic Optimization for Variational Inference
Robust-Adaptive Control of Linear Systems: beyond Quadratic Costs
Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimization
Robust compressed sensing using generative models
Robust Correction of Sampling Bias using Cumulative Distribution Functions
Robust Deep Reinforcement Learning against Adversarial Perturbations on State Observations
Robust Disentanglement of a Few Factors at a Time
Robust Disentanglement of a Few Factors at a Time using rPU-VAE
Robust Federated Learning: The Case of Affine Distribution Shifts
Robust Gaussian Covariance Estimation in Nearly-Matrix Multiplication Time
Robust Meta-learning for Mixed Linear Regression with Small Batches
Robust Multi-Agent Reinforcement Learning with Model Uncertainty
Robust Multi-Object Matching via Iterative Reweighting of the Graph Connection Laplacian
Robustness Analysis of Non-Convex Stochastic Gradient Descent using Biased Expectations
Robustness of Bayesian Neural Networks to Gradient-Based Attacks
Robustness of Community Detection to Random Geometric Perturbations
Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptation
Robust Optimization for Fairness with Noisy Protected Groups
Robust Persistence Diagrams using Reproducing Kernels
Robust Pre-Training by Adversarial Contrastive Learning
Robust Quantization: One Model to Rule Them All
Robust Recovery via Implicit Bias of Discrepant Learning Rates for Double Over-parameterization
Robust Recursive Partitioning for Heterogeneous Treatment Effects with Uncertainty Quantification
Robust Reinforcement Learning via Adversarial training with Langevin Dynamics
Robust Sequence Submodular Maximization
Robust Sub-Gaussian Principal Component Analysis and Width-Independent Schatten Packing
Rotated Binary Neural Network
Rotation-Invariant Local-to-Global Representation Learning for 3D Point Cloud
RSKDD-Net: Random Sample-based Keypoint Detector and Descriptor
SAC: Accelerating and Structuring Self-Attention via Sparse Adaptive Connection
Safe Reinforcement Learning via Curriculum Induction
Sample complexity and effective dimension for regression on manifolds
Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction
Sample Complexity of Uniform Convergence for Multicalibration
Sample-Efficient Optimization in the Latent Space of Deep Generative Models via Weighted Retraining
Sample-Efficient Reinforcement Learning of Undercomplete POMDPs
Sample Efficient Reinforcement Learning via Low-Rank Matrix Estimation
Sampling-Decomposable Generative Adversarial Recommender

« prev Page 31/39 next »