{"total":208,"rows":[{"id":"2406.18665","title":"RouteLLM: Learning to Route LLMs with Preference Data","created":"2024-06-26","cited_by_count":682,"area":null},{"id":"2410.03834","title":"GraphRouter: A Graph-based Router for LLM Selections","created":"2024-10-04","cited_by_count":165,"area":null},{"id":"2407.18921","title":"Mobile Edge Intelligence for Large Language Models: A Contemporary Survey","created":"2024-07-09","cited_by_count":128,"area":null},{"id":"2408.00741","title":"DynamoLLM: Designing LLM Inference Clusters for Performance and Energy Efficiency","created":"2024-08-01","cited_by_count":112,"area":null},{"id":"2406.11903","title":"A Survey of Large Language Models for Financial Applications: Progress, Prospects and Challenges","created":"2024-06-15","cited_by_count":90,"area":null},{"id":"2409.19886","title":"RouterDC: Query-Based Router by Dual Contrastive Learning for Assembling Large Language Models","created":"2024-09-30","cited_by_count":88,"area":null},{"id":"2502.18036","title":"Harnessing Multiple Large Language Models: A Survey on LLM Ensemble","created":"2025-02-25","cited_by_count":86,"area":null},{"id":"2506.09033","title":"Router-R1: Teaching LLMs Multi-Round Routing and Aggregation via Reinforcement Learning","created":"2025-06-10","cited_by_count":72,"area":null},{"id":"2410.13284","title":"Learning to Route LLMs with Confidence Tokens","created":"2024-10-17","cited_by_count":67,"area":null},{"id":"2506.22716","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute","created":"2025-06-28","cited_by_count":67,"area":null},{"id":"2503.10657","title":"RouterEval: A Comprehensive Benchmark for Routing LLMs to Explore Model-level Scaling Up in LLMs","created":"2025-03-08","cited_by_count":61,"area":null},{"id":"2502.18482","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","created":"2025-02-09","cited_by_count":59,"area":null},{"id":"2405.00467","title":"Harnessing the Power of Multiple Minds: Lessons Learned from LLM Routing","created":"2024-05-01","cited_by_count":46,"area":null},{"id":"2407.06089","title":"Merge, Ensemble, and Cooperate! A Survey on Collaborative Strategies in the Era of Large Language Models","created":"2024-07-08","cited_by_count":44,"area":null},{"id":"2407.10834","title":"MetaLLM: A High-performant and Cost-efficient Dynamic Framework for Wrapping LLMs","created":"2024-07-15","cited_by_count":41,"area":null},{"id":"2409.06857","title":"What is the Role of Small Models in the LLM Era: A Survey","created":"2024-09-10","cited_by_count":41,"area":null},{"id":"2506.01048","title":"IRT-Router: Effective and Interpretable Multi-LLM Routing via Item Response Theory","created":"2025-06-01","cited_by_count":40,"area":null},{"id":"2601.07206","title":"LLMRouterBench: A Massive Benchmark and Unified Framework for LLM Routing","created":"2026-01-12","cited_by_count":38,"area":null},{"id":"2502.20576","title":"OmniRouter: Budget and Performance Controllable Multi-LLM Routing","created":"2025-02-27","cited_by_count":35,"area":null},{"id":"2405.02134","title":"Optimising Calls to Large Language Models with Uncertainty-Based Two-Tier Selection","created":"2024-05-03","cited_by_count":33,"area":null},{"id":"2502.14855","title":"Prompt-to-Leaderboard","created":"2025-02-20","cited_by_count":30,"area":null},{"id":"2502.04506","title":"When One LLM Drools, Multi-LLM Collaboration Rules","created":"2025-02-06","cited_by_count":28,"area":null},{"id":"2502.17282","title":"Capability Instruction Tuning: A New Paradigm for Dynamic LLM Routing","created":"2025-02-24","cited_by_count":25,"area":null},{"id":"2508.21141","title":"Adaptive LLM Routing under Budget Constraints","created":"2025-08-28","cited_by_count":24,"area":null},{"id":"2407.10725","title":"CLAVE: An Adaptive Framework for Evaluating Values of LLM Generated Responses","created":"2024-07-15","cited_by_count":23,"area":null},{"id":"2602.19672","title":"SkillOrchestra: Learning to Route Agents via Skill Transfer","created":"2026-02-23","cited_by_count":23,"area":null},{"id":"2502.00409","title":"Doing More with Less: A Survey on Routing Strategies for Resource Optimisation in Large Language Model-Based Systems","created":"2025-02-01","cited_by_count":20,"area":null},{"id":"2506.17670","title":"Online Multi-LLM Selection via Contextual Bandits under Unstructured Context Evolution","created":"2025-06-21","cited_by_count":19,"area":null},{"id":"2510.08439","title":"xRouter: Training Cost-Aware LLMs Orchestration System via Reinforcement Learning","created":"2025-10-09","cited_by_count":17,"area":null},{"id":"2407.02348","title":"Agreement-Based Cascading for Efficient Inference","created":"2024-07-02","cited_by_count":16,"area":null},{"id":"2508.12491","title":"Cost-Aware Contrastive Routing for LLMs","created":"2025-08-17","cited_by_count":16,"area":null},{"id":"2406.00060","title":"Cascade-Aware Training of Language Models","created":"2024-05-29","cited_by_count":15,"area":null},{"id":"2410.15761","title":"Optimal Query Allocation in Extractive QA with LLMs: A Learning-to-Defer Framework with Theoretical Guarantees","created":"2024-10-21","cited_by_count":15,"area":null},{"id":"2509.24496","title":"LLM DNA: Tracing Model Evolution via Functional Representations","created":"2025-09-29","cited_by_count":15,"area":null},{"id":"2502.11007","title":"Device-Cloud Collaborative LLM Inference with Multi-Modal, Multi-Task, Multi-Turn Conversations","created":"2025-02-16","cited_by_count":14,"area":null},{"id":"2505.07460","title":"A Survey on Collaborative Mechanisms Between Large and Small Language Models","created":"2025-05-12","cited_by_count":14,"area":null},{"id":"2503.22402","title":"EllieSQL: Cost-Efficient Text-to-SQL with Complexity-Aware Routing","created":"2025-03-28","cited_by_count":13,"area":null},{"id":"2509.20241","title":"Energy Use of AI Inference, Efficiency Pathways, and Test-Time Scaling","created":"2025-09-24","cited_by_count":13,"area":null},{"id":"2410.13006","title":"LLM Chain Ensembles for Scalable and Accurate Data Annotation","created":"2024-10-16","cited_by_count":11,"area":null},{"id":"2506.03880","title":"RadialRouter: Structured Representation for Efficient and Robust Large Language Models Routing","created":"2025-06-04","cited_by_count":11,"area":null},{"id":"2506.11887","title":"Cascaded Language Models for Cost-effective Human-AI Decision-Making","created":"2025-06-13","cited_by_count":11,"area":null},{"id":"2501.09345","title":"Rational Tuning of LLM Cascades via Probabilistic Modeling","created":"2025-01-16","cited_by_count":10,"area":null},{"id":"2502.19335","title":"Gatekeeper: Improving Model Cascades Through Confidence Tuning","created":"2025-02-26","cited_by_count":10,"area":null},{"id":"2507.10540","title":"FusionFactory: Fusing LLM Capabilities with Multi-LLM Log Data","created":"2025-07-14","cited_by_count":10,"area":null},{"id":"2602.03478","title":"When Routing Collapses: On the Degenerate Convergence of LLM Routers","created":"2026-02-03","cited_by_count":10,"area":null},{"id":"2503.13505","title":"Ensemble Learning for Large Language Models in Text and Code Generation: A Survey","created":"2025-03-13","cited_by_count":9,"area":null},{"id":"2505.19947","title":"MESS+: Dynamically Learned Inference-Time LLM Routing in Model Zoos with Service Level Guarantees","created":"2025-05-26","cited_by_count":9,"area":null},{"id":"2506.12473","title":"TagRouter: Learning Route to LLMs through Tags for Open-Domain Text Generation Tasks","created":"2025-06-14","cited_by_count":9,"area":null},{"id":"2407.08642","title":"Towards Building Specialized Generalist AI with System 1 and System 2 Fusion","created":"2024-07-11","cited_by_count":8,"area":null},{"id":"2407.09502","title":"From Text to Life: On the Reciprocal Relationship between Artificial Life and Large Language Models","created":"2024-06-14","cited_by_count":8,"area":null},{"id":"2408.08545","title":"SelectLLM: Query-Aware Efficient Selection Algorithm for Large Language Models","created":"2024-08-16","cited_by_count":8,"area":null},{"id":"2505.16303","title":"INFERENCEDYNAMICS: Efficient Routing Across LLMs through Structured Capability and Knowledge Profiling","created":"2025-05-22","cited_by_count":8,"area":null},{"id":"2412.04167","title":"Bench-CoE: a Framework for Collaboration of Experts from Benchmark","created":"2024-12-05","cited_by_count":7,"area":null},{"id":"2502.14445","title":"PredictaBoard: Benchmarking LLM Score Predictability","created":"2025-02-20","cited_by_count":7,"area":null},{"id":"2502.20375","title":"When does a predictor know its own loss?","created":"2025-02-27","cited_by_count":7,"area":null},{"id":"2508.00234","title":"Quality-of-Service Aware LLM Routing for Edge Computing with Multiple Experts","created":"2025-08-01","cited_by_count":7,"area":null},{"id":"2510.00841","title":"LLM Routing with Dueling Feedback","created":"2025-10-01","cited_by_count":7,"area":null},{"id":"2510.05164","title":"SATER: A Self-Aware and Token-Efficient Approach to Routing and Cascading","created":"2025-10-04","cited_by_count":7,"area":null},{"id":"2603.06616","title":"RACER: Risk-Aware Calibrated Efficient Routing for Large Language Models","created":"2026-02-20","cited_by_count":7,"area":null},{"id":"2601.21795","title":"Effective LoRA Adapter Routing using Task Representations","created":"2026-01-29","cited_by_count":6,"area":null},{"id":"2603.25450","title":"Cross-Model Disagreement as a Label-Free Correctness Signal","created":"2026-03-26","cited_by_count":6,"area":null},{"id":"2410.02173","title":"Efficiently Deploying LLMs with Controlled Risk","created":"2024-10-03","cited_by_count":5,"area":null},{"id":"2411.04319","title":"Towards Optimizing SQL Generation via LLM Routing","created":"2024-11-06","cited_by_count":5,"area":null},{"id":"2411.07858","title":"Verbosity $\\neq$ Veracity: Demystify Verbosity Compensation Behavior of Large Language Models","created":"2024-11-12","cited_by_count":5,"area":null},{"id":"2506.06579","title":"Towards Efficient Multi-LLM Inference: Characterization and Analysis of LLM Routing and Hierarchical Techniques","created":"2025-06-06","cited_by_count":5,"area":null},{"id":"2507.03834","title":"Economic Evaluation of LLMs","created":"2025-07-04","cited_by_count":5,"area":null},{"id":"2509.06274","title":"IPR: Intelligent Prompt Routing with User-Controlled Quality-Cost Trade-offs","created":"2025-09-08","cited_by_count":5,"area":null},{"id":"2510.19208","title":"DiSRouter: Distributed Self-Routing for LLM Selections","created":"2025-10-22","cited_by_count":5,"area":null},{"id":"2511.08590","title":"GMTRouter: Personalized LLM Router over Multi-turn User Interactions","created":"2025-10-29","cited_by_count":5,"area":null},{"id":"2607.03436","title":"What Does a Routing Oracle Measure Under Stochastic Decoding? Coupling, Scorer Choice, and Single-Commit Ceilings","created":"2026-07-03","cited_by_count":5,"area":null},{"id":"2502.01459","title":"Learning to Partially Defer for Sequences","created":"2025-02-03","cited_by_count":4,"area":null},{"id":"2502.12701","title":"Translate Smart, not Hard: Cascaded Translation Systems with Quality-Aware Deferral","created":"2025-02-18","cited_by_count":4,"area":null},{"id":"2503.14887","title":"Pseudo Relevance Feedback is Enough to Close the Gap Between Small and Large Dense Retrieval Models","created":"2025-03-19","cited_by_count":4,"area":null},{"id":"2505.15101","title":"Cost-aware LLM-based Online Dataset Annotation","created":"2025-05-21","cited_by_count":4,"area":null},{"id":"2508.11291","title":"Dynamic Quality-Latency Aware Routing for LLM Inference in Wireless Edge-Device Networks","created":"2025-08-15","cited_by_count":4,"area":null},{"id":"2511.16883","title":"PersonalizedRouter: Personalized LLM Routing via Graph-based User Preference Modeling","created":"2025-11-21","cited_by_count":4,"area":null},{"id":"2601.19402","title":"PROTEUS: SLA-Aware Routing via Lagrangian RL for Multi-LLM Serving Systems","created":"2026-01-27","cited_by_count":4,"area":null},{"id":"2604.00025","title":"Brevity Constraints Reverse Performance Hierarchies in Language Models","created":"2026-03-11","cited_by_count":4,"area":null},{"id":"2604.00136","title":"ParetoBandit: Budget-Paced Adaptive Routing for Non-Stationary LLM Serving","created":"2026-03-31","cited_by_count":4,"area":null},{"id":"2605.07395","title":"Unsolvability Ceiling in Multi-LLM Routing: An Empirical Study of Evaluation Artifacts","created":"2026-05-08","cited_by_count":4,"area":null},{"id":"2605.18796","title":"UCCI: Calibrated Uncertainty for Cost-Optimal LLM Cascade Routing","created":"2026-05-11","cited_by_count":4,"area":null},{"id":"2608.06867","title":"LLMRouter: Unified Infrastructure for Developing, Evaluating, and Deploying LLM Routers","created":"2026-08-07","cited_by_count":4,"area":null},{"id":"2608.08265","title":"Opportunity Is Not Realizability: Selection-Valid Diagnostics for Multi-LLM Routing","created":"2026-08-08","cited_by_count":4,"area":null},{"id":"2406.04508","title":"OCCAM: Towards Cost-Efficient and Accuracy-Aware Classification Inference","created":"2024-06-06","cited_by_count":3,"area":null},{"id":"2410.18125","title":"Towards Edge General Intelligence via Large Language Models: Opportunities and Challenges","created":"2024-10-16","cited_by_count":3,"area":null},{"id":"2504.16871","title":"Exploring How LLMs Capture and Represent Domain-Specific Knowledge","created":"2025-04-23","cited_by_count":3,"area":null},{"id":"2506.17254","title":"Near-Optimal Online Deployment and Routing for Streaming LLMs","created":"2025-06-08","cited_by_count":3,"area":null},{"id":"2508.02584","title":"MArgE: Meshing Argumentative Evidence from Multiple Large Language Models for Justifiable Claim Verification","created":"2025-08-04","cited_by_count":3,"area":null},{"id":"2509.14899","title":"CARGO: A Framework for Confidence-Aware Routing of Large Language Models","created":"2025-09-18","cited_by_count":3,"area":null},{"id":"2601.03511","title":"IntroLM: Introspective Language Models via Prefilling-Time Self-Evaluation","created":"2026-01-07","cited_by_count":3,"area":null},{"id":"2601.04544","title":"TCAndon-Router: Adaptive Reasoning Router for Multi-Agent Collaboration","created":"2026-01-08","cited_by_count":3,"area":null},{"id":"2601.05903","title":"HAPS: Hierarchical LLM Routing with Joint Architecture and Parameter Search","created":"2026-01-09","cited_by_count":3,"area":null},{"id":"2601.06220","title":"Breaking Model Lock-in: Cost-Efficient Zero-Shot LLM Routing via a Universal Latent Space","created":"2026-01-09","cited_by_count":3,"area":null},{"id":"2601.17551","title":"GreenServ: Energy-Efficient Context-Aware Dynamic Routing for Multi-Model LLM Inference","created":"2026-01-24","cited_by_count":3,"area":null},{"id":"2601.22318","title":"Federate the Router: Learning Language Model Routers with Sparse and Decentralized Evaluations","created":"2026-01-29","cited_by_count":3,"area":null},{"id":"2603.26796","title":"Robust Batch-Level Query Routing for Large Language Models under Cost and Capacity Constraints","created":"2026-03-25","cited_by_count":3,"area":null},{"id":"2604.00904","title":"Fatigue-Aware Learning to Defer via Constrained Optimisation","created":"2026-04-01","cited_by_count":3,"area":null},{"id":"2606.19376","title":"Cost-Optimal LLM Routing with Limited User Feedback under User Satisfaction Guarantees","created":"2026-06-12","cited_by_count":3,"area":null},{"id":"2607.23765","title":"WISERouter: LLM Routing with Workload Budget Constraint","created":"2026-07-26","cited_by_count":3,"area":null},{"id":"2411.13787","title":"Adaptive Routing of Text-to-Image Generation Requests Between Large Cloud Model and Light-Weight Edge Model","created":"2024-11-21","cited_by_count":2,"area":null}],"next_cursor":"100"}