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
Optimal Algorithms for Non-Smooth Distributed Optimization in Networks
Optimal Subsampling with Influence Functions
Optimistic optimization of a Brownian
Optimization for Approximate Submodularity
Optimization of Smooth Functions with Noisy Observations: Local Minimax Rates
Optimization over Continuous and Multi-dimensional Decisions with Observational Data
Orthogonally Decoupled Variational Gaussian Processes
Out-of-Distribution Detection using Multiple Semantic Label Representations
Out of the Box: Reasoning with Graph Convolution Nets for Factual Visual Question Answering
Overcoming Language Priors in Visual Question Answering with Adversarial Regularization
Overlapping Clustering Models, and One (class) SVM to Bind Them All
PAC-Bayes bounds for stable algorithms with instance-dependent priors
PAC-Bayes Tree: weighted subtrees with guarantees
PacGAN: The power of two samples in generative adversarial networks
PAC-learning in the presence of adversaries
Parameters as interacting particles: long time convergence and asymptotic error scaling of neural networks
Paraphrasing Complex Network: Network Compression via Factor Transfer
Parsimonious Bayesian deep networks
Parsimonious Quantile Regression of Financial Asset Tail Dynamics via Sequential Learning
Partially-Supervised Image Captioning
PCA of high dimensional random walks with comparison to neural network training
Persistence Fisher Kernel: A Riemannian Manifold Kernel for Persistence Diagrams
PG-TS: Improved Thompson Sampling for Logistic Contextual Bandits
Phase Retrieval Under a Generative Prior
Pipe-SGD: A Decentralized Pipelined SGD Framework for Distributed Deep Net Training
Playing hard exploration games by watching YouTube
Plug-in Estimation in High-Dimensional Linear Inverse Problems: A Rigorous Analysis
PointCNN: Convolution On X-Transformed Points
Point process latent variable models of larval zebrafish behavior
Poison Frogs! Targeted Clean-Label Poisoning Attacks on Neural Networks
Policy-Conditioned Uncertainty Sets for Robust Markov Decision Processes
Policy Optimization via Importance Sampling
Policy Regret in Repeated Games
Porcupine Neural Networks: Approximating Neural Network Landscapes
Post: Device Placement with Cross-Entropy Minimization and Proximal Policy Optimization
Posterior Concentration for Sparse Deep Learning
Power-law efficient neural codes provide general link between perceptual bias and discriminability
Practical Deep Stereo (PDS): Toward applications-friendly deep stereo matching
Practical exact algorithm for trembling-hand equilibrium refinements in games
Practical Methods for Graph Two-Sample Testing
Precision and Recall for Time Series
Predictive Approximate Bayesian Computation via Saddle Points
Predictive Uncertainty Estimation via Prior Networks
Predict Responsibly: Improving Fairness and Accuracy by Learning to Defer
Preference Based Adaptation for Learning Objectives
Privacy Amplification by Subsampling: Tight Analyses via Couplings and Divergences
Probabilistic Matrix Factorization for Automated Machine Learning
Probabilistic Model-Agnostic Meta-Learning
Probabilistic Neural Programmed Networks for Scene Generation
Probabilistic Pose Graph Optimization via Bingham Distributions and Tempered Geodesic MCMC

« prev Page 15/21 next »