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

Journal of Machine Learning Research

Volumn 22, Issue , 2012, Pages 895-904

  Pnevmatikakis, Eftychios A ^a   Paninski, Liam ^a  

^a Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; INFERENCE ENGINES; ITERATIVE METHODS; STATE SPACE METHODS;

HIGH-DIMENSIONAL; LINEAR COMPLEXITY; MAXIMUM A POSTERIORI; NEWTON DIRECTIONS; SECOND-ORDER ALGORITHMS; SPECIAL STRUCTURE; STABILITY AND CONVERGENCE; STATE - SPACE MODELS;

ALGORITHMS;

EID: 84954474766     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (32)

1. Agarwal, A., Negahban, S., and Wainwright, M. (2011). Fast global convergence of gradient methods for high-dimensional statistical recovery. Arxiv preprint arXiv: 1104.4824.
2. Asif, S. and Romberg, J. (2010). Dynamic updating for l1 minimization. Selected Topics in Signal Processing, IEEE Journal of, 4 (2): 421-434.
3. Becker, S., Candès, E., and Grant, M. (2010). Templates for convex cone problems with applications to sparse signal recovery. Mathematical Programming Computation, 3 (3): 1-54.
4. Bickel, J. and Levina, E. (2008). Regularized estimation of large covariance matrices. Annals of Statistics, 36: 199-227.
5. Blei, D. and Lafferty, J. (2006). Dynamic topic models. In Proceedings of the 23rd international conference on Machine learning, pages 113-120. ACM.
6. Boyd, S. and Vandenberghe, L. (2004). Convex Optimization. Oxford University Press.
7. Burt, P. and Adelson, E. (1983). The Laplacian pyramid as a compact image code. Communications, IEEE Transactions on, 31 (4): 532-540.
8. Cai, J., Candes, E., and Shen, Z. (2010). A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20 (4): 1956-1982.
9. Cai, J. and Osher, S. (2010). Fast singular value thresholding without singular value decomposition. UCLA CAM Report, pages 10-24.
10. Candes, E. and Recht, B. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9 (6): 717-772.
11. Carmi, A., Gurfil, P., and Kanevsky, D. (2010). Methods for sparse signal recovery using kalman filtering with embedded pseudo-measurement norms and quasinorms. Signal Processing, IEEE Transactions on, 58 (4): 2405-2409.
12. Cressie, N. and Johannesson, G. (2008). Fixed rank kriging for very large spatial data sets. Journal Of The Royal Statistical Society Series B, 70: 209-226.
13. Dembo, R., Eisenstat, S., and Steihaug, T. (1982). Inexact Newton methods. SIAM Journal on Numerical analysis, 19 (2): 400-408.
14. Donoho, D., Maleki, A., and Montanari, A. (2009). Message-passing algorithms for compressed sensing. Proceedings of the National Academy of Sciences, 106 (45): 18914.
15. Eisenstat, S. and Walker, H. (1994). Globally convergent inexact Newton methods. SIAM Journal on Optimization, 4 (2): 393-422.
16. Fazel, M., Hindi, H., and Boyd, S. (2001). A rank minimization heuristic with application to minimum order system approximation. In American Control Conference, 2001. Proceedings of the 2001, volume 6, pages 4734-4739. IEEE.
17. Forney Jr, G. (1973). The Viterbi algorithm. Proceedings of the IEEE, 61 (3): 268-278.
18. Goldfarb, D., Ma, S., and Scheinberg, K. (2009). Fast alternating linearization methods for minimizing the sum of two convex functions. Arxiv preprint arXiv: 0912.4571.
19. Hu, T. and Chklovskii, D. (2009). Reconstruction of sparse circuits using multi-neuronal excitation (rescume). Advances in Neural Information Processing Systems, 22: 790-798.
20. Isaacson, E. and Keller, H. (1994). Analysis of numerical methods. Dover Publications.
21. Liu, D. and Nocedal, J. (1989). On the limited memory bfgs method for large scale optimization. Mathematical programming, 45 (1): 503-528.
22. Mineault, P., Barthelmé, S., and Pack, C. (2009). Improved classification images with sparse priors in a smooth basis. Journal of Vision, 9 (10).
23. Nesterov, Y. (2005). Smooth minimization of non-smooth functions. Mathematical Programming, 103 (1): 127-152.
24. Paninski, L. (2010). Fast Kalman filtering on quasilinear dendritic trees. Journal of Computational Neuroscience, 28: 211-28.
25. Read, J. and Cumming, B. (2003). Measuring V1 receptive fields despite eye movements in awake monkeys. J Neurophysiol, 90: 946-960.
26. Schmidt, M. (2011). minFunc. http://www.di.ens.fr/ mschmidt/Software/minFunc.html.
27. Sun, W. and Yuan, Y. (2006). Optimization Theory and Methods: Nonlinear Programming. Springer Verlag.
28. Tang, Y., Saul, A., Gur, M., Goei, S., Wong, E., Ersoy, B., and Snodderly, D. M. (2007). Eye position compensation improves estimates or response magnitude and receptive field geometry in alert monkeys. J Neurophysiol, 97: 3439-3448.
29. Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., and Knight, K. (2005). Sparsity and smoothness via the fused lasso. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 67 (1): 91-108.
30. Vaswani, N. (2008). Kalman filtered compressed sensing. In Image Processing, 2008. ICIP 2008. 15th IEEE International Conference on, pages 893-896. IEEE.
31. Yuan, M. and Lin, Y. (2006). Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 68 (1): 49-67.
32. Ziniel, J., Potter, L., and Schniter, P. (2010). Tracking and smoothing of time-varying sparse signals via approximate belief propagation. In Signals, Systems and Computers (ASILOMAR), 2010 Conference Record of the Forty Fourth Asilomar Conference on, pages 808-812. IEEE.