{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EIU66ZIY42XB3RTQ4NRQ5FQ7GS","short_pith_number":"pith:EIU66ZIY","schema_version":"1.0","canonical_sha256":"2229ef6518e6ae1dc670e3630e961f34ae02395c404a8fba2d1c340b611a8bb9","source":{"kind":"arxiv","id":"1406.4445","version":2},"attestation_state":"computed","paper":{"title":"RAPID: Rapidly Accelerated Proximal Gradient Algorithms for Convex Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Venkatesh Saligrama, Ziming Zhang","submitted_at":"2014-06-13T20:08:58Z","abstract_excerpt":"In this paper, we propose a new algorithm to speed-up the convergence of accelerated proximal gradient (APG) methods. In order to minimize a convex function $f(\\mathbf{x})$, our algorithm introduces a simple line search step after each proximal gradient step in APG so that a biconvex function $f(\\theta\\mathbf{x})$ is minimized over scalar variable $\\theta>0$ while fixing variable $\\mathbf{x}$. We propose two new ways of constructing the auxiliary variables in APG based on the intermediate solutions of the proximal gradient and the line search steps. We prove that at arbitrary iteration step $t"},"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":"1406.4445","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-13T20:08:58Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"9d0a47e758035365f067078c857f6c0600667fa7f83748eebd9a3fcef188ae63","abstract_canon_sha256":"65d3101cddc0ea210d4a1f51349eb643d957076630cc2e2010092bb084ea3c4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:31.338303Z","signature_b64":"dOsFHJSFfVMnVv8FZFsj4ZGZQqjqQ1qHcJV7r5QqOLi65XFWnOfjuCMRIBWvsS++sbVsXvcd1++TO0/KFPpyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2229ef6518e6ae1dc670e3630e961f34ae02395c404a8fba2d1c340b611a8bb9","last_reissued_at":"2026-05-18T02:49:31.337924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:31.337924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RAPID: Rapidly Accelerated Proximal Gradient Algorithms for Convex Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Venkatesh Saligrama, Ziming Zhang","submitted_at":"2014-06-13T20:08:58Z","abstract_excerpt":"In this paper, we propose a new algorithm to speed-up the convergence of accelerated proximal gradient (APG) methods. In order to minimize a convex function $f(\\mathbf{x})$, our algorithm introduces a simple line search step after each proximal gradient step in APG so that a biconvex function $f(\\theta\\mathbf{x})$ is minimized over scalar variable $\\theta>0$ while fixing variable $\\mathbf{x}$. We propose two new ways of constructing the auxiliary variables in APG based on the intermediate solutions of the proximal gradient and the line search steps. We prove that at arbitrary iteration step $t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4445","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":"1406.4445","created_at":"2026-05-18T02:49:31.337975+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.4445v2","created_at":"2026-05-18T02:49:31.337975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4445","created_at":"2026-05-18T02:49:31.337975+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIU66ZIY42XB","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIU66ZIY42XB3RTQ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIU66ZIY","created_at":"2026-05-18T12:28:25.294606+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/EIU66ZIY42XB3RTQ4NRQ5FQ7GS","json":"https://pith.science/pith/EIU66ZIY42XB3RTQ4NRQ5FQ7GS.json","graph_json":"https://pith.science/api/pith-number/EIU66ZIY42XB3RTQ4NRQ5FQ7GS/graph.json","events_json":"https://pith.science/api/pith-number/EIU66ZIY42XB3RTQ4NRQ5FQ7GS/events.json","paper":"https://pith.science/paper/EIU66ZIY"},"agent_actions":{"view_html":"https://pith.science/pith/EIU66ZIY42XB3RTQ4NRQ5FQ7GS","download_json":"https://pith.science/pith/EIU66ZIY42XB3RTQ4NRQ5FQ7GS.json","view_paper":"https://pith.science/paper/EIU66ZIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.4445&json=true","fetch_graph":"https://pith.science/api/pith-number/EIU66ZIY42XB3RTQ4NRQ5FQ7GS/graph.json","fetch_events":"https://pith.science/api/pith-number/EIU66ZIY42XB3RTQ4NRQ5FQ7GS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIU66ZIY42XB3RTQ4NRQ5FQ7GS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIU66ZIY42XB3RTQ4NRQ5FQ7GS/action/storage_attestation","attest_author":"https://pith.science/pith/EIU66ZIY42XB3RTQ4NRQ5FQ7GS/action/author_attestation","sign_citation":"https://pith.science/pith/EIU66ZIY42XB3RTQ4NRQ5FQ7GS/action/citation_signature","submit_replication":"https://pith.science/pith/EIU66ZIY42XB3RTQ4NRQ5FQ7GS/action/replication_record"}},"created_at":"2026-05-18T02:49:31.337975+00:00","updated_at":"2026-05-18T02:49:31.337975+00:00"}