{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OJKWBCG6SAUPZ7KU45XSEGRLYZ","short_pith_number":"pith:OJKWBCG6","schema_version":"1.0","canonical_sha256":"72556088de9028fcfd54e76f221a2bc649707b76d04ca5a488b9dda0ad553ff0","source":{"kind":"arxiv","id":"1306.3721","version":2},"attestation_state":"computed","paper":{"title":"Online Alternating Direction Method (longer version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Arindam Banerjee, Huahua Wang","submitted_at":"2013-06-17T01:27:10Z","abstract_excerpt":"Online optimization has emerged as powerful tool in large scale optimization. In this pa- per, we introduce efficient online optimization algorithms based on the alternating direction method (ADM), which can solve online convex optimization under linear constraints where the objective could be non-smooth. We introduce new proof techniques for ADM in the batch setting, which yields a O(1/T) convergence rate for ADM and forms the basis for regret anal- ysis in the online setting. We consider two scenarios in the online setting, based on whether an additional Bregman divergence is needed or not. "},"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":"1306.3721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-06-17T01:27:10Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c9d428ddc2261cda69a8ff4e9b0e80cbacb99a79d8faa16131a60a0efa389ef8","abstract_canon_sha256":"71207173dc8493a62bebe7eb8c27bb4c2d46bd2c140236068d94cef9c42cde69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:51.115964Z","signature_b64":"qdbLg1mEfxxLpcFmaDKPsyWKUziJjchymokdOlQCLAC0gnrOYsLS6fG+YjeWryQn3nrl4JrnniVvXu2AETbLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72556088de9028fcfd54e76f221a2bc649707b76d04ca5a488b9dda0ad553ff0","last_reissued_at":"2026-05-18T03:18:51.115456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:51.115456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Alternating Direction Method (longer version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Arindam Banerjee, Huahua Wang","submitted_at":"2013-06-17T01:27:10Z","abstract_excerpt":"Online optimization has emerged as powerful tool in large scale optimization. In this pa- per, we introduce efficient online optimization algorithms based on the alternating direction method (ADM), which can solve online convex optimization under linear constraints where the objective could be non-smooth. We introduce new proof techniques for ADM in the batch setting, which yields a O(1/T) convergence rate for ADM and forms the basis for regret anal- ysis in the online setting. We consider two scenarios in the online setting, based on whether an additional Bregman divergence is needed or not. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3721","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":"1306.3721","created_at":"2026-05-18T03:18:51.115543+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.3721v2","created_at":"2026-05-18T03:18:51.115543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3721","created_at":"2026-05-18T03:18:51.115543+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJKWBCG6SAUP","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJKWBCG6SAUPZ7KU","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJKWBCG6","created_at":"2026-05-18T12:27:54.935989+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/OJKWBCG6SAUPZ7KU45XSEGRLYZ","json":"https://pith.science/pith/OJKWBCG6SAUPZ7KU45XSEGRLYZ.json","graph_json":"https://pith.science/api/pith-number/OJKWBCG6SAUPZ7KU45XSEGRLYZ/graph.json","events_json":"https://pith.science/api/pith-number/OJKWBCG6SAUPZ7KU45XSEGRLYZ/events.json","paper":"https://pith.science/paper/OJKWBCG6"},"agent_actions":{"view_html":"https://pith.science/pith/OJKWBCG6SAUPZ7KU45XSEGRLYZ","download_json":"https://pith.science/pith/OJKWBCG6SAUPZ7KU45XSEGRLYZ.json","view_paper":"https://pith.science/paper/OJKWBCG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.3721&json=true","fetch_graph":"https://pith.science/api/pith-number/OJKWBCG6SAUPZ7KU45XSEGRLYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/OJKWBCG6SAUPZ7KU45XSEGRLYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJKWBCG6SAUPZ7KU45XSEGRLYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJKWBCG6SAUPZ7KU45XSEGRLYZ/action/storage_attestation","attest_author":"https://pith.science/pith/OJKWBCG6SAUPZ7KU45XSEGRLYZ/action/author_attestation","sign_citation":"https://pith.science/pith/OJKWBCG6SAUPZ7KU45XSEGRLYZ/action/citation_signature","submit_replication":"https://pith.science/pith/OJKWBCG6SAUPZ7KU45XSEGRLYZ/action/replication_record"}},"created_at":"2026-05-18T03:18:51.115543+00:00","updated_at":"2026-05-18T03:18:51.115543+00:00"}