ICML 2020

1,099 papers

Top Research Directions

Research directions most represented by ICML 2020 papers.

Bypassing the Computational Bottleneck of Adversarial Training 13
Overcoming the Convexity Constraint in Modern Optimization 12
Mitigating Gradient Variance in Stochastic Optimization 11
Scaling Gaussian Processes Beyond Cubic Complexity 11
Clean Accuracy Degradation in Machine Learning Defenses 11
Mitigating Gradient Variance in Policy Optimization 10
Safe Reinforcement Learning via Constrained Markov Decision Processes 9
The Non-Linear Function Approximation Gap in Reinforcement Learning 9
Scaling Reinforcement Learning to High-Dimensional Visual Observations 8
Accelerating Neural Architecture Search Without Full Model Training 8
Navigating Non-Convex Loss Landscapes in Deep Learning 8
The Function Approximation Gap in Reinforcement Learning Theory 8
Understanding Gradient Masking in Adversarial Defenses 8
Mitigating Input Perturbation Sensitivity in Deep Networks 8
Causal Inference with Unobserved Confounding 8

Top Authors

AuthorPapers
Masashi Sugiyama11
Michael Jordan8
Dale Schuurmans7
Gang Niu7
Michal Valko7
Percy Liang7
Tommi Jaakkola7
Zhaoran Wang7
Mihaela van der Schaar6
Pieter Abbeel6
Stefano Ermon6
Yoshua Bengio6
Zhangyang Wang6
Zhuoran Yang6
Aldo Pacchiano5
Bo Han5
Chi Jin5
Heng Huang5
Jinwoo Shin5
Mehryar Mohri5

Impactful Papers

Papers from ICML 2020 that shaped research clusters.

Foundational

Influential

Papers

Title
Neural Networks are Convex Regularizers: Exact Polynomial-time Convex Optimization Formulations for Two-layer Networks
Neural Topic Modeling with Continual Lifelong Learning
Neuro-Symbolic Visual Reasoning: Disentangling "Visual" from "Reasoning"
New Oracle-Efficient Algorithms for Private Synthetic Data Release
NGBoost: Natural Gradient Boosting for Probabilistic Prediction
Non-autoregressive Machine Translation with Disentangled Context Transformer
Non-Autoregressive Neural Text-to-Speech
Non-convex Learning via Replica Exchange Stochastic Gradient MCMC
Nonparametric Score Estimators
Non-separable Non-stationary random fields
Non-Stationary Delayed Bandits with Intermediate Observations
No-Regret and Incentive-Compatible Online Learning
No-Regret Exploration in Goal-Oriented Reinforcement Learning
Normalized Flat Minima: Exploring Scale Invariant Definition of Flat Minima for Neural Networks Using PAC-Bayesian Analysis
Normalized Loss Functions for Deep Learning with Noisy Labels
Normalizing Flows on Tori and Spheres
Obtaining Adjustable Regularization for Free via Iterate Averaging
Off-Policy Actor-Critic with Shared Experience Replay
On Approximate Thompson Sampling with Langevin Algorithms
On a projective ensemble approach to two sample test for equality of distributions
On Breaking Deep Generative Model-based Defenses and Beyond
On Conditional Versus Marginal Bias in Multi-Armed Bandits
On Contrastive Learning for Likelihood-free Inference
On Convergence-Diagnostic based Step Sizes for Stochastic Gradient Descent
On Coresets for Regularized Regression
On Differentially Private Stochastic Convex Optimization with Heavy-tailed Data
On Efficient Constructions of Checkpoints
On Efficient Low Distortion Ultrametric Embedding
One Policy to Control Them All: Shared Modular Policies for Agent-Agnostic Control
One-shot Distributed Ridge Regression in High Dimensions
One Size Fits All: Can We Train One Denoiser for All Noise Levels?
On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
On hyperparameter tuning in general clustering problemsm
On Layer Normalization in the Transformer Architecture
On Learning Language-Invariant Representations for Universal Machine Translation
On Learning Sets of Symmetric Elements
On Leveraging Pretrained GANs for Generation with Limited Data
Online Bayesian Moment Matching based SAT Solver Heuristics
Online Continual Learning from Imbalanced Data
Online Control of the False Coverage Rate and False Sign Rate
Online Convex Optimization in the Random Order Model
Online Dense Subgraph Discovery via Blurred-Graph Feedback
Online Learned Continual Compression with Adaptive Quantization Modules
Online Learning for Active Cache Synchronization
Online Learning with Dependent Stochastic Feedback Graphs
Online Learning with Imperfect Hints
Online metric algorithms with untrusted predictions
Online mirror descent and dual averaging: keeping pace in the dynamic case
Online Multi-Kernel Learning with Graph-Structured Feedback
Online Pricing with Offline Data: Phase Transition and Inverse Square Law

« prev Page 14/22 next »