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
Learning Conditioned Graph Structures for Interpretable Visual Question Answering
Learning Confidence Sets using Support Vector Machines
Learning convex bounds for linear quadratic control policy synthesis
Learning convex polytopes with margin
Learning Deep Disentangled Embeddings With the F-Statistic Loss
Learning Disentangled Joint Continuous and Discrete Representations
Learning filter widths of spectral decompositions with wavelets
Learning from discriminative feature feedback
Learning from Group Comparisons: Exploiting Higher Order Interactions
Learning Gaussian Processes by Minimizing PAC-Bayesian Generalization Bounds
Learning Hierarchical Semantic Image Manipulation through Structured Representations
Learning in Games with Lossy Feedback
Learning Invariances using the Marginal Likelihood
Learning Latent Subspaces in Variational Autoencoders
Learning latent variable structured prediction models with Gaussian perturbations
Learning Libraries of Subroutines for Neurally-Guided Bayesian Program Induction
Learning long-range spatial dependencies with horizontal gated recurrent units
Learning Loop Invariants for Program Verification
Learning Optimal Reserve Price against Non-myopic Bidders
Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Data
Learning Pipelines with Limited Data and Domain Knowledge: A Study in Parsing Physics Problems
Learning Plannable Representations with Causal InfoGAN
Learning Safe Policies with Expert Guidance
Learning semantic similarity in a continuous space
Learning Signed Determinantal Point Processes through the Principal Minor Assignment Problem
Learning SMaLL Predictors
Learning sparse neural networks via sensitivity-driven regularization
Learning Task Specifications from Demonstrations
Learning Temporal Point Processes via Reinforcement Learning
Learning to Decompose and Disentangle Representations for Video Prediction
Learning to Exploit Stability for 3D Scene Parsing
Learning to Infer Graphics Programs from Hand-Drawn Images
Learning To Learn Around A Common Mean
Learning to Multitask
Learning to Navigate in Cities Without a Map
Learning to Optimize Tensor Programs
Learning to Play With Intrinsically-Motivated, Self-Aware Agents
Learning to Reason with Third Order Tensor Products
Learning to Reconstruct Shapes from Unseen Classes
Learning to Repair Software Vulnerabilities with Generative Adversarial Networks
Learning to Share and Hide Intentions using Information Regularization
Learning to Solve SMT Formulas
Learning to Specialize with Knowledge Distillation for Visual Question Answering
Learning to Teach with Dynamic Loss Functions
Learning towards Minimum Hyperspherical Energy
Learning Versatile Filters for Efficient Convolutional Neural Networks
Learning without the Phase: Regularized PhaseMax Achieves Optimal Sample Complexity
Learning with SGD and Random Features
Learn What Not to Learn: Action Elimination with Deep Reinforcement Learning
Legendre Decomposition for Tensors

« prev Page 11/21 next »