NeurIPS 2008

256 papers

Top Research Directions

Research directions most represented by NeurIPS 2008 papers.

Scaling Gaussian Processes Beyond Cubic Complexity 9
Variational Inference as an Optimization Problem 6
Overcoming the Cubic Complexity of Kernel Methods 5
Understanding and Tightening Variational Bounds 4
Divisive Normalization for Adaptive Gain Control 3
Implementing Bayesian Inference in Biological Neural Circuits 3
Modeling Non-Gaussian Noise in Neural Activity 3
Sample Complexity Scaling in Graphical Model Recovery 3
Active Set Optimization for High Dimensional Sparse Learning 3
Non-linear Modeling of Neural Population Dynamics 3
Semidefinite Relaxation for Non-Convex Engineering Optimization 3
Nonparametric Latent Feature Discovery 3
Nonparametric Bayesian Methods for Adaptive Clustering 3
Global Optimization for Decision Tree Induction 3
Differentiable Relaxations for Sorting and Ranking 3

Top Authors

AuthorPapers
Bernhard Schölkopf7
Michael Jordan6
Francis Bach5
Thomas L. Griffiths5
Yee Whye Teh5
Alex Smola4
Geoffrey Hinton4
Jan Peters4
Arthur Gretton3
Bin Yu3
Csaba Szepesvari3
David Blei3
Iain Murray3
Nicolas Vayatis3
Peter Dayan3
Pradeep Kumar Ravikumar3
Remi Munos3
Richard Zemel3
Rong Jin3
Sethu Vijayakumar3

Impactful Papers

Papers from NeurIPS 2008 that shaped research clusters.

Foundational

Influential

Papers

Title
Multiscale Random Fields with Application to Contour Grouping
Multi-stage Convex Relaxation for Learning with Sparse Regularization
Multi-task Gaussian Process Learning of Robot Inverse Dynamics
Natural Image Denoising with Convolutional Networks
Near-minimax recursive density estimation on the binary hypercube
Near-optimal Regret Bounds for Reinforcement Learning
Nonlinear causal discovery with additive noise models
Nonparametric Bayesian Learning of Switching Linear Dynamical Systems
Nonparametric regression and classification with joint sparsity constraints
Non-parametric Regression Between Manifolds
Nonparametric sparse hierarchical models describe V1 fMRI responses to natural images
Nonrigid Structure from Motion in Trajectory Space
Non-stationary dynamic Bayesian networks
Offline Handwriting Recognition with Multidimensional Recurrent Neural Networks
On Bootstrapping the ROC Curve
On Computational Power and the Order-Chaos Phase Transition in Reservoir Computing
One sketch for all: Theory and Application of Conditional Random Sampling
Online Metric Learning and Fast Similarity Search
Online Models for Content Optimization
Online Optimization in X-Armed Bandits
Online Prediction on Large Diameter Graphs
On the asymptotic equivalence between differential Hebbian and temporal difference learning using a local third factor
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
On the Design of Loss Functions for Classification: theory, robustness to outliers, and SavageBoost
On the Efficient Minimization of Classification Calibrated Surrogates
On the Generalization Ability of Online Strongly Convex Programming Algorithms
On the Reliability of Clustering Stability in the Large Sample Regime
Optimal Response Initiation: Why Recent Experience Matters
Optimization on a Budget: A Reinforcement Learning Approach
Overlaying classifiers: a practical approach for optimal ranking
Partially Observed Maximum Entropy Discrimination Markov Networks
Particle Filter-based Policy Gradient in POMDPs
Performance analysis for L_2 kernel classification
Phase transitions for high-dimensional joint support recovery
Playing Pinball with non-invasive BCI
Policy Search for Motor Primitives in Robotics
Posterior Consistency of the Silverman g-prior in Bayesian Model Choice
Predicting the Geometry of Metal Binding Sites from Protein Sequence
Predictive Indexing for Fast Search
Privacy-preserving logistic regression
Probabilistic detection of short events, with application to critical care monitoring
PSDBoost: Matrix-Generation Linear Programming for Positive Semidefinite Matrices Learning
Psychiatry: Insights into depression through normative decision-making models
QUIC-SVD: Fast SVD Using Cosine Trees
Rademacher Complexity Bounds for Non-I.I.D. Processes
Reconciling Real Scores with Binary Comparisons: A New Logistic Based Model for Ranking
Recursive Segmentation and Recognition Templates for 2D Parsing
Reducing statistical dependencies in natural signals using radial Gaussianization
Regularized Co-Clustering with Dual Supervision
Regularized Learning with Networks of Features

« prev Page 4/6 next »