{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TX2MDBNFM52BTM2BMP6KUC2HDL","short_pith_number":"pith:TX2MDBNF","schema_version":"1.0","canonical_sha256":"9df4c185a5677419b34163fcaa0b471af1f9d64e4c87cbc63eb26ce5162671d2","source":{"kind":"arxiv","id":"1506.02535","version":5},"attestation_state":"computed","paper":{"title":"Efficient Learning of Ensembles with QuadBoost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fran\\c{c}ois Laviolette, Jean-Francis Roy, Louis-Emile Robitaille, Louis Fortier-Dubois, Mario Marchand","submitted_at":"2015-06-08T15:10:56Z","abstract_excerpt":"We first present a general risk bound for ensembles that depends on the Lp norm of the weighted combination of voters which can be selected from a continuous set. We then propose a boosting method, called QuadBoost, which is strongly supported by the general risk bound and has very simple rules for assigning the voters' weights. Moreover, QuadBoost exhibits a rate of decrease of its empirical error which is slightly faster than the one achieved by AdaBoost. The experimental results confirm the expectation of the theory that QuadBoost is a very efficient method for learning ensembles."},"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":"1506.02535","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-08T15:10:56Z","cross_cats_sorted":[],"title_canon_sha256":"af232277987f503633430fc5670ceb8b92c00e71f7c8468e653ac6bde4a8d65d","abstract_canon_sha256":"df314151469b59564b7667ce38c6cec749d2070a5c1395f33b8c1a2c45e391db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:25.250288Z","signature_b64":"Xx7uHfR6zSO92uTs0U1ajbOd6NVn/YdiF9ZfbjYnSBrnhp8v+8ZmmE0JLVMHHss1TkQ1v5zJgQAKuexg7yukDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9df4c185a5677419b34163fcaa0b471af1f9d64e4c87cbc63eb26ce5162671d2","last_reissued_at":"2026-05-18T01:26:25.249842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:25.249842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Learning of Ensembles with QuadBoost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fran\\c{c}ois Laviolette, Jean-Francis Roy, Louis-Emile Robitaille, Louis Fortier-Dubois, Mario Marchand","submitted_at":"2015-06-08T15:10:56Z","abstract_excerpt":"We first present a general risk bound for ensembles that depends on the Lp norm of the weighted combination of voters which can be selected from a continuous set. We then propose a boosting method, called QuadBoost, which is strongly supported by the general risk bound and has very simple rules for assigning the voters' weights. Moreover, QuadBoost exhibits a rate of decrease of its empirical error which is slightly faster than the one achieved by AdaBoost. The experimental results confirm the expectation of the theory that QuadBoost is a very efficient method for learning ensembles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02535","kind":"arxiv","version":5},"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":"1506.02535","created_at":"2026-05-18T01:26:25.249904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02535v5","created_at":"2026-05-18T01:26:25.249904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02535","created_at":"2026-05-18T01:26:25.249904+00:00"},{"alias_kind":"pith_short_12","alias_value":"TX2MDBNFM52B","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TX2MDBNFM52BTM2B","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TX2MDBNF","created_at":"2026-05-18T12:29:42.218222+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/TX2MDBNFM52BTM2BMP6KUC2HDL","json":"https://pith.science/pith/TX2MDBNFM52BTM2BMP6KUC2HDL.json","graph_json":"https://pith.science/api/pith-number/TX2MDBNFM52BTM2BMP6KUC2HDL/graph.json","events_json":"https://pith.science/api/pith-number/TX2MDBNFM52BTM2BMP6KUC2HDL/events.json","paper":"https://pith.science/paper/TX2MDBNF"},"agent_actions":{"view_html":"https://pith.science/pith/TX2MDBNFM52BTM2BMP6KUC2HDL","download_json":"https://pith.science/pith/TX2MDBNFM52BTM2BMP6KUC2HDL.json","view_paper":"https://pith.science/paper/TX2MDBNF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02535&json=true","fetch_graph":"https://pith.science/api/pith-number/TX2MDBNFM52BTM2BMP6KUC2HDL/graph.json","fetch_events":"https://pith.science/api/pith-number/TX2MDBNFM52BTM2BMP6KUC2HDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TX2MDBNFM52BTM2BMP6KUC2HDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TX2MDBNFM52BTM2BMP6KUC2HDL/action/storage_attestation","attest_author":"https://pith.science/pith/TX2MDBNFM52BTM2BMP6KUC2HDL/action/author_attestation","sign_citation":"https://pith.science/pith/TX2MDBNFM52BTM2BMP6KUC2HDL/action/citation_signature","submit_replication":"https://pith.science/pith/TX2MDBNFM52BTM2BMP6KUC2HDL/action/replication_record"}},"created_at":"2026-05-18T01:26:25.249904+00:00","updated_at":"2026-05-18T01:26:25.249904+00:00"}