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
Model-Agnostic Private Learning
Model Agnostic Supervised Local Explanations
Model-based targeted dimensionality reduction for neuronal population data
Modeling Dynamic Missingness of Implicit Feedback for Recommendation
Modelling and unsupervised learning of symmetric deformable object categories
Modelling sparsity, heterogeneity, reciprocity and community structure in temporal interaction data.
Modern Neural Networks Generalize on Small Data Sets
Modular Networks: Learning to Decompose Neural Computation
Monte-Carlo Tree Search for Constrained POMDPs
Moonshine: Distilling with Cheap Convolutions
Multi-Agent Generative Adversarial Imitation Learning
Multi-Agent Reinforcement Learning via Double Averaging Primal-Dual Optimization
Multi-armed Bandits with Compensation
Multi-Class Learning: From Theory to Algorithm
Multi-domain Causal Structure Learning in Linear Systems
Multi-Layered Gradient Boosting Decision Trees
Multilingual Anchoring: Interactive Topic Modeling and Alignment Across Languages
Multimodal Generative Models for Scalable Weakly-Supervised Learning
Multi-objective Maximization of Monotone Submodular Functions with Cardinality Constraint
Multiple Instance Learning for Efficient Sequential Data Classification on Resource-constrained Devices
Multiple-Step Greedy Policies in Approximate and Online Reinforcement Learning
Multiplicative Weights Updates with Constant Step-Size in Graphical Constant-Sum Games
Multitask Boosting for Survival Analysis with Competing Risks
Multi-Task Learning as Multi-Objective Optimization
Multi-Task Zipping via Layer-wise Neuron Sharing
Multi-value Rule Sets for Interpretable Classification with Feature-Efficient Representations
Multivariate Convolutional Sparse Coding for Electromagnetic Brain Signals
Multivariate Time Series Imputation with Generative Adversarial Networks
Multi-View Silhouette and Depth Decomposition for High Resolution 3D Object Representation
M-Walk: Learning to Walk over Graphs using Monte Carlo Tree Search
NAIS-Net: Stable Deep Networks from Non-Autonomous Differential Equations
Natasha 2: Faster Non-Convex Optimization Than SGD
Navigating with Graph Representations for Fast and Scalable Decoding of Neural Language Models
Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes
Near Optimal Exploration-Exploitation in Non-Communicating Markov Decision Processes
Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models
Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model
Negotiable Reinforcement Learning for Pareto Optimal Sequential Decision-Making
Neighbourhood Consensus Networks
NEON2: Finding Local Minima via First-Order Oracles
Neural Architecture Optimization
Neural Architecture Search with Bayesian Optimisation and Optimal Transport
Neural Arithmetic Logic Units
Neural Code Comprehension: A Learnable Representation of Code Semantics
Neural Edit Operations for Biological Sequences
Neural Guided Constraint Logic Programming for Program Synthesis
Neural Interaction Transparency (NIT): Disentangling Learned Interactions for Improved Interpretability
Neural Nearest Neighbors Networks
Neural Networks Trained to Solve Differential Equations Learn General Representations
Neural Ordinary Differential Equations

« prev Page 13/21 next »