Learning networks of stochastic differential equations

Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, NIPS 2010

Volumn , Issue , 2010, Pages

  Bento, José ^a   Ibrahimi, Morteza ^a   Montanari, Andrea ^b  

^a Stanford University   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Gaussian processes; Graphical models; Model selection and structure learning; Sparsity and feature selection

Indexed keywords

DEGREES OF FREEDOM (MECHANICS); DIFFERENTIAL EQUATIONS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

FEATURES SELECTION; GAUSSIAN PROCESSES; GRAPHICAL MODEL; LEARNING NETWORK; LINEAR MODELING; MODEL SELECTION; MODEL SELECTION AND STRUCTURE LEARNING; SPARSITY AND FEATURE SELECTION; STOCHASTIC DIFFERENTIAL EQUATIONS; STRUCTURE-LEARNING;

DIRECTED GRAPHS;

EID: 85162004913     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. D.T. Gillespie. Stochastic simulation of chemical kinetics. Annual Review of Physical Chemistry, 58:35-55, 2007.
2. D. Higham. Modeling and Simulating Chemical Reactions. SIAM Review, 50:347-368, 2008.
3. N.D.Lawrence et al., editor. Learning and Inference in Computational Systems Biology. MIT Press, 2010.
4. T. Toni, D. Welch, N. Strelkova, A. Ipsen, and M.P.H. Stumpf. Modeling and Simulating Chemical Reactions. J. R. Soc. Interface, 6:187-202, 2009.
5. K. Zhou, J.C. Doyle, and K. Glover. Robust and optimal control. Prentice Hall, 1996.
6. R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B (Methodological), 58(1):267-288, 1996.
7. D.L. Donoho. For most large underdetermined systems of equations, the minimal l1-norm near-solution approximates the sparsest near-solution. Communications on Pure and Applied Mathematics, 59(7):907-934, 2006.
8. D.L. Donoho. For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution. Communications on Pure and Applied Mathematics, 59(6):797-829, 2006.
9. T. Zhang. Some sharp performance bounds for least squares regression with L1 regularization. Annals of Statistics, 37:2109-2144, 2009.
10. M.J. Wainwright. Sharp thresholds for high-dimensional and noisy sparsity recovery using l1-constrained quadratic programming (Lasso). IEEE Trans. Information Theory, 55:2183-2202, 2009.
11. M.J. Wainwright, P. Ravikumar, and J.D. Lafferty. High-Dimensional Graphical Model Selection Using l-1-Regularized Logistic Regression. Advances in Neural Information Processing Systems, 19:1465, 2007.
12. P. Zhao and B. Yu. On model selection consistency of Lasso. The Journal of Machine Learning Research, 7:2541-2563, 2006.
13. J. Friedman, T. Hastie, and R. Tibshirani. Sparse inverse covariance estimation with the graphical lasso. Biostatistics, 9(3):432, 2008.
14. K. Ball, T.G. Kurtz, L. Popovic, and G. Rempala. Modeling and Simulating Chemical Reactions. Ann. Appl. Prob., 16:1925-1961, 2006.
15. G.A. Pavliotis and A.M. Stuart. Parameter estimation for multiscale diffusions. J. Stat. Phys., 127:741-781, 2007.
16. J. Songsiri, J. Dahl, and L. Vandenberghe. Graphical models of autoregressive processes. pages 89-116, 2010.
17. J. Songsiri and L. Vandenberghe. Topology selection in graphical models of autoregressive processes. Journal of Machine Learning Research, 2010. submitted.
18. F.R.K. Chung. Spectral Graph Theory. CBMS Regional Conference Series in Mathematics, 1997.
19. P. Ravikumar, M.J.Wainwright, and J. Lafferty. High-dimensional Ising model selection using l1-regularized logistic regression. Annals of Statistics, 2008.