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
Rethinking the Role of Hyperparameter Tuning in Optimizer Benchmarking2021
Rethinking the Variational Interpretation of Accelerated Optimization Methods2021
Retiring Adult: New Datasets for Fair Machine Learning2021
RETRIEVE: Coreset Selection for Efficient and Robust Semi-Supervised Learning2021
Retrospective on the 2021 MineRL BASALT Competition on Learning from Human Feedback2021
Retrospective on the SENSORIUM 2022 competition2021
Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes2021
Revealing and Protecting Labels in Distributed Training2021
Revenue maximization via machine learning with noisy data2021
Reverse-Complement Equivariant Networks for DNA Sequences2021
Reverse engineering learned optimizers reveals known and novel mechanisms2021
Reverse engineering recurrent neural networks with Jacobian switching linear dynamical systems2021
Revisiting 3D Object Detection From an Egocentric Perspective2021
Revisiting Contrastive Methods for Unsupervised Learning of Visual Representations2021
Revisiting Deep Learning Models for Tabular Data2021
Revisiting Design Choices in Offline Model Based Reinforcement Learning2021
Revisiting Discriminator in GAN Compression: A Generator-discriminator Cooperative Compression Scheme2021
Revisiting Hilbert-Schmidt Information Bottleneck for Adversarial Robustness2021
Revisiting Model Stitching to Compare Neural Representations2021
Revisiting Multi-Codebook Quantization2021
Revisiting ResNets: Improved Training and Scaling Strategies2021
Revisiting Smoothed Online Learning2021
Revisiting the Calibration of Modern Neural Networks2021
Revisiting Time Series Outlier Detection: Definitions and Benchmarks2021
Revisit Multimodal Meta-Learning through the Lens of Multi-Task Learning2021
Revitalizing CNN Attention via Transformers in Self-Supervised Visual Representation Learning2021
Reward-Free Model-Based Reinforcement Learning with Linear Function Approximation2021
Reward is enough for convex MDPs2021
RIM: Reliable Influence-based Active Learning on Graphs2021
Risk-Averse Bayes-Adaptive Reinforcement Learning2021
Risk-averse Heteroscedastic Bayesian Optimization2021
Risk-Aware Transfer in Reinforcement Learning using Successor Features2021
Risk Bounds and Calibration for a Smart Predict-then-Optimize Method2021
Risk Bounds for Over-parameterized Maximum Margin Classification on Sub-Gaussian Mixtures2021
Risk Minimization from Adaptively Collected Data: Guarantees for Supervised and Policy Learning2021
Risk Monotonicity in Statistical Learning2021
RL for Latent MDPs: Regret Guarantees and a Lower Bound2021
RLlib Flow: Distributed Reinforcement Learning is a Dataflow Problem2021
RMIX: Learning Risk-Sensitive Policies for Cooperative Reinforcement Learning Agents2021
RMM: Reinforced Memory Management for Class-Incremental Learning2021
Robust Allocations with Diversity Constraints2021
Robust and Decomposable Average Precision for Image Retrieval2021
Robust and differentially private mean estimation2021
Robust and Fully-Dynamic Coreset for Continuous-and-Bounded Learning (With Outliers) Problems2021
Robust Auction Design in the Auto-bidding World2021
RobustBench: a standardized adversarial robustness benchmark2021
Robust Compressed Sensing MRI with Deep Generative Priors2021
Robust Contrastive Learning Using Negative Samples with Diminished Semantics2021
Robust Counterfactual Explanations on Graph Neural Networks2021
Robust Deep Reinforcement Learning through Adversarial Loss2021

« prev Page 381/630 next »