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
(Probably) Concave Graph Matching
Processing of missing data by neural networks
Provable Gaussian Embedding with One Observation
Provable Variational Inference for Constrained Log-Submodular Models
Provably Correct Automatic Sub-Differentiation for Qualified Programs
Proximal Graphical Event Models
Proximal SCOPE for Distributed Sparse Learning
Q-learning with Nearest Neighbors
Quadratic Decomposable Submodular Function Minimization
Quadrature-based features for kernel approximation
Quantifying Learning Guarantees for Convex but Inconsistent Surrogates
Query Complexity of Bayesian Private Learning
Query K-means Clustering and the Double Dixie Cup Problem
Random Feature Stein Discrepancies
Randomized Prior Functions for Deep Reinforcement Learning
Realistic Evaluation of Deep Semi-Supervised Learning Algorithms
Rectangular Bounding Process
Recurrently Controlled Recurrent Networks
Recurrent Relational Networks
Recurrent Transformer Networks for Semantic Correspondence
Recurrent World Models Facilitate Policy Evolution
Reducing Network Agnostophobia
Re-evaluating evaluation
REFUEL: Exploring Sparse Features in Deep Reinforcement Learning for Fast Disease Diagnosis
Regret bounds for meta Bayesian optimization with an unknown Gaussian process prior
Regret Bounds for Online Portfolio Selection with a Cardinality Constraint
Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator
Regularization Learning Networks: Deep Learning for Tabular Datasets
Regularizing by the Variance of the Activations' Sample-Variances
Reinforced Continual Learning
Reinforcement Learning for Solving the Vehicle Routing Problem
Reinforcement Learning of Theorem Proving
Reinforcement Learning with Multiple Experts: A Bayesian Model Combination Approach
Relating Leverage Scores and Density using Regularized Christoffel Functions
Relational recurrent neural networks
Removing Hidden Confounding by Experimental Grounding
Removing the Feature Correlation Effect of Multiplicative Noise
RenderNet: A deep convolutional network for differentiable rendering from 3D shapes
Reparameterization Gradient for Non-differentiable Models
Representation Balancing MDPs for Off-policy Policy Evaluation
Representation Learning for Treatment Effect Estimation from Observational Data
Representation Learning for Treatment Effect Estimation from Observational Data.
Representation Learning of Compositional Data
Representer Point Selection for Explaining Deep Neural Networks
ResNet with one-neuron hidden layers is a Universal Approximator
Rest-Katyusha: Exploiting the Solution's Structure via Scheduled Restart Schemes
RetGK: Graph Kernels based on Return Probabilities of Random Walks
Reversible Recurrent Neural Networks
Revisiting Decomposable Submodular Function Minimization with Incidence Relations
Revisiting (\epsilon, \gamma, \tau)-similarity learning for domain adaptation

« prev Page 16/21 next »