NeurIPS 2018

1,011 papers

Top Research Directions

Research directions most represented by NeurIPS 2018 papers.

Scaling Gaussian Processes Beyond Cubic Complexity 18
Mitigating Gradient Variance in Stochastic Optimization 11
Sample Efficient Reinforcement Learning 11
Matrix-Free Curvature Estimation for Deep Learning 9
Escaping Saddle Points in Nonconvex Optimization 9
Navigating Non-Convex Loss Landscapes in Deep Learning 9
Overcoming the Cubic Complexity of Kernel Methods 9
Stochastic Noise Injection for Escaping Saddle Points 8
Inducing Point Approximations for Scalable Gaussian Processes 8
Variance Reduction in Stochastic Optimization 8
Communication Efficient Distributed Training of Large Models 8
Beyond the Deterministic Transition Assumption in Reinforcement Learning 7
Variance Reduction for Discrete Gradient Estimation 7
Overcoming Local Receptive Field Constraints in Visual Models 7
Basins of Attraction in Nonconvex Optimization 7

Top Authors

AuthorPapers
Joshua B. Tenenbaum10
Eric P. Xing8
Michael Jordan8
Sergey Levine8
Francis Bach7
Honglak Lee6
Masashi Sugiyama6
Mingyuan Zhou6
Stefano Ermon6
Tong Zhang6
Alessandro Rudi5
Jason D. Lee5
Jiajun Wu5
Jonathan W. Pillow5
Lorenzo Rosasco5
Pradeep Kumar Ravikumar5
Tie-Yan Liu5
Tuomas Sandholm5
William T. Freeman5
Xiaodan Liang5

Impactful Papers

Papers from NeurIPS 2018 that shaped research clusters.

Foundational

Influential

Papers

Title
Neural Proximal Gradient Descent for Compressive Imaging
Neural-Symbolic VQA: Disentangling Reasoning from Vision and Language Understanding
Neural Tangent Kernel: Convergence and Generalization in Neural Networks
Neural Voice Cloning with a Few Samples
New Insight into Hybrid Stochastic Gradient Descent: Beyond With-Replacement Sampling and Convexity
Non-Adversarial Mapping with VAEs
Non-delusional Q-learning and value-iteration
Non-Ergodic Alternating Proximal Augmented Lagrangian Algorithms with Optimal Rates
Nonlocal Neural Networks, Nonlocal Diffusion and Nonlocal Modeling
Non-Local Recurrent Network for Image Restoration
Non-metric Similarity Graphs for Maximum Inner Product Search
Non-monotone Submodular Maximization in Exponentially Fewer Iterations
Nonparametric Bayesian Lomax delegate racing for survival analysis with competing risks
Nonparametric Density Estimation under Adversarial Losses
Nonparametric learning from Bayesian models with randomized objective functions
Norm matters: efficient and accurate normalization schemes in deep networks
Norm-Ranging LSH for Maximum Inner Product Search
Objective and efficient inference for couplings in neuronal networks
Object-Oriented Dynamics Predictor
Occam's razor is insufficient to infer the preferences of irrational agents
On Binary Classification in Extreme Regions
On Controllable Sparse Alternatives to Softmax
On Coresets for Logistic Regression
One-Shot Unsupervised Cross Domain Translation
On Fast Leverage Score Sampling and Optimal Learning
On GANs and GMMs
On gradient regularizers for MMD GANs
On Learning Intrinsic Rewards for Policy Gradient Methods
On Learning Markov Chains
Online Adaptive Methods, Universality and Acceleration
Online convex optimization for cumulative constraints
Online Improper Learning with an Approximation Oracle
Online Learning of Quantum States
Online Learning with an Unknown Fairness Metric
Online Reciprocal Recommendation with Theoretical Performance Guarantees
Online Robust Policy Learning in the Presence of Unknown Adversaries
Online Structured Laplace Approximations for Overcoming Catastrophic Forgetting
Online Structure Learning for Feed-Forward and Recurrent Sum-Product Networks
On Markov Chain Gradient Descent
On Misinformation Containment in Online Social Networks
On Neuronal Capacity
On Oracle-Efficient PAC Reinforcement Learning with Rich Observations
On Oracle-Efficient PAC RL with Rich Observations
On preserving non-discrimination when combining expert advice
On the Convergence and Robustness of Training GANs with Regularized Optimal Transport
On the Dimensionality of Word Embedding
On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transport
On the Local Hessian in Back-propagation
On the Local Minima of the Empirical Risk
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization

« prev Page 14/21 next »