{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GITKW4WEGGY476I6N6XVQLXVJI","short_pith_number":"pith:GITKW4WE","schema_version":"1.0","canonical_sha256":"3226ab72c431b1cff91e6faf582ef54a1de15fd6fada1b47fcbdb08fad10568c","source":{"kind":"arxiv","id":"1607.03815","version":2},"attestation_state":"computed","paper":{"title":"Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than $O(1/\\epsilon)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Qihang Lin, Tianbao Yang, Yan Yan, Yi Xu","submitted_at":"2016-07-13T16:20:52Z","abstract_excerpt":"In this paper, we develop a novel {\\bf ho}moto{\\bf p}y {\\bf s}moothing (HOPS) algorithm for solving a family of non-smooth problems that is composed of a non-smooth term with an explicit max-structure and a smooth term or a simple non-smooth term whose proximal mapping is easy to compute. The best known iteration complexity for solving such non-smooth optimization problems is $O(1/\\epsilon)$ without any assumption on the strong convexity. In this work, we will show that the proposed HOPS achieved a lower iteration complexity of $\\widetilde O(1/\\epsilon^{1-\\theta})$\\footnote{$\\widetilde O()$ su"},"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":"1607.03815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-13T16:20:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"32ca7e1bfbf38fd300ac85957f16127d51fa455e2ae376faa6c02219a5aac957","abstract_canon_sha256":"3687f61e0aec6f4ab132a81e1358b05fda5fe75eedac0b8c0ead5b0aa9bbd024"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:19.173170Z","signature_b64":"fO54+QWe4j1ELAudGJptp1huJ3L/WOXP9R4FS1iFuxemjFdPZTzhmVbBesk6J2u4EZrNkul9/LbNj5uw5ForBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3226ab72c431b1cff91e6faf582ef54a1de15fd6fada1b47fcbdb08fad10568c","last_reissued_at":"2026-05-18T01:00:19.172507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:19.172507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than $O(1/\\epsilon)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Qihang Lin, Tianbao Yang, Yan Yan, Yi Xu","submitted_at":"2016-07-13T16:20:52Z","abstract_excerpt":"In this paper, we develop a novel {\\bf ho}moto{\\bf p}y {\\bf s}moothing (HOPS) algorithm for solving a family of non-smooth problems that is composed of a non-smooth term with an explicit max-structure and a smooth term or a simple non-smooth term whose proximal mapping is easy to compute. The best known iteration complexity for solving such non-smooth optimization problems is $O(1/\\epsilon)$ without any assumption on the strong convexity. In this work, we will show that the proposed HOPS achieved a lower iteration complexity of $\\widetilde O(1/\\epsilon^{1-\\theta})$\\footnote{$\\widetilde O()$ su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03815","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":"1607.03815","created_at":"2026-05-18T01:00:19.172615+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03815v2","created_at":"2026-05-18T01:00:19.172615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03815","created_at":"2026-05-18T01:00:19.172615+00:00"},{"alias_kind":"pith_short_12","alias_value":"GITKW4WEGGY4","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GITKW4WEGGY476I6","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GITKW4WE","created_at":"2026-05-18T12:30:19.053100+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/GITKW4WEGGY476I6N6XVQLXVJI","json":"https://pith.science/pith/GITKW4WEGGY476I6N6XVQLXVJI.json","graph_json":"https://pith.science/api/pith-number/GITKW4WEGGY476I6N6XVQLXVJI/graph.json","events_json":"https://pith.science/api/pith-number/GITKW4WEGGY476I6N6XVQLXVJI/events.json","paper":"https://pith.science/paper/GITKW4WE"},"agent_actions":{"view_html":"https://pith.science/pith/GITKW4WEGGY476I6N6XVQLXVJI","download_json":"https://pith.science/pith/GITKW4WEGGY476I6N6XVQLXVJI.json","view_paper":"https://pith.science/paper/GITKW4WE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03815&json=true","fetch_graph":"https://pith.science/api/pith-number/GITKW4WEGGY476I6N6XVQLXVJI/graph.json","fetch_events":"https://pith.science/api/pith-number/GITKW4WEGGY476I6N6XVQLXVJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GITKW4WEGGY476I6N6XVQLXVJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GITKW4WEGGY476I6N6XVQLXVJI/action/storage_attestation","attest_author":"https://pith.science/pith/GITKW4WEGGY476I6N6XVQLXVJI/action/author_attestation","sign_citation":"https://pith.science/pith/GITKW4WEGGY476I6N6XVQLXVJI/action/citation_signature","submit_replication":"https://pith.science/pith/GITKW4WEGGY476I6N6XVQLXVJI/action/replication_record"}},"created_at":"2026-05-18T01:00:19.172615+00:00","updated_at":"2026-05-18T01:00:19.172615+00:00"}