{
  "annotation_id": "a1b75e7e-0ff6-4a6e-bf6e-1fcde86d013d",
  "date_created": "2026-02-17T05:53:05.102000Z",
  "date_modified": "2026-02-17T05:53:05.102000Z",
  "file_hash": "4cea5ab51d0b5b2fc6a4b3ee674c4384ff1197ed962981fd6836f52c11d88f8e",
  "private": false,
  "record": {
    "abstract": "Large language model (LLM) routing aims to exploit the specialized strengths of different LLMs for diverse tasks. However, existing approaches typically focus on selecting LLM architectures while overlooking parameter settings, which are critical for task performance. In this paper, we introduce HAPS, a hierarchical LLM routing framework that jointly searches over model architectures and parameters. Specifically, we use a high-level router to select among candidate LLM architectures, and then search for the optimal parameters for the selected architectures based on a low-level router. We design a parameter generation network to share parameters between the two routers to mutually enhance their capabilities. In the training process, we design a reward-augmented objective to effectively optimize our framework. Experiments on two commonly used benchmarks show that HAPS consistently outperforms strong routing baselines. We have released our code at https://github.com/zihangtian/HAPS.",
    "arxiv_id": "2601.05903",
    "authors": [
      "Zihang Tian",
      "Rui Li",
      "Jingsen Zhang",
      "Xiaohe Bo",
      "Wei Huo",
      "Xu Chen"
    ],
    "categories": [
      "cs.CL"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "HAPS: Hierarchical LLM Routing with Joint Architecture and Parameter Search",
    "url": "https://arxiv.org/abs/2601.05903",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "97e5c00b-f28b-4900-b2c0-44794e744ce3",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}