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
Optimal Auctions through Deep Learning
Optimal Continuous DR-Submodular Maximization and Applications to Provable Mean Field Inference
Optimal Differential Privacy Composition for Exponential Mechanisms and the Cost of Adaptivity
Optimality Implies Kernel Sum Classifiers are Statistically Efficient
Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning
Optimal Mini-Batch and Step Sizes for SAGA
Optimal Minimal Margin Maximization with Boosting
Optimal Transport for structured data with application on graphs
Optimistic Policy Optimization via Multiple Importance Sampling
Optimizer Benchmarking Needs to Account for Hyperparameter Tuning
Orthogonal Random Forest for Causal Inference
Overcoming Mean-Field Approximations in Recurrent Gaussian Process Models
Overcoming Multi-model Forgetting
Overparameterized Nonlinear Learning: Gradient Descent Takes the Shortest Path?
PAC Identification of Many Good Arms in Stochastic Multi-Armed Bandits
PAC Learnability of Node Functions in Networked Dynamical Systems
PA-GD: On the Convergence of Perturbed Alternating Gradient Descent to Second-Order Stationary Points for Structured Nonconvex Optimization
Parameter efficient training of deep convolutional neural networks by dynamic sparse reparameterization
Parameter-Efficient Transfer Learning for NLP
Pareto Optimal Streaming Unsupervised Classification
Parsimonious Black-Box Adversarial Attacks via Efficient Combinatorial Optimization
Partially Exchangeable Networks and Architectures for Learning Summary Statistics in Approximate Bayesian Computation
Partially Linear Additive Gaussian Graphical Models
Particle Flow Bayes' Rule
Passed & Spurious: Descent Algorithms and Local Minima in Spiked Matrix-Tensor Models
Per-Decision Option Discounting
Phaseless PCA: Low-Rank Matrix Recovery from Column-wise Phaseless Measurements
Phase transition in PCA with missing data: Reduced signal-to-noise ratio, not sample size!
Plug-and-Play Methods Provably Converge with Properly Trained Denoisers
Poission Subsampled Rényi Differential Privacy
Policy Certificates: Towards Accountable Reinforcement Learning
Policy Consolidation for Continual Reinforcement Learning
POLITEX: Regret Bounds for Policy Iteration using Expert Prediction
POPQORN: Quantifying Robustness of Recurrent Neural Networks
Population Based Augmentation: Efficient Learning of Augmentation Policy Schedules
Position-aware Graph Neural Networks
Power k-Means Clustering
Predicate Exchange: Inference with Declarative Knowledge
Predictive Multiplicity in Classification
Predictor-Corrector Policy Optimization
Probabilistic Neural Symbolic Models for Interpretable Visual Question Answering
Probability Functional Descent: A Unifying Perspective on GANs, Variational Inference, and Reinforcement Learning
Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA
Processing Megapixel Images with Deep Attention-Sampling Models
Projection onto Minkowski Sums with Application to Constrained Learning
Projections for Approximate Policy Iteration Algorithms
Proportionally Fair Clustering
Provable Guarantees for Gradient-Based Meta-Learning
Provably Efficient Exploration in Policy Optimization
Provably Efficient Imitation Learning from Observation Alone

« prev Page 12/16 next »