3D Optimization for AI Inference Scaling: Balancing Accuracy, Cost, and Latency
Not on the map. Why?
Abstract (arXiv)
AI inference scaling is often tuned through 1D heuristics (a fixed reasoning pass) or 2D bivariate trade-offs (e.g., accuracy vs. compute), which fail to consider cost and latency constraints. We introduce a 3D optimization framework that jointly calibrates accuracy, cost, and latency within a unified decision space, enabling constraints-aware inference scaling. Using Monte Carlo simulations across three representative scenarios and nine simulated large language models, we evaluate four optimization methods to address the 3D multi-objective optimization (MOO) problem. Framing inference scaling in MOO shapes a feasible space that 1D and 2D optimizations fail to capture, enabling environment-adaptive selection of the inference scaling~k. Results show that knee-point optimization based on Pareto frontiers achieves the best balance, while accuracy-maximization remains favorable when accuracy is prioritized. Our results further show that smaller models, when combined with optimal inference scaling, can match or exceed the performance of larger models at a fraction of the cost. The framework establishes a theoretical foundation for deployment-aware inference scaling across diverse operational conditions.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 5 of its 9 references that are in the map. First posted on arXiv 21 Oct 2025.
Builds on
5 of 9 references.
References · 5
- 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,708
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameterscited by 1,986
- 2024Large Language Monkeys: Scaling Inference Compute with Repeated Samplingcited by 991
- 2025The Energy Cost of Reasoning: Analyzing Energy Usage in LLMs with Test-time Computecited by 15
- 2025Kinetics: Rethinking Test-Time Scaling Lawscited by 12
Built on by
Citing papers per year: 2026: 1.
1 paper.