{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KADXWCHJLCD4EV2VRUO3BQDPSE","short_pith_number":"pith:KADXWCHJ","schema_version":"1.0","canonical_sha256":"50077b08e95887c257558d1db0c06f912938798fee33df2e32cb27d989dc0f1d","source":{"kind":"arxiv","id":"1912.10155","version":1},"attestation_state":"computed","paper":{"title":"Finite-Time Performance of Distributed Two-Time-Scale Stochastic Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Justin Romberg, Thinh T. Doan","submitted_at":"2019-12-21T00:51:47Z","abstract_excerpt":"Two-time-scale stochastic approximation is a popular iterative method for finding the solution of a system of two equations. Such methods have found broad applications in many areas, especially in machine learning and reinforcement learning. In this paper, we propose a distributed variant of this method over a network of agents, where the agents use two graphs representing their communication at different speeds due to the nature of their two-time-scale updates. Our main contribution is to provide a finite-time analysis for the performance of the proposed method. In particular, we establish an"},"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":"1912.10155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-21T00:51:47Z","cross_cats_sorted":[],"title_canon_sha256":"32ff09748e8be0267affa1a6d3ef85feadc5f741fe2cf8ff1c6acfb3cfc730f8","abstract_canon_sha256":"1ac2cb296dc764d038842ff39fe29cb1e25ef1df6be053d1af7f166be28f6b21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:27:47.328531Z","signature_b64":"YN8bUwfVLy4VH33ibFbrihzJSM69Nl8wNi8vpuDsXE6LFrEQ6cd6xnrIuw0iYmuAbbz9WED6GgOcAq6mj/7RDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50077b08e95887c257558d1db0c06f912938798fee33df2e32cb27d989dc0f1d","last_reissued_at":"2026-07-05T00:27:47.328156Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:27:47.328156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite-Time Performance of Distributed Two-Time-Scale Stochastic Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Justin Romberg, Thinh T. Doan","submitted_at":"2019-12-21T00:51:47Z","abstract_excerpt":"Two-time-scale stochastic approximation is a popular iterative method for finding the solution of a system of two equations. Such methods have found broad applications in many areas, especially in machine learning and reinforcement learning. In this paper, we propose a distributed variant of this method over a network of agents, where the agents use two graphs representing their communication at different speeds due to the nature of their two-time-scale updates. Our main contribution is to provide a finite-time analysis for the performance of the proposed method. In particular, we establish an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.10155","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.10155/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1912.10155","created_at":"2026-07-05T00:27:47.328204+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.10155v1","created_at":"2026-07-05T00:27:47.328204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.10155","created_at":"2026-07-05T00:27:47.328204+00:00"},{"alias_kind":"pith_short_12","alias_value":"KADXWCHJLCD4","created_at":"2026-07-05T00:27:47.328204+00:00"},{"alias_kind":"pith_short_16","alias_value":"KADXWCHJLCD4EV2V","created_at":"2026-07-05T00:27:47.328204+00:00"},{"alias_kind":"pith_short_8","alias_value":"KADXWCHJ","created_at":"2026-07-05T00:27:47.328204+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.02805","citing_title":"Fast Multi-Agent Temporal-Difference Learning via Homotopy Stochastic Primal-Dual Optimization","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KADXWCHJLCD4EV2VRUO3BQDPSE","json":"https://pith.science/pith/KADXWCHJLCD4EV2VRUO3BQDPSE.json","graph_json":"https://pith.science/api/pith-number/KADXWCHJLCD4EV2VRUO3BQDPSE/graph.json","events_json":"https://pith.science/api/pith-number/KADXWCHJLCD4EV2VRUO3BQDPSE/events.json","paper":"https://pith.science/paper/KADXWCHJ"},"agent_actions":{"view_html":"https://pith.science/pith/KADXWCHJLCD4EV2VRUO3BQDPSE","download_json":"https://pith.science/pith/KADXWCHJLCD4EV2VRUO3BQDPSE.json","view_paper":"https://pith.science/paper/KADXWCHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.10155&json=true","fetch_graph":"https://pith.science/api/pith-number/KADXWCHJLCD4EV2VRUO3BQDPSE/graph.json","fetch_events":"https://pith.science/api/pith-number/KADXWCHJLCD4EV2VRUO3BQDPSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KADXWCHJLCD4EV2VRUO3BQDPSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KADXWCHJLCD4EV2VRUO3BQDPSE/action/storage_attestation","attest_author":"https://pith.science/pith/KADXWCHJLCD4EV2VRUO3BQDPSE/action/author_attestation","sign_citation":"https://pith.science/pith/KADXWCHJLCD4EV2VRUO3BQDPSE/action/citation_signature","submit_replication":"https://pith.science/pith/KADXWCHJLCD4EV2VRUO3BQDPSE/action/replication_record"}},"created_at":"2026-07-05T00:27:47.328204+00:00","updated_at":"2026-07-05T00:27:47.328204+00:00"}