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
Exploiting weakly supervised visual patterns to learn from partial annotations
Explore Aggressively, Update Conservatively: Stochastic Extragradient Methods with Variable Stepsize Scaling
Exponential ergodicity of mirror-Langevin diffusions
Extrapolation Towards Imaginary 0-Nearest Neighbour and Its Improved Convergence Rate
Factor Graph Grammars
Factor Graph Neural Networks
Factorizable Graph Convolutional Networks
Factorized Neural Processes for Neural Processes: K-Shot Prediction of Neural Responses
Fair Hierarchical Clustering
Fair Multiple Decision Making Through Soft Interventions
Fairness constraints can help exact inference in structured prediction
Fairness in Streaming Submodular Maximization: Algorithms and Hardness
Fairness without Demographics through Adversarially Reweighted Learning
Fairness with Overlapping Groups; a Probabilistic Perspective
Fair Performance Metric Elicitation
Fair regression via plug-in estimator and recalibration with statistical guarantees
Fair regression with Wasserstein barycenters
Faithful Embeddings for Knowledge Base Queries
Falcon: Fast Spectral Inference on Encrypted Data
Fast, Accurate, and Simple Models for Tabular Data via Augmented Distillation
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
Fast Adversarial Robustness Certification of Nearest Prototype Classifiers for Arbitrary Seminorms
Fast and Accurate $k$-means++ via Rejection Sampling
Fast and Flexible Temporal Point Processes with Triangular Maps
Fast Convergence of Langevin Dynamics on Manifold: Geodesics meet Log-Sobolev
Fast Epigraphical Projection-based Incremental Algorithms for Wasserstein Distributionally Robust Support Vector Machine
Faster DBSCAN via subsampled similarity queries
Faster Differentially Private Samplers via Rényi Divergence Analysis of Discretized Langevin MCMC
Faster Randomized Infeasible Interior Point Methods for Tall/Wide Linear Programs
Faster Wasserstein Distance Estimation with the Sinkhorn Divergence
Fast Fourier Convolution
Fast geometric learning with symbolic matrices
Fast Matrix Square Roots with Applications to Gaussian Processes and Bayesian Optimization
Fast Transformers with Clustered Attention
Fast Unbalanced Optimal Transport on a Tree
f-Divergence Variational Inference
Feature Importance Ranking for Deep Learning
Feature Shift Detection: Localizing Which Features Have Shifted via Conditional Distribution Tests
Federated Accelerated Stochastic Gradient Descent
Federated Bayesian Optimization via Thompson Sampling
Federated Principal Component Analysis
FedSplit: an algorithmic framework for fast federated optimization
Few-Cost Salient Object Detection with Adversarial-Paced Learning
Fewer is More: A Deep Graph Metric Learning Perspective Using Fewer Proxies
Few-shot Image Generation with Elastic Weight Consolidation
Few-shot Visual Reasoning with Meta-Analogical Contrastive Learning
f-GAIL: Learning f-Divergence for Generative Adversarial Imitation Learning
Fictitious Play for Mean Field Games: Continuous Time Analysis and Applications
Field-wise Learning for Multi-field Categorical Data
Fighting Copycat Agents in Behavioral Cloning from Observation Histories

« prev Page 13/39 next »