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
A Value-Function-based Interior-point Method for Non-convex Bi-level Optimization2021
Average-Reward Off-Policy Policy Evaluation with Function Approximation2021
A Wasserstein Minimax Framework for Mixed Linear Regression2021
A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimization2021
Backdoor Scanning for Deep Neural Networks through K-Arm Optimization2021
Backpropagated Neighborhood Aggregation for Accurate Training of Spiking Neural Networks2021
BANG: Bridging Autoregressive and Non-autoregressive Generation with Large Scale Pretraining2021
Barlow Twins: Self-Supervised Learning via Redundancy Reduction2021
BASE Layers: Simplifying Training of Large, Sparse Models2021
BASGD: Buffered Asynchronous SGD for Byzantine Learning2021
BasisDeVAE: Interpretable Simultaneous Dimensionality Reduction and Feature-Level Clustering with Derivative-Based Variational Autoencoders2021
Batch Value-function Approximation with Only Realizability2021
Bayesian Algorithm Execution: Estimating Computable Properties of Black-box Functions Using Mutual Information2021
Bayesian Attention Belief Networks2021
Bayesian Deep Learning via Subnetwork Inference2021
Bayesian Optimistic Optimisation with Exponentially Decaying Regret2021
Bayesian Optimization over Hybrid Spaces2021
Bayesian Quadrature on Riemannian Data Manifolds2021
Bayesian Structural Adaptation for Continual Learning2021
Benchmarks, Algorithms, and Metrics for Hierarchical Disentanglement2021
Besov Function Approximation and Binary Classification on Low-Dimensional Manifolds Using Convolutional Residual Networks2021
Best Arm Identification in Graphical Bilinear Bandits2021
Best Model Identification: A Rested Bandit Formulation2021
Beyond log2(T) regret for decentralized bandits in matching markets2021
Beyond log(T) regret for decentralized bandits in matching markets2021
Beyond the Pareto Efficient Frontier: Constraint Active Search for Multiobjective Experimental Design2021
Beyond Variance Reduction: Understanding the True Impact of Baselines on Policy Optimization2021
Bias-Free Scalable Gaussian Processes via Randomized Truncations2021
Bias-Robust Bayesian Optimization via Dueling Bandits2021
Bias-Variance Reduced Local SGD for Less Heterogeneous Federated Learning2021
Biclustering analysis of gene expression data using multi-objective evolutionary algorithms2021
Bilevel Optimization: Convergence Analysis and Enhanced Design2021
Bilinear Classes: A Structural Framework for Provable Generalization in RL2021
Binary Classification from Multiple Unlabeled Datasets via Surrogate Set Classification2021
Blind Pareto Fairness and Subgroup Robustness2021
Boosting for Online Convex Optimization2021
Boosting the Intelligibility of Waveform Speech Enhancement Networks through Self-supervised Representations2021
Boosting the Throughput and Accelerator Utilization of Specialized CNN Inference Beyond Increasing Batch Size2021
Bootstrapping Fitted Q-Evaluation for Off-Policy Inference2021
BORE: Bayesian Optimization by Density-Ratio Estimation2021
Breaking the Deadly Triad with a Target Network2021
Breaking the Limits of Message Passing Graph Neural Networks2021
Break-It-Fix-It: Unsupervised Learning for Program Repair2021
Bridging Multi-Task Learning and Meta-Learning: Towards Efficient Training and Effective Adaptation2021
Budgeted Heterogeneous Treatment Effect Estimation2021
Byzantine-Resilient High-Dimensional SGD with Local Iterations on Heterogeneous Data2021
Calibrate Before Use: Improving Few-shot Performance of Language Models2021
Can Subnetwork Structure Be the Key to Out-of-Distribution Generalization?2021
CARTL: Cooperative Adversarially-Robust Transfer Learning2021
Catastrophic Fisher Explosion: Early Phase Fisher Matrix Impacts Generalization2021

« prev Page 314/464 next »