arXiv (OAI Expanded)
open access
Learned Look-Ahead Splitting Rule for CART
Classification and regression trees are typically constructed using a greedy splitting rule that maximizes the immediate reduction in prediction error at each node. Although this strategy is computationally efficient, it can miss splits that yield small short-term gains but create substantial downst
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Amazon’s Machine Learning Toolkit: Sagemaker#10785
- Deep Divide-and-Reduce in Symbolic Regression#927408
- IFW-BLS: Dual-Robust Broad Learning System with Intuitionistic Fuzzy Wave Loss#924304
- IFW-BLS: Dual-Robust Broad Learning System with Intuitionistic Fuzzy Wave Loss#920073
- A Prediction--Correction Analysis of Two-Way Block Splitting in Distributed Learning#1064468
Record · ID 1110797
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive