Metraipolis › archive › dc_9f04cd5e1fab
Missing Bridges: Composition-Aware Active Imitation Learning — arXiv:2609.18004
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.18004
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T16:59:09.776Z
- SHA-256 of the archived text
d5efe97a8dfbe51ab6ec7138d3a10f815ef7a5bf9bf946236d4a1860728a76c6- Stable URL of this page
https://metraipolis.com/documento/dc_9f04cd5e1fab
How to cite
Missing Bridges: Composition-Aware Active Imitation Learning — arXiv:2609.18004 — arXiv (en), https://arxiv.org/abs/2609.18004 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9f04cd5e1fab (Metraipolis archive dc_9f04cd5e1fab, sha256 d5efe97a8dfbe51ab6ec7138d3a10f815ef7a5bf9bf946236d4a1860728a76c6)
BibTeX
@misc{dc9f04cd5e1fab,
title = {Missing Bridges: Composition-Aware Active Imitation Learning — arXiv:2609.18004},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.18004},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9f04cd5e1fab; sha256 d5efe97a8dfbe51ab6ec7138d3a10f815ef7a5bf9bf946236d4a1860728a76c6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18004. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Active imitation learning reduces expert effort by allowing a learner to request the demonstrations it needs. Existing methods typically select these requests for their expected information gain about the expert policy. In structured multi-task domains, however, the number of start-goal tasks may grow combinatorially despite their solutions sharing reusable behavior. This makes composable behaviors especially valuable, since a single demonstration may help solve many tasks at once. Prior methods do not explicitly account for this value when selecting which demonstration to request. We introduce Adaptive Agents via Latent Topologies (AALT), which requests demonstrations that maximize expected gains in start-goal connectivity. We further show that this objective is formally tied to information gain about task reachability. AALT organizes existing demonstrations into a topology of latent hub states connected by learned behaviors, identifies high-value bridge demonstrations that are likely to enable many tasks at once, and grounds each to an expert query. At inference, it plans through the resulting topology and conditions a diffusion policy on each successive hub transition. In a simulated UR5e robot ordered-retrieval domain with 72 tasks, AALT improved from 42/72 to 72/72 (100%) successful tasks consistently using only 3 demonstrations totaling 5 transitions beyond the initial dataset. After 20 demonstrations, the strongest baseline averaged 88.6% success using 98 transitions. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-17 in cs.RO). Categorie arXiv: Artificial Intelligence (cs.AI) ; Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2609.18004 — 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-15T16:13:27.351Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).