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
NP-Match: When Neural Processes meet Semi-Supervised Learning2022
NysADMM: faster composite convex optimization via low-rank approximation2022
Nyström Kernel Mean Embeddings2022
Object Permanence Emerges in a Random Walk along Memory2022
OFA: Unifying Architectures, Tasks, and Modalities Through a Simple Sequence-to-Sequence Learning Framework2022
Offline RL Policies Should Be Trained to be Adaptive2022
Off-Policy Evaluation for Large Action Spaces via Embeddings2022
Off-Policy Fitted Q-Evaluation with Differentiable Function Approximators: Z-Estimation and Inference Theory2022
Omni-Granular Ego-Semantic Propagation for Self-Supervised Graph Representation Learning2022
On Collective Robustness of Bagging Against Data Poisoning2022
On Convergence of Gradient Descent Ascent: A Tight Local Analysis2022
On Distribution Shift in Learning-based Bug Detectors2022
One-Pass Algorithms for MAP Inference of Nonsymmetric Determinantal Point Processes2022
One-Pass Diversified Sampling with Application to Terabyte-Scale Genomic Sequence Streams2022
On Finite-Sample Identifiability of Contrastive Learning-Based Nonlinear Independent Component Analysis2022
On Implicit Bias in Overparameterized Bilevel Optimization2022
On Improving Model-Free Algorithms for Decentralized Multi-Agent Reinforcement Learning2022
On Last-Iterate Convergence Beyond Zero-Sum Games2022
On Learning Mixture of Linear Regressions in the Non-Realizable Setting2022
Online Active Regression2022
Online Algorithms with Multiple Predictions2022
Online and Consistent Correlation Clustering2022
Online Balanced Experimental Design2022
Online Continual Learning through Mutual Information Maximization2022
Online Decision Transformer2022
Online Learning and Pricing with Reusable Resources: Linear Bandits with Sub-Exponential Rewards2022
Online Learning for Min Sum Set Cover and Pandora's Box2022
Online Learning with Knapsacks: the Best of Both Worlds2022
Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback2022
Only tails matter: Average-Case Universality and Robustness in the Convex Regime2022
On Measuring Causal Contributions via do-interventions2022
On Non-local Convergence Analysis of Deep Linear Networks2022
On Numerical Integration in Neural Ordinary Differential Equations2022
On the Adversarial Robustness of Causal Algorithmic Recourse2022
On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming2022
On the Convergence of Local Stochastic Compositional Gradient Descent with Momentum2022
On the Convergence of the Shapley Value in Parametric Bayesian Learning Games2022
On the Difficulty of Defending Self-Supervised Learning against Model Extraction2022
On the Effects of Artificial Data Modification2022
On the Equivalence Between Temporal and Static Equivariant Graph Representations2022
On the Finite-Time Complexity and Practical Computation of Approximate Stationarity Concepts of Lipschitz Functions2022
On the Finite-Time Performance of the Knowledge Gradient Algorithm2022
On the Generalization Analysis of Adversarial Learning2022
On the Hidden Biases of Policy Mirror Ascent in Continuous Action Spaces2022
On the Impossibility of Learning to Cooperate with Adaptive Partner Strategies in Repeated Games2022
On the Learning of Non-Autoregressive Transformers2022
On the Optimization Landscape of Neural Collapse under MSE Loss: Global Optimality with Unconstrained Features2022
On the Practicality of Deterministic Epistemic Uncertainty2022
On the Robustness of CountSketch to Adaptive Inputs2022
On the Role of Discount Factor in Offline Reinforcement Learning2022

« prev Page 303/464 next »