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
Snap ML: A Hierarchical Framework for Machine Learning
SNIPER: Efficient Multi-Scale Training
Soft-Gated Warping-GAN for Pose-Guided Person Image Synthesis
Solving Large Sequential Games with the Excessive Gap Technique
Solving Non-smooth Constrained Programs with Lower Complexity than \mathcal{O}(1/\varepsilon): A Primal-Dual Homotopy Smoothing Approach
Sparse Attentive Backtracking: Temporal Credit Assignment Through Reminding
Sparse Covariance Modeling in High Dimensions with Gaussian Processes
Sparse DNNs with Improved Adversarial Robustness
Sparse PCA from Sparse Linear Regression
Sparsified SGD with Memory
Speaker-Follower Models for Vision-and-Language Navigation
Spectral Filtering for General Linear Dynamical Systems
Spectral Signatures in Backdoor Attacks
SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path-Integrated Differential Estimator
SplineNets: Continuous Neural Decision Graphs
Stacked Semantics-Guided Attention Model for Fine-Grained Zero-Shot Learning
Statistical and Computational Trade-Offs in Kernel K-Means
Statistical mechanics of low-rank tensor decomposition
Statistical Optimality of Stochastic Gradient Descent on Hard Learning Problems through Multiple Passes
Stein Variational Gradient Descent as Moment Matching
Step Size Matters in Deep Learning
Stimulus domain transfer in recurrent models for large scale cortical population prediction on video
Stochastic Chebyshev Gradient Descent for Spectral Optimization
Stochastic Composite Mirror Descent: Optimal Bounds with High Probabilities
Stochastic Cubic Regularization for Fast Nonconvex Optimization
Stochastic Expectation Maximization with Variance Reduction
Stochastic Nested Variance Reduced Gradient Descent for Nonconvex Optimization
Stochastic Nested Variance Reduction for Nonconvex Optimization
Stochastic Nonparametric Event-Tensor Decomposition
Stochastic Primal-Dual Method for Empirical Risk Minimization with O(1) Per-Iteration Complexity
Stochastic Spectral and Conjugate Descent Methods
Streaming Kernel PCA with \tilde{O}(\sqrt{n}) Random Features
Streamlining Variational Inference for Constraint Satisfaction Problems
Structural Causal Bandits: Where to Intervene?
Structure-Aware Convolutional Neural Networks
Structured Local Minima in Sparse Blind Deconvolution
Sublinear Time Low-Rank Approximation of Distance Matrices
Submodular Field Grammars: Representation, Inference, and Application to Image Parsing
Submodular Maximization via Gradient Ascent: The Case of Deep Submodular Functions
Supervised autoencoders: Improving generalization performance with unsupervised regularizers
Supervising Unsupervised Learning
Support Recovery for Orthogonal Matching Pursuit: Upper and Lower bounds
Symbolic Graph Reasoning Meets Convolutions
Synaptic Strength For Convolutional Neural Network
Synthesized Policies for Transfer and Adaptation across Tasks and Environments
Synthesize Policies for Transfer and Adaptation across Tasks and Environments
TADAM: Task dependent adaptive metric for improved few-shot learning
Tangent: Automatic differentiation using source-code transformation for dynamically typed array programming
Task-Driven Convolutional Recurrent Models of the Visual System
Teaching Inverse Reinforcement Learners via Features and Demonstrations

« prev Page 18/21 next »