ICML 2020

1,099 papers

Top Research Directions

Research directions most represented by ICML 2020 papers.

Bypassing the Computational Bottleneck of Adversarial Training 13
Overcoming the Convexity Constraint in Modern Optimization 12
Mitigating Gradient Variance in Stochastic Optimization 11
Scaling Gaussian Processes Beyond Cubic Complexity 11
Clean Accuracy Degradation in Machine Learning Defenses 11
Mitigating Gradient Variance in Policy Optimization 10
Safe Reinforcement Learning via Constrained Markov Decision Processes 9
The Non-Linear Function Approximation Gap in Reinforcement Learning 9
Scaling Reinforcement Learning to High-Dimensional Visual Observations 8
Accelerating Neural Architecture Search Without Full Model Training 8
Navigating Non-Convex Loss Landscapes in Deep Learning 8
The Function Approximation Gap in Reinforcement Learning Theory 8
Understanding Gradient Masking in Adversarial Defenses 8
Mitigating Input Perturbation Sensitivity in Deep Networks 8
Causal Inference with Unobserved Confounding 8

Top Authors

AuthorPapers
Masashi Sugiyama11
Michael Jordan8
Dale Schuurmans7
Gang Niu7
Michal Valko7
Percy Liang7
Tommi Jaakkola7
Zhaoran Wang7
Mihaela van der Schaar6
Pieter Abbeel6
Stefano Ermon6
Yoshua Bengio6
Zhangyang Wang6
Zhuoran Yang6
Aldo Pacchiano5
Bo Han5
Chi Jin5
Heng Huang5
Jinwoo Shin5
Mehryar Mohri5

Impactful Papers

Papers from ICML 2020 that shaped research clusters.

Foundational

Influential

Papers

Title
Minimax-Optimal Off-Policy Evaluation with Linear Function Approximation
Minimax Pareto Fairness: A Multi Objective Perspective
Minimax Rate for Learning From Pairwise Comparisons in the BTL Model
Minimax Weight and Q-Function Learning for Off-Policy Evaluation
Min-Max Optimization without Gradients: Convergence and Applications to Black-Box Evasion and Poisoning Attacks
Missing Data Imputation using Optimal Transport
Mix-n-Match : Ensemble and Compositional Methods for Uncertainty Calibration in Deep Learning
Model-Based Reinforcement Learning with Value-Targeted Regression
Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processes
Model Fusion with Kullback-Leibler Divergence
Modulating Surrogates for Bayesian Optimization
Momentum-Based Policy Gradient Methods
MoNet3D: Towards Accurate Monocular 3D Object Localization in Real Time
Moniqua: Modulo Quantized Communication in Decentralized SGD
Monte-Carlo Tree Search as Regularized Policy Optimization
More Information Supervised Probabilistic Deep Face Embedding Learning
Multi-Agent Determinantal Q-Learning
Multi-Agent Routing Value Iteration Network
Multiclass Neural Network Minimization via Tropical Newton Polytope Approximation
Multidimensional Shape Constraints
Multi-fidelity Bayesian Optimization with Max-value Entropy Search and its Parallelization
Multigrid Neural Memory
Multilinear Latent Conditioning for Generating Unseen Attribute Combinations
Multinomial Logit Bandit with Low Switching Cost
Multi-objective Bayesian Optimization using Pareto-frontier Entropy
Multi-Objective Molecule Generation using Interpretable Substructures
Multi-Precision Policy Enforced Training (MuPPET) : A Precision-Switching Strategy for Quantised Fixed-Point Training of CNNs
Multiresolution Tensor Learning for Efficient and Interpretable Spatial Analysis
Multi-step Greedy Reinforcement Learning Algorithms
Multi-Task Learning with User Preferences: Gradient Descent with Controlled Ascent in Pareto Optimization
Musical Word Embedding: Bridging the Gap between Listening Contexts and Music
Mutual Transfer Learning for Massive Data
My Fair Bandit: Distributed Learning of Max-Min Fairness with Multi-player Bandits
NADS: Neural Architecture Distribution Search for Uncertainty Awareness
Naive Exploration is Optimal for Online LQR
Near Input Sparsity Time Kernel Embeddings via Adaptive Sampling
Nearly Linear Row Sampling Algorithm for Quantile Regression
Near-optimal Regret Bounds for Stochastic Shortest Path
Near-optimal sample complexity bounds for learning Latent k-polytopes and applications to Ad-Mixtures
Near-Tight Margin-Based Generalization Bounds for Support Vector Machines
Negative Sampling in Semi-Supervised learning
Nested Subspace Arrangement for Representation of Relational Data
NetGAN without GAN: From Random Walks to Low-Rank Approximations
Network Pruning by Greedy Subnetwork Selection
Neural Architecture Search in A Proxy Validation Loss Landscape
Neural Clustering Processes
Neural Contextual Bandits with UCB-based Exploration
Neural Datalog Through Time: Informed Temporal Modeling via Logical Specification
Neural Kernels Without Tangents
Neural Network Control Policy Verification With Persistent Adversarial Perturbation

« prev Page 13/22 next »