{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CE2QWWFPRK64TICGGJRPAV2U63","short_pith_number":"pith:CE2QWWFP","schema_version":"1.0","canonical_sha256":"11350b58af8abdc9a0463262f05754f6c4ca85a28e5c49bd0ee39cea0a01336d","source":{"kind":"arxiv","id":"1702.08651","version":1},"attestation_state":"computed","paper":{"title":"Speeding Up Latent Variable Gaussian Graphical Model Estimation via Nonconvex Optimizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jian Ma, Pan Xu, Quanquan Gu","submitted_at":"2017-02-28T05:38:40Z","abstract_excerpt":"We study the estimation of the latent variable Gaussian graphical model (LVGGM), where the precision matrix is the superposition of a sparse matrix and a low-rank matrix. In order to speed up the estimation of the sparse plus low-rank components, we propose a sparsity constrained maximum likelihood estimator based on matrix factorization, and an efficient alternating gradient descent algorithm with hard thresholding to solve it. Our algorithm is orders of magnitude faster than the convex relaxation based methods for LVGGM. In addition, we prove that our algorithm is guaranteed to linearly conv"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1702.08651","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-28T05:38:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ffbc73a513450a141382f679902f7e047278655ccf17fe0d60781b874c69486b","abstract_canon_sha256":"9176e4301d22e16c02ab2212f470af2f76b4dacb0d6e89a7e3495c9e5081e0ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:48.187196Z","signature_b64":"xXT9Ak3TkDC9cMXb845oiDTRSI2fkj3zGpOvTrssBI5uBm7Xo5viFvbFBeresNaIiRzaSv3cGRDkbAyuUhgXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11350b58af8abdc9a0463262f05754f6c4ca85a28e5c49bd0ee39cea0a01336d","last_reissued_at":"2026-05-18T00:49:48.186646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:48.186646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speeding Up Latent Variable Gaussian Graphical Model Estimation via Nonconvex Optimizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jian Ma, Pan Xu, Quanquan Gu","submitted_at":"2017-02-28T05:38:40Z","abstract_excerpt":"We study the estimation of the latent variable Gaussian graphical model (LVGGM), where the precision matrix is the superposition of a sparse matrix and a low-rank matrix. In order to speed up the estimation of the sparse plus low-rank components, we propose a sparsity constrained maximum likelihood estimator based on matrix factorization, and an efficient alternating gradient descent algorithm with hard thresholding to solve it. Our algorithm is orders of magnitude faster than the convex relaxation based methods for LVGGM. In addition, we prove that our algorithm is guaranteed to linearly conv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08651","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.08651","created_at":"2026-05-18T00:49:48.186743+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.08651v1","created_at":"2026-05-18T00:49:48.186743+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08651","created_at":"2026-05-18T00:49:48.186743+00:00"},{"alias_kind":"pith_short_12","alias_value":"CE2QWWFPRK64","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CE2QWWFPRK64TICG","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CE2QWWFP","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CE2QWWFPRK64TICGGJRPAV2U63","json":"https://pith.science/pith/CE2QWWFPRK64TICGGJRPAV2U63.json","graph_json":"https://pith.science/api/pith-number/CE2QWWFPRK64TICGGJRPAV2U63/graph.json","events_json":"https://pith.science/api/pith-number/CE2QWWFPRK64TICGGJRPAV2U63/events.json","paper":"https://pith.science/paper/CE2QWWFP"},"agent_actions":{"view_html":"https://pith.science/pith/CE2QWWFPRK64TICGGJRPAV2U63","download_json":"https://pith.science/pith/CE2QWWFPRK64TICGGJRPAV2U63.json","view_paper":"https://pith.science/paper/CE2QWWFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.08651&json=true","fetch_graph":"https://pith.science/api/pith-number/CE2QWWFPRK64TICGGJRPAV2U63/graph.json","fetch_events":"https://pith.science/api/pith-number/CE2QWWFPRK64TICGGJRPAV2U63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CE2QWWFPRK64TICGGJRPAV2U63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CE2QWWFPRK64TICGGJRPAV2U63/action/storage_attestation","attest_author":"https://pith.science/pith/CE2QWWFPRK64TICGGJRPAV2U63/action/author_attestation","sign_citation":"https://pith.science/pith/CE2QWWFPRK64TICGGJRPAV2U63/action/citation_signature","submit_replication":"https://pith.science/pith/CE2QWWFPRK64TICGGJRPAV2U63/action/replication_record"}},"created_at":"2026-05-18T00:49:48.186743+00:00","updated_at":"2026-05-18T00:49:48.186743+00:00"}