Research map / Probabilistic and scientific modeling / Uncertainty and Gaussian processes
Probabilistically-routed Bayesian Additive Spanning Trees for Learning on Constrained Domains
Abhisek Chakraborty, Abhishek Mandal, Anirban Chakraborty
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace hard spanning-tree cuts with probabilistic routing (PR-BAST) versus BAST | BAST · NYC taxi 8AM pickups | RMSE: 0.7341 -> 0.6108 | Improved |
| replace hard spanning-tree cuts with probabilistic routing | BAST · One-way road network with flyovers, 26x33 | RMSE: 0.478 -> 0.095 | Improved |
| replace hard spanning-tree cuts with probabilistic routing | BAST · Simulated traffic with bottlenecks, 12x12 | RMSE: 0.190 -> 0.154 | Improved |
| use spanning-tree geometry (BAST) instead of Euclidean GP | BAST · Simulated traffic with bottlenecks, 26x26 | RMSE: 0.350 -> 0.197 | Improved |
| use BART axis-aligned splits instead of BAST on flyover network (22x28, 24x31, 26x33) | BART · One-way road network with flyovers | RMSE: BART 0.382 vs BAST 0.478 at 26x33; BART 0.569 vs BAST 0.286 at 12x15 | Mixed |
| use probabilistic routing instead of hard cuts to cut computation | BAST · Simulated traffic with bottlenecks | average run time (minutes): 5.6 -> 2.4 | Improved |
| increase routing temperature tau (ablation) | PR-BAST · Synthetic graph signal (Figure 1) | locality of fit | Mixed |
Earlier methods this paper compares with
Named baselines from earlier accepted papers in this paper's results tables: better than 1 of 1 on most shared results.
- BAST — BAST: Bayesian Additive Regression Spanning Trees for Complex Constrained Domain (NeurIPS 2021) · better on 8 of 8 shared results
Matched by method name in results tables read by AI. Authors' own tables tend to favour the newer method, and a comparison can be missed when a method is renamed.
Closest papers by meaning
- BAST: Bayesian Additive Regression Spanning Trees for Complex Constrained Domain (NeurIPS 2021 · similarity 0.92)
- Bayesian Additive Distribution Regression (NeurIPS 2026 · similarity 0.87)
- BARK: A Fully Bayesian Tree Kernel for Black-box Optimization (ICML 2025 · similarity 0.87)
- Very Fast Bayesian Additive Regression Trees on GPU (NeurIPS 2026 · similarity 0.85)
- Distribution Learning Meets Graph Structure Sampling (NeurIPS 2025 · similarity 0.85)
- Multistage Defer Trees for Hybrid Interpretability: If at First You Can't Succeed, Tree Again (NeurIPS 2026 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
