ICML 2024

2,660 papers

Top Research Directions

Research directions most represented by ICML 2024 papers.

Overcoming the Iterative Inference Latency of Diffusion Models 24
Safe Reinforcement Learning via Constrained Markov Decision Processes 21
The Non-Linear Function Approximation Gap in Reinforcement Learning 21
Sample Efficient Reinforcement Learning 21
Clean Accuracy Degradation in Machine Learning Defenses 21
Overcoming the Homophily Assumption in Graph Neural Networks 18
The Mechanics of Backdoor Attacks in Neural Networks 17
The Weisfeiler Lehman Expressivity Bottleneck 16
The Function Approximation Gap in Reinforcement Learning Theory 16
Mitigating Gradient Variance in Policy Optimization 14
Matrix-Free Curvature Estimation for Deep Learning 14
Optimization and Generalization with Non-Smooth Activations 14
Accelerating Sparse Neural Networks on Dense Hardware 14
Scaling Gaussian Processes Beyond Cubic Complexity 14
Bypassing the Computational Bottleneck of Adversarial Training 14

Top Authors

AuthorPapers
Bo Li12
James Y. Zou12
Jianye HAO12
Pin-Yu Chen11
Tongliang Liu11
James Zou10
Junchi Yan10
Sergey Levine10
Stan Z. Li10
Volkan Cevher10
Zhangyang Wang10
Dacheng Tao9
Furong Huang9
Rongrong Ji9
Taiji Suzuki9
Andrew Gordon Wilson8
Bo Han8
David Woodruff8
Dawn Song8
De-Chuan Zhan8

Impactful Papers

Papers from ICML 2024 that shaped research clusters.

Foundational

Influential

Papers

Title
BiSHop: Bi-Directional Cellular Learning for Tabular Data with Generalized Sparse Modern Hopfield Model
Bivariate Causal Discovery using Bayesian Model Selection
Black-box density function estimation using recursive partitioning
Block Acceleration Without Momentum: On Optimal Stepsizes of Block Gradient Descent for Least-Squares
BLO-SAM: Bi-level Optimization Based Finetuning of the Segment Anything Model for Overfitting-Preventing Semantic Segmentation
Boosting Offline Optimizers with Surrogate Sensitivity
Boosting Reinforcement Learning with Strongly Delayed Feedback Through Auxiliary Short Delays
Bootstrap AutoEncoders With Contrastive Paradigm for Self-supervised Gaze Estimation
Bootstrapping Fisher Market Equilibrium and First-Price Pacing Equilibrium
Borda Regret Minimization for Generalized Linear Dueling Bandits
BOtied: Multi-objective Bayesian optimization with tied multivariate ranks
Bottleneck-Minimal Indexing for Generative Document Retrieval
Boundary Exploration for Bayesian Optimization With Unknown Physical Constraints
Bounded and Uniform Energy-based Out-of-distribution Detection for Graphs
Bounding the Excess Risk for Linear Models Trained on Marginal-Preserving, Differentially-Private, Synthetic Data
Box Facets and Cut Facets of Lifted Multicut Polytopes
Boximator: Generating Rich and Controllable Motions for Video Synthesis
BRAIn: Bayesian Reward-conditioned Amortized Inference for natural language generation from feedback
Breadth-First Exploration on Adaptive Grid for Reinforcement Learning
Breaking the Barrier: Enhanced Utility and Robustness in Smoothed DRL Agents
Breaking through the learning plateaus of in-context learning in Transformer
Break the Sequential Dependency of LLM Inference Using Lookahead Decoding
Bridging Data Gaps in Diffusion Models with Adversarial Noise-Based Transfer Learning
Bridging discrete and continuous state spaces: Exploring the Ehrenfest process in time-continuous diffusion models
Bridging Environments and Language with Rendering Functions and Vision-Language Models
Bridging Mini-Batch and Asymptotic Analysis in Contrastive Learning: From InfoNCE to Kernel-Based Losses
Bridging Model Heterogeneity in Federated Learning via Uncertainty-based Asymmetrical Reciprocity Learning
Bringing Motion Taxonomies to Continuous Domains via GPLVM on Hyperbolic manifolds
Bring Your Own (Non-Robust) Algorithm to Solve Robust MDPs by Estimating The Worst Kernel
Building Socially-Equitable Public Models
BWS: Best Window Selection Based on Sample Scores for Data Pruning across Broad Ranges
ByMI: Byzantine Machine Identification with False Discovery Rate Control
By Tying Embeddings You Are Assuming the Distributional Hypothesis
Byzantine Resilient and Fast Federated Few-Shot Learning
Byzantine-Robust Federated Learning: Impact of Client Subsampling and Local Updates
Caduceus: Bi-Directional Equivariant Long-Range DNA Sequence Modeling
Calibration Bottleneck: Over-compressed Representations are Less Calibratable
CaM: Cache Merging for Memory-efficient LLMs Inference
Can a Few Decide for Many? The Metric Distortion of Sortition
Can AI Assistants Know What They Don't Know?
Candidate Pseudolabel Learning: Enhancing Vision-Language Models by Prompt Tuning with Unlabeled Data
Can Gaussian Sketching Converge Faster on a Preconditioned Landscape?
Can Implicit Bias Imply Adversarial Robustness?
Can Looped Transformers Learn to Implement Multi-step Gradient Descent for In-context Learning?
Can Machines Learn the True Probabilities?
Can Mamba Learn How To Learn? A Comparative Study on In-Context Learning Tasks
Can We Remove the Square-Root in Adaptive Gradient Methods? A Second-Order Perspective
CaPS: Collaborative and Private Synthetic Data Generation from Distributed Sources
CarbonNovo: Joint Design of Protein Structure and Sequence Using a Unified Energy-based Model
Careful with that Scalpel: Improving Gradient Surgery with an EMA

« prev Page 7/54 next »