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
Structured agents for physical construction
Sublinear quantum algorithms for training linear and kernel-based classifiers
Sublinear Space Private Algorithms Under the Sliding Window Model
Sublinear Time Nearest Neighbor Search over Generalized Weighted Space
Submodular Cost Submodular Cover with an Approximate Oracle
Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications
Submodular Observation Selection and Information Gathering for Quadratic Models
Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity
Subspace Robust Wasserstein Distances
Sum-of-Squares Polynomial Flow
Supervised Hierarchical Clustering with Exponential Linkage
Surrogate Losses for Online Learning of Stepsizes in Stochastic Non-Convex Optimization
Switching Linear Dynamics for Variational Bayes Filtering
Taming MAML: Efficient unbiased meta-reinforcement learning
TapNet: Neural Network Augmented with Task-Adaptive Projection for Few-Shot Learning
Target-Based Temporal-Difference Learning
Target Tracking for Contextual Bandits: Application to Demand Side Management
TarMAC: Targeted Multi-Agent Communication
Task-Agnostic Dynamics Priors for Deep Reinforcement Learning
Teaching a black-box learner
Temporal Gaussian Mixture Layer for Videos
TensorFuzz: Debugging Neural Networks with Coverage-Guided Fuzzing
Tensor Variable Elimination for Plated Factor Graphs
The advantages of multiple classes for reducing overfitting from test set reuse
The Anisotropic Noise in Stochastic Gradient Descent: Its Behavior of Escaping from Sharp Minima and Regularization Effects
The Effect of Network Width on Stochastic Gradient Descent and Generalization: an Empirical Study
The Evolved Transformer
The Implicit Fairness Criterion of Unconstrained Learning
The information-theoretic value of unlabeled data in semi-supervised learning
The Kernel Interaction Trick: Fast Bayesian Discovery of Pairwise Interactions in High Dimensions
The Natural Language of Actions
The Odds are Odd: A Statistical Test for Detecting Adversarial Examples
Theoretically Principled Trade-off between Robustness and Accuracy
The Value Function Polytope in Reinforcement Learning
The Variational Predictive Natural Gradient
The Wasserstein Transform
TibGM: A Transferable and Information-Based Graphical Model Approach for Reinforcement Learning
Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds
Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel $k$-means Clustering
Topological Data Analysis of Decision Boundaries with Application to Model Selection
Toward Controlling Discrimination in Online Ad Auctions
Towards Accurate Model Selection in Deep Unsupervised Domain Adaptation
Towards a Deep and Unified Understanding of Deep Neural Models in NLP
Towards a Unified Analysis of Random Fourier Features
Towards Understanding Knowledge Distillation
Toward Understanding the Importance of Noise in Training Neural Networks
Tractable n-Metrics for Multiple Graphs
Trading Redundancy for Communication: Speeding up Distributed SGD for Non-convex Optimization
Traditional and Heavy Tailed Self Regularization in Neural Network Models
Trainable Decoding of Sets of Sequences for Neural Sequence Models

« prev Page 15/16 next »