{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HGPBHWDYP6POC4IBHZUYBMZDLX","short_pith_number":"pith:HGPBHWDY","schema_version":"1.0","canonical_sha256":"399e13d8787f9ee171013e6980b3235df42b75c94c0a81ebb9534a9e455d1fdf","source":{"kind":"arxiv","id":"1703.04082","version":2},"attestation_state":"computed","paper":{"title":"Sequential Local Learning for Latent Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eunho Yang, Jinwoo Shin, Sejun Park","submitted_at":"2017-03-12T08:18:11Z","abstract_excerpt":"Learning parameters of latent graphical models (GM) is inherently much harder than that of no-latent ones since the latent variables make the corresponding log-likelihood non-concave. Nevertheless, expectation-maximization schemes are popularly used in practice, but they are typically stuck in local optima. In the recent years, the method of moments have provided a refreshing angle for resolving the non-convex issue, but it is applicable to a quite limited class of latent GMs. In this paper, we aim for enhancing its power via enlarging such a class of latent GMs. To this end, we introduce two "},"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":"1703.04082","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-12T08:18:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bdae2c95ce4683dd8140415f99be71264528b1a4aa2fd724b273c99949fe955b","abstract_canon_sha256":"ab125b216be5ff2a3305b8d166f3f585997388de037cc15f53d1a0732496a8f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:34.806822Z","signature_b64":"H1PQ83AST6bN3sEWfKaQkR+VYyUyvNu1LI1LWkInrFvsZ3HLkvwEoJA/qJxncFBEu0YZLW0dVVElnamijWqGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"399e13d8787f9ee171013e6980b3235df42b75c94c0a81ebb9534a9e455d1fdf","last_reissued_at":"2026-05-18T00:48:34.806242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:34.806242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Local Learning for Latent Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eunho Yang, Jinwoo Shin, Sejun Park","submitted_at":"2017-03-12T08:18:11Z","abstract_excerpt":"Learning parameters of latent graphical models (GM) is inherently much harder than that of no-latent ones since the latent variables make the corresponding log-likelihood non-concave. Nevertheless, expectation-maximization schemes are popularly used in practice, but they are typically stuck in local optima. In the recent years, the method of moments have provided a refreshing angle for resolving the non-convex issue, but it is applicable to a quite limited class of latent GMs. In this paper, we aim for enhancing its power via enlarging such a class of latent GMs. To this end, we introduce two "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04082","kind":"arxiv","version":2},"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":"1703.04082","created_at":"2026-05-18T00:48:34.806336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.04082v2","created_at":"2026-05-18T00:48:34.806336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04082","created_at":"2026-05-18T00:48:34.806336+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGPBHWDYP6PO","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGPBHWDYP6POC4IB","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGPBHWDY","created_at":"2026-05-18T12:31:18.294218+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/HGPBHWDYP6POC4IBHZUYBMZDLX","json":"https://pith.science/pith/HGPBHWDYP6POC4IBHZUYBMZDLX.json","graph_json":"https://pith.science/api/pith-number/HGPBHWDYP6POC4IBHZUYBMZDLX/graph.json","events_json":"https://pith.science/api/pith-number/HGPBHWDYP6POC4IBHZUYBMZDLX/events.json","paper":"https://pith.science/paper/HGPBHWDY"},"agent_actions":{"view_html":"https://pith.science/pith/HGPBHWDYP6POC4IBHZUYBMZDLX","download_json":"https://pith.science/pith/HGPBHWDYP6POC4IBHZUYBMZDLX.json","view_paper":"https://pith.science/paper/HGPBHWDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.04082&json=true","fetch_graph":"https://pith.science/api/pith-number/HGPBHWDYP6POC4IBHZUYBMZDLX/graph.json","fetch_events":"https://pith.science/api/pith-number/HGPBHWDYP6POC4IBHZUYBMZDLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGPBHWDYP6POC4IBHZUYBMZDLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGPBHWDYP6POC4IBHZUYBMZDLX/action/storage_attestation","attest_author":"https://pith.science/pith/HGPBHWDYP6POC4IBHZUYBMZDLX/action/author_attestation","sign_citation":"https://pith.science/pith/HGPBHWDYP6POC4IBHZUYBMZDLX/action/citation_signature","submit_replication":"https://pith.science/pith/HGPBHWDYP6POC4IBHZUYBMZDLX/action/replication_record"}},"created_at":"2026-05-18T00:48:34.806336+00:00","updated_at":"2026-05-18T00:48:34.806336+00:00"}