{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5TOMN44WIQRJM2RFJM4WF55AHU","short_pith_number":"pith:5TOMN44W","schema_version":"1.0","canonical_sha256":"ecdcc6f3964422966a254b3962f7a03d3403d89e8a2463ae798f73b95f48c62b","source":{"kind":"arxiv","id":"1510.02558","version":1},"attestation_state":"computed","paper":{"title":"Functional Frank-Wolfe Boosting for General Loss Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chu Wang, Robert Schapire, Weinan E, Yingfei Wang","submitted_at":"2015-10-09T03:16:07Z","abstract_excerpt":"Boosting is a generic learning method for classification and regression. Yet, as the number of base hypotheses becomes larger, boosting can lead to a deterioration of test performance. Overfitting is an important and ubiquitous phenomenon, especially in regression settings. To avoid overfitting, we consider using $l_1$ regularization. We propose a novel Frank-Wolfe type boosting algorithm (FWBoost) applied to general loss functions. By using exponential loss, the FWBoost algorithm can be rewritten as a variant of AdaBoost for binary classification. FWBoost algorithms have exactly the same form"},"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":"1510.02558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-09T03:16:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9ed003f897e0399d20a8eb6a13311a9813f99f27b72ed28b2d0ab6ab5a88abbd","abstract_canon_sha256":"8b51b8af34cc41f04078b3a4ee56c8c45580c036b06b25ae978c16a17a62d6e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:42.093465Z","signature_b64":"M5cetrCRxS2jiMisVVhCdbtLtvy8gfn7B/uXxHQejVnIR9+UT0+a+g8FdL2Wv3660xXDHhd0qMhdJCO9KnnQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecdcc6f3964422966a254b3962f7a03d3403d89e8a2463ae798f73b95f48c62b","last_reissued_at":"2026-05-18T01:30:42.092862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:42.092862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Functional Frank-Wolfe Boosting for General Loss Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chu Wang, Robert Schapire, Weinan E, Yingfei Wang","submitted_at":"2015-10-09T03:16:07Z","abstract_excerpt":"Boosting is a generic learning method for classification and regression. Yet, as the number of base hypotheses becomes larger, boosting can lead to a deterioration of test performance. Overfitting is an important and ubiquitous phenomenon, especially in regression settings. To avoid overfitting, we consider using $l_1$ regularization. We propose a novel Frank-Wolfe type boosting algorithm (FWBoost) applied to general loss functions. By using exponential loss, the FWBoost algorithm can be rewritten as a variant of AdaBoost for binary classification. FWBoost algorithms have exactly the same form"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02558","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":"1510.02558","created_at":"2026-05-18T01:30:42.092964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.02558v1","created_at":"2026-05-18T01:30:42.092964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02558","created_at":"2026-05-18T01:30:42.092964+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TOMN44WIQRJ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TOMN44WIQRJM2RF","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TOMN44W","created_at":"2026-05-18T12:29:07.941421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06117","citing_title":"BoostLLM: Boosting-inspired LLM Fine-tuning for Few-shot Tabular Classification","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06117","citing_title":"BoostLLM: Boosting-inspired LLM Fine-tuning for Few-shot Tabular Classification","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5TOMN44WIQRJM2RFJM4WF55AHU","json":"https://pith.science/pith/5TOMN44WIQRJM2RFJM4WF55AHU.json","graph_json":"https://pith.science/api/pith-number/5TOMN44WIQRJM2RFJM4WF55AHU/graph.json","events_json":"https://pith.science/api/pith-number/5TOMN44WIQRJM2RFJM4WF55AHU/events.json","paper":"https://pith.science/paper/5TOMN44W"},"agent_actions":{"view_html":"https://pith.science/pith/5TOMN44WIQRJM2RFJM4WF55AHU","download_json":"https://pith.science/pith/5TOMN44WIQRJM2RFJM4WF55AHU.json","view_paper":"https://pith.science/paper/5TOMN44W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.02558&json=true","fetch_graph":"https://pith.science/api/pith-number/5TOMN44WIQRJM2RFJM4WF55AHU/graph.json","fetch_events":"https://pith.science/api/pith-number/5TOMN44WIQRJM2RFJM4WF55AHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TOMN44WIQRJM2RFJM4WF55AHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TOMN44WIQRJM2RFJM4WF55AHU/action/storage_attestation","attest_author":"https://pith.science/pith/5TOMN44WIQRJM2RFJM4WF55AHU/action/author_attestation","sign_citation":"https://pith.science/pith/5TOMN44WIQRJM2RFJM4WF55AHU/action/citation_signature","submit_replication":"https://pith.science/pith/5TOMN44WIQRJM2RFJM4WF55AHU/action/replication_record"}},"created_at":"2026-05-18T01:30:42.092964+00:00","updated_at":"2026-05-18T01:30:42.092964+00:00"}