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
X-means: Extending K-means with Efficient Estimation of the Number of Clusters2000
Abstracting from Robot Sensor Data using Hidden Markov Models1999
Active Learning for Natural Language Parsing and Information Extraction1999
AdaCost: Misclassification Cost-Sensitive Boosting1999
A Hybrid Lazy-Eager Approach to Reducing the Computation and Memory Requirements of Local Parametric Learning Algorithms1999
A Minimum Risk Metric for Nearest Neighbor Classification1999
An Accelerated Chow and Liu Algorithm: Fitting Tree Distributions to High-Dimensional Sparse Data1999
An Region-Based Learning Approach to Discovering Temporal Structures in Data1999
Approximation Via Value Unification1999
Associative Reinforcement Learning using Linear Probabilistic Concepts1999
Attribute Dependencies, Understandability and Split Selection in Tree Based Models1999
Boosting a Strong Learner: Evidence Against the Minimum Margin1999
Combining Error-Driven Pruning and Classification for Partial Parsing1999
Combining Statistical Learning with a Knowledge-Based Approach - A Case Study in Intensive Care Monitoring1999
Correcting Noisy Data1999
Detecting Motifs from Sequences1999
Discriminant Trees1999
Distributed Robotic Learning: Adaptive Behavior Acquisition for Distributed Autonomous Swimming Robot in Real World1999
Efficient Non-Linear Control by Combining Q-learning with Local Linear Controllers1999
Expected Error Analysis for Model Selection1999
Experiments with Noise Filtering in a Medical Domain1999
Feature Engineering for Text Classification1999
Feature Selection as a Preprocessing Step for Hierarchical Clustering1999
Feature Selection for Unbalanced Class Distribution and Naive Bayes1999
GA-based Learning of Context-Free Grammars using Tabular Representations1999
Hierarchical Models for Screening of Iron Deficiency Anemia1999
Hierarchical Optimization of Policy-Coupled Semi-Markov Decision Processes1999
Implicit Imitation in Multiagent Reinforcement Learning1999
Instance-Family Abstraction in Memory-Based Language Learning1999
Large Margin Trees for Induction and Transduction1999
Lazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees1999
Learning Comprehensible Descriptions of Multivariate Time Series1999
Learning Discriminatory and Descriptive Rules by an Inductive Logic Programming System1999
Learning Hierarchical Performance Knowledge by Observation1999
Learning Policies with External Memory1999
Learning to Optimally Schedule Internet Banner Advertisements1999
Learning to Ride a Bicycle using Iterated Phantom Induction1999
Learning User Evaluation Functions for Adaptive Scheduling Assistance1999
Least-Squares Temporal Difference Learning1999
Local Learning for Iterated Time-Series Prediction1999
Machine-Learning Applications of Algorithmic Randomness1999
Making Better Use of Global Discretization1999
Model Selection in Unsupervised Learning with Applications To Document Clustering1999
Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes1999
Noise-Tolerant Recursive Best-First Induction1999
On Some Misbehaviour of Back-Propagation with Non-Normalized RBFNs and a Solution1999
OPT-KD: An Algorithm for Optimizing Kd-Trees1999
Policy Invariance Under Reward Transformations: Theory and Application to Reward Shaping1999
Proceedings of the Sixteenth International Conference on Machine Learning (ICML 1999), Bled, Slovenia, June 27 - 30, 19991999
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples1999

« prev Page 457/464 next »