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
Benefits and Pitfalls of the Exponential Mechanism with Applications to Hilbert Spaces and Functional PCA
BERT and PALs: Projected Attention Layers for Efficient Adaptation in Multi-Task Learning
Better generalization with less data using robust gradient descent
Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio
Beyond Backprop: Online Alternating Minimization with Auxiliary Variables
Beyond the Chinese Restaurant and Pitman-Yor processes: Statistical Models with double power-law behavior.
Bias Also Matters: Bias Attribution for Deep Neural Network Explanation
Bilinear Bandits with Low-rank Structure
Bit-Swap: Recursive Bits-Back Coding for Lossless Compression with Hierarchical Latent Variables
Blended Conditonal Gradients
Boosted Density Estimation Remastered
Bounding User Contributions: A Bias-Variance Trade-off in Differential Privacy
Breaking Inter-Layer Co-Adaptation by Classifier Anonymization
Breaking the gridlock in Mixture-of-Experts: Consistent and Efficient Algorithms
Breaking the Softmax Bottleneck via Learnable Monotonic Pointwise Non-linearities
Bridging Theory and Algorithm for Domain Adaptation
CAB: Continuous Adaptive Blending for Policy Evaluation and Learning
Calibrated Approximate Bayesian Inference
Calibrated Model-Based Deep Reinforcement Learning
CapsAndRuns: An Improved Method for Approximately Optimal Algorithm Configuration.
Categorical Feature Compression via Submodular Optimization
Causal Discovery and Forecasting in Nonstationary Environments with State-Space Models
Causal Identification under Markov Equivalence: Completeness Results
Cautious Regret Minimization: Online Optimization with Long-Term Budget Constraints
Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representations
Characterization of Convex Objective Functions and Optimal Expected Convergence Rates for SGD
Characterizing Well-Behaved vs. Pathological Deep Neural Networks
Cheap Orthogonal Constraints in Neural Networks: A Simple Parametrization of the Orthogonal and Unitary Group
CHiVE: Varying Prosody in Speech Synthesis with a Linguistically Driven Dynamic Hierarchical Conditional Variational Network
Circuit-GNN: Graph Neural Networks for Distributed Circuit Design
Classification from Positive, Unlabeled and Biased Negative Data
Classifying Treatment Responders Under Causal Effect Monotonicity
Cognitive model priors for predicting human decisions
Collaborative Channel Pruning for Deep Networks
Collaborative Evolutionary Reinforcement Learning
Collective Model Fusion for Multiple Black-Box Experts
Co-manifold learning with missing data
Combating Label Noise in Deep Learning using Abstention
Combining parametric and nonparametric models for off-policy evaluation
COMIC: Multi-view Clustering Without Parameter Selection
Communication Complexity in Locally Private Distribution Estimation and Heavy Hitters
Communication-Constrained Inference and the Role of Shared Randomness
Competing Against Nash Equilibria in Adversarially Changing Zero-Sum Games
CompILE: Compositional Imitation Learning and Execution
Complementary-Label Learning for Arbitrary Losses and Models
Complexity of Linear Regions in Deep Networks
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm
Composing Entropic Policies using Divergence Correction
Composing Value Functions in Reinforcement Learning
Compositional Fairness Constraints for Graph Embeddings

« prev Page 3/16 next »