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
Automating Bayesian optimization with Bayesian optimization
Backpropagation with Callbacks: Foundations for Efficient and Expressive Differentiable Programming
Balanced Policy Evaluation and Learning
Banach Wasserstein GAN
Bandit Learning in Concave N-Person Games
Bandit Learning with Implicit Feedback
Bandit Learning with Positive Externalities
Batch-Instance Normalization for Adaptively Style-Invariant Neural Networks
Bayesian Adversarial Learning
Bayesian Alignments of Warped Multi-Output Gaussian Processes
Bayesian Control of Large MDPs with Unknown Dynamics in Data-Poor Environments
Bayesian Distributed Stochastic Gradient Descent
Bayesian Inference of Temporal Task Specifications from Demonstrations
Bayesian Model-Agnostic Meta-Learning
Bayesian Model Selection Approach to Boundary Detection with Non-Local Priors
Bayesian multi-domain learning for cancer subtype discovery from next-generation sequencing count data
Bayesian Nonparametric Spectral Estimation
Bayesian Pose Graph Optimization via Bingham Distributions and Tempered Geodesic MCMC
Bayesian Semi-supervised Learning with Graph Gaussian Processes
Bayesian Structure Learning by Recursive Bootstrap
Beauty-in-averageness and its contextual modulations: A Bayesian statistical account
Benefits of over-parameterization with EM
Beyond Grids: Learning Graph Representations for Visual Recognition
Beyond Log-concavity: Provable Guarantees for Sampling Multi-modal Distributions using Simulated Tempering Langevin Monte Carlo
Bias and Generalization in Deep Generative Models: An Empirical Study
Bilevel Distance Metric Learning for Robust Image Recognition
Bilevel learning of the Group Lasso structure
Bilinear Attention Networks
Binary Classification from Positive-Confidence Data
Binary Rating Estimation with Graph Side Information
BinGAN: Learning Compact Binary Descriptors with a Regularized GAN
Bipartite Stochastic Block Models with Tiny Clusters
Blind Deconvolutional Phase Retrieval via Convex Programming
Blockwise Parallel Decoding for Deep Autoregressive Models
BML: A High-performance, Low-cost Gradient Synchronization Algorithm for DML Training
Boolean Decision Rules via Column Generation
Boosted Sparse and Low-Rank Tensor Regression
Boosting Black Box Variational Inference
Bounded-Loss Private Prediction Markets
BourGAN: Generative Networks with Metric Embeddings
Breaking the Activation Function Bottleneck through Adaptive Parameterization
Breaking the Curse of Horizon: Infinite-Horizon Off-Policy Estimation
Breaking the Span Assumption Yields Fast Finite-Sum Minimization
BRITS: Bidirectional Recurrent Imputation for Time Series
BRUNO: A Deep Recurrent Model for Exchangeable Data
But How Does It Work in Theory? Linear SVM with Random Features
Byzantine Stochastic Gradient Descent
Can We Gain More from Orthogonality Regularizations in Training Deep Networks?
CapProNet: Deep Feature Learning via Orthogonal Projections onto Capsule Subspaces
CatBoost: unbiased boosting with categorical features

« prev Page 3/21 next »