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
Learning from a Learner
Learning from Delayed Outcomes via Proxies with Applications to Recommender Systems.
Learning Generative Models across Incomparable Spaces
Learning Hawkes Processes Under Synchronization Noise
Learning interpretable continuous-time models of latent stochastic dynamical systems
Learning Latent Dynamics for Planning from Pixels
Learning Linear-Quadratic Regulators Efficiently with only $\sqrtT$ Regret
Learning Linear-Quadratic Regulators Efficiently with only √T Regret
Learning Models from Data with Measurement Error: Tackling Underreporting
Learning Neurosymbolic Generative Models via Program Synthesis
Learning Novel Policies For Tasks
Learning Optimal Fair Policies
Learning Optimal Linear Regularizers
Learning Structured Decision Problems with Unawareness
Learning to bid in revenue-maximizing auctions
Learning to Clear the Market
Learning to Collaborate in Markov Decision Processes
Learning to Convolve: A Generalized Weight-Tying Approach
Learning to Exploit Long-term Relational Dependencies in Knowledge Graphs
Learning to Generalize from Sparse and Underspecified Rewards
Learning to Groove with Inverse Sequence Transformations
Learning to Infer Program Sketches
Learning-to-Learn Stochastic Gradient Descent with Biased Regularization
Learning to Optimize Multigrid PDE Solvers
Learning to Prove Theorems via Interacting with Proof Assistants
Learning to Route in Similarity Graphs
Learning to select for a predefined ranking
Learning What and Where to Transfer
Learning with Bad Training Data via Iterative Trimmed Loss Minimization
Learn to Grow: A Continual Structure Learning Framework for Overcoming Catastrophic Forgetting
LegoNet: Efficient Convolutional Neural Networks with Lego Filters
Leveraging Low-Rank Relations Between Surrogate Tasks in Structured Prediction
Lexicographic and Depth-Sensitive Margins in Homogeneous and Non-Homogeneous Deep Models
LGM-Net: Learning to Generate Matching Networks for Few-Shot Learning
Linear-Complexity Data-Parallel Earth Mover's Distance Approximations
Lipschitz Generative Adversarial Nets
LIT: Learned Intermediate Representation Training for Model Compression
Locally Private Bayesian Inference for Count Models
Look Ma, No Latent Variables: Accurate Cutset Networks via Compilation
Lorentzian Distance Learning for Hyperbolic Representations
Loss Landscapes of Regularized Linear Autoencoders
Lossless or Quantized Boosting with Integer Arithmetic
Lower Bounds for Smooth Nonconvex Finite-Sum Optimization
Low Latency Privacy Preserving Inference
LR-GLM: High-Dimensional Bayesian Inference Using Low-Rank Data Approximations
Making Convolutional Networks Shift-Invariant Again
Making Decisions that Reduce Discriminatory Impacts
Making Deep Q-learning methods robust to time discretization
Mallows ranking models: maximum likelihood estimate and regeneration
Manifold Mixup: Better Representations by Interpolating Hidden States

« prev Page 9/16 next »