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
Regularization and Variance-Weighted Regression Achieves Minimax Optimality in Linear MDPs: Theory and Practice
Regularization-free Diffeomorphic Temporal Alignment Nets
Regularizing Towards Soft Equivariance Under Mixed Symmetries
Reinforcement Learning Can Be More Efficient with Multiple Rewards
Reinforcement Learning from Passive Data via Latent Intentions
Reinforcement Learning in Low-rank MDPs with Density Features
Reinforcement Learning with General Utilities: Simpler Variance Reduction and Large State-Action Space
Reinforcement Learning with History Dependent Dynamic Contexts
Relevant Walk Search for Explaining Graph Neural Networks
Reliable Measures of Spread in High Dimensional Latent Spaces
ReLOAD: Reinforcement Learning with Optimistic Ascent-Descent for Last-Iterate Convergence in Constrained MDPs
Reparameterized Policy Learning for Multimodal Trajectory Optimization
Repository-Level Prompt Generation for Large Language Models of Code
Representation-Driven Reinforcement Learning
Representation Learning with Multi-Step Inverse Kinematics: An Efficient and Optimal Approach to Rich-Observation RL
Representations and Exploration for Deep Reinforcement Learning using Singular Value Decomposition
Representer Point Selection for Explaining Regularized High-dimensional Models
Reprogramming Pretrained Language Models for Antibody Sequence Infilling
Restoration based Generative Models
Restoration-Degradation Beyond Linear Diffusions: A Non-Asymptotic Analysis For DDIM-type Samplers
Resurrecting Recurrent Neural Networks for Long Sequences
Rethink DARTS Search Space and Renovate a New Benchmark
Rethinking Backdoor Attacks
Rethinking Explaining Graph Neural Networks via Non-parametric Subgraph Matching
Rethinking Visual Reconstruction: Experience-Based Content Completion Guided by Visual Cues
Rethinking Warm-Starts with Predictions: Learning Predictions Close to Sets of Optimal Solutions for Faster $\text{L}$-/$\text{L}^\natural$-Convex Function Minimization
Rethinking Warm-Starts with Predictions: Learning Predictions Close to Sets of Optimal Solutions for Faster L-/L-Convex Function Minimization
Rethinking Weak Supervision in Helping Contrastive Learning
Retrieval-Augmented Multimodal Language Modeling
Retrosynthetic Planning with Dual Value Networks
Returning The Favour: When Regression Benefits From Probabilistic Causal Knowledge
Revisiting Bellman Errors for Offline Model Selection
Revisiting Data-Free Knowledge Distillation with Poisoned Teachers
Revisiting Discriminative vs. Generative Classifiers: Theory and Implications
Revisiting Domain Randomization via Relaxed State-Adversarial Policy Optimization
Revisiting Gradient Clipping: Stochastic bias and tight convergence guarantees
Revisiting Over-smoothing and Over-squashing Using Ollivier-Ricci Curvature
Revisiting Pseudo-Label for Single-Positive Multi-Label Learning
Revisiting Sampling for Combinatorial Optimization
Revisiting Simple Regret: Fast Rates for Returning a Good Arm
Revisiting Structured Variational Autoencoders
Revisiting the Linear-Programming Framework for Offline RL with General Function Approximation
Revisiting Weighted Aggregation in Federated Learning with Neural Networks
Reward-Mixing MDPs with Few Latent Contexts are Learnable
RGE: A Repulsive Graph Rectification for Node Classification via Influence
Rigid Body Flows for Sampling Molecular Crystal Structures
RLang: A Declarative Language for Describing Partial World Knowledge to Reinforcement Learning Agents
RLEG: Vision-Language Representation Learning with Diffusion-based Embedding Generation
RLSbench: Domain Adaptation Under Relaxed Label Shift
Robust and private stochastic linear bandits

« prev Page 29/38 next »