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
Heterogeneity for the Win: One-Shot Federated Clustering2021
Heterogeneous Risk Minimization2021
"Hey, that's not an ODE": Faster ODE Adjoints via Seminorms2021
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time2021
Hierarchical Clustering of Data Streams: Scalable Algorithms and Approximation Guarantees2021
Hierarchical VAEs Know What They Don't Know2021
High Confidence Generalization for Reinforcement Learning2021
High-dimensional Experimental Design and Kernel Bandits2021
High-Dimensional Gaussian Process Inference with Derivatives2021
High-Performance Large-Scale Image Recognition Without Normalization2021
Homomorphic Sensing: Sparsity and Noise2021
HoroPCA: Hyperbolic Dimensionality Reduction via Horospherical Projections2021
Householder Sketch for Accurate and Accelerated Least-Mean-Squares Solvers2021
How and Why to Use Experimental Data to Evaluate Methods for Observational Causal Inference2021
How could Neural Networks understand Programs?2021
How Do Adam and Training Strategies Help BNNs Optimization2021
How Does Loss Function Affect Generalization Performance of Deep Learning? Application to Human Age Estimation2021
How Framelets Enhance Graph Neural Networks2021
How Important is the Train-Validation Split in Meta-Learning?2021
How rotational invariance of common kernels prevents generalization in high dimensions2021
How to Learn when Data Reacts to Your Model: Performative Gradient Descent2021
HyperHyperNetwork for the Design of Antenna Arrays2021
Hyperparameter Selection for Imitation Learning2021
I-BERT: Integer-only BERT Quantization2021
iDARTS: Differentiable Architecture Search with Stochastic Implicit Gradients2021
Image-Level or Object-Level? A Tale of Two Resampling Strategies for Long-Tailed Detection2021
Imitation by Predicting Observations2021
Implicit Bias of Linear RNNs2021
Implicit-PDF: Non-Parametric Representation of Probability Distributions on the Rotation Manifold2021
Implicit rate-constrained optimization of non-decomposable objectives2021
Implicit Regularization in Tensor Factorization2021
Improved Algorithms for Agnostic Pool-based Active Classification2021
Improved Confidence Bounds for the Linear Logistic Model and Applications to Bandits2021
Improved Corruption Robust Algorithms for Episodic Reinforcement Learning2021
Improved Denoising Diffusion Probabilistic Models2021
Improved, Deterministic Smoothing for L_1 Certified Robustness2021
Improved, Deterministic Smoothing for L1 Certified Robustness2021
Improved OOD Generalization via Adversarial Training and Pretraing2021
Improved Regret Bounds of Bilinear Bandits using Action Space Analysis2021
Improving Breadth-Wise Backpropagation in Graph Neural Networks Helps Learning Long-Range Dependencies2021
Improving Generalization in Meta-learning via Task Augmentation2021
Improving Gradient Regularization using Complex-Valued Neural Networks2021
Improving Molecular Graph Neural Network Explainability with Orthonormalization and Induced Sparsity2021
Improving Predictors via Combination Across Diverse Task Categories2021
Improving Ultrametrics Embeddings Through Coresets2021
Incentivizing Compliance with Algorithmic Instruments2021
In-Database Regression in Input Sparsity Time2021
Inferring Latent Dynamics Underlying Neural Population Activity via Neural Differential Equations2021
Inferring serial correlation with dynamic backgrounds2021
Infinite-Dimensional Optimization for Zero-Sum Games via Variational Transport2021

« prev Page 321/464 next »