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
Facilitating Graph Neural Networks with Random Walk on Simplicial Complexes2023
Facing Off World Model Backbones: RNNs, Transformers, and S42023
Factorized Contrastive Learning: Going Beyond Multi-view Redundancy2023
Failure-Aware Gaussian Process Optimization with Regret Bounds2023
Fair Adaptive Experiments2023
Fair Allocation of Indivisible Chores: Beyond Additive Costs2023
Fair Canonical Correlation Analysis2023
Fair Graph Distillation2023
FairLISA: Fair User Modeling with Limited Sensitive Attributes Information2023
Fairly Recommending with Social Attributes: A Flexible and Controllable Optimization Approach2023
Fairness Aware Counterfactuals for Subgroups2023
Fairness Continual Learning Approach to Semantic Scene Understanding in Open-World Environments2023
Fairness-guided Few-shot Prompting for Large Language Models2023
Fair, Polylog-Approximate Low-Cost Hierarchical Clustering2023
Fair Streaming Principal Component Analysis: Statistical and Algorithmic Viewpoint2023
Faith and Fate: Limits of Transformers on Compositionality2023
False Discovery Proportion control for aggregated Knockoffs2023
FAMO: Fast Adaptive Multitask Optimization2023
Fantastic Robustness Measures: The Secrets of Robust Generalization2023
Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Training2023
FAST: a Fused and Accurate Shrinkage Tree for Heterogeneous Treatment Effects Estimation2023
Fast and Regret Optimal Best Arm Identification: Fundamental Limits and Low-Complexity Algorithms2023
Fast and Simple Spectral Clustering in Theory and Practice2023
Fast Approximation of Similarity Graphs with Kernel Density Estimation2023
Fast Asymptotically Optimal Algorithms for Non-Parametric Stochastic Bandits2023
Fast Attention Over Long Sequences With Dynamic Sparse Flash Attention2023
Fast Attention Requires Bounded Entries2023
Fast Bellman Updates for Wasserstein Distributionally Robust MDPs2023
Fast Conditional Mixing of MCMC Algorithms for Non-log-concave Distributions2023
Faster approximate subgraph counts with privacy2023
Faster Differentially Private Convex Optimization via Second-Order Methods2023
Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case2023
Faster Margin Maximization Rates for Generic Optimization Methods2023
Faster Query Times for Fully Dynamic $k$-Center Clustering with Outliers2023
Faster Query Times for Fully Dynamic k-Center Clustering with Outliers2023
Faster Relative Entropy Coding with Greedy Rejection Coding2023
Fast Exact Leverage Score Sampling from Khatri-Rao Products with Applications to Tensor Decomposition2023
Fast Model DeBias with Machine Unlearning2023
Fast Optimal Locally Private Mean Estimation via Random Projections2023
Fast Optimal Transport through Sliced Generalized Wasserstein Geodesics2023
Fast Partitioned Learned Bloom Filter2023
Fast Projected Newton-like Method for Precision Matrix Estimation under Total Positivity2023
Fast Rank-1 Lattice Targeted Sampling for Black-box Optimization2023
Fast Scalable and Accurate Discovery of DAGs Using the Best Order Score Search and Grow Shrink Trees2023
Fast Trainable Projection for Robust Fine-tuning2023
FD-Align: Feature Discrimination Alignment for Fine-tuning Pre-Trained Models in Few-Shot Learning2023
Feature Adaptation for Sparse Linear Regression2023
Feature Dropout: Revisiting the Role of Augmentations in Contrastive Learning2023
Feature Learning for Interpretable, Performant Decision Trees2023
Feature-Learning Networks Are Consistent Across Widths At Realistic Scales2023

« prev Page 233/630 next »