{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BTEWQRX6H6DNBYK4GFNJXZZVGW","short_pith_number":"pith:BTEWQRX6","schema_version":"1.0","canonical_sha256":"0cc96846fe3f86d0e15c315a9be735358b71d8b3d9336a66908fd35ab0278fd8","source":{"kind":"arxiv","id":"1504.06952","version":21},"attestation_state":"computed","paper":{"title":"Random Forest for the Contextual Bandit Problem - extended version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fabrice Cl\\'erot, Rapha\\\"el F\\'eraud, Robin Allesiardo, Tanguy Urvoy","submitted_at":"2015-04-27T07:27:10Z","abstract_excerpt":"To address the contextual bandit problem, we propose an online random forest algorithm. The analysis of the proposed algorithm is based on the sample complexity needed to find the optimal decision stump. Then, the decision stumps are assembled in a random collection of decision trees, Bandit Forest. We show that the proposed algorithm is optimal up to logarithmic factors. The dependence of the sample complexity upon the number of contextual variables is logarithmic. The computational cost of the proposed algorithm with respect to the time horizon is linear. These analytical results allow the p"},"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":"1504.06952","kind":"arxiv","version":21},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-27T07:27:10Z","cross_cats_sorted":[],"title_canon_sha256":"497a5b338a104fa45344f960bbc1b0fa01c90b1240d6de82e671b90bb93e16a8","abstract_canon_sha256":"2a1a711bb0e5dd1f594076020ff65a7385ed62defd056f00b0564c6a53e79b30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:37.858272Z","signature_b64":"b50KwKv+AMYQyxklgvgdHdXa8sLfAUsgbB7hmx1E8XkKB71uR+sjQxOVyeAQxQetLezGB0Zn2y+o8HZ3iD1ODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cc96846fe3f86d0e15c315a9be735358b71d8b3d9336a66908fd35ab0278fd8","last_reissued_at":"2026-05-18T01:04:37.857550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:37.857550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Forest for the Contextual Bandit Problem - extended version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fabrice Cl\\'erot, Rapha\\\"el F\\'eraud, Robin Allesiardo, Tanguy Urvoy","submitted_at":"2015-04-27T07:27:10Z","abstract_excerpt":"To address the contextual bandit problem, we propose an online random forest algorithm. The analysis of the proposed algorithm is based on the sample complexity needed to find the optimal decision stump. Then, the decision stumps are assembled in a random collection of decision trees, Bandit Forest. We show that the proposed algorithm is optimal up to logarithmic factors. The dependence of the sample complexity upon the number of contextual variables is logarithmic. The computational cost of the proposed algorithm with respect to the time horizon is linear. These analytical results allow the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06952","kind":"arxiv","version":21},"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":"1504.06952","created_at":"2026-05-18T01:04:37.857673+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06952v21","created_at":"2026-05-18T01:04:37.857673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06952","created_at":"2026-05-18T01:04:37.857673+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTEWQRX6H6DN","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTEWQRX6H6DNBYK4","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTEWQRX6","created_at":"2026-05-18T12:29:14.074870+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/BTEWQRX6H6DNBYK4GFNJXZZVGW","json":"https://pith.science/pith/BTEWQRX6H6DNBYK4GFNJXZZVGW.json","graph_json":"https://pith.science/api/pith-number/BTEWQRX6H6DNBYK4GFNJXZZVGW/graph.json","events_json":"https://pith.science/api/pith-number/BTEWQRX6H6DNBYK4GFNJXZZVGW/events.json","paper":"https://pith.science/paper/BTEWQRX6"},"agent_actions":{"view_html":"https://pith.science/pith/BTEWQRX6H6DNBYK4GFNJXZZVGW","download_json":"https://pith.science/pith/BTEWQRX6H6DNBYK4GFNJXZZVGW.json","view_paper":"https://pith.science/paper/BTEWQRX6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06952&json=true","fetch_graph":"https://pith.science/api/pith-number/BTEWQRX6H6DNBYK4GFNJXZZVGW/graph.json","fetch_events":"https://pith.science/api/pith-number/BTEWQRX6H6DNBYK4GFNJXZZVGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTEWQRX6H6DNBYK4GFNJXZZVGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTEWQRX6H6DNBYK4GFNJXZZVGW/action/storage_attestation","attest_author":"https://pith.science/pith/BTEWQRX6H6DNBYK4GFNJXZZVGW/action/author_attestation","sign_citation":"https://pith.science/pith/BTEWQRX6H6DNBYK4GFNJXZZVGW/action/citation_signature","submit_replication":"https://pith.science/pith/BTEWQRX6H6DNBYK4GFNJXZZVGW/action/replication_record"}},"created_at":"2026-05-18T01:04:37.857673+00:00","updated_at":"2026-05-18T01:04:37.857673+00:00"}