arxiv
PublishedOctober 9, 2026 at 4:00 AM
AdaSwitch: An Adaptive Switching Meta-Algorithm for Learning-Augmented Bounded-Influence Problems
Publisher summary· verbatim
arXiv:2509.02302v2 Announce Type: replace Abstract: We study history-dependent online problems with a possibly inaccurate prediction of the future request sequence. Motivated by several real-world applications, we introduce a \emph{bounded-influence} framework in which past decisions and requests af
Stay posted· Newsletter
Three short emails a week: Monday, Wednesday and Friday. Top movers, new models and the most-referenced story.
Your email is used only to send The Bubble Brief. Privacy policy
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivBridging the Gap: Converting Read Text to Conversational Dialogue1harxivTruth for Believable AI: Expressed Doubt, Provenance, and Belief Revision as an Engineerable Stance1harxivRICE-Alpha: Reliability-Informed Correction with Event Graphs for LLM-Agent Stock Forecasting1harxivWitness Overlap: Directional Provenance Inside Open-Weight Model Families1hThe Bubble Brief
MON · WED · FRIRead AI insights every Monday, Wednesday and Friday — top movers, new models, story of the week.
Your email is used only to send The Bubble Brief. Privacy policy
Originally published on arxiv ↗