Efficient Graph Laplacian Estimation by Proximal Newton

13 February 2023

Papers citing "Efficient Graph Laplacian Estimation by Proximal Newton"

12 / 12 papers shown

Title
Learning Multi-Attribute Differential Graphs with Non-Convex Penalties Jitendra K Tugnait 674 0 0 14 May 2025
Sparse Graph Learning Under Laplacian-Related Constraints Jitendra Tugnait 37 12 0 16 Nov 2021
Learning Sparse Graph with Minimax Concave Penalty under Gaussian Markov Random Fields Tatsuya Koyakumaru M. Yukawa Eduardo Pavez Antonio Ortega 42 8 0 17 Sep 2021
Effective Learning of a GMRF Mixture Model Shahaf E. Finder Eran Treister Oren Freifeld 28 5 0 18 May 2020
Structured Graph Learning Via Laplacian Spectral Constraints Sandeep Kumar Jiaxi Ying J. Cardoso Daniel P. Palomar 83 57 0 24 Sep 2019
Sparse Inverse Covariance Matrix Estimation Using Quadratic Approximation Cho-Jui Hsieh Mátyás A. Sustik Inderjit S. Dhillon Pradeep Ravikumar 39 344 0 13 Jun 2013
Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima Po-Ling Loh Martin J. Wainwright 174 516 0 10 May 2013
Iterative Thresholding Algorithm for Sparse Inverse Covariance Estimation D. Guillot B. Rajaratnam B. T. Rolfs A. Maleki Ian Wong 51 100 0 12 Nov 2012
Exact covariance thresholding into connected components for large-scale Graphical Lasso Rahul Mazumder Trevor Hastie 87 232 0 18 Aug 2011
Rejoinder: One-step sparse estimates in nonconcave penalized likelihood models H. Zou Runze Li 193 1,234 0 07 Aug 2008
Sparsistency and rates of convergence in large covariance matrix estimation Clifford Lam Jianqing Fan 162 608 0 26 Nov 2007
A Tutorial on Spectral Clustering U. V. Luxburg 177 10,497 0 01 Nov 2007