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
Learning Symbolic Prototypes1997
Machine Learning by Function Decomposition1997
On Learning From Multi-Instance Examples: Empirical Evaluation of a Theoretical Approach1997
On the Decomposition of Polychotomies into Dichotomies1997
Option Decision Trees with Majority Votes1997
Pessimistic decision tree pruning based Continuous-time1997
Predicting Multiprocessor Memory Access Patterns with Learning Models1997
Preventing "Overfitting" of Cross-Validation Data1997
Probabilistic Linear Tree1997
Proceedings of the Fourteenth International Conference on Machine Learning (ICML 1997), Nashville, Tennessee, USA, July 8-12, 19971997
Pruning Adaptive Boosting1997
Reinforcement Learning in POMDPs with Function Approximation1997
Robot Learning From Demonstration1997
Stacking Bagged and Dagged Models1997
The Canonical Distortion Measure for Vector Quantization and Function Approximation1997
The Effective Size of a Neural Network: A Principal Component Approach1997
Using Optimal Dependency-Trees for Combinational Optimization1997
Using output codes to boost multiclass learning problems1997
Why Experimentation can be better than "Perfect Guidance"1997
A Convergent Reinforcement Learning Algorithm in the Continuous Case: The Finite-Element Reinforcement Learning1996
Actual Return Reinforcement Learning versus Temporal Differences: Some Theoretical and Experimental Results1996
A Generalized Reinforcement-Learning Model: Convergence and Applications1996
Algorithms and Applications for Multitask Learning1996
An Advanced Evolution Should Not Repeat its Past Errors1996
Analogy Access by Mapping Spreading and Abstraction in Large, Multifunctional Knowledge Bases1996
Applying the Multiple Cause Mixture Model to Text Categorization1996
Applying the Waek Learning Framework to Understand and Improve C4.51996
Applying Winnow to Context-Sensitive Spelling Correction1996
Approximate Value Trees in Structured Dynamic Programming1996
A Probabilistic Approach to Feature Selection - A Filter Solution1996
A Theoretical and Empirical Study of a Noise-Tolerant Algorithm to Learn Geormetric Patterns1996
Background Knowledge in GA-based Concept Learning1996
Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier1996
Bias Plus Variance Decomposition for Zero-One Loss Functions1996
Causal Discovery via MML1996
Constructive Induction Using Fragmentary Knowledge1996
Data Mining and Machine Learning (Abstract)1996
Delaying the Choice of Bias: A Disjunctive Version Space Approach1996
Discovering Structure in Multiple Learning Tasks: The TC Algorithm1996
Discretizing Continuous Attributes While Learning Bayesian Networks1996
Efficient Learning of Selective Bayesian Network Classifiers1996
Experimental Knowledge Acquisition for Planning1996
Experiments with a New Boosting Algorithm1996
Exploiting the Omission of Irrelevant Data1996
Identifying the Information Contained in a Flawed Theory1996
Improving the Efficiency of Knowledge Base Refinement1996
K Nearest Neighbor Classification on Feature Projections1996
Learning Active Classifiers1996
Learning Bayesian Belief Networks Based on the Minimum Description Length Principle: An Efficient Algorithm Using the B & B Technique1996
Learning Despite Concept Variation by Finding Structure in Attribute-based Data1996

« prev Page 460/464 next »