ICML

23,199 papers12,206 directions

Papers by Year

2026 6,487
2025 3,384
2024 2,660
2023 1,862
2022 1,154
2021 1,200
2020 1,099
2019 797
2018 644
2017 440
2016 331
2015 277
2014 314
2013 287
2012 267
2011 158
2010 161
2009 187
2008 164
2007 155
2006 142
2005 137
2004 118
2003 118
2002 87
2001 80
2000 153
1999 55
1998 67
1997 47
1996 67
1995 72
1994 43
1993 45
1991 1
1990 1
1988 1

Top Research Directions

Research directions most represented by papers from this venue.

Scaling Gaussian Processes Beyond Cubic Complexity 181
The Non-Linear Function Approximation Gap in Reinforcement Learning 173
Clean Accuracy Degradation in Machine Learning Defenses 161
Bypassing the Computational Bottleneck of Adversarial Training 133
Overcoming the Iterative Inference Latency of Diffusion Models 132
The Function Approximation Gap in Reinforcement Learning Theory 120
Mitigating Gradient Variance in Policy Optimization 117
Sample Efficient Reinforcement Learning 111
Safe Reinforcement Learning via Constrained Markov Decision Processes 109
Shifting from Static Benchmarks to Dynamic Evaluation 106
Matrix-Free Curvature Estimation for Deep Learning 105
Mitigating Gradient Variance in Stochastic Optimization 102
Scaling Reinforcement Learning to High-Dimensional Visual Observations 96
The Performance Cliff in Ultra Low Bit Quantization 96
Optimization and Generalization with Non-Smooth Activations 94

Top Authors

AuthorPapers
Bernhard Schölkopf84
Michael Jordan81
Masashi Sugiyama75
Sergey Levine75
Yoshua Bengio73
Jun Zhu72
Quanquan Gu69
Shie Mannor66
Mihaela van der Schaar63
Bo Han57
Andreas Krause56
Eric P. Xing55
Pieter Abbeel55
Stefano Ermon55
Percy Liang54
Zhangyang Wang54
Junchi Yan53
Remi Munos53
Csaba Szepesvari51
Tongliang Liu51

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
TFix: Learning to Fix Coding Errors with a Text-to-Text Transformer2021
The Distributed Discrete Gaussian Mechanism for Federated Learning with Secure Aggregation2021
The Earth Mover's Pinball Loss: Quantiles for Histogram-Valued Regression2021
The Emergence of Individuality2021
The Heavy-Tail Phenomenon in SGD2021
The Hintons in your Neural Network: a Quantum Field Theory View of Deep Learning2021
The Impact of Record Linkage on Learning from Feature Partitioned Data2021
The Implicit Bias for Adaptive Optimization Algorithms on Homogeneous Neural Networks2021
The Limits of Min-Max Optimization Algorithms: Convergence to Spurious Non-Critical Sets2021
The Lipschitz Constant of Self-Attention2021
The Logical Options Framework2021
Theory of Spectral Method for Union of Subspaces-Based Random Geometry Graph2021
The Power of Adaptivity for Stochastic Submodular Cover2021
The Power of Log-Sum-Exp: Sequential Density Ratio Matrix Estimation for Speed-Accuracy Optimization2021
The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks2021
Think Global and Act Local: Bayesian Optimisation over High-Dimensional Categorical and Mixed Search Spaces2021
Thinking Like Transformers2021
Three Operator Splitting with a Nonconvex Loss Function2021
Tight Bounds on the Smallest Eigenvalue of the Neural Tangent Kernel for Deep ReLU Networks2021
Tightening the Dependence on Horizon in the Sample Complexity of Q-Learning2021
Tighter Bounds on the Log Marginal Likelihood of Gaussian Process Regression Using Conjugate Gradients2021
Tilting the playing field: Dynamical loss functions for machine learning2021
To be Robust or to be Fair: Towards Fairness in Adversarial Training2021
Top-k eXtreme Contextual Bandits with Arm Hierarchy2021
Toward Better Generalization Bounds with Locally Elastic Stability2021
Towards Better Laplacian Representation in Reinforcement Learning with Generalized Graph Drawing2021
Towards Better Robust Generalization with Shift Consistency Regularization2021
Towards Certifying L-infinity Robustness using Neural Networks with L-inf-dist Neurons2021
Towards Defending against Adversarial Examples via Attack-Invariant Features2021
Towards Distraction-Robust Active Visual Tracking2021
Towards Domain-Agnostic Contrastive Learning2021
Towards Open Ad Hoc Teamwork Using Graph-based Policy Learning2021
Towards Open-World Recommendation: An Inductive Model-based Collaborative Filtering Approach2021
Towards Practical Mean Bounds for Small Samples2021
Towards Rigorous Interpretations: a Formalisation of Feature Attribution2021
Towards the Unification and Robustness of Perturbation and Gradient Based Explanations2021
Towards Tight Bounds on the Sample Complexity of Average-reward MDPs2021
Towards Understanding and Mitigating Social Biases in Language Models2021
Towards Understanding Learning in Neural Networks with Linear Teachers2021
Toward Understanding the Feature Learning Process of Self-supervised Contrastive Learning2021
Tractable structured natural-gradient descent using local parameterizations2021
Training Adversarially Robust Sparse Networks via Bayesian Connectivity Sampling2021
Training data-efficient image transformers & distillation through attention2021
Training Data Subset Selection for Regression with Controlled Generalization Error2021
Training Graph Neural Networks with 1000 Layers2021
Training Quantized Neural Networks to Global Optimality via Semidefinite Programming2021
Training Recurrent Neural Networks via Forward Propagation Through Time2021
Train simultaneously, generalize better: Stability of gradient-based minimax learners2021
Trajectory Diversity for Zero-Shot Coordination2021
Transfer-Based Semantic Anomaly Detection2021

« prev Page 333/464 next »