{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/even-faster-hyperbolic-random-forests-a","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","arxiv_id":"2506.04360","date":"2025-06-04","proceeding":null,"authors":["Philippe Chlenski","Itsik Pe'er"],"abstract":"Decision trees and models that use them as primitives are workhorses of machine learning in Euclidean spaces. Recent work has further extended these models to the Lorentz model of hyperbolic space by replacing axis-parallel hyperplanes with homogeneous hyperplanes when partitioning the input space. In this paper, we show how the hyperDT algorithm can be elegantly reexpressed in the Beltrami-Klein model of hyperbolic spaces. This preserves the thresholding operation used in Euclidean decision trees, enabling us to further rewrite hyperDT as simple pre- and post-processing steps that form a wrapper around existing tree-based models designed for Euclidean spaces. The wrapper approach unlocks many optimizations already available in Euclidean space models, improving flexibility, speed, and accuracy while offering a simpler, more maintainable, and extensible codebase. Our implementation is available at https://github.com/pchlenski/hyperdt.","url_abs":"https://arxiv.org/abs/2506.04360v1","url_pdf":"https://arxiv.org/pdf/2506.04360v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"even-faster-hyperbolic-random-forests-a","repo_url":"https://github.com/pchlenski/hyperdt","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2506.04360","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.04360"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/pchlenski/hyperdt","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":3},"by_repo_kind":{"official":{"samples":3,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"b5ad24441c561b14","entry":"convert","repo":"pchlenski/hyperdt","repo_kind":"official","path":"hyperdt/legacy/conversions.py","file_url":"https://github.com/pchlenski/hyperdt/blob/HEAD/hyperdt/legacy/conversions.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b5ad24441c561b14"}},{"code_sha256_prefix":"4a1ac198e8523050","entry":"get_candidates","repo":"pchlenski/hyperdt","repo_kind":"official","path":"hyperdt/legacy/hyperbolic_trig.py","file_url":"https://github.com/pchlenski/hyperdt/blob/HEAD/hyperdt/legacy/hyperbolic_trig.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4a1ac198e8523050"}},{"code_sha256_prefix":"b39fb79acdcaed4c","entry":"get_midpoint","repo":"pchlenski/hyperdt","repo_kind":"official","path":"hyperdt/legacy/hyperbolic_trig.py","file_url":"https://github.com/pchlenski/hyperdt/blob/HEAD/hyperdt/legacy/hyperbolic_trig.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b39fb79acdcaed4c"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}