CORTEXA
← Browse
arxivcs.LG2026-07-15

From Novice to Expert: Cost-Aware Bandits for Evolving Worker Performance in Crowdsensing

Yin Huang, Qingsong Liu, Jie Xu

Mobile crowdsensing (MC) recruits mobile users to perform sensing tasks using their smartphones, enabling large-scale applications such as traffic monitoring and environmental sensing. A fundamental challenge is online worker recruitment under uncertainty, where the platform must learn workers' sensing performance while operating with a limited budget. Existing learning-based MC recruitment methods typically assume that each worker's sensing quality is stationary with a fixed mean over time. In practice, however, worker performance often improves with experience and eventually stabilizes, while the incurred sensing cost can be unknown in advance due to time-varying device and context states. In this paper, we study a budget-constrained online recruitment problem in which the platform selects one worker in each round, observes the sensing quality and incurred cost, where the expected sensing quality of each worker increases with experience and eventually converges to a plateau, and repeats until the budget is exhausted. We formulate this problem as a structured bandit model where each worker's expected reward evolves according to an unknown increasing-then-converging function of its participation count, and each worker has an unknown expected cost. We develop a cost-aware online learning framework that jointly learns evolving reward trajectories and heterogeneous costs, detects performance saturation, and allocates the limited budget to maximize long-term sensing utility. We provide theoretical performance guarantees and validate the proposed approach through extensive experiments, demonstrating consistent improvements over baselines that ignore experience-driven dynamics or assume known costs.

View free PDFSource page

Related papers

arxivquant-phcs.AIcs.CVcs.LG2026-07-11

Quantum Circuit Vision: Cost-Aware Evaluation of Visual AI Agents for Quantum Code Generation

Dongping Liu, Aoyu Zhang, Luyao Zhang

Can AI agents visually comprehend quantum circuit diagrams and generate verified executable code--and at what cost? We present Quantum Circuit Vision, a cost-aware evaluation framework for multimodal AI agents on quantum circuit visual understanding. We construct a 132-circuit be…

View free PDFSource page
arxivcs.AIcs.LGq-fin.CPq-fin.PM2026-06-29

CLQT: A Closed-Loop, Cost-Aware, Strategy-Consistent Benchmark for Diagnostic Evaluation of LLM Portfolio-Management Agents

Bo Qu, Mingguang Chen

LLM agents are increasingly cast as autonomous portfolio managers, and benchmarks have moved from financial question-answering to sequential trading. Yet most still rank agents by returns over a fixed window -- a weak proxy, since a period's return is dominated by the market path…

View free PDFSource page
arxivcs.LGcs.AIcs.IRcs.MA2026-06-27

Multi-Agent Routing as Set-Valued Prediction: A WildChat Benchmark and Cost-Aware Evaluation

Ananto Nayan Bala, Faisal Muhammad Shah

Tool and agent routing from natural-language prompts is naturally a set-valued prediction problem: a single query may require multiple agents, while over-selection increases execution cost. The benchmark introduced here is derived from WildChat and contains 3,000 prompts over a f…

View free PDFSource page
arxivcs.AIcs.CLcs.LG2026-06-29

When Does Learning to Stop Help? A Cost-Aware Study of Early Exits in Reasoning Models

Zhe Dong, Fang Qin, Manish Shah

Reasoning models spend test-time compute unevenly across instances, and a growing family of early-exit rules -- confidence thresholds, entropy monitors, answer-stability checks, and learned stoppers -- promises to reclaim the waste. These rules, however, are evaluated under heter…

View free PDFSource page
arxivcs.LGcs.AIcs.DCcs.PF2026-07-16

An Auto-Scaling Approach for Serverless Environments Based on a Multi-Expert Consensus Mechanism

Mobina Kashaniyan, Mehrdad Ashtiani, Amirhossein Ghassemi

Serverless computing provides automatic resource management and pay-per-use execution, but effective autoscaling remains challenging because of dynamic workloads, cold-start latency, and dependencies among functions. We present a dependency-aware autoscaling framework that integr…

View free PDFSource page