Sign inGet started
Paper · arXiv

Learning to Order: Task Sequencing as In-Context Optimization

Task sequencing (TS) is one of the core open problems in Deep Learning, arising in a plethora of real-world domains, from robotic assembly lines to autonomous driving. Unfortunately, prior work has not convincingly demonstrated the generalization ability of meta-learned TS methods to solve new TS problems, given few initial demonstrations. In this paper, we demonstrate that deep neural networks can meta-learn over an infinite prior of synthetically generated TS problems and achieve a few-shot generalization. We meta-learn a transformer-based architecture over datasets of sequencing trajectories generated from a prior distribution that samples sequencing problems as paths in directed graph...

AuthorsJan Kobiolka, Christian Frey, Arlind Kadra et al.
Primary categorycs.LG
Published15 March 2026
Last updated at source15 March 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/97ba8b09-dd87-4232-aa0f-0dcbe7896f55" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.