{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:D33XRV4F4SX7QREBLYRRWGXMNI","short_pith_number":"pith:D33XRV4F","schema_version":"1.0","canonical_sha256":"1ef778d785e4aff844815e231b1aec6a11dfed49079ad5f06c4bf5e0f7a4cb62","source":{"kind":"arxiv","id":"1307.1192","version":1},"attestation_state":"computed","paper":{"title":"AdaBoost and Forward Stagewise Regression are First-Order Convex Optimization Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Paul Grigas, Rahul Mazumder, Robert M. Freund","submitted_at":"2013-07-04T03:17:23Z","abstract_excerpt":"Boosting methods are highly popular and effective supervised learning methods which combine weak learners into a single accurate model with good statistical performance. In this paper, we analyze two well-known boosting methods, AdaBoost and Incremental Forward Stagewise Regression (FS$_\\varepsilon$), by establishing their precise connections to the Mirror Descent algorithm, which is a first-order method in convex optimization. As a consequence of these connections we obtain novel computational guarantees for these boosting methods. In particular, we characterize convergence bounds of AdaBoost"},"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":"1307.1192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-04T03:17:23Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"43fc8a5a7829ce8326c9f5004771435b8d349d13a39c88fb8e07efe68ec6a52a","abstract_canon_sha256":"1dcb26b193ff7a149eb3497a1c75df98b8dcdbfa4c384dcba7de8f911415c5e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:14.442800Z","signature_b64":"ybDVtX6WZabpORX0c6cTzrwOTGFvOy3Es0MraGsWtOQ22COIMMjCfzjn5605b3MKStk80H3gzGjOF6jtzFRzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ef778d785e4aff844815e231b1aec6a11dfed49079ad5f06c4bf5e0f7a4cb62","last_reissued_at":"2026-05-18T03:19:14.442108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:14.442108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AdaBoost and Forward Stagewise Regression are First-Order Convex Optimization Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Paul Grigas, Rahul Mazumder, Robert M. Freund","submitted_at":"2013-07-04T03:17:23Z","abstract_excerpt":"Boosting methods are highly popular and effective supervised learning methods which combine weak learners into a single accurate model with good statistical performance. In this paper, we analyze two well-known boosting methods, AdaBoost and Incremental Forward Stagewise Regression (FS$_\\varepsilon$), by establishing their precise connections to the Mirror Descent algorithm, which is a first-order method in convex optimization. As a consequence of these connections we obtain novel computational guarantees for these boosting methods. In particular, we characterize convergence bounds of AdaBoost"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1192","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":"1307.1192","created_at":"2026-05-18T03:19:14.442218+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.1192v1","created_at":"2026-05-18T03:19:14.442218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1192","created_at":"2026-05-18T03:19:14.442218+00:00"},{"alias_kind":"pith_short_12","alias_value":"D33XRV4F4SX7","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"D33XRV4F4SX7QREB","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"D33XRV4F","created_at":"2026-05-18T12:27:40.988391+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/D33XRV4F4SX7QREBLYRRWGXMNI","json":"https://pith.science/pith/D33XRV4F4SX7QREBLYRRWGXMNI.json","graph_json":"https://pith.science/api/pith-number/D33XRV4F4SX7QREBLYRRWGXMNI/graph.json","events_json":"https://pith.science/api/pith-number/D33XRV4F4SX7QREBLYRRWGXMNI/events.json","paper":"https://pith.science/paper/D33XRV4F"},"agent_actions":{"view_html":"https://pith.science/pith/D33XRV4F4SX7QREBLYRRWGXMNI","download_json":"https://pith.science/pith/D33XRV4F4SX7QREBLYRRWGXMNI.json","view_paper":"https://pith.science/paper/D33XRV4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.1192&json=true","fetch_graph":"https://pith.science/api/pith-number/D33XRV4F4SX7QREBLYRRWGXMNI/graph.json","fetch_events":"https://pith.science/api/pith-number/D33XRV4F4SX7QREBLYRRWGXMNI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D33XRV4F4SX7QREBLYRRWGXMNI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D33XRV4F4SX7QREBLYRRWGXMNI/action/storage_attestation","attest_author":"https://pith.science/pith/D33XRV4F4SX7QREBLYRRWGXMNI/action/author_attestation","sign_citation":"https://pith.science/pith/D33XRV4F4SX7QREBLYRRWGXMNI/action/citation_signature","submit_replication":"https://pith.science/pith/D33XRV4F4SX7QREBLYRRWGXMNI/action/replication_record"}},"created_at":"2026-05-18T03:19:14.442218+00:00","updated_at":"2026-05-18T03:19:14.442218+00:00"}