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
Learning to Detect Objects with a 1 Megapixel Event Camera
Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learning
Learning to Execute Programs with Instruction Pointer Attention Graph Neural Networks
Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Prediction
Learning to Incentivize Other Learning Agents
Learning to Learn Variational Semantic Memory
Learning to Learn with Feedback and Local Plasticity
Learning to Mutate with Hypergradient Guided Population
Learning to Orient Surfaces by Self-supervised Spherical CNNs
Learning to Play No-Press Diplomacy with Best Response Policy Iteration
Learning to Play Sequential Games versus Unknown Opponents
Learning to Prove Theorems by Learning to Generate Theorems
Learning to run a Power Network Challenge: a Retrospective Analysis
Learning to search efficiently for causally near-optimal treatments
Learning to Select Best Forecast Tasks for Clinical Outcome Prediction
Learning to solve TV regularised problems with unrolled algorithms
Learning to summarize with human feedback
Learning to Utilize Shaping Rewards: A New Approach of Reward Shaping
Learning under Model Misspecification: Applications to Variational and Ensemble methods
Learning Utilities and Equilibria in Non-Truthful Auctions
Learning with Differentiable Pertubed Optimizers
Learning with Operator-valued Kernels in Reproducing Kernel Krein Spaces
Learning with Optimized Random Features: Exponential Speedup by Quantum Machine Learning without Sparsity and Low-Rank Assumptions
Least Squares Regression with Markovian Data: Fundamental Limits and Algorithms
Leverage the Average: an Analysis of KL Regularization in Reinforcement Learning
Leveraging Predictions in Smoothed Online Convex Optimization via Gradient-based Algorithms
Liberty or Depth: Deep Bayesian Neural Nets Do Not Need Complex Weight Posterior Approximations
Lightweight Generative Adversarial Networks for Text-Guided Image Manipulation
Likelihood Regret: An Out-of-Distribution Detection Score For Variational Auto-encoder
Limits on Testing Structural Changes in Ising Models
Limits to Depth Efficiencies of Self-Attention
Linear Disentangled Representations and Unsupervised Action Estimation
Linear Dynamical Systems as a Core Computational Primitive
Linearly Converging Error Compensated SGD
Linear-Sample Learning of Low-Rank Distributions
Linear Time Sinkhorn Divergences using Positive Features
Lipschitz Bounds and Provably Robust Training by Laplacian Smoothing
Lipschitz-Certifiable Training with a Tight Outer Bound
List-Decodable Mean Estimation via Iterative Multi-Filtering
Listening to Sounds of Silence for Speech Denoising
Locally-Adaptive Nonparametric Online Learning
Locally Differentially Private (Contextual) Bandits Learning
Locally private non-asymptotic testing of discrete distributions is faster using interactive mechanisms
LoCo: Local Contrastive Representation Learning
Logarithmic Pruning is All You Need
Logarithmic Regret Bound in Partially Observable Linear Dynamical Systems
Log-Likelihood Ratio Minimizing Flows: Towards Robust and Quantifiable Neural Distribution Alignment
Long-Horizon Visual Planning with Goal-Conditioned Hierarchical Predictors
Long-Tailed Classification by Keeping the Good and Removing the Bad Momentum Causal Effect
Look-ahead Meta Learning for Continual Learning

« prev Page 21/39 next »