ICML 2023

1,862 papers

Top Research Directions

Research directions most represented by ICML 2023 papers.

Clean Accuracy Degradation in Machine Learning Defenses 32
The Non-Linear Function Approximation Gap in Reinforcement Learning 30
Overcoming the Iterative Inference Latency of Diffusion Models 23
Bypassing the Computational Bottleneck of Adversarial Training 23
Overcoming the Homophily Assumption in Graph Neural Networks 20
The Function Approximation Gap in Reinforcement Learning Theory 20
The Weisfeiler Lehman Expressivity Bottleneck 19
Over-Smoothing in Graph Neural Networks 19
Scaling Gaussian Processes Beyond Cubic Complexity 17
Scaling Reinforcement Learning to High-Dimensional Visual Observations 16
The Mechanics of Benign Overfitting in High Dimensions 15
Exploration Strategies for Sparse Reward Reinforcement Learning 15
Conformal Prediction for Rigorous Uncertainty Quantification 14
Overcoming the Cubic Complexity of Kernel Methods 14
The Mechanics of Backdoor Attacks in Neural Networks 14

Top Authors

AuthorPapers
Quanquan Gu14
Yoshua Bengio12
Bernhard Schölkopf11
Remi Munos11
Yunhao Tang10
Bo Han9
Michal Valko9
Pieter Abbeel9
Tongliang Liu9
Zhangyang Wang9
Jun Zhu8
Sergey Levine8
Stefano Ermon8
Junchi Yan7
Percy Liang7
Tianbao Yang7
Will Dabney7
Clare Lyle6
Dacheng Tao6
Kun Zhang6

Impactful Papers

Papers from ICML 2023 that shaped research clusters.

Foundational

Influential

Papers

Title
Explainable Data-Driven Optimization: From Context to Decision and Back Again
Explaining Reinforcement Learning with Shapley Values
Explaining the effects of non-convergent MCMC in the training of Energy-Based Models
Explore and Exploit the Diverse Knowledge in Model Zoo for Domain Generalization
Exploring Chemical Space with Score-based Out-of-distribution Generation
Exploring Model Dynamics for Accumulative Poisoning Discovery
Exploring the Benefits of Training Expert Language Models over Instruction Tuning
Exploring the Limits of Model-Targeted Indiscriminate Data Poisoning Attacks
Exponential Smoothing for Off-Policy Learning
Extending Conformal Prediction to Hidden Markov Models with Exact Validity via de Finetti's Theorem for Markov Chains
Extending Kernel PCA through Dualization: Sparsity, Robustness and Fast Algorithms
Extrapolated Random Tree for Regression
Extrapolative Controlled Sequence Generation via Iterative Refinement
Facial Expression Recognition with Adaptive Frame Rate based on Multiple Testing Correction
FaDIn: Fast Discretized Inference for Hawkes Processes with General Parametric Kernels
FAENet: Frame Averaging Equivariant GNN for Materials Modeling
Fair and Accurate Decision Making through Group-Aware Learning
Fair and Optimal Classification via Post-Processing
Fair and Robust Estimation of Heterogeneous Treatment Effects for Policy Learning
Fair Densities via Boosting the Sufficient Statistics of Exponential Families
FAIRER: Fairness as Decision Rationale Alignment
Fair Neighbor Embedding
Fairness in Matching under Uncertainty
Fairness in Streaming Submodular Maximization over a Matroid Constraint
Fair yet Asymptotically Equal Collaborative Learning
FARE: Provably Fair Representation Learning with Practical Certificates
Fascinating Supervisory Signals and Where to Find Them: Deep Anomaly Detection with Scale Learning
Fast $(1+\varepsilon)$-Approximation Algorithms for Binary Matrix Factorization
Fast (1+ε)-Approximation Algorithms for Binary Matrix Factorization
Fast Algorithms for Distributed k-Clustering with Outliers
Fast as CHITA: Neural Network Pruning with Combinatorial Optimization
Fast Combinatorial Algorithms for Min Max Correlation Clustering
Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspective
Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
Faster Rates of Convergence to Stationary Points in Differentially Private Optimization
Fast Excess Risk Rates via Offset Rademacher Complexity
Fast Federated Machine Unlearning with Nonlinear Functional Theory
Fast Inference from Transformers via Speculative Decoding
Fast Online Node Labeling for Very Large Graphs
Fast Online Value-Maximizing Prediction Sets with Conformal Cost Control
Fast Private Kernel Density Estimation via Locality Sensitive Quantization
Fast Rates for Maximum Entropy Exploration
Fast Rates in Time-Varying Strongly Monotone Games
Fast Sampling of Diffusion Models via Operator Learning
Featured Graph Coarsening with Similarity Guarantees
Feature Directions Matter: Long-Tailed Learning via Rotated Balanced Representation
Feature Expansion for Graph Neural Networks
Feature learning in deep classifiers through Intermediate Neural Collapse
Feature Programming for Multivariate Time Series Prediction
FedAvg Converges to Zero Training Loss Linearly for Overparameterized Multi-Layer Neural Networks

« prev Page 12/38 next »