NeurIPS

31,469 papers14,757 directions

Papers by Year

2026 13
2025 5,812
2024 4,579
2023 3,621
2022 2,923
2021 2,712
2020 1,908
2019 1,442
2018 1,011
2017 718
2016 574
2015 410
2014 416
2013 366
2012 379
2011 311
2010 307
2009 268
2008 256
2007 221
2006 209
2005 212
2004 212
2003 202
2002 211
2001 200
2000 155
1999 152
1998 152
1997 157
1996 153
1995 161
1994 149
1993 166
1992 142
1991 151
1990 172
1989 108
1988 100
1987 90

Top Research Directions

Research directions most represented by papers from this venue.

Scaling Gaussian Processes Beyond Cubic Complexity 263
Bypassing the Computational Bottleneck of Adversarial Training 159
The Non-Linear Function Approximation Gap in Reinforcement Learning 158
Clean Accuracy Degradation in Machine Learning Defenses 155
Safe Reinforcement Learning via Constrained Markov Decision Processes 144
The Mechanics of Benign Overfitting in High Dimensions 144
Multi-Agent Learning Under Bandit Feedback 137
Non-linear Modeling of Neural Population Dynamics 126
Overcoming the Cubic Complexity of Kernel Methods 123
Matrix-Free Curvature Estimation for Deep Learning 120
Kernel Hyperparameter Sensitivity in Distributional Metrics 118
The Statistical Computational Gap in High Dimensions 115
Overcoming the Iterative Inference Latency of Diffusion Models 113
Non-linear Causal Discovery via Functional Constraints 109
Mitigating Gradient Variance in Stochastic Optimization 108

Top Authors

AuthorPapers
Michael Jordan147
Bernhard Schölkopf122
Yoshua Bengio112
Joshua B. Tenenbaum100
Sergey Levine94
Andreas Krause86
Stefano Ermon85
Francis Bach81
Jun Zhu74
Dacheng Tao73
Pieter Abbeel72
Pradeep Kumar Ravikumar72
Mihaela van der Schaar70
Eric P. Xing68
Masashi Sugiyama67
Tong Zhang67
Zhangyang Wang64
Kun Zhang63
Nathan Srebro62
Sham M. Kakade61

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
On the Theory of Reinforcement Learning with Once-per-Episode Feedback2021
On the Universality of Graph Neural Networks on Large Random Graphs2021
On the Validity of Modeling SGD with Stochastic Differential Equations (SDEs)2021
On the Value of Infinite Gradients in Variational Autoencoder Models2021
On the Value of Interaction and Function Approximation in Imitation Learning2021
On the Variance of the Fisher Information for Deep Learning2021
On Training Implicit Models2021
On UMAP's True Loss Function2021
Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluation2021
OpenMatch: Open-Set Semi-supervised Learning with Open-set Consistency Regularization2021
OpenML Benchmarking Suites2021
Open Rule Induction2021
Open-set Label Noise Can Improve Robustness Against Inherent Label Noise2021
Optimal Algorithms for Stochastic Contextual Preference Bandits2021
Optimal Best-Arm Identification Methods for Tail-Risk Measures2021
Optimal Client Sampling for Federated Learning2021
Optimal detection of the feature matching map in presence of noise and outliers2021
Optimal Gradient-based Algorithms for Non-concave Bandit Optimization2021
Optimality and Stability in Federated Learning: A Game-theoretic Approach2021
Optimality of variational inference for stochasticblock model with missing links2021
Optimality of Zeroth Order Gradient Ascent for Nonlinear Bandit Optimization2021
Optimal Order Simple Regret for Gaussian Process Bandits2021
Optimal Policies Tend To Seek Power2021
Optimal prediction of Markov chains with and without spectral gap2021
Optimal Rates for Nonparametric Density Estimation under Communication Constraints2021
Optimal Rates for Random Order Online Optimization2021
Optimal Sketching for Trace Estimation2021
Optimal Underdamped Langevin MCMC Method2021
Optimal Uniform OPE and Model-based Offline Reinforcement Learning in Time-Homogeneous, Reward-Free and Task-Agnostic Settings2021
Optimization-Based Algebraic Multigrid Coarsening Using Reinforcement Learning2021
Optimizing Conditional Value-At-Risk of Black-Box Functions2021
Optimizing Information-theoretical Generalization Bound via Anisotropic Noise of SGLD2021
Optimizing Reusable Knowledge for Continual Learning via Metalearning2021
Oracle Complexity in Nonsmooth Nonconvex Optimization2021
Oracle-Efficient Regret Minimization in Factored MDPs with Unknown Structure2021
OSOA: One-Shot Online Adaptation of Deep Generative Models for Lossless Compression2021
Outcome-Driven Reinforcement Learning via Variational Inference2021
Out-of-Distribution Generalization in Kernel Regression2021
Overcoming Catastrophic Forgetting in Incremental Few-Shot Learning by Finding Flat Minima2021
Overcoming the Convex Barrier for Simplex Inputs2021
Overcoming the curse of dimensionality with Laplacian regularization in semi-supervised learning2021
Overinterpretation reveals image classification model pathologies2021
Overlapping Spaces for Compact Graph Representations2021
Overparameterization Improves Robustness to Covariate Shift in High Dimensions2021
Pairwise Adjusted Mutual Information2021
Panoptic 3D Scene Reconstruction From a Single RGB Image2021
Parallel and Efficient Hierarchical k-Median Clustering2021
Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement2021
Parallelizing Thompson Sampling2021
Parameter-free HE-friendly Logistic Regression2021

« prev Page 375/630 next »