NeurIPS 2017

718 papers

Top Research Directions

Research directions most represented by NeurIPS 2017 papers.

Scaling Gaussian Processes Beyond Cubic Complexity 12
Mitigating Mode Collapse and Instability in Generative Training 8
Parameter Agnostic Optimization for Unknown Problem Constants 7
The Pareto Frontier of Algorithmic Accuracy and Fairness 7
Kernel Hyperparameter Sensitivity in Distributional Metrics 7
Overcoming the Cubic Complexity of Kernel Methods 7
Enforcing Bidirectional Consistency in Latent Spaces 6
Multi-Agent Learning Under Bandit Feedback 6
Mitigating Posterior Collapse in Latent Variable Models 6
Overcoming the Convexity Constraint in Modern Optimization 6
Basins of Attraction in Nonconvex Optimization 6
Mitigating the Curse of Dimensionality in Density Estimation 6
The Expressivity Bottleneck of Invertible Neural Networks 5
Non-linear Modeling of Neural Population Dynamics 5
Beyond the Linear Assumption in Reward Modeling 5

Top Authors

AuthorPapers
Lawrence Carin9
Alex Schwing6
Andreas Krause5
Le Song5
Michael Jordan5
Nicolas Heess5
Pieter Abbeel5
Razvan Pascanu5
Aarti Singh4
Andrew Gordon Wilson4
Barnabas Poczos4
Chunyuan Li4
David Blei4
David Silver4
David Woodruff4
Jiajun Wu4
Jiashi Feng4
Joshua B. Tenenbaum4
Masashi Sugiyama4
Nathan Srebro4

Impactful Papers

Papers from NeurIPS 2017 that shaped research clusters.

Foundational

Influential

Papers

Title
Influence Maximization with $\varepsilon$-Almost Submodular Threshold Functions
Influence Maximization with ε-Almost Submodular Threshold Functions
InfoGAIL: Interpretable Imitation Learning from Visual Demonstrations
Information-theoretic analysis of generalization capability of learning algorithms
Information Theoretic Properties of Markov Random Fields, and their Algorithmic Applications
Inhomogeneous Hypergraph Clustering with Applications
Inner-loop free ADMM using Auxiliary Deep Neural Networks
Integration Methods and Optimization Algorithms
Interactive Submodular Bandit
Interpolated Policy Gradient: Merging On-Policy and Off-Policy Gradient Estimation for Deep Reinforcement Learning
Interpretable and Globally Optimal Prediction for Textual Grounding using Image Concepts
Introspective Classification with Convolutional Nets
Invariance and Stability of Deep Convolutional Representations
Inverse Filtering for Hidden Markov Models
Inverse Reward Design
Investigating the learning dynamics of deep neural networks using random matrix theory
Is Input Sparsity Time Possible for Kernel Low-Rank Approximation?
Is the Bellman residual a bad proxy?
Joint distribution optimal transportation for domain adaptation
Kernel Feature Selection via Conditional Covariance Minimization
Kernel functions based on triplet comparisons
K-Medoids For K-Means Seeding
k-Support and Ordered Weighted Sparsity for Overlapping Groups: Hardness and Algorithms
Label Distribution Learning Forests
Label efficient learning of transferable representations across domains and tasks
Label Efficient Learning of Transferable Representations acrosss Domains and Tasks
Langevin Dynamics with Continuous Tempering for Training Deep Neural Networks
Language Modeling with Recurrent Highway Hypernetworks
Large-Scale Quadratically Constrained Quadratic Program via Low-Discrepancy Sequences
Latent Structure Learning using Gaussian and Dirichlet Processes
Learned D-AMP: Principled Neural Network based Compressive Image Recovery
Learned in Translation: Contextualized Word Vectors
Learning Active Learning from Data
Learning Affinity via Spatial Propagation Networks
Learning a Multi-View Stereo Machine
Learning A Structured Optimal Bipartite Graph for Co-Clustering
Learning Causal Graphs with Latent Variables
Learning Causal Structures Using Regression Invariance
Learning Chordal Markov Networks via Branch and Bound
Learning Combinatorial Optimization Algorithms over Graphs
Learning Deep Structured Multi-Scale Features using Attention-Gated CRFs for Contour Prediction
Learning Disentangled Representations with Semi-Supervised Deep Generative Models
Learning Efficient Object Detection Models with Knowledge Distillation
Learning from Complementary Labels
Learning from uncertain curves: The 2-Wasserstein metric for Gaussian processes
Learning Graph Embeddings with Embedding Propagation
Learning Graph Representations with Embedding Propagation
Learning Hierarchical Information Flow with Recurrent Neural Modules
Learning Identifiable Gaussian Bayesian Networks in Polynomial Time and Sample Complexity
Learning Koopman Invariant Subspaces for Dynamic Mode Decomposition

« prev Page 7/15 next »