A convex formulation for learning scale-free networks via submodular relaxation

Advances in Neural Information Processing Systems

Volumn 2, Issue , 2012, Pages 1250-1258

  Defazio, Aaron J ^a   Caetano, Tiberio S ^a,b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION PROBLEMS; CONVEX RELAXATION; GAUSSIAN GRAPHICAL MODELS; NETWORK STRUCTURES; SCALE FREE NETWORKS; STRUCTURED SPARSITIES; SUBMODULAR FUNCTIONS; TRACTABLE CLASS;

CONVEX OPTIMIZATION;

RELAXATION PROCESSES;

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

References (22)

1. Francis Bach. Convex analysis and optimization with submodular functions: a tutorial. Technical report, INRIA, 2010.
2. Francis Bach. Structured sparsity-inducing norms through submodular functions. NIPS, 2010.
3. Francis Bach, Rodolphe Jenatton, Julien Mairal, and Guillaume Obozinski. Optimization with sparsityinducing penalties. Foundations and Trends in Machine Learning, 2012.
4. Albert-Laszlo Barabasi and Reka Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999.
5. Moshen Bayati, Jeong Han Kim, and Amin Saberi. A sequential algorithm for generating random graphs. Algorithmica, 58, 2009.
6. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3, 2011.
7. Emmanuel J. Candes, Michael B. Wakin, and Stephen P. Boyd. Enhancing sparsity by reweighted l1 minimization. Journal of Fourier Analysis and Applications, 2008.
8. A. P. Dempster. Covariance selection. Biometrics, 28:157-175, 1972.
9. Adrian Dobra, Chris Hans, Beatrix Jones, Joseph R Nevins, and Mike West. Sparse graphical models for exploring gene expression data. Journal of Multivariate Analysis, 2004.
10. Jerome Friedman, Trevor Hastie, and Robert Tibshirani. Sparse inverse covariance estimation with the graphical lasso. Biostatistics, 2007.
11. Saruto Fujishige. Submodular Functions and Optimization. Elsevier, 2005.
12. Rodolphe Jenatton, Julien Mairal, Guillaume Obozinski, and Francis Bach. Proximal methods for sparse hierarchical dictionary learning. ICML, 2010.
13. Rodolphe Jenatton, Guillaume Obozinski, and Francis Bach. Structured sparse principal component analysis. AISTATS, 2010.
14. Qiang Liu and Alexander Ihler. Learning scale free networks by reweighted l1 regularization. AISTATS, 2011.
15. Zhaosong Lu. Smooth optimization approach for sparse covariance selection. SIAM J. Optim., 2009.
16. Zachary M. Saul and Vladimir Filkov. Exploring biological network structure using exponential random graph models. Bioinformatics, 2007.
17. Katya Scheinberg and Shiqian Ma. Optimization for Machine Learning, chapter 17. optimization methods for sparse inverse covariance selection. MIT Press, 2011.
18. Katya Scheinbert, Shiqian Ma, and Donald Goldfarb. Sparse inverse covariance selection via alternating linearization methods. In NIPS, 2010.
19. T. Snijders. Markov chain monte carlo estimation of exponential random graph models. Journal of Social Structure, 2002.
20. Tom A.B. Snijders, Philippa E. Pattison, and Mark S. Handcock. New specifications for exponential random graph models. Technical report, University of Washington, 2004.
21. Alan Terry. Exponential random graphs. Master's thesis, University of York, 2005.
22. M. Yuan and Y. Lin. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society, 2007.