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 a Terminator2022
Reinforcement Learning with Automated Auxiliary Loss Search2022
Reinforcement Learning with Logarithmic Regret and Policy Switches2022
Reinforcement Learning with Neural Radiance Fields2022
Reinforcement Learning with Non-Exponential Discounting2022
Relational Proxies: Emergent Relationships as Fine-Grained Discriminators2022
Relational Reasoning via Set Transformers: Provable Efficiency and Applications to MARL2022
Relation-Constrained Decoding for Text Generation2022
Relaxing Equivariance Constraints with Non-stationary Continuous Filters2022
Remember the Past: Distilling Datasets into Addressable Memories for Neural Networks2022
RényiCL: Contrastive Representation Learning with Skew Rényi Divergence2022
Renyi Differential Privacy of Propose-Test-Release and Applications to Private and Robust Machine Learning2022
Repairing Neural Networks by Leaving the Right Past Behind2022
Representing Spatial Trajectories as Distributions2022
Reproducibility in Optimization: Theoretical Framework and Limits2022
Residual Multiplicative Filter Networks for Multiscale Reconstruction2022
Resolving the data ambiguity for periodic crystals2022
Resource-Adaptive Federated Learning with All-In-One Neural Composition2022
Respecting Transfer Gap in Knowledge Distillation2022
ResQ: A Residual Q Function-based Approach for Multi-Agent Reinforcement Learning Value Factorization2022
ResT V2: Simpler, Faster and Stronger2022
Retaining Knowledge for Learning with Dynamic Definition2022
Rethinking Alignment in Video Super-Resolution Transformers2022
Rethinking and Improving Robustness of Convolutional Neural Networks: a Shapley Value-based Approach in Frequency Domain2022
Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discrimination2022
Rethinking Counterfactual Explanations as Local and Regional Counterfactual Policies2022
Rethinking Generalization in Few-Shot Classification2022
Rethinking Image Restoration for Object Detection2022
Rethinking Individual Global Max in Cooperative Multi-Agent Reinforcement Learning2022
Rethinking Knowledge Graph Evaluation Under the Open-World Assumption2022
Rethinking Lipschitz Neural Networks and Certified Robustness: A Boolean Function Perspective2022
Rethinking Resolution in the Context of Efficient Video Recognition2022
Rethinking the compositionality of point clouds through regularization in the hyperbolic space2022
Rethinking the Reverse-engineering of Trojan Triggers2022
Rethinking Value Function Learning for Generalization in Reinforcement Learning2022
Rethinking Variational Inference for Probabilistic Programs with Stochastic Support2022
Retrieval-Augmented Diffusion Models2022
Retrieve, Reason, and Refine: Generating Accurate and Faithful Patient Instructions2022
Retrospective Adversarial Replay for Continual Learning2022
Revisiting Active Sets for Gaussian Process Decoders2022
Revisiting Graph Contrastive Learning from the Perspective of Graph Spectrum2022
Revisiting Heterophily For Graph Neural Networks2022
Revisiting Injective Attacks on Recommender Systems2022
Revisiting Neural Scaling Laws in Language and Vision2022
Revisiting Non-Parametric Matching Cost Volumes for Robust and Generalizable Stereo Matching2022
Revisiting Optimal Convergence Rate for Smooth and Non-convex Stochastic Decentralized Optimization2022
Revisiting Populations in Multi-Agent Communication2022
Revisiting Realistic Test-Time Training: Sequential Inference and Adaptation by Anchored Clustering2022
Revisiting Sliced Wasserstein on Images: From Vectorization to Convolution2022
Revisiting Sparse Convolutional Model for Visual Recognition2022

« prev Page 325/630 next »