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
Do Machine Learning Models Learn Statistical Rules Inferred from Data?
Domain Adaptation for Time Series Under Feature and Label Shifts
DoMo-AC: Doubly Multi-step Off-policy Actor-Critic Algorithm
Do Not Train It: A Linear Neural Architecture Search of Graph Neural Networks
Do Perceptually Aligned Gradients Imply Robustness?
Do the Rewards Justify the Means? Measuring Trade-Offs Between Rewards and Ethical Behavior in the Machiavelli Benchmark
Double-Weighting for Covariate Shift Adaptation
Doubly Adversarial Federated Bandits
Doubly Optimal No-Regret Learning in Monotone Games
Do You Remember? Overcoming Catastrophic Forgetting for Fake Audio Detection
DP-Fast MH: Private, Fast, and Accurate Metropolis-Hastings for Large-Scale Bayesian Inference
DRCFS: Doubly Robust Causal Feature Selection
DRew: Dynamically Rewired Message Passing with Delay
Dropout Reduces Underfitting
Drug Discovery under Covariate Shift with Domain-Informed Prior Distributions over Functions
DS-1000: A Natural and Reliable Benchmark for Data Science Code Generation
DSGD-CECA: Decentralized SGD with Communication-Optimal Exact Consensus Algorithm
Dual Focal Loss for Calibration
DualHSIC: HSIC-Bottleneck and Alignment for Continual Learning
Dual Propagation: Accelerating Contrastive Hebbian Learning with Dyadic Neurons
DUET: 2D Structured and Approximately Equivariant Representations
dugMatting: Decomposed-Uncertainty-Guided Matting
Dynamical Linear Bandits
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time
Dynamic Regularized Sharpness Aware Minimization in Federated Learning: Approaching Global Consistency and Smooth Landscape
Dynamics-inspired Neuromorphic Visual Representation Learning
E$(n)$ Equivariant Message Passing Simplicial Networks
ED-Batch: Efficient Automatic Batching of Dynamic Neural Networks via Learned Finite State Machines
EF21-P and Friends: Improved Theoretical Communication Complexity for Distributed Optimization with Bidirectional Compression
Effective and Efficient Structural Inference with Reservoir Computing
Effectively Using Public Data in Privacy Preserving Machine Learning
Effective Minkowski Dimension of Deep Nonparametric Regression: Function Approximation and Statistical Theories
Effective Neural Topic Modeling with Embedding Clustering Regularization
Effective Structured Prompting by Meta-Learning and Representative Verbalizer
Efficient Algorithms for Exact Graph Matching on Correlated Stochastic Block Models with Constant Correlation
Efficient and Degree-Guided Graph Generation via Discrete Diffusion Modeling
Efficient and Equivariant Graph Networks for Predicting Quantum Hamiltonian
Efficient Approximations of Complete Interatomic Potentials for Crystal Property Prediction
Efficient Bound of Lipschitz Constant for Convolutional Layers by Gram Iteration
Efficient displacement convex optimization with particle gradient descent
Efficient Exploration via Epistemic-Risk-Seeking Policy Optimization
Efficient Graph Field Integrators Meet Point Clouds
Efficient Latency-Aware CNN Depth Compression via Two-Stage Dynamic Programming
Efficient Learning of Mesh-Based Physical Simulation with Bi-Stride Multi-Scale Graph Neural Network
Efficient List-Decodable Regression using Batches
Efficiently predicting high resolution mass spectra with graph neural networks
Efficient Online Reinforcement Learning with Offline Data
Efficient Parametric Approximations of Neural Network Function Space Distance
Efficient Personalized Federated Learning via Sparse Model-Adaptation
Efficient preconditioned stochastic gradient descent for estimation in latent variable models

« prev Page 10/38 next »