{"id":29830846,"url":"https://github.com/finite-sample/lookahead-cart","last_synced_at":"2025-07-29T10:12:06.778Z","repository":{"id":299907769,"uuid":"1004600879","full_name":"finite-sample/lookahead-cart","owner":"finite-sample","description":"Look Ahead CART","archived":false,"fork":false,"pushed_at":"2025-06-18T22:20:45.000Z","size":8,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-19T19:04:12.991Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/finite-sample.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2025-06-18T22:16:35.000Z","updated_at":"2025-06-19T01:21:09.000Z","dependencies_parsed_at":"2025-06-18T23:36:28.568Z","dependency_job_id":null,"html_url":"https://github.com/finite-sample/lookahead-cart","commit_stats":null,"previous_names":["soodoku/lookahead-cart","finite-sample/lookahead-cart"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/finite-sample/lookahead-cart","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/finite-sample%2Flookahead-cart","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/finite-sample%2Flookahead-cart/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/finite-sample%2Flookahead-cart/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/finite-sample%2Flookahead-cart/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/finite-sample","download_url":"https://codeload.github.com/finite-sample/lookahead-cart/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/finite-sample%2Flookahead-cart/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":267668847,"owners_count":24124973,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-07-29T02:00:12.549Z","response_time":2574,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-07-29T10:11:51.478Z","updated_at":"2025-07-29T10:12:06.670Z","avatar_url":"https://github.com/finite-sample.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Lookahead CART\n\n\u003e Decision trees with bounded lookahead search\n\n## Overview\n\nStandard CART algorithms make greedy split decisions based only on immediate impurity reduction. This can miss globally optimal tree structures where a seemingly poor split enables much better future splits.\n\nLookahead CART uses bounded search with alpha-beta pruning to look ahead 2-3 levels when choosing splits, discovering tree structures that greedy methods miss.\n\n## Code for LookAhead CART + Simulation Results\n\n* [Lookahead CART](lookahead-cart.ipynb)\n\n## Key Results\n\n**XOR Regression Problem:**\n- Standard CART (sklearn): MSE = 0.316\n- Lookahead CART: MSE = 0.040 (**87% improvement**)\n- Successfully discovers XOR interaction pattern\n\n**Computational Cost:**\n- 100-1000x time overhead vs standard CART\n- 40-45% branch pruning effectiveness\n- Memory overhead: ~100-150KB\n\n## When It Works\n\n✅ **Feature interactions** dominate individual feature effects  \n✅ **Tree interpretability** is important  \n✅ **Accuracy matters more than speed**  \n\n❌ Simple linear relationships  \n❌ Real-time applications  \n❌ Large-scale production use (due to computational cost)\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffinite-sample%2Flookahead-cart","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffinite-sample%2Flookahead-cart","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffinite-sample%2Flookahead-cart/lists"}