NeurIPS 2015

410 papers

Top Research Directions

Research directions most represented by NeurIPS 2015 papers.

Learning Densities with Intractable Normalizing Constants 9
Scaling Gaussian Processes Beyond Cubic Complexity 8
Mitigating Gradient Variance in Stochastic Optimization 7
Multi-Agent Learning Under Bandit Feedback 6
Matrix-Free Curvature Estimation for Deep Learning 6
Scaling Bayesian Sampling via Stochastic Gradient MCMC 6
Convergence Guarantees for Inexact Subproblem Optimization 5
Navigating the Inference Efficiency Accuracy Tradeoff 5
Inducing Point Approximations for Scalable Gaussian Processes 5
Overcoming the Cubic Complexity of Kernel Methods 5
Unified Mathematical Frameworks for Optimization Algorithms 4
Signal Recovery Beyond the Gaussian Measurement Assumption 4
Greedy Maximization for Submodular Subset Selection 4
Overcoming Geometric Mismatch in Parameter Space Optimization 4
Non-Conjugate Inference for Gaussian Processes 4

Top Authors

AuthorPapers
Pradeep Kumar Ravikumar7
Lawrence Carin6
Inderjit S Dhillon5
Le Song5
Zoubin Ghahramani5
Han Liu4
Joshua B. Tenenbaum4
Michael Jordan4
Percy Liang4
Prateek Jain4
Prateek Jain4
Ryan P Adams4
Shie Mannor4
Simon Lacoste-Julien4
Yoshua Bengio4
Zhaoran Wang4
Alex Dimakis3
Ambuj Tewari3
Antonio Torralba3
Christopher Re3

Impactful Papers

Papers from NeurIPS 2015 that shaped research clusters.

Foundational

Influential

Papers

Title
Nonparametric von Mises Estimators for Entropies, Divergences and Mutual Informations
No-Regret Learning in Bayesian Games
On Elicitation Complexity
Online F-Measure Optimization
Online Gradient Boosting
Online Learning for Adversaries with Memory: Price of Past Mistakes
Online Learning with Adversarial Delays
Online Prediction at the Limit of Zero Temperature
Online Rank Elicitation for Plackett-Luce: A Dueling Bandits Approach
On some provably correct cases of variational inference for topic models
On the Accuracy of Self-Normalized Log-Linear Models
On the consistency theory of high dimensional variable screening
On the Convergence of Stochastic Gradient MCMC Algorithms with High-Order Integrators
On the Global Linear Convergence of Frank-Wolfe Optimization Variants
On-the-Job Learning with Bayesian Decision Theory
On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank-One Perturbations of Gaussian Tensors
On the Optimality of Classifier Chain for Multi-label Classification
On the Pseudo-Dimension of Nearly Optimal Auctions
On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs
On Variance Reduction in Stochastic Gradient Descent and its Asynchronous Variants
Optimal Linear Estimation under Unknown Nonlinear Transform
Optimal Rates for Random Fourier Features
Optimal Ridge Detection using Coverage Risk
Optimal Testing for Properties of Distributions
Optimization Monte Carlo: Efficient and Embarrassingly Parallel Likelihood-Free Inference
Orthogonal NMF through Subspace Exploration
Parallel Correlation Clustering on Big Graphs
Parallelizing MCMC with Random Partition Trees
Parallel Multi-Dimensional LSTM, With Application to Fast Biomedical Volumetric Image Segmentation
Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functions
Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models
Particle Gibbs for Infinite Hidden Markov Models
Path-SGD: Path-Normalized Optimization in Deep Neural Networks
Planar Ultrametrics for Image Segmentation
Pointer Networks
Policy Evaluation Using the Ω-Return
Policy Gradient for Coherent Risk Measures
Practical and Optimal LSH for Angular Distance
Precision-Recall-Gain Curves: PR Analysis Done Right
Preconditioned Spectral Descent for Deep Learning
Predtron: A Family of Online Algorithms for General Prediction Problems
Principal Differences Analysis: Interpretable Characterization of Differences between Distributions
Principal Geodesic Analysis for Probability Measures under the Optimal Transport Metric
Private Graphon Estimation for Sparse Graphs
Probabilistic Curve Learning: Coulomb Repulsion and the Electrostatic Gaussian Process
Probabilistic Line Searches for Stochastic Optimization
Probabilistic Variational Bounds for Graphical Models
Quartz: Randomized Dual Coordinate Ascent with Arbitrary Sampling
Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition
Rapidly Mixing Gibbs Sampling for a Class of Factor Graphs Using Hierarchy Width

« prev Page 6/9 next »