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
Reinforcement Learning with Latent Flow2021
Reinforcement Learning with State Observation Costs in Action-Contingent Noiselessly Observable Markov Decision Processes2021
Relational Self-Attention: What's Missing in Attention for Video Understanding2021
Relational VAE: A Continuous Latent Variable Model for Graph Structured Data2021
Relative Flatness and Generalization2021
Relative stability toward diffeomorphisms indicates performance in deep nets2021
Relative Uncertainty Learning for Facial Expression Recognition2021
Relaxed Marginal Consistency for Differentially Private Query Answering2021
Relaxing Local Robustness2021
RelaySum for Decentralized Deep Learning on Heterogeneous Data2021
Reliable and Trustworthy Machine Learning for Health Using Dataset Shift Detection2021
Reliable Causal Discovery with Improved Exact Search and Weaker Assumptions2021
Reliable Decisions with Threshold Calibration2021
Reliable Estimation of KL Divergence using a Discriminator in Reproducing Kernel Hilbert Space2021
Reliable Post hoc Explanations: Modeling Uncertainty in Explainability2021
ReLU Regression with Massart Noise2021
Remember What You Want to Forget: Algorithms for Machine Unlearning2021
REMIPS: Physically Consistent 3D Reconstruction of Multiple Interacting People under Weak Supervision2021
Removing Inter-Experimental Variability from Functional Data in Systems Neuroscience2021
Renyi Differential Privacy of The Subsampled Shuffle Model In Distributed Learning2021
Replacing Rewards with Examples: Example-Based Policy Search via Recursive Classification2021
Replay-Guided Adversarial Environment Design2021
Representation Costs of Linear Neural Networks: Analysis and Design2021
Representation Learning Beyond Linear Prediction Functions2021
Representation Learning for Event-based Visuomotor Policies2021
Representation Learning on Spatial Networks2021
Representer Point Selection via Local Jacobian Expansion for Post-hoc Classifier Explanation of Deep Neural Networks and Ensemble Models2021
Representing Hyperbolic Space Accurately using Multi-Component Floats2021
Representing Long-Range Context for Graph Neural Networks with Global Attention2021
Represent Your Own Policies: Reinforcement Learning with Policy-extended Value Function Approximator2021
Repulsive Deep Ensembles are Bayesian2021
Re-ranking for image retrieval and transductive few-shot classification2021
Residual2Vec: Debiasing graph embedding with random graphs2021
Residual Pathway Priors for Soft Equivariance Constraints2021
Residual Relaxation for Multi-view Representation Learning2021
ResMLP: Feedforward networks for image classification with data-efficient training2021
ResNEsts and DenseNEsts: Block-based DNN Models with Improved Representation Guarantees2021
ReSSL: Relational Self-Supervised Learning with Weak Augmentation2021
ResT: An Efficient Transformer for Visual Recognition2021
Results and findings of the 2021 Image Similarity Challenge2021
Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search2021
Rethinking and Reweighting the Univariate Losses for Multi-Label Ranking: Consistency and Generalization2021
Rethinking Calibration of Deep Neural Networks: Do Not Be Afraid of Overconfidence2021
Rethinking conditional GAN training: An approach using geometrically structured latent manifolds2021
Rethinking gradient sparsification as total error minimization2021
Rethinking Graph Transformers with Spectral Attention2021
Rethinking Neural Operations for Diverse Tasks2021
Rethinking Space-Time Networks with Improved Memory Coverage for Efficient Video Object Segmentation2021
Rethinking supervised learning: insights from biological learning and from calling it by its name2021
Rethinking the Pruning Criteria for Convolutional Neural Network2021

« prev Page 380/630 next »