ICML 2021

1,200 papers

Top Research Directions

Research directions most represented by ICML 2021 papers.

The Non-Linear Function Approximation Gap in Reinforcement Learning 26
Scaling Reinforcement Learning to High-Dimensional Visual Observations 19
Scaling Gaussian Processes Beyond Cubic Complexity 17
Clean Accuracy Degradation in Machine Learning Defenses 16
Bypassing the Computational Bottleneck of Adversarial Training 16
The Function Approximation Gap in Reinforcement Learning Theory 14
Exploration Strategies for Sparse Reward Reinforcement Learning 14
Horizon Free Bounds in Reinforcement Learning 13
Learning with Instance Dependent Label Noise 11
Variance Adaptive Confidence Bounds 11
Optimistic Exploration for Efficient Reinforcement Learning 11
Optimization and Generalization with Non-Smooth Activations 11
Accelerating Neural Architecture Search Without Full Model Training 11
Linearizing Deep Learning via the Neural Tangent Kernel 10
The Computational Overhead of Iterative Model Pruning 10

Top Authors

AuthorPapers
Masashi Sugiyama14
Sergey Levine12
Gang Niu11
Zhaoran Wang11
Zhuoran Yang11
Quanquan Gu8
Andreas Krause7
Bo Han7
Chelsea Finn7
Percy Liang7
Bernhard Schölkopf6
Csaba Szepesvari6
David Woodruff6
Michal Valko6
Pieter Abbeel6
Tongliang Liu6
Alex Dimakis5
Andrew Gordon Wilson5
Bo Li5
Gal Chechik5

Impactful Papers

Papers from ICML 2021 that shaped research clusters.

Foundational

Influential

Papers

Title
Multi-Receiver Online Bayesian Persuasion
Multiscale Invertible Generative Networks for High-Dimensional Bayesian Inference
Multi-scale selection pyramid networks for small-sample target detection algorithms
Multi-Task Reinforcement Learning with Context-based Representations
MURAL: Meta-Learning Uncertainty-Aware Rewards for Outcome-Driven Reinforcement Learning
Narrow Margins: Classification, Margins and Fat Tails
Navigation Turing Test (NTT): Learning to Evaluate Human-Like Navigation
Near-Optimal Algorithms for Explainable k-Medians and k-Means
Near-Optimal Confidence Sequences for Bounded Random Variables
Near-Optimal Entrywise Anomaly Detection for Low-Rank Matrices with Sub-Exponential Noise
Near-Optimal Linear Regression under Distribution Shift
Near-Optimal Model-Free Reinforcement Learning in Non-Stationary Episodic MDPs
Near-Optimal Representation Learning for Linear Bandits and Linear RL
Near Optimal Reward-Free Reinforcement Learning
Necessary and sufficient conditions for causal feature selection in time series with latent common causes
Neighborhood Contrastive Learning Applied to Online Patient Monitoring
NeRF-VAE: A Geometry Aware 3D Scene Generative Model
Network Inference and Influence Maximization from Samples
Neural Architecture Search without Training
Neural Feature Matching in Implicit 3D Representations
Neural Pharmacodynamic State Space Modeling
Neural-Pull: Learning Signed Distance Function from Point clouds by Learning to Pull Space onto Surface
Neural Rough Differential Equations for Long Time Series
Neural SDEs as Infinite-Dimensional GANs
Neural Symbolic Regression that scales
Neural Tangent Generalization Attacks
Neural Transformation Learning for Deep Anomaly Detection Beyond Images
Neuro-algorithmic Policies Enable Fast Combinatorial Generalization
Newton Method over Networks is Fast up to the Statistical Precision
Noise and Fluctuation of Finite Learning Rate Stochastic Gradient Descent
Non-Autoregressive Electron Redistribution Modeling for Reaction Prediction
Nondeterminism and Instability in Neural Network Optimization
Non-Exponentially Weighted Aggregation: Regret Bounds for Unbounded Loss Functions
Nonmyopic Multifidelity Acitve Search
Non-Negative Bregman Divergence Minimization for Deep Direct Density Ratio Estimation
Nonparametric Decomposition of Sparse Tensors
Nonparametric Hamiltonian Monte Carlo
No-regret Algorithms for Capturing Events in Poisson Point Processes
Not All Memories are Created Equal: Learning to Forget by Expiring
Objective Bound Conditional Gaussian Process for Bayesian Optimization
Object Segmentation Without Labels with Large-Scale Generative Models
Oblivious Sketching-based Central Path Method for Linear Programming
Oblivious Sketching for Logistic Regression
Off-Belief Learning
Offline Contextual Bandits with Overparameterized Models
Offline Meta-Reinforcement Learning with Advantage Weighting
Offline Reinforcement Learning with Fisher Divergence Critic Regularization
Offline Reinforcement Learning with Pseudometric Learning
Off-Policy Confidence Sequences
Of Moments and Matching: A Game-Theoretic Framework for Closing the Imitation Gap

« prev Page 15/24 next »