{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:TWA4XMQSTNNBATXDGL2X7P2HO2","short_pith_number":"pith:TWA4XMQS","schema_version":"1.0","canonical_sha256":"9d81cbb2129b5a104ee332f57fbf477685ca833e595061364a9ee71305db99aa","source":{"kind":"arxiv","id":"1011.0472","version":1},"attestation_state":"computed","paper":{"title":"Regularized Risk Minimization by Nesterov's Accelerated Gradient Methods: Algorithmic Extensions and Empirical Studies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ankan Saha, S.V.N. Vishwanathan, Xinhua Zhang","submitted_at":"2010-11-01T23:41:35Z","abstract_excerpt":"Nesterov's accelerated gradient methods (AGM) have been successfully applied in many machine learning areas. However, their empirical performance on training max-margin models has been inferior to existing specialized solvers. In this paper, we first extend AGM to strongly convex and composite objective functions with Bregman style prox-functions. Our unifying framework covers both the $\\infty$-memory and 1-memory styles of AGM, tunes the Lipschiz constant adaptively, and bounds the duality gap. Then we demonstrate various ways to apply this framework of methods to a wide range of machine lear"},"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":"1011.0472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-11-01T23:41:35Z","cross_cats_sorted":[],"title_canon_sha256":"32fadd76c9594172d69e53b008552b7c33a31d69b23e5f8b3ce14158ecdc65fc","abstract_canon_sha256":"81b977d0b03ca5b36d081599cf9f0119a9c864faf479eb860e604f45588d6b5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:21.646016Z","signature_b64":"7rbRxvMB0abuI389oI8jsDgJjyXt30P8SLBQ1KWOAIM2n+VWGaDVhKGNN4+k98hrmxcZUg39dFoxXlot6wTFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d81cbb2129b5a104ee332f57fbf477685ca833e595061364a9ee71305db99aa","last_reissued_at":"2026-05-18T04:37:21.645353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:21.645353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regularized Risk Minimization by Nesterov's Accelerated Gradient Methods: Algorithmic Extensions and Empirical Studies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ankan Saha, S.V.N. Vishwanathan, Xinhua Zhang","submitted_at":"2010-11-01T23:41:35Z","abstract_excerpt":"Nesterov's accelerated gradient methods (AGM) have been successfully applied in many machine learning areas. However, their empirical performance on training max-margin models has been inferior to existing specialized solvers. In this paper, we first extend AGM to strongly convex and composite objective functions with Bregman style prox-functions. Our unifying framework covers both the $\\infty$-memory and 1-memory styles of AGM, tunes the Lipschiz constant adaptively, and bounds the duality gap. Then we demonstrate various ways to apply this framework of methods to a wide range of machine lear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0472","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":"1011.0472","created_at":"2026-05-18T04:37:21.645457+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.0472v1","created_at":"2026-05-18T04:37:21.645457+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0472","created_at":"2026-05-18T04:37:21.645457+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWA4XMQSTNNB","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWA4XMQSTNNBATXD","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWA4XMQS","created_at":"2026-05-18T12:26:15.391820+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/TWA4XMQSTNNBATXDGL2X7P2HO2","json":"https://pith.science/pith/TWA4XMQSTNNBATXDGL2X7P2HO2.json","graph_json":"https://pith.science/api/pith-number/TWA4XMQSTNNBATXDGL2X7P2HO2/graph.json","events_json":"https://pith.science/api/pith-number/TWA4XMQSTNNBATXDGL2X7P2HO2/events.json","paper":"https://pith.science/paper/TWA4XMQS"},"agent_actions":{"view_html":"https://pith.science/pith/TWA4XMQSTNNBATXDGL2X7P2HO2","download_json":"https://pith.science/pith/TWA4XMQSTNNBATXDGL2X7P2HO2.json","view_paper":"https://pith.science/paper/TWA4XMQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.0472&json=true","fetch_graph":"https://pith.science/api/pith-number/TWA4XMQSTNNBATXDGL2X7P2HO2/graph.json","fetch_events":"https://pith.science/api/pith-number/TWA4XMQSTNNBATXDGL2X7P2HO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWA4XMQSTNNBATXDGL2X7P2HO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWA4XMQSTNNBATXDGL2X7P2HO2/action/storage_attestation","attest_author":"https://pith.science/pith/TWA4XMQSTNNBATXDGL2X7P2HO2/action/author_attestation","sign_citation":"https://pith.science/pith/TWA4XMQSTNNBATXDGL2X7P2HO2/action/citation_signature","submit_replication":"https://pith.science/pith/TWA4XMQSTNNBATXDGL2X7P2HO2/action/replication_record"}},"created_at":"2026-05-18T04:37:21.645457+00:00","updated_at":"2026-05-18T04:37:21.645457+00:00"}