ICLR 2020

718 papers

Top Research Directions

Research directions most represented by ICLR 2020 papers.

The Mechanics of Benign Overfitting in High Dimensions 14
Sample Efficient Reinforcement Learning 12
Clean Accuracy Degradation in Machine Learning Defenses 12
Bypassing the Computational Bottleneck of Adversarial Training 11
Optimization and Generalization with Non-Smooth Activations 10
Accelerating Neural Architecture Search Without Full Model Training 10
Mitigating Input Perturbation Sensitivity in Deep Networks 10
The Computational Overhead of Iterative Model Pruning 8
Mitigating Gradient Variance in Policy Optimization 8
Exploration Strategies for Sparse Reward Reinforcement Learning 8
Mitigating Posterior Collapse in Latent Variable Models 7
Harnessing Parameter Redundancy in Deep Neural Networks 7
Why Differentiable Architecture Search Collapses to Skip Connections 6
Learning Minimal Sufficient Representations via Information Bottlenecks 6
Linearizing Deep Learning via the Neural Tangent Kernel 6

Top Authors

AuthorPapers
Sergey Levine13
Jun Zhu7
Cho-Jui Hsieh6
Liwei Wang6
Pushmeet Kohli6
Yoshua Bengio6
Anirudh Goyal5
Chelsea Finn5
Martin Jaggi5
Tom Goldstein5
Abhinav Gupta4
Deva Ramanan4
Eunho Yang4
Frank Hutter4
Graham Neubig4
Jiatao Gu4
Kyunghyun Cho4
Matthew Botvinick4
Max Welling4
Quanquan Gu4

Impactful Papers

Papers from ICLR 2020 that shaped research clusters.

Foundational

Influential

Papers

Title
Image-guided Neural Object Rendering
Imitation Learning via Off-Policy Distribution Matching
IMPACT: Importance Weighted Asynchronous Architectures with Clipped Target Networks
Implementation Matters in Deep RL: A Case Study on PPO and TRPO
Implementing Inductive bias for different navigation tasks through diverse RNN attrractors
Implicit Bias of Gradient Descent based Adversarial Training on Separable Data
Improved memory in recurrent neural networks with sequential non-normal dynamics
Improved Sample Complexities for Deep Neural Networks and Robust Classification via an All-Layer Margin
Improving Adversarial Robustness Requires Revisiting Misclassified Examples
Improving Generalization in Meta Reinforcement Learning using Learned Objectives
Improving Neural Language Generation with Spectrum Control
Incorporating BERT into Neural Machine Translation
Inductive and Unsupervised Representation Learning on Graph Structured Objects
Inductive Matrix Completion Based on Graph Neural Networks
Inductive representation learning on temporal graphs
Infinite-Horizon Differentiable Model Predictive Control
Infinite-horizon Off-Policy Policy Evaluation with Multiple Behavior Policies
Influence-Based Multi-Agent Exploration
InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization
Information Geometry of Orthogonal Initializations and Training
Input Complexity and Out-of-distribution Detection with Likelihood-based Generative Models
In Search for a SAT-friendly Binarized Neural Network Architecture
InstaHide’s Sample Complexity When Mixing Two Private Images
Intensity-Free Learning of Temporal Point Processes
Interpretable Complex-Valued Neural Networks for Privacy Protection
Intriguing Properties of Adversarial Training at Scale
Intrinsically Motivated Discovery of Diverse Patterns in Self-Organizing Systems
Intrinsic Motivation for Encouraging Synergistic Behavior
Is a Good Representation Sufficient for Sample Efficient Reinforcement Learning?
Iterative energy-based projection on a normal data manifold for anomaly localization
Jacobian Adversarially Regularized Networks for Robustness
Jelly Bean World: A Testbed for Never-Ending Learning
Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Maps
Keep Doing What Worked: Behavior Modelling Priors for Offline Reinforcement Learning
Kernelized Wasserstein Natural Gradient
Kernel of CycleGAN as a principal homogeneous space
Knowledge Consistency between Neural Networks and Beyond
Lagrangian Fluid Simulation with Continuous Convolutions
LambdaNet: Probabilistic Type Inference using Graph Neural Networks
LAMOL: LAnguage MOdeling for Lifelong Language Learning
Language GANs Falling Short
Large Batch Optimization for Deep Learning: Training BERT in 76 minutes
Latent Normalizing Flows for Many-to-Many Cross-Domain Mappings
Lazy-CFR: fast and near-optimal regret minimization for extensive games with imperfect information
LEAN: graph-based pruning for convolutional neural networks by extracting longest chains
Learned Step Size quantization
Learning-Augmented Data Stream Algorithms
Learning Compositional Koopman Operators for Model-Based Control
Learning deep graph matching with channel-independent embedding and Hungarian attention
Learning Disentangled Representations for CounterFactual Regression

« prev Page 7/15 next »