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
Distributionally Robust Local Non-parametric Conditional Estimation
Distributionally Robust Parametric Maximum Likelihood Estimation
Distributional Robustness with IPMs and links to Regularization and GANs
Distribution-free binary classification: prediction sets, confidence intervals and calibration
Distribution Matching for Crowd Counting
Diverse Image Captioning with Context-Object Split Latent Spaces
Diversity can be Transferred: Output Diversification for White- and Black-box Attacks
Diversity-Guided Multi-Objective Bayesian Optimization With Batch Evaluations
Do Adversarially Robust ImageNet Models Transfer Better?
Does Unsupervised Architecture Representation Learning Help Neural Architecture Search?
Domain Adaptation as a Problem of Inference on Graphical Models
Domain Adaptation with Conditional Distribution Matching and Generalized Label Shift
Domain Generalization for Medical Imaging Classification with Linear-Dependency Regularization
Domain Generalization via Entropy Regularization
Doubly Robust Off-Policy Value and Gradient Estimation for Deterministic Policies
Dual-Free Stochastic Decentralized Optimization with Variance Reduction
Dual Instrumental Variable Regression
Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completion
Dual Manifold Adversarial Robustness: Defense against Lp and non-Lp Adversarial Attacks
Dual-Resolution Correspondence Networks
Dual T: Reducing Estimation Error for Transition Matrix in Label-noise Learning
DVERGE: Diversifying Vulnerabilities for Enhanced Robust Generation of Ensembles
DynaBERT: Dynamic BERT with Adaptive Width and Depth
Dynamic allocation of limited memory resources in reinforcement learning
Dynamical mean-field theory for stochastic gradient descent in Gaussian mixture classification
Dynamic Fusion of Eye Movement Data and Verbal Narrations in Knowledge-rich Domains
Dynamic Regret of Convex and Smooth Functions
Dynamic Regret of Policy Optimization in Non-Stationary Environments
Dynamic Submodular Maximization
Early-Learning Regularization Prevents Memorization of Noisy Labels
EcoLight: Intersection Control in Developing Regions Under Extreme Budget and Network Constraints
Effective Dimension Adaptive Sketching Methods for Faster Regularized Least-Squares Optimization
Effective Diversity in Population Based Reinforcement Learning
Efficient active learning of sparse halfspaces with arbitrary bounded noise
Efficient Algorithms for Device Placement of DNN Graph Operators
Efficient Clustering Based On A Unified View Of $K$-means And Ratio-cut
Efficient Clustering for Stretched Mixtures: Landscape and Optimality
Efficient Contextual Bandits with Continuous Actions
Efficient estimation of neural tuning during naturalistic behavior
Efficient Exact Verification of Binarized Neural Networks
Efficient Exploration of Reward Functions in Inverse Reinforcement Learning via Bayesian Optimization
Efficient Generation of Structured Objects with Constrained Adversarial Networks
Efficient Learning of Discrete Graphical Models
Efficient Learning of Generative Models via Finite-Difference Score Matching
Efficient Low Rank Gaussian Variational Inference for Neural Networks
Efficient Marginalization of Discrete and Structured Latent Variables via Sparsity
Efficient Model-Based Reinforcement Learning through Optimistic Policy Search and Planning
Efficient Nonmyopic Bayesian Optimization via One-Shot Multi-Step Trees
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent
Efficient Planning in Large MDPs with Weak Linear Function Approximation

« prev Page 11/39 next »