Metraipolis › archive › dc_a9d52b9ea5cd

Learning Source Acquisition Policies by Offline Planning — arXiv:2609.14299

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.14299
License (as archived)
CC0-1.0
Archived
2026-10-16T00:10:40.589Z
SHA-256 of the archived text
08a80c6d4a52b038c38e58093df34331923d97ee14b3d14a0bd5d94da1b523ad
Stable URL of this page
https://metraipolis.com/documento/dc_a9d52b9ea5cd

How to cite

Learning Source Acquisition Policies by Offline Planning — arXiv:2609.14299 — arXiv (en), https://arxiv.org/abs/2609.14299 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a9d52b9ea5cd (Metraipolis archive dc_a9d52b9ea5cd, sha256 08a80c6d4a52b038c38e58093df34331923d97ee14b3d14a0bd5d94da1b523ad)
BibTeX
@misc{dca9d52b9ea5cd,
  title = {Learning Source Acquisition Policies by Offline Planning — arXiv:2609.14299},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.14299},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a9d52b9ea5cd; sha256 08a80c6d4a52b038c38e58093df34331923d97ee14b3d14a0bd5d94da1b523ad},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14299. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Predicting under an acquisition budget requires choosing feature groups whose value can depend on later queries. O-MPAC transfers finite-horizon risk-cost targets from complete training records into a shared source-action scorer. At inference time, the scorer uses partial observations and source metadata, re-scores after each query, and applies a hard cost mask. We analyze how tied teacher targets and the remaining planning horizon affect the learned decisions. Uniform supervision over tied minima preserves the target distribution under source relabeling. In a five-seed routing experiment, it achieves 0.965 accuracy under both original and context-last orders. On six real tasks, validation selects H1 without action cross-entropy in all thirty splits. O-MPAC has the highest mean budget-integrated accuracy on five tasks against source-adapted GDFS, DIME, AACO+NN and a static policy.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-15 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.14299 — 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-15T23:54:14.688Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).