Fast interior-point inference in high-dimensional sparse, penalized state-space models

No abstract is available for this paper.

• Publication year

  2012

• Venue

  International Conference on Artificial Intelligence and Statistics

• Publication date

  2012-03-21

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fast Singular Value Thresholding without Singular Value Decomposition

  2013cited by this paper
• Appendix to : Fast Kalman filtering and forward-backward smoothing via a low-rank perturbative approach

  2012cited by this paper
• Analysis of numerical methods

  2011cited by this paper
• Fast global convergence of gradient methods for high-dimensional statistical recovery

  2011cited by this paper
• Optimization Theory and Methods: Nonlinear Programming

  2010cited by this paper
• Convex optimization

  2010influential reference
• Methods for Sparse Signal Recovery Using Kalman Filtering With Embedded Pseudo-Measurement Norms and Quasi-Norms

  2010cited by this paper
• Tracking and smoothing of time-varying sparse signals via approximate belief propagation

  2010cited by this paper
• Viterbi Algorithm

  2010cited by this paper
• Fast Kalman filtering on quasilinear dendritic trees

  2010influential reference
• Templates for convex cone problems with applications to sparse signal recovery

  2010influential reference
• Dynamic Updating for $\ell_{1}$ Minimization

  2009cited by this paper
• Message-passing algorithms for compressed sensing

  2009cited by this paper
• Fast alternating linearization methods for minimizing the sum of two convex functions

  2009cited by this paper
• Reconstruction of Sparse Circuits Using Multi-neuronal Excitation (RESCUME)

  2009cited by this paper
• Improved classification images with sparse priors in a smooth basis.

  2009cited by this paper
• A Singular Value Thresholding Algorithm for Matrix Completion

  2008cited by this paper
• Regularized estimation of large covariance matrices

  2008cited by this paper
• Exact Matrix Completion via Convex Optimization

  2008cited by this paper
• Kalman filtered Compressed Sensing

  2008cited by this paper
• Fixed rank kriging for very large spatial data sets

  2008cited by this paper
• Eye position compensation improves estimates of response magnitude and receptive field geometry in alert monkeys.

  2007cited by this paper
• Model selection and estimation in regression with grouped variables

  2006cited by this paper
• Smooth minimization of non-smooth functions

  2005influential reference
• Sparsity and smoothness via the fused lasso

  2005cited by this paper
• Measuring V1 receptive fields despite eye movements in awake monkeys.

  2003cited by this paper
• A rank minimization heuristic with application to minimum order system approximation

  2001cited by this paper
• Large Deviations Techniques and Applications

  1998cited by this paper
• Globally Convergent Inexact Newton Methods

  1994cited by this paper
• On the limited memory BFGS method for large scale optimization

  1989cited by this paper
• The Laplacian Pyramid as a Compact Image Code

  1983cited by this paper
• INEXACT NEWTON METHODS

  1982cited by this paper

• High-resolution eye tracking using V1 neuron activity

  2014cites this paper
• Fast state-space methods for inferring dendritic synaptic connectivity

  2013influential citation
• Fast Spatiotemporal Smoothing of Calcium Measurements in Dendritic Trees

  2012cites this paper
• Appendix to : Fast Kalman filtering and forward-backward smoothing via a low-rank perturbative approach

  2012cites this paper
• Fast Kalman filtering via a low-rank perturbative approach

  2011cites this paper