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
Object Detection with Grammar Models2011
On Causal Discovery with Cyclic Additive Noise Models2011
On fast approximate submodular minimization2011
On Learning Discrete Graphical Models using Greedy Methods2011
Online Learning: Stochastic, Constrained, and Smoothed Adversaries2011
Online Submodular Set Cover, Ranking, and Repeated Active Learning2011
On Strategy Stitching in Large Extensive Form Multiplayer Games2011
On the accuracy of l1-filtering of signals with block-sparse structure2011
On the Analysis of Multi-Channel Neural Spike Data2011
On the Completeness of First-Order Knowledge Compilation for Lifted Probabilistic Inference2011
On the Universality of Online Mirror Descent2011
On Tracking The Partition Function2011
On U-processes and clustering performance2011
Optimal learning rates for least squares SVMs using Gaussian kernels2011
Optimal Reinforcement Learning for Gaussian Systems2011
Optimistic Optimization of a Deterministic Function without the Knowledge of its Smoothness2011
Orthogonal Matching Pursuit with Replacement2011
PAC-Bayesian Analysis of Contextual Bandits2011
Penalty Decomposition Methods for Rank Minimization2011
Periodic Finite State Controllers for Efficient POMDP and DEC-POMDP Planning2011
Phase transition in the family of p-resistances2011
PiCoDes: Learning a Compact Code for Novel-Category Recognition.2011
Policy Gradient Coagent Networks2011
Portmanteau Vocabularies for Multi-Cue Image Representation2011
Practical Variational Inference for Neural Networks2011
Predicting Dynamic Difficulty2011
Predicting response time and error rates in visual search2011
Prediction strategies without loss2011
Priors over Recurrent Continuous Time Processes2011
Prismatic Algorithm for Discrete D.C. Programming Problem2011
Probabilistic amplitude and frequency demodulation2011
Probabilistic Joint Image Segmentation and Labeling2011
Probabilistic Modeling of Dependencies Among Visual Short-Term Memory Representations2011
Projection onto A Nonnegative Max-Heap2011
Pylon Model for Semantic Segmentation2011
Quasi-Newton Methods for Markov Chain Monte Carlo2011
Query-Aware MCMC2011
Randomized Algorithms for Comparison-based Search2011
Ranking annotators for crowdsourced labeling tasks2011
Rapid Deformable Object Detection using Dual-Tree Branch-and-Bound2011
Reconstructing Patterns of Information Diffusion from Incomplete Observations2011
Recovering Intrinsic Images with a Global Sparsity Prior on Reflectance2011
Regularized Laplacian Estimation and Fast Eigenvector Approximation2011
Reinforcement Learning using Kernel-Based Stochastic Factorization.2011
Relative Density-Ratio Estimation for Robust Distribution Comparison2011
Robust Lasso with missing and grossly corrupted observations2011
Robust Multi-Class Gaussian Process Classification2011
RTRMC: A Riemannian trust-region method for low-rank matrix completion2011
Scalable Training of Mixture Models via Coresets2011
See the Tree Through the Lines: The Shazoo Algorithm2011

« prev Page 542/630 next »