BORT
Beyond Pareto: Bi-Objective and Multi-Objective Regression Trees’
Implements the Bi-objective Regression Tree (BORT) for efficiently learning vector-valued functions. Unlike traditional methods that rely on constructing multiple models or static scalarisation, BORT integrates the exploration of the Pareto front directly into a single tree's growth process. It provides high-efficiency, single-model approaches that can Pareto-dominate entire Pareto-consistent families of trees, supported by a C backend for fast computation. For more details see Paz (2026) <doi:10.1007/978-3-032-28393-1_2> and Paz (2025) <doi:10.1007/978-3-031-78401-9_2>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1.0 |
rolling linux/jammy R-4.5 | BORT_0.1.0.tar.gz |
19.4 KiB |
0.1.0 |
rolling linux/noble R-4.5 | BORT_0.1.0.tar.gz |
19.4 KiB |
0.1.0 |
rolling source/ R- | BORT_0.1.0.tar.gz |
5.8 KiB |
0.1.0 |
latest linux/jammy R-4.5 | BORT_0.1.0.tar.gz |
19.4 KiB |
0.1.0 |
latest linux/noble R-4.5 | BORT_0.1.0.tar.gz |
19.4 KiB |
0.1.0 |
latest source/ R- | BORT_0.1.0.tar.gz |
5.8 KiB |
0.1.0 |
2026-04-23 source/ R- | BORT_0.1.0.tar.gz |
0 B |