ArXivCSExplorer
β˜†β˜†BookmarksπŸ†RSSHow to UseFAQ
Built with and by Teycir Ben Soltaneβ€’
How to Useβ€’FAQβ€’GitHubβ€’arXiv.orgβ€’
Share:

20 results for β€œexpected cost”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.β“˜

Want pure semantic search? Try claim verification β†’

cs.DScs.DMTheoreticalRecentSep 23, 2026

Transposition achieves OPT$+O(1)$ in polynomial time for IID list update

Clayton Mizgerd

The paper improves the expected cost of queries in a self-organizing list by proving that after a polynomial number of queries, the expected cost is at most OPT + O(1)

View β†’
cs.CLRecentJun 1, 2026

Cost-Aware Diffusion Draft Trees for Speculative Decoding

Shuai Zhang, Huachuan Qiu, Hongliang He, Yong Dai

The paper introduces CaDDTree, a cost-aware method that optimizes token throughput by jointly selecting the tree structure and node budget for speculative decoding, outperforming existing methods like…

View β†’
cs.LGmath.OCstat.MLEmpiricalRecentOct 30, 2026

Cost-Aware Stopping for Freeze-Thaw Bayesian Optimization: When Does One-Step Lookahead Suffice?

Long Vu, Jongseong Brad Choi, Binoy Ravindran, Zhoulai Fu

This paper proposes a new stopping criterion for Bayesian optimization, called EI stopping, which balances exploration and exploitation to optimize a budget-free utility.

View β†’
cs.DSTheoreticalRecentOct 19, 2026

Capacitated Line Aggregation with Maximum Delay

Runtian Ren, Shengcai Liu

This paper studies capacitated line aggregation with per-batch maximum delay and presents several algorithms with competitive ratios.

View β†’
cs.ROcs.AIEmpiricalRecentJul 22, 2026

Courteous Anticipation: Improving Long-Lived Task Planning in Persistent Shared Environments

Md Ridwan Hossain Talukder, Roshan Dhakal, Elizabeth Phillips, Gregory J. Stein

A model-based planner is presented that minimizes immediate cost and aggregated expected future cost across all robots in a task planning scenario with robots sharing a persistent environment.

View β†’
cs.ARcs.AIcs.PFEmpiricalRecentOct 7, 2026

The Missing Fourth Term for the Emulation Tensor Memory Equilibrium (TME) Model: The Residue Deconstruction Cost

Harun Bayraktar, John Gunnels, Peter Caday

This paper corrects the Tensor-Memory Equilibrium model by adding a missing term and recalculating the operational-intensity threshold.

View β†’
cs.DSmath-phmath.CATheoreticalRecentJun 22, 2026

Computing Gaussian and exponential integrals in ${\Bbb R}^n$

Alexander Barvinok

This paper proves conditions for efficiently approximating expectations of certain functions with respect to standard Gaussian or symmetric exponential probability measures.

View β†’
cs.CRcs.CYcs.SIMar 22, 2026

Estimating the Social Cost of Corporate Data Breaches

Lina Alkarmi, Armin Sarabi, Mingyan Liu

This study estimates the true social cost of corporate data breaches by quantifying the direct financial and opportunity costs to victims, finding that these costs can significantly exceed corporate s…

View β†’
cs.PLTheoreticalRecentJul 28, 2026

The Best of Times, the Worst of Times: Moment-Based Analysis of Probabilistic Cost Structures

Chenyu Zhou, Di Wang, Thomas Reps

This paper presents a compositional cost analysis for probabilistic programs with hierarchical cost structures, allowing computation of mean and higher moments of non-additive costs.

View β†’
cs.LGcs.AIcs.SEEmpiricalRecentSep 28, 2026

TokenCast: Forecasting Token Consumption During LLM Agent Execution

Chaoqian Ouyang, Ling Yue, Libin Zheng, Huanghui Guo +6 more

This paper proposes TokenCast, a method to predict and control the token consumption of large language model agents.

View β†’
cs.DCcs.PFEmpiricalRecentJun 10, 2026

Beyond Per-Token Pricing: A Concurrency-Aware Methodology for LLM Infrastructure Cost Estimation

Chitral Patil

This paper corrects the dominant source of error in public LLM cost calculators by proposing a measurement methodology that takes into account actual GPU utilization.

View β†’
cs.DBcs.DSEmpiricalRecentJun 18, 2026

Caching for Dollars, Not Hits: An Exact Offline Reference for Cloud-Egress Caching and the Crossover That Decides When It Pays

Madhulatha Mandarapu, Sandeep Kunkunuru

This paper analyzes the effectiveness of caching heuristics on cloud object storage and provides a benchmark to measure their performance.

View β†’
cs.CYcs.AIcs.LGEmpiricalRecentJul 26, 2026

AI Strategy: How to Choose What AI Product to Implement

Foster Provost, Panos Ipeirotis

The paper introduces a framework called expected ROI (eROI) to help firms make informed decisions on AI projects by decomposing each project into three components: Value if Successful, Likelihood of S…

View β†’
cs.LGcs.ITmath.DGTheoreticalRecentJun 19, 2026

The Cost Geometry of Belief: finite-resource inference under noisy observation

Laurent Caraffa

The paper introduces a new cost geometry in Wasserstein space, reweighted by Fisher information, to model the cost of passing from one belief to another.

View β†’
stat.MLcs.LGmath.STEmpiricalRecentOct 12, 2026

Limit Theory for Online Expectile Estimation under Short and Long Range Dependence

Younghun Lee, Jake Zummo, Wei Biao Wu

The paper develops a one-pass stochastic-gradient algorithm for online estimation of expectiles from dependent data.

View β†’
cs.CERecentMay 29, 2026

When Certainty Is Not Worth It: Capital Lock-Up and Settlement Discounting in Prediction Markets

Jonas Gebele, Florian Matthes

This paper shows that the pricing of outcomes in prediction markets is significantly influenced by the financial friction of delayed settlement, quantifying this effect using an annualized settlement…

View β†’
cs.GTcs.AIcs.LGEmpiricalRecentOct 14, 2026

Price of Anarchy of First-Price Auctions in Agentic Markets

Shubhendu Trivedi, Jacob Eisenstein, Alekh Agarwal, Ian Gemp +2 more

This paper investigates the properties of agentic markets in decentralized serving-time markets and their potential to reduce the price-of-anarchy.

View β†’
stat.MLcs.AIcs.LGRecentMay 28, 2026

Improved Distribution Estimation in $\ell_\infty$

Doron Cohen, Aryeh Kontorovich, Yonatan Livshitz

This paper improves the theoretical bounds for estimating discrete probability distributions using the $\ell_\infty$ norm, resolving several open questions in the field.

View β†’