{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QD4WHNUIWVVJS7NZINCOYU6MWQ","short_pith_number":"pith:QD4WHNUI","schema_version":"1.0","canonical_sha256":"80f963b688b56a997db94344ec53ccb429557535db396304b6fb44df80dca6ab","source":{"kind":"arxiv","id":"1706.04632","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Gradient MCMC Methods for Hidden Markov Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Emily B. Fox, Nicholas J. Foti, Yi-An Ma","submitted_at":"2017-06-14T18:44:29Z","abstract_excerpt":"Stochastic gradient MCMC (SG-MCMC) algorithms have proven useful in scaling Bayesian inference to large datasets under an assumption of i.i.d data. We instead develop an SG-MCMC algorithm to learn the parameters of hidden Markov models (HMMs) for time-dependent data. There are two challenges to applying SG-MCMC in this setting: The latent discrete states, and needing to break dependencies when considering minibatches. We consider a marginal likelihood representation of the HMM and propose an algorithm that harnesses the inherent memory decay of the process. We demonstrate the effectiveness of "},"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":"1706.04632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-14T18:44:29Z","cross_cats_sorted":[],"title_canon_sha256":"8b06ecd9f5311ae8f4132389ade5b0e01ec0b0d625b65df68979de5f7c1c5930","abstract_canon_sha256":"e133a237d7af7f5b5ad2aa4368dfc27786296a26f435d149123fa055f228b8c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:19.470712Z","signature_b64":"US4hlC0JGrkD13zPOrnZJZttBo98RnzOHLOgB/h2v6cCRlUBp2xm8yB+esQubaDFdMgKvMZAz6CP0xm9zhFuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80f963b688b56a997db94344ec53ccb429557535db396304b6fb44df80dca6ab","last_reissued_at":"2026-05-18T00:42:19.470241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:19.470241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Gradient MCMC Methods for Hidden Markov Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Emily B. Fox, Nicholas J. Foti, Yi-An Ma","submitted_at":"2017-06-14T18:44:29Z","abstract_excerpt":"Stochastic gradient MCMC (SG-MCMC) algorithms have proven useful in scaling Bayesian inference to large datasets under an assumption of i.i.d data. We instead develop an SG-MCMC algorithm to learn the parameters of hidden Markov models (HMMs) for time-dependent data. There are two challenges to applying SG-MCMC in this setting: The latent discrete states, and needing to break dependencies when considering minibatches. We consider a marginal likelihood representation of the HMM and propose an algorithm that harnesses the inherent memory decay of the process. We demonstrate the effectiveness of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04632","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":"1706.04632","created_at":"2026-05-18T00:42:19.470314+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04632v1","created_at":"2026-05-18T00:42:19.470314+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04632","created_at":"2026-05-18T00:42:19.470314+00:00"},{"alias_kind":"pith_short_12","alias_value":"QD4WHNUIWVVJ","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QD4WHNUIWVVJS7NZ","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QD4WHNUI","created_at":"2026-05-18T12:31:37.085036+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/QD4WHNUIWVVJS7NZINCOYU6MWQ","json":"https://pith.science/pith/QD4WHNUIWVVJS7NZINCOYU6MWQ.json","graph_json":"https://pith.science/api/pith-number/QD4WHNUIWVVJS7NZINCOYU6MWQ/graph.json","events_json":"https://pith.science/api/pith-number/QD4WHNUIWVVJS7NZINCOYU6MWQ/events.json","paper":"https://pith.science/paper/QD4WHNUI"},"agent_actions":{"view_html":"https://pith.science/pith/QD4WHNUIWVVJS7NZINCOYU6MWQ","download_json":"https://pith.science/pith/QD4WHNUIWVVJS7NZINCOYU6MWQ.json","view_paper":"https://pith.science/paper/QD4WHNUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04632&json=true","fetch_graph":"https://pith.science/api/pith-number/QD4WHNUIWVVJS7NZINCOYU6MWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/QD4WHNUIWVVJS7NZINCOYU6MWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QD4WHNUIWVVJS7NZINCOYU6MWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QD4WHNUIWVVJS7NZINCOYU6MWQ/action/storage_attestation","attest_author":"https://pith.science/pith/QD4WHNUIWVVJS7NZINCOYU6MWQ/action/author_attestation","sign_citation":"https://pith.science/pith/QD4WHNUIWVVJS7NZINCOYU6MWQ/action/citation_signature","submit_replication":"https://pith.science/pith/QD4WHNUIWVVJS7NZINCOYU6MWQ/action/replication_record"}},"created_at":"2026-05-18T00:42:19.470314+00:00","updated_at":"2026-05-18T00:42:19.470314+00:00"}