{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NDF3K5K7YXSSHQEIXUSDN24JR4","short_pith_number":"pith:NDF3K5K7","schema_version":"1.0","canonical_sha256":"68cbb5755fc5e523c088bd2436eb898f140c375ab87a609623cc5ca0f1e725fb","source":{"kind":"arxiv","id":"1211.6013","version":2},"attestation_state":"computed","paper":{"title":"Online Stochastic Optimization with Multiple Objectives","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Mehrdad Mahdavi, Rong Jin, Tianbao Yang","submitted_at":"2012-11-26T16:27:18Z","abstract_excerpt":"In this paper we propose a general framework to characterize and solve the stochastic optimization problems with multiple objectives underlying many real world learning applications. We first propose a projection based algorithm which attains an $O(T^{-1/3})$ convergence rate. Then, by leveraging on the theory of Lagrangian in constrained optimization, we devise a novel primal-dual stochastic approximation algorithm which attains the optimal convergence rate of $O(T^{-1/2})$ for general Lipschitz continuous objectives."},"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":"1211.6013","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2012-11-26T16:27:18Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"301d27d33035aaa5d7af892901887611542424abf32b1c1fbca962568603f0c2","abstract_canon_sha256":"9a3824ec77fe01e2a7d5e5279a4aee697605da3b202a13a2c7e8cb1e42d24778"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:31.411731Z","signature_b64":"DPCU2uddU6ZuhquxRuHg1amXXD0nbOyDht9AOe0efGIhSWxvGdc8kTJG/y1FVdmKM+g56D7oihO1kTL2kNuRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68cbb5755fc5e523c088bd2436eb898f140c375ab87a609623cc5ca0f1e725fb","last_reissued_at":"2026-05-18T03:18:31.411161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:31.411161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Stochastic Optimization with Multiple Objectives","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Mehrdad Mahdavi, Rong Jin, Tianbao Yang","submitted_at":"2012-11-26T16:27:18Z","abstract_excerpt":"In this paper we propose a general framework to characterize and solve the stochastic optimization problems with multiple objectives underlying many real world learning applications. We first propose a projection based algorithm which attains an $O(T^{-1/3})$ convergence rate. Then, by leveraging on the theory of Lagrangian in constrained optimization, we devise a novel primal-dual stochastic approximation algorithm which attains the optimal convergence rate of $O(T^{-1/2})$ for general Lipschitz continuous objectives."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6013","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":"1211.6013","created_at":"2026-05-18T03:18:31.411247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.6013v2","created_at":"2026-05-18T03:18:31.411247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6013","created_at":"2026-05-18T03:18:31.411247+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDF3K5K7YXSS","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDF3K5K7YXSSHQEI","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDF3K5K7","created_at":"2026-05-18T12:27:16.716162+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/NDF3K5K7YXSSHQEIXUSDN24JR4","json":"https://pith.science/pith/NDF3K5K7YXSSHQEIXUSDN24JR4.json","graph_json":"https://pith.science/api/pith-number/NDF3K5K7YXSSHQEIXUSDN24JR4/graph.json","events_json":"https://pith.science/api/pith-number/NDF3K5K7YXSSHQEIXUSDN24JR4/events.json","paper":"https://pith.science/paper/NDF3K5K7"},"agent_actions":{"view_html":"https://pith.science/pith/NDF3K5K7YXSSHQEIXUSDN24JR4","download_json":"https://pith.science/pith/NDF3K5K7YXSSHQEIXUSDN24JR4.json","view_paper":"https://pith.science/paper/NDF3K5K7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.6013&json=true","fetch_graph":"https://pith.science/api/pith-number/NDF3K5K7YXSSHQEIXUSDN24JR4/graph.json","fetch_events":"https://pith.science/api/pith-number/NDF3K5K7YXSSHQEIXUSDN24JR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDF3K5K7YXSSHQEIXUSDN24JR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDF3K5K7YXSSHQEIXUSDN24JR4/action/storage_attestation","attest_author":"https://pith.science/pith/NDF3K5K7YXSSHQEIXUSDN24JR4/action/author_attestation","sign_citation":"https://pith.science/pith/NDF3K5K7YXSSHQEIXUSDN24JR4/action/citation_signature","submit_replication":"https://pith.science/pith/NDF3K5K7YXSSHQEIXUSDN24JR4/action/replication_record"}},"created_at":"2026-05-18T03:18:31.411247+00:00","updated_at":"2026-05-18T03:18:31.411247+00:00"}