SOURCE-LINKED INTELLIGENCE

Canopy: Exploiting Piecewise Smooth Tree Priors for Multi-Fidelity Bandits

arXiv · AI, language, vision and robotics · article · Sep 24, 2026 · UTC

Many LLM inference problems, including model routing, prefix-cache management, prompt trimming, and test-time search, can be viewed as optimization over a tree. This structure arises naturally from autoregressive generation: every prefix defines a node, and its continuations form a subtree below it. Internal nodes of the tree provide cheap but biased estimates of a region's value, while leaf evaluations are expensive but accurate. Hierarchical bandit methods can exploit this structure, but typically require a specific smoothness schedule to be specified in advance, even though real objectives

Read original source ↗ Open in workspace

recordType

paper

region

Global