[{"doi":"10.48550/ARXIV.2406.12531","type":"journal_article","user_id":"128464","_id":"66175","date_created":"2026-07-03T21:13:01Z","date_updated":"2026-07-05T14:48:17Z","citation":{"mla":"<i>TREE: Tree Regularization for Efficient Execution</i>. 2024, doi:<a href=\"https://doi.org/10.48550/ARXIV.2406.12531\">10.48550/ARXIV.2406.12531</a>.","bibtex":"@article{TREE: Tree Regularization for Efficient Execution_2024, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2406.12531\">10.48550/ARXIV.2406.12531</a>}, year={2024} }","ama":"TREE: Tree Regularization for Efficient Execution. Published online 2024. doi:<a href=\"https://doi.org/10.48550/ARXIV.2406.12531\">10.48550/ARXIV.2406.12531</a>","ieee":"“TREE: Tree Regularization for Efficient Execution,” 2024, doi: <a href=\"https://doi.org/10.48550/ARXIV.2406.12531\">10.48550/ARXIV.2406.12531</a>.","apa":"<i>TREE: Tree Regularization for Efficient Execution</i>. (2024). <a href=\"https://doi.org/10.48550/ARXIV.2406.12531\">https://doi.org/10.48550/ARXIV.2406.12531</a>","chicago":"“TREE: Tree Regularization for Efficient Execution,” 2024. <a href=\"https://doi.org/10.48550/ARXIV.2406.12531\">https://doi.org/10.48550/ARXIV.2406.12531</a>.","short":"(2024)."},"title":"TREE: Tree Regularization for Efficient Execution","status":"public","year":"2024"}]