Metraipolis › archive › dc_07bddd22dfc4
Beyond End-Task Success: How to Audit Visual Experience Retrieval in Robotics — arXiv:2609.26567
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.26567
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T16:43:11.501Z
- SHA-256 of the archived text
893b12b9d15f48515f94127cb0fd9b8150ad840482d229cd20fd3edaac5fbe1e- Stable URL of this page
https://metraipolis.com/documento/dc_07bddd22dfc4
How to cite
Beyond End-Task Success: How to Audit Visual Experience Retrieval in Robotics — arXiv:2609.26567 — arXiv (en), https://arxiv.org/abs/2609.26567 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_07bddd22dfc4 (Metraipolis archive dc_07bddd22dfc4, sha256 893b12b9d15f48515f94127cb0fd9b8150ad840482d229cd20fd3edaac5fbe1e)
BibTeX
@misc{dc07bddd22dfc4,
title = {Beyond End-Task Success: How to Audit Visual Experience Retrieval in Robotics — arXiv:2609.26567},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.26567},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_07bddd22dfc4; sha256 893b12b9d15f48515f94127cb0fd9b8150ad840482d229cd20fd3edaac5fbe1e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.26567. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Robots that store past experiences must select which one to reuse in a new scene. Most systems select by visual similarity, and most evaluations report only the success of the selected experience. That number does not show whether the selection was good: a rule can score well by repeatedly using one broadly transferable experience, or poorly because its preferred experience is weak. Since robots increasingly adapt by reuse rather than retraining, a score that describes the library rather than the rule misleads what the field builds next. We contribute an audit methodology: execute every stored experience in every query scene, over two manipulation tasks, three reuse mechanisms, and libraries of $K=3$, $10$, and $50$. Because every alternative's outcome is known, a score can be traced to per-scene selection or to library quality. The audited rules select by nearest-neighbor distance in five visual embeddings, from raw pixels to CLIP. (1) One fixed experience, chosen with hindsight, captures 30-58% of the gap between random selection and an oracle; per-scene selection competes for the remaining 0.07-0.15 in success rate. (2) At $K\ge10$, visual rules concentrate on one experience 1.5-3 times more than the oracle does, and their scores then follow that experience's quality. (3) Wherever a rule differs significantly from a shuffle that keeps its selection rates but pairs them with scenes at random, the rule is worse, for every learned image policy. (4) Visual distance predicts well whether a given pair will succeed (AUROC up to 0.96), yet ranks the candidates within one scene no better than chance for four of five embeddings at $K=50$ (AUROC 0.45-0.52). Exhaustive execution is usually infeasible, so the audit reduces to two cheap reports any study can give: the distribution of selected experiences, and the success of the best single experience in hindsight. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-23 in cs.CV). Categorie arXiv: Robotics (cs.RO) ; Computer Vision and Pattern Recognition (cs.CV). Pagina del lavoro: https://arxiv.org/abs/2609.26567 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T15:56:18.249Z dalla pagina https://arxiv.org/catchup/cs.CV/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).