arXiv — cs.AI preprintsInternational15 October 2026
ConicFlow: constrained Inference-time optimal control for flow matching models
This is an official announcement record
Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2610.14307v1 Announce Type: new Abstract: We propose ConicFlow, which frames constrained sampling from a flow matching model at inference time as an optimal control problem that balances deviation from the pretrained trajectory against reward, subject to hard terminal constraints. We discretize this problem and adapt receding-horizon control, optimizing only a short window of the trajectory at each step for computational tractability. We address the resulting sequence of receding-horizon subproblems with a receding-horizon primal-dual algorithm. Its dual multipliers capture the difficult
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- Artificiality's First Exam: An LLM-Referenced C-test for Supraintelligence15 October 2026
- The Silent Failures in Agentic Data Science15 October 2026
- ClawLoop: Self-Improving Agents via Harness-Native Training Loop15 October 2026
- Correction Training for Diffusion Models15 October 2026
- Long-Horizon-Terminal-Bench 2.0: Automating Diverse Task Construction and Measuring Sustained Agent Progress15 October 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.