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
Temporal alignment and latent Gaussian process factor inference in population spike trains
Temporal Regularization for Markov Decision Process
Testing for Families of Distributions via the Fourier Transform
TETRIS: TilE-matching the TRemendous Irregular Sparsity
Text-Adaptive Generative Adversarial Networks: Manipulating Images with Natural Language
The challenge of realistic music generation: modelling raw audio at scale
The Cluster Description Problem - Complexity Results, Formulations and Approximations
The committee machine: Computational to statistical gaps in learning a two-layers neural network
The Convergence of Sparsified Gradient Methods
The Description Length of Deep Learning models
The Effect of Network Width on the Performance of Large-batch Training
The emergence of multiple retinal cell types through efficient coding of natural movies
The Everlasting Database: Statistical Validity at a Fair Price
The Global Anchor Method for Quantifying Linguistic Shifts and Domain Adaptation
The Importance of Sampling inMeta-Reinforcement Learning
The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
The Limits of Post-Selection Generalization
The Lingering of Gradients: How to Reuse Gradients Over Time
The Nearest Neighbor Information Estimator is Adaptively Near Minimax Rate-Optimal
Theoretical guarantees for EM under misspecified Gaussian mixture models
Theoretical Linear Convergence of Unfolded ISTA and Its Practical Weights and Thresholds
The Pessimistic Limits and Possibilities of Margin-based Losses in Semi-supervised Learning
The Physical Systems Behind Optimization Algorithms
The Price of Fair PCA: One Extra dimension
The Price of Privacy for Low-rank Factorization
The promises and pitfalls of Stochastic Gradient Langevin Dynamics
Thermostat-assisted continuously-tempered Hamiltonian Monte Carlo for Bayesian learning
The Sample Complexity of Semi-Supervised Learning with Nonparametric Mixture Models
The Sparse Manifold Transform
The Spectrum of the Fisher Information Matrix of a Single-Hidden-Layer Neural Network
The streaming rollout of deep networks - towards fully model-parallel execution
Third-order Smoothness Helps: Faster Stochastic Optimization Algorithms for Finding Local Minima
Thwarting Adversarial Examples: An L_0-Robust Sparse Fourier Transform
Tight Bounds for Collaborative PAC Learning via Multiplicative Weights
Toddler-Inspired Visual Object Learning
Topkapi: Parallel and Fast Sketches for Finding Top-K Frequent Elements
TopRank: A practical algorithm for online stochastic ranking
Total stochastic gradient algorithms and applications in reinforcement learning
To Trust Or Not To Trust A Classifier
Towards Deep Conversational Recommendations
Towards Robust Detection of Adversarial Examples
Towards Robust Interpretability with Self-Explaining Neural Networks
Towards Text Generation with Adversarially Learned Neural Outlines
Towards Understanding Acceleration Tradeoff between Momentum and Asynchrony in Nonconvex Stochastic Optimization
Towards Understanding Learning Representations: To What Extent Do Different Neural Networks Learn the Same Representation
Trading robust representations for sample complexity through self-supervised visual experience
Training deep learning based denoisers without ground truth data
Training Deep Models Faster with Robust, Approximate Importance Sampling
Training Deep Neural Networks with 8-bit Floating Point Numbers
Training DNNs with Hybrid Block Floating Point

« prev Page 19/21 next »