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
Exploration-Exploitation in Multi-Agent Competition: Convergence with Bounded Rationality2021
Exploring Architectural Ingredients of Adversarially Robust Deep Neural Networks2021
Exploring Conceptual Soundness with TruLens2021
Exploring Cross-Video and Cross-Modality Signals for Weakly-Supervised Audio-Visual Video Parsing2021
Exploring Forensic Dental Identification with Deep Learning2021
Exploring Social Posterior Collapse in Variational Autoencoder for Interaction Modeling2021
Exploring the Limits of Out-of-Distribution Detection2021
ExpMRC: Explainability Evaluation for Machine Reading Comprehension2021
Exponential Bellman Equation and Improved Regret Bounds for Risk-Sensitive Reinforcement Learning2021
Exponential Graph is Provably Efficient for Decentralized Deep Training2021
Exponential Separation between Two Learning Models and Adversarial Robustness2021
Extending Lagrangian and Hamiltonian Neural Networks with Differentiable Contact Models2021
Extracting Deformation-Aware Local Features by Learning to Deform2021
FACMAC: Factored Multi-Agent Centralised Policy Gradients2021
Fact-driven Logical Reasoning2021
Factored Policy Gradients: Leveraging Structure for Efficient Learning in MOMDPs2021
Fair Algorithms for Multi-Agent Multi-Armed Bandits2021
Fair Classification with Adversarial Perturbations2021
Fair Clustering Under a Bounded Cost2021
Fair Exploration via Axiomatic Bargaining2021
Fairness in Ranking under Uncertainty2021
Fairness via Representation Neutralization2021
Fair Scheduling for Time-dependent Resources2021
Fair Sequential Selection Using Supervised Learning Models2021
Fair Sortition Made Transparent2021
Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem2021
FakeAVCeleb: A Novel Audio-Video Multimodal Deepfake Dataset2021
Fast Abductive Learning by Similarity-based Consistency Optimization2021
Fast Algorithms for $L_\infty$-constrained S-rectangular Robust MDPs2021
Fast and accurate randomized algorithms for low-rank tensor decompositions2021
Fast and Memory Efficient Differentially Private-SGD via JL Projections2021
Fast Approximate Dynamic Programming for Infinite-Horizon Markov Decision Processes2021
Fast Approximation of the Sliced-Wasserstein Distance Using Concentration of Random Projections2021
Fast Axiomatic Attribution for Neural Networks2021
Fast Bayesian Inference for Gaussian Cox Processes via Path Integral Formulation2021
Fast Certified Robust Training with Short Warmup2021
FastCorrect: Fast Error Correction with Edit Alignment for Automatic Speech Recognition2021
Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds2021
Faster Algorithms and Constant Lower Bounds for the Worst-Case Expected Error2021
Faster Directional Convergence of Linear Neural Networks under Spherically Symmetric Data2021
Faster Matchings via Learned Duals2021
Faster Neural Network Training with Approximate Tensor Operations2021
Faster Non-asymptotic Convergence for Double Q-learning2021
Faster Perturbed Stochastic Gradient Methods for Finding Local Minima2021
Faster proximal algorithms for matrix optimization using Jacobi-based eigenvalue methods2021
Fast Extra Gradient Methods for Smooth Structured Nonconvex-Nonconcave Minimax Problems2021
Fast Federated Learning in the Presence of Arbitrary Device Unavailability2021
Fast Minimum-norm Adversarial Attacks through Adaptive Norm Constraints2021
Fast Multi-Resolution Transformer Fine-tuning for Extreme Multi-label Text Classification2021
Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization2021

« prev Page 357/630 next »