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 Distributed Hierarchical Clustering2017
One-Shot Imitation Learning2017
One-Sided Unsupervised Domain Mapping2017
On Fairness and Calibration2017
On Frank-Wolfe and Equilibrium Computation2017
Online control of the false discovery rate with decaying memory2017
Online Convex Optimization with Stochastic Constraints2017
Online Dynamic Programming2017
Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback2017
Online Learning for Multivariate Hawkes Processes2017
Online Learning of Optimal Bidding Strategy in Repeated Multi-Commodity Auctions2017
Online Learning with a Hint2017
Online Learning with Transductive Regret2017
Online multiclass boosting2017
Online Prediction with Selfish Experts2017
Online Reinforcement Learning in Stochastic Games2017
Online to Offline Conversions, Universality and Adaptive Minibatch Sizes2017
On Optimal Generalizability in Parametric Learning2017
On Quadratic Convergence of DC Proximal Newton Algorithm in Nonconvex Sparse Learning2017
On Separability of Loss Functions, and Revisiting Discriminative Vs Generative Models2017
On Structured Prediction Theory with Calibrated Convex Surrogate Losses2017
On Tensor Train Rank Minimization : Statistical Efficiency and Scalable Algorithm2017
On the Complexity of Learning Neural Networks2017
On the Consistency of Quick Shift2017
On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks2017
On-the-fly Operation Batching in Dynamic Computation Graphs2017
On the Model Shrinkage Effect of Gamma Process Edge Partition Models2017
On the Optimization Landscape of Tensor Decompositions2017
On the Power of Truncated SVD for General High-rank Matrix Estimation Problems2017
Optimal Sample Complexity of M-wise Data for Top-K Ranking2017
Optimal Shrinkage of Singular Values Under Random Data Contamination2017
Optimistic posterior sampling for reinforcement learning: worst-case regret bounds2017
Optimized Pre-Processing for Discrimination Prevention2017
Overcoming Catastrophic Forgetting by Incremental Moment Matching2017
Parallel Streaming Wasserstein Barycenters2017
Parameter-Free Online Learning via Model Selection2017
Parametric Simplex Method for Sparse Learning2017
Partial Hard Thresholding: Towards A Principled Analysis of Support Recovery2017
PASS-GLM: polynomial approximate sufficient statistics for scalable Bayesian GLM inference2017
Permutation-based Causal Inference Algorithms with Interventions2017
Perturbative Black Box Variational Inference2017
Phase Transitions in the Pooled Data Problem2017
PixelGAN Autoencoders2017
Pixels to Graphs by Associative Embedding2017
Plan, Attend, Generate: Planning for Sequence-to-Sequence Models2017
Poincaré Embeddings for Learning Hierarchical Representations2017
PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Space2017
Policy Gradient With Value Function Approximation For Collective Multiagent Planning2017
Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication2017
Polynomial time algorithms for dual volume sampling2017

« prev Page 490/630 next »