ICML 2019

797 papers

Top Research Directions

Research directions most represented by ICML 2019 papers.

Scaling Gaussian Processes Beyond Cubic Complexity 11
Clean Accuracy Degradation in Machine Learning Defenses 10
Sample Efficient Reinforcement Learning 9
Stationary Point Convergence in Nonconvex Optimization 8
The Pareto Frontier of Algorithmic Accuracy and Fairness 8
The Width Gap Between Deep Learning Theory and Practice 7
Beyond the Deterministic Transition Assumption in Reinforcement Learning 7
Lipschitz Regularization for Stable Neural Networks 7
Multi-Agent Learning Under Bandit Feedback 7
Mitigating Gradient Variance in Policy Optimization 7
Matrix-Free Curvature Estimation for Deep Learning 7
The Non-Linear Function Approximation Gap in Reinforcement Learning 7
The Mechanics of Benign Overfitting in High Dimensions 7
Greedy Maximization for Submodular Subset Selection 6
Stochastic Noise Injection for Escaping Saddle Points 6

Top Authors

AuthorPapers
Michael Jordan7
Sergey Levine6
Volkan Cevher6
Andreas Krause5
Bernhard Schölkopf5
Masashi Sugiyama5
Pieter Abbeel5
Stefano Ermon5
Csaba Szepesvari4
Dhruv Batra4
Emma Brunskill4
James Y. Zou4
Jinwoo Shin4
Jun Zhu4
Lawrence Carin4
Michael A Osborne4
Mingsheng Long4
Peter Bailis4
Peter Bartlett4
Sham M. Kakade4

Impactful Papers

Papers from ICML 2019 that shaped research clusters.

Foundational

Influential

Papers

Title
Noisy Dual Principal Component Pursuit
Non-Asymptotic Analysis of Fractional Langevin Monte Carlo for Non-Convex Optimization
Nonconvex Variance Reduced Optimization with Arbitrary Sampling
Nonlinear Distributional Gradient Temporal-Difference Learning
Nonlinear Stein Variational Gradient Descent for Learning Diversified Mixture Models
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity
Non-Monotonic Sequential Text Generation
Nonparametric Bayesian Deep Networks with Local Competition
Non-Parametric Priors For Generative Adversarial Networks
Obtaining Fairness using Optimal Transport Theory
ODIN: Optimal Discovery of High-value INformation Using Model-based Deep Reinforcement Learning
Off-Policy Deep Reinforcement Learning without Exploration
On Certifying Non-Uniform Bounds against Adversarial Attacks
On Connected Sublevel Sets in Deep Learning
On discriminative learning of prediction uncertainty
On Dropout and Nuclear Norm Regularization
On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms
On Learning Invariant Representations for Domain Adaptation
Online Adaptive Principal Component Analysis and Its extensions
Online Algorithms for Rent-Or-Buy with Expert Advice
Online Control with Adversarial Disturbances
Online Convex Optimization in Adversarial Markov Decision Processes
Online Learning to Rank with Features
Online learning with kernel losses
Online Learning with Sleeping Experts and Feedback Graphs
Online Meta-Learning
Online Variance Reduction with Mixtures
On Medians of (Randomized) Pairwise Means
On Scalable and Efficient Computation of Large Scale Optimal Transport
On Sparse Linear Regression in the Local Differential Privacy Model
On Symmetric Losses for Learning from Corrupted Labels
On the Complexity of Approximating Wasserstein Barycenters
On the Computation and Communication Complexity of Parallel SGD with Dynamic Batch Sizes for Stochastic Non-Convex Optimization
On the Connection Between Adversarial Robustness and Saliency Map Interpretability
On the Convergence and Robustness of Adversarial Training
On the Design of Estimators for Bandit Off-Policy Evaluation.
On the Feasibility of Learning, Rather than Assuming, Human Biases for Reward Inference
On the Generalization Gap in Reparameterizable Reinforcement Learning
On the Impact of the Activation function on Deep Neural Networks Training
On the Limitations of Representing Functions on Sets
On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed Non-Convex Optimization
On the Long-term Impact of Algorithmic Decision Policies: Effort Unfairness and Feature Segregation through Social Learning
On The Power of Curriculum Learning in Training Deep Networks
On the Spectral Bias of Neural Networks
On the statistical rate of nonlinear recovery in generative models with heavy-tailed data
On the Universality of Invariant Networks
On Variational Bounds of Mutual Information
Open-ended learning in symmetric zero-sum games
Open Vocabulary Learning on Source Code with a Graph-Structured Cache
Optimal Algorithms for Lipschitz Bandits with Heavy-tailed Rewards

« prev Page 11/16 next »