NeurIPS 2014

416 papers

Top Research Directions

Research directions most represented by NeurIPS 2014 papers.

Scaling Gaussian Processes Beyond Cubic Complexity 13
Tensor Decomposition for Latent Parameter Recovery 7
Overcoming the Cubic Complexity of Kernel Methods 7
Convergence of Message Passing on Loopy Graphs 6
Basins of Attraction in Nonconvex Optimization 6
Learning Densities with Intractable Normalizing Constants 6
The Statistical Computational Gap in High Dimensions 5
Multi-Agent Learning Under Bandit Feedback 5
Non-Conjugate Inference for Gaussian Processes 5
Expectation Propagation for Approximate Bayesian Inference 4
Submodular Optimization for Diverse Subset Selection 4
Parameter Identifiability in Complex Statistical Models 4
Breaking the Sequential Bottleneck in Black-Box Optimization 4
Mitigating Gradient Variance in Stochastic Optimization 4
Parallelizing Sequential Sampling for High Dimensional Inference 4

Top Authors

AuthorPapers
Pradeep Kumar Ravikumar9
Inderjit S Dhillon8
Jonathan W. Pillow5
Prateek Jain5
Prateek Jain5
Remi Munos5
Yoshua Bengio5
Devavrat Shah4
Han Liu4
huan xu4
Jun Zhu4
Lawrence Carin4
Le Song4
Maria Florina Balcan4
Michael Jordan4
Sewoong Oh4
Shuicheng YAN4
Stefanie Jegelka4
Alessandro Lazaric3
Andrea Montanari3

Impactful Papers

Papers from NeurIPS 2014 that shaped research clusters.

Foundational

Influential

Papers

Title
Multitask learning meets tensor factorization: task imputation via convex optimization
Multivariate f-divergence Estimation With Confidence
Multivariate Regression with Calibration
Multi-View Perceptron: a Deep Model for Learning Face Identity and View Representations
Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms
Near-optimal Reinforcement Learning in Factored MDPs
Near-optimal sample compression for nearest neighbors
Near-Optimal-Sample Estimators for Spherical Gaussian Mixtures
Neural Word Embedding as Implicit Matrix Factorization
Neurons as Monte Carlo Samplers: Bayesian Inference and Learning in Spiking Networks
Neurons as Monte Carlo Samplers: Bayesian Inference and Learning in Spiking Networks
New Rules for Domain Independent Lifted MAP Inference
Non-convex Robust PCA
Nonparametric Bayesian inference on multivariate exponential families
Object Localization based on Structural SVM using Privileged Information
On a Theory of Nonparametric Pairwise Similarity for Clustering: Connecting Clustering to Classification
On Communication Cost of Distributed Statistical Estimation and Dimensionality
On Integrated Clustering and Outlier Detection
On Iterative Hard Thresholding Methods for High-dimensional M-Estimation
Online and Stochastic Gradient Methods for Non-decomposable Loss Functions
Online combinatorial optimization with stochastic decision sets and adversarial losses
Online Decision-Making in General Combinatorial Spaces
Online Optimization for Max-Norm Regularization
On Model Parallelization and Scheduling Strategies for Distributed Machine Learning
On Multiplicative Multitask Feature Learning
On Prior Distributions and Approximate Inference for Structured Variables
On Sparse Gaussian Chain Graph Models
On the Computational Efficiency of Training Neural Networks
On the Convergence Rate of Decomposable Submodular Function Minimization
On the Information Theoretic Limits of Learning Ising Models
On the Number of Linear Regions of Deep Neural Networks
On the relations of LFPs & Neural Spike Trains
On the Statistical Consistency of Plug-in Classifiers for Non-decomposable Performance Measures
Optimal decision-making with time-varying evidence reliability
Optimal Neural Codes for Control and Estimation
Optimal prior-dependent neural population codes under shared input noise
Optimal rates for k-NN density and mode estimation
Optimal Regret Minimization in Posted-Price Auctions with Strategic Buyers
Optimal Teaching for Limited-Capacity Human Learners
Optimistic Planning in Markov Decision Processes Using a Generative Model
Optimization Methods for Sparse Pseudo-Likelihood Graphical Model Selection
Optimizing Energy Production Using Policy Search and Predictive State Representations
Optimizing F-Measures by Cost-Sensitive Classification
Orbit Regularization
PAC-Bayesian AUC classification and scoring
Parallel Direction Method of Multipliers
Parallel Double Greedy Submodular Maximization
Parallel Feature Selection Inspired by Group Testing
Parallel Sampling of HDPs using Sub-Cluster Splits
Parallel Successive Convex Approximation for Nonsmooth Nonconvex Optimization

« prev Page 6/9 next »