When Does Adaptive Recovery Pay? Crossover-Horizon Prediction for Failure Recovery under a Noisy Failure Classifier
编号:170 访问权限:仅限参会人 更新:2026-11-10 17:01:54 浏览:7次 Online

报告开始:2026年11月20日 16:00(Asia/Kolkata)

报告时间:15min

所在会场:[S4] Artificial Intelligence and Intelligent Computing [S4-4] Artificial Intelligence and Intelligent Computing

暂无文件

摘要
Tool-using agents fail in recurring and classifiable ways, and the choice of recovery strategy is increasingly treated as something to be learned rather than fixed in advance. A designer weighing a hand-written recovery table against an online learner needs to know at what deployment horizon the learner overtakes the table. Existing crossover analyses assume the policy observes the true failure type, which real systems do not provide; the policy sees a classifier’s prediction. The present work reformulates the crossover problem under an arbitrary confusion matrix by mapping the strategy-success matrix into predicted-type space with an exact Bayes mixture, then separates the resulting degradation into a reward-ceiling channel and a learnability channel. At a classifier with 0.939 mean diagonal accuracy, ceiling loss exceeds learnability loss by roughly six to one. The two channels also work against each other: classifier noise raises the static table’s regret rate by 58%, yet shifts the predicted crossover only from 3053 to 3126 episodes, and a constructed instance establishes that the horizon is not monotonic in classifier accuracy. The reformulation’s free constant was tested under a protocol registered before the supporting data existed. The held-out ratio R = 1.4729 clears its pre-committed threshold of 1.5, but the bootstrap interval [1.00, 9.55] required by the same protocol does not confirm that the clearance is stable, so the component is reported as partially supported. A labeled, non-pre-registered follow-up traces the instability to one confound: all 25 environments were scored against a single reused table rather than one competent for each. Widening to 150 environments with a table authored per environment cuts median error from 59.7%/40.5% to 19.98%/14.00%, brings R to 1.4270, and narrows the interval to [0.78, 2.17], which still crosses 1.5, so the corrected result counts as substantially more stable rather than confirmed. Index Terms—autonomous agents, failure recovery, multiarmed bandits, Thompson sampling, noisy context, preregistration, negative results
关键词
autonomous agents, failure recovery, multi-armed bandits, Thompson sampling, noisy context, pre-registration, negative results
报告人
Pio Michael
student Karunya Institute of Technology and Science

稿件作者
Pio Michael Karunya Institute of Technology and Science
Divina T P Karunya Institute of Technology and Science
发表评论
验证码 看不清楚,更换一张
全部评论
重要日期
  • 会议日期

    11月20日

    2026

    至

    11月22日

    2026

  • 10月31日 2026

    初稿截稿日期

  • 11月07日 2026

    提前注册日期

  • 11月22日 2026

    注册截止日期

主办单位
United Societies of Science
承办单位
Pondicherry University
协办单位
IEEE Section
IEEE Madras Section
移动端
在手机上打开
小程序
打开微信小程序
客服
扫码或点此咨询