{"ID":2869457,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2509.15143","arxiv_id":"2509.15143","title":"Next-Depth Lookahead Tree","abstract":"This paper proposes the Next-Depth Lookahead Tree (NDLT), a single-tree model designed to improve performance by evaluating node splits not only at the node being optimized but also by evaluating the quality of the next depth level.","short_abstract":"This paper proposes the Next-Depth Lookahead Tree (NDLT), a single-tree model designed to improve performance by evaluating node splits not only at the node being optimized but also by evaluating the quality of the next depth level.","url_abs":"https://arxiv.org/abs/2509.15143","url_pdf":"https://arxiv.org/pdf/2509.15143v1","authors":"[\"Jaeho Lee\",\"Kangjin Kim\",\"Gyeong Taek Lee\"]","published":"2025-09-18T16:51:57Z","proceeding":"stat.ML","tasks":"[\"stat.ML\",\"cs.LG\"]","methods":"[]","has_code":false}