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
Non-monotone Continuous DR-submodular Maximization: Structure and Algorithms
Nonparametric Online Regression while Learning the Metric
Non-parametric Structured Output Networks
Non-Stationary Spectral Kernels
Off-policy evaluation for slate recommendation
OnACID: Online Analysis of Calcium Imaging Data in Real Time
On Blackbox Backpropagation and Jacobian Sensing
On clustering network-valued data
On Distributed Hierarchical Clustering
One-Shot Imitation Learning
One-Sided Unsupervised Domain Mapping
On Fairness and Calibration
On Frank-Wolfe and Equilibrium Computation
Online control of the false discovery rate with decaying memory
Online Convex Optimization with Stochastic Constraints
Online Dynamic Programming
Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback
Online Learning for Multivariate Hawkes Processes
Online Learning of Optimal Bidding Strategy in Repeated Multi-Commodity Auctions
Online Learning with a Hint
Online Learning with Transductive Regret
Online multiclass boosting
Online Prediction with Selfish Experts
Online Reinforcement Learning in Stochastic Games
Online to Offline Conversions, Universality and Adaptive Minibatch Sizes
On Optimal Generalizability in Parametric Learning
On Quadratic Convergence of DC Proximal Newton Algorithm in Nonconvex Sparse Learning
On Separability of Loss Functions, and Revisiting Discriminative Vs Generative Models
On Structured Prediction Theory with Calibrated Convex Surrogate Losses
On Tensor Train Rank Minimization : Statistical Efficiency and Scalable Algorithm
On the Complexity of Learning Neural Networks
On the Consistency of Quick Shift
On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks
On-the-fly Operation Batching in Dynamic Computation Graphs
On the Model Shrinkage Effect of Gamma Process Edge Partition Models
On the Optimization Landscape of Tensor Decompositions
On the Power of Truncated SVD for General High-rank Matrix Estimation Problems
Optimal Sample Complexity of M-wise Data for Top-K Ranking
Optimal Shrinkage of Singular Values Under Random Data Contamination
Optimistic posterior sampling for reinforcement learning: worst-case regret bounds
Optimized Pre-Processing for Discrimination Prevention
Overcoming Catastrophic Forgetting by Incremental Moment Matching
Parallel Streaming Wasserstein Barycenters
Parameter-Free Online Learning via Model Selection
Parametric Simplex Method for Sparse Learning
Partial Hard Thresholding: Towards A Principled Analysis of Support Recovery
PASS-GLM: polynomial approximate sufficient statistics for scalable Bayesian GLM inference
Permutation-based Causal Inference Algorithms with Interventions
Perturbative Black Box Variational Inference
Phase Transitions in the Pooled Data Problem

« prev Page 10/15 next »