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
Musical Word Embedding: Bridging the Gap between Listening Contexts and Music2020
Mutual Transfer Learning for Massive Data2020
My Fair Bandit: Distributed Learning of Max-Min Fairness with Multi-player Bandits2020
NADS: Neural Architecture Distribution Search for Uncertainty Awareness2020
Naive Exploration is Optimal for Online LQR2020
Near Input Sparsity Time Kernel Embeddings via Adaptive Sampling2020
Nearly Linear Row Sampling Algorithm for Quantile Regression2020
Near-optimal Regret Bounds for Stochastic Shortest Path2020
Near-optimal sample complexity bounds for learning Latent k-polytopes and applications to Ad-Mixtures2020
Near-Tight Margin-Based Generalization Bounds for Support Vector Machines2020
Negative Sampling in Semi-Supervised learning2020
Nested Subspace Arrangement for Representation of Relational Data2020
NetGAN without GAN: From Random Walks to Low-Rank Approximations2020
Network Pruning by Greedy Subnetwork Selection2020
Neural Architecture Search in A Proxy Validation Loss Landscape2020
Neural Clustering Processes2020
Neural Contextual Bandits with UCB-based Exploration2020
Neural Datalog Through Time: Informed Temporal Modeling via Logical Specification2020
Neural Kernels Without Tangents2020
Neural Network Control Policy Verification With Persistent Adversarial Perturbation2020
Neural Networks are Convex Regularizers: Exact Polynomial-time Convex Optimization Formulations for Two-layer Networks2020
Neural Topic Modeling with Continual Lifelong Learning2020
Neuro-Symbolic Visual Reasoning: Disentangling "Visual" from "Reasoning"2020
New Oracle-Efficient Algorithms for Private Synthetic Data Release2020
NGBoost: Natural Gradient Boosting for Probabilistic Prediction2020
Non-autoregressive Machine Translation with Disentangled Context Transformer2020
Non-Autoregressive Neural Text-to-Speech2020
Non-convex Learning via Replica Exchange Stochastic Gradient MCMC2020
Nonparametric Score Estimators2020
Non-separable Non-stationary random fields2020
Non-Stationary Delayed Bandits with Intermediate Observations2020
No-Regret and Incentive-Compatible Online Learning2020
No-Regret Exploration in Goal-Oriented Reinforcement Learning2020
Normalized Flat Minima: Exploring Scale Invariant Definition of Flat Minima for Neural Networks Using PAC-Bayesian Analysis2020
Normalized Loss Functions for Deep Learning with Noisy Labels2020
Normalizing Flows on Tori and Spheres2020
Obtaining Adjustable Regularization for Free via Iterate Averaging2020
Off-Policy Actor-Critic with Shared Experience Replay2020
On Approximate Thompson Sampling with Langevin Algorithms2020
On a projective ensemble approach to two sample test for equality of distributions2020
On Breaking Deep Generative Model-based Defenses and Beyond2020
On Conditional Versus Marginal Bias in Multi-Armed Bandits2020
On Contrastive Learning for Likelihood-free Inference2020
On Convergence-Diagnostic based Step Sizes for Stochastic Gradient Descent2020
On Coresets for Regularized Regression2020
On Differentially Private Stochastic Convex Optimization with Heavy-tailed Data2020
On Efficient Constructions of Checkpoints2020
On Efficient Low Distortion Ultrametric Embedding2020
One Policy to Control Them All: Shared Modular Policies for Agent-Agnostic Control2020
One-shot Distributed Ridge Regression in High Dimensions2020

« prev Page 348/464 next »