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
Semi-supervised Learning with Deep Generative Models
Sensory Integration and Density Estimation
Sequence to Sequence Learning with Neural Networks
Sequential Monte Carlo for Graphical Models
SerialRank: Spectral Ranking using Seriation
Shape and Illumination from Shading using the Generic Viewpoint Assumption
Shaping Social Activity by Incentivizing Users
Signal Aggregate Constraints in Additive Factorial HMMs, with Application to Energy Disaggregation
Simple MAP Inference via Low-Rank Relaxations
Simultaneous Model Selection and Optimization through Parameter-free Stochastic Learning
Smoothed Gradients for Stochastic Variational Inference
Sparse Bayesian structure learning with dependent relevance determination priors
Sparse Multi-Task Reinforcement Learning
Sparse PCA via Covariance Thresholding
Sparse PCA with Oracle Property
Sparse Polynomial Learning and Graph Sketching
Sparse Random Feature Algorithm as Coordinate Descent in Hilbert Space
Sparse Space-Time Deconvolution for Calcium Image Analysis
Spatio-temporal Representations of Uncertainty in Spiking Neural Networks
Spectral Clustering of graphs with the Bethe Hessian
Spectral k-Support Norm Regularization
Spectral Learning of Mixture of Hidden Markov Models
Spectral Methods for Indian Buffet Process Inference
Spectral Methods for Supervised Topic Models
Spectral Methods meet EM: A Provably Optimal Algorithm for Crowdsourcing
Spike Frequency Adaptation Implements Anticipative Tracking in Continuous Attractor Neural Networks
Stochastic Gradient Descent, Weighted Sampling, and the Randomized Kaczmarz algorithm
Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards
Stochastic Network Design in Bidirected Trees
Stochastic Proximal Gradient Descent with Acceleration Techniques
Stochastic variational inference for hidden Markov models
Streaming, Memory Limited Algorithms for Community Detection
Structure learning of antiferromagnetic Ising models
Structure Regularization for Structured Prediction
Submodular Attribute Selection for Action Recognition in Video
Submodular meets Structured: Finding Diverse Subsets in Exponentially-Large Structured Item Sets
Subspace Embeddings for the Polynomial Kernel
Summarizing Topics: From Word Lists to Phrases
Testing Unfaithful Gaussian Graphical Models
The Bayesian Case Model: A Generative Approach for Case-Based Reasoning and Prototype Classification
The Blinded Bandit: Learning with Adaptive Feedback
The Infinite Mixture of Infinite Gaussian Mixtures
The Large Margin Mechanism for Differentially Private Maximization
The limits of squared Euclidean distance regularization
The Noisy Power Method: A Meta Algorithm with Applications
Tight Bounds for Influence in Diffusion Networks and Application to Bond Percolation and Epidemiology
Tight Continuous Relaxation of the Balanced k-Cut Problem
Tight convex relaxations for sparse matrix factorization
Tighten after Relax: Minimax-Optimal Sparse PCA in Polynomial Time
Time-Data Tradeoffs by Aggressive Smoothing

« prev Page 8/9 next »