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
Gaussian Quadrature for Kernel Features
Generalization Properties of Learning with Random Features
Generalized Linear Model Regression under Distance-to-set Penalties
Generalizing GANs: A Turing Perspective.
Generating steganographic images via adversarial training
Generative Local Metric Learning for Kernel Regression
Geometric Descent Method for Convex Composite Minimization
Geometric Matrix Completion with Recurrent Multi-Graph Neural Networks
GibbsNet: Iterative Adversarial Inference for Deep Graphical Models
Good Semi-supervised Learning That Requires a Bad GAN
GP CaKe: Effective brain connectivity with causal kernels
Gradient Descent Can Take Exponential Time to Escape Saddle Points
Gradient descent GAN optimization is locally stable
Gradient Episodic Memory for Continual Learning
Gradient Methods for Submodular Maximization
Gradients of Generative Models for Improved Discriminative Analysis of Tandem Mass Spectra
Grammatically-Interpretable Learned Representations in Deep NLP Models
Graph Matching via Multiplicative Update Algorithm
Greedy Algorithms for Cone Constrained Optimization with Convergence Guarantees
Group Additive Structure Identification for Kernel Nonparametric Regression
Group Sparse Additive Machine
Hash Embeddings for Efficient Word Representations
Hiding Images in Plain Sight: Deep Steganography
Hierarchical Attentive Recurrent Tracking
Hierarchical Clustering Beyond the Worst-Case
Hierarchical Implicit Models and Likelihood-Free Variational Inference
Hierarchical Methods of Moments
Higher-Order Total Variation Classes on Grids: Minimax Theory and Trend Filtering Methods
High-Order Attention Models for Visual Question Answering
Hindsight Experience Replay
Houdini: Democratizing Adversarial Examples
Houdini: Fooling Deep Structured Visual and Speech Recognition Models with Adversarial Examples
How regularization affects the critical points in linear networks
Hunt For The Unique, Stable, Sparse And Fast Feature Learning On Graphs
Hybrid Reward Architecture for Reinforcement Learning
Hypothesis Transfer Learning via Transformation Functions
Identification of Gaussian Process State Space Models
Identifying Outlier Arms in Multi-Armed Bandit
Imagination-Augmented Agents for Deep Reinforcement Learning
Implicit Regularization in Matrix Factorization
Improved Dynamic Regret for Non-degenerate Functions
Improved Graph Laplacian via Geometric Self-Consistency
Improved Training of Wasserstein GANs
Improving Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms and Its Applications
Improving the Expected Improvement Algorithm
Incorporating Side Information by Adaptive Convolution
Independence clustering (without a matrix)
Inductive Representation Learning on Large Graphs
Inference in Graphical Models via Semidefinite Programming Hierarchies
Inferring Generative Model Structure with Static Analysis

« prev Page 6/15 next »