ICML 2022

1,154 papers

Top Research Directions

Research directions most represented by ICML 2022 papers.

The Non-Linear Function Approximation Gap in Reinforcement Learning 23
Clean Accuracy Degradation in Machine Learning Defenses 22
Scaling Gaussian Processes Beyond Cubic Complexity 17
Provably Efficient Reinforcement Learning with Linear MDPs 15
The Function Approximation Gap in Reinforcement Learning Theory 15
Bypassing the Computational Bottleneck of Adversarial Training 14
Loss Landscape Flatness and the Generalization Gap 13
Mitigating Gradient Variance in Policy Optimization 13
Distribution Shift in Offline Reinforcement Learning 12
Scaling Bandit Learning to Large Action Spaces 10
Multi-Agent Learning Under Bandit Feedback 10
Horizon Free Bounds in Reinforcement Learning 10
Periodic Synchronization for Communication Efficient Distributed Learning 10
Optimistic Exploration for Efficient Reinforcement Learning 10
Matrix-Free Curvature Estimation for Deep Learning 10

Top Authors

AuthorPapers
Zhangyang Wang9
Zhaoran Wang9
Zhuoran Yang9
Bo Li7
Jun Zhu7
Shandian Zhe7
Tianbao Yang7
Bernhard Schölkopf6
Bo Han6
Manzil Zaheer6
Mihaela van der Schaar6
Nhat Ho6
Pranjal Awasthi6
Sergey Levine6
Tianlong Chen6
Yang Liu6
Andreas Krause5
David Woodruff5
Michael W. Mahoney5
Peter Richtárik5

Impactful Papers

Papers from ICML 2022 that shaped research clusters.

Foundational

Influential

Papers

Title
Reverse Engineering the Neural Tangent Kernel
Revisiting Consistency Regularization for Deep Partial Label Learning
Revisiting Contrastive Learning through the Lens of Neighborhood Component Analysis: an Integrated Framework
Revisiting End-to-End Speech-to-Text Translation From Scratch
Revisiting Label Smoothing and Knowledge Distillation Compatibility: What was Missing?
Revisiting Online Submodular Minimization: Gap-Dependent Regret Bounds, Best of Both Worlds and Adversarial Robustness
Revisiting Some Common Practices in Cooperative Multi-Agent Reinforcement Learning
Revisiting the Effects of Stochasticity for Hamiltonian Samplers
REvolveR: Continuous Evolutionary Models for Robot-to-robot Policy Transfer
Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes
Rich Feature Construction for the Optimization-Generalization Dilemma
Ripple Attention for Visual Perception with Sub-quadratic Complexity
Risk-Averse No-Regret Learning in Online Convex Games
Robin Hood and Matthew Effects: Differential Privacy Has Disparate Impact on Synthetic Data
Robust alignment of cross-session recordings of neural population activity by behaviour via unsupervised domain adaptation
Robust Counterfactual Explanations for Tree-Based Ensembles
Robust Deep Reinforcement Learning through Bootstrapped Opportunistic Curriculum
Robust Fine-Tuning of Deep Neural Networks with Hessian-based Generalization Guarantees
Robust Group Synchronization via Quadratic Programming
Robust Imitation Learning against Variations in Environment Dynamics
Robust Kernel Density Estimation with Median-of-Means principle
Robust Meta-learning with Sampling Noise and Label Noise via Eigen-Reptile
Robust Multi-Objective Bayesian Optimization Under Input Noise
Robustness and Accuracy Could Be Reconcilable by (Proper) Definition
Robustness Implies Generalization via Data-Dependent Generalization Bounds
Robustness in Multi-Objective Submodular Optimization: a Quantile Approach
Robustness Verification for Contrastive Learning
Robust Policy Learning over Multiple Uncertainty Sets
Robust SDE-Based Variational Formulations for Solving Linear PDEs via Deep Learning
Robust Task Representations for Offline Meta-Reinforcement Learning via Contrastive Learning
Robust Training of Neural Networks Using Scale Invariant Architectures
Robust Training under Label Noise by Over-parameterization
ROCK: Causal Inference Principles for Reasoning about Commonsense Causality
Role-based Multiplex Network Embedding
Rotting Infinitely Many-Armed Bandits
RUMs from Head-to-Head Contests
Safe Exploration for Efficient Policy Evaluation and Comparison
Safe Learning in Tree-Form Sequential Decision Making: Handling Hard and Soft Constraints
Sample Efficient Learning of Predictors that Complement Humans
Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost
Sanity Simulations for Saliency Methods
Scalable Computation of Causal Bounds
Scalable Deep Gaussian Markov Random Fields for General Graphs
Scalable Deep Reinforcement Learning Algorithms for Mean Field Games
Scalable First-Order Bayesian Optimization via Structured Automatic Differentiation
Scalable MCMC Sampling for Nonsymmetric Determinantal Point Processes
Scalable Spike-and-Slab
Scaling Gaussian Process Optimization by Evaluating a Few Unique Candidates Multiple Times
Scaling Out-of-Distribution Detection for Real-World Settings
Scaling Structured Inference with Randomization

« prev Page 19/24 next »