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
Imitating Latent Policies from Observation
Imitation Learning from Imperfect Demonstration
Imperceptible, Robust, and Targeted Adversarial Examples for Automatic Speech Recognition
Importance Sampling Policy Evaluation with an Estimated Behavior Policy
Improved Convergence for $\ell_1$ and $\ell_∞$ Regression via Iteratively Reweighted Least Squares
Improved Dynamic Graph Learning through Fault-Tolerant Sparsification
Improved Parallel Algorithms for Density-Based Network Clustering
Improved Zeroth-Order Variance Reduced Algorithms and Analysis for Nonconvex Optimization
Improving Adversarial Robustness via Promoting Ensemble Diversity
Improving Model Selection by Employing the Test Data
Improving Neural Language Modeling via Adversarial Training
Improving Neural Network Quantization without Retraining using Outlier Channel Splitting
Imputing Missing Events in Continuous-Time Event Streams
Incorporating Grouping Information into Bayesian Decision Tree Ensembles
Incremental Randomized Sketching for Online Kernel Learning
Inference and Sampling of $K_33$-free Ising Models
Inferring Heterogeneous Causal Effects in Presence of Spatial Confounding
Infinite Mixture Prototypes for Few-shot Learning
InfoGAN-CR and ModelCentrality: Self-supervised Model Training and Selection for Disentangling GANs
Information-Theoretic Considerations in Batch Reinforcement Learning
Insertion Transformer: Flexible Sequence Generation via Insertion Operations
Interpretations are Useful: Penalizing Explanations to Align Neural Networks with Prior Knowledge
Interpreting Adversarially Trained Convolutional Neural Networks
Invariant-Equivariant Representation Learning for Multi-Class Data
Invertible Residual Networks
Iterative Linearized Control: Stable Algorithms and Complexity Guarantees
Ithemal: Accurate, Portable and Fast Basic Block Throughput Estimation using Deep Neural Networks
Jumpout : Improved Dropout for Deep Neural Networks with ReLUs
Katalyst: Boosting Convex Katayusha for Non-Convex Problems with a Large Condition Number
Kernel-Based Reinforcement Learning in Robust Markov Decision Processes
Kernel Mean Matching for Content Addressability of GANs
Kernel Normalized Cut: a Theoretical Revisit
kernelPSI: a Post-Selection Inference Framework for Nonlinear Variable Selection
Ladder Capsule Network
Large-Scale Sparse Kernel Canonical Correlation Analysis
LatentGNN: Learning Efficient Non-local Relations for Visual Recognition
Latent Normalizing Flows for Discrete Sequences
LeanResNet: A Low-cost yet Effective Convolutional Residual Networks
Learning a Compressed Sensing Measurement Matrix via Gradient Unrolling
Learning Action Representations for Reinforcement Learning
Learning and Data Selection in Big Datasets
Learning a Prior over Intent via Meta-Inverse Reinforcement Learning
Learning Classifiers for Target Domain with Limited or No Labels
Learning Context-dependent Label Permutations for Multi-label Classification
Learning deep kernels for exponential family densities
Learning Dependency Structures for Weak Supervision Models
Learning Discrete and Continuous Factors of Data via Alternating Disentanglement
Learning Discrete Structures for Graph Neural Networks
Learning Distance for Sequences by Learning a Ground Metric
Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizations

« prev Page 8/16 next »