arXiv — cs.AI preprintsInternational7 October 2026
Joint upper-bound coverage and route-choice utility: an empirical evaluation on two urban proxy tasks
This is an official announcement record
Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2610.06995v1 Announce Type: new Abstract: Whether more accurate traffic forecasts or higher uncertainty coverage improve route decisions is unclear. We evaluate this question with a frozen protocol that separates speed error, joint candidate path upper bound coverage, route selection, and realized loss. Using processed road speed data from Beijing and Chengdu, we construct offline proxy tasks with 150 origin destination pairs, three candidate paths, and 14 test days per city. We compare raw 90th percentile path time bounds with jointly calibrated upper bounds under minimum bound route ch
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- GAMEGO: Training Game-Dev Agents with Synthetic Trajectories Anchored in Real-World Assets7 October 2026
- Text2Dashboard: A Governed Agent Architecture for Natural-Language Dashboard Generation over Enterprise DataBrain7 October 2026
- FluidPD: In-Place Elasticity for SLO-Aware Prefill-Decode Disaggregated LLM Serving7 October 2026
- Anchor Divergence for Semantic Geometry in Contrastive Learning7 October 2026
- RadOnc-Agent: An LLM-Orchestrated Framework for AI Workflows Across the Radiotherapy Care Pathway7 October 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.