paper-with-me

Papers

Start Right, Arrive Right: Asynchronous Execution via Initial Noise Selection

2026-06-18 · Trong-Bao Ho, Quang-Tan Nguyen, Thien-Loc Ha, Gia-Binh Nguyen, Viet-Thanh Nguyen, Long Dinh, Minh N. Vu, Duy M. H. Nguyen, An Thai Le, Ngo Anh Vien arxiv

Action chunking enables robot policies to produce temporally coherent behavior, but generating multi-step action sequences with flow-based policies incurs latency that is incompatible with real-time control. Under asynchronous execution, the robot continues executing the current chunk while the next one is generated, causing even minor delays to create inconsistencies at chunk boundaries. Existing methods address this problem by steering generation toward the already executed action prefix. We instead show that prefix consistency can be achieved by selecting an appropriate initial noise before generation begins, allowing the unmodified flow ODE to produce a coherent next chunk. This reframes asynchronous inference as a noise selection problem rather than a trajectory steering problem. We introduce \textbf{PAINT}, a training-free method that finds this noise via backward Euler inversion and constructs the final chunk through a repainting rule. In summary, \texttt{PAINT} requires no gradients, retraining, or policy modification; yet it improves execution consistency and task performance across \textit{12 simulated benchmarks} and \textit{6 real-world manipulation tasks} spanning single-arm, bimanual, and humanoid embodiments. Website: ~\href{https://paint-action-chunking.github.io}{\texttt{https://paint-action-chunking.github.io}}.

📄 PDF Abstract BibTeX arXiv:2606.19774

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Asynchronous Distributed Optimization with Stochastic Delays

2020-09-22 · Margalit Glasgow, Mary Wootters

We study asynchronous finite sum minimization in a distributed-data setting with a central parameter server. While asynchrony is well understood in parallel settings where the data is accessible by all machines -- e.g., …

Distributed Optimization

Smart-Start Decoding for Neural Machine Translation

2021-06-01 · NAACL 2021 4 · Jian Yang, Shuming Ma, Dongdong Zhang, Juncheng Wan 외

Most current neural machine translation models adopt a monotonic decoding order of either left-to-right or right-to-left. In this work, we propose a novel method that breaks up the limitation of these decoding orders, ca…

Machine TranslationTranslation

Centralization in Attester-Proposer Separation

2024-08-06 · Mallesh Pai, Max Resnick

We show that Execution Tickets and Execution Auctions dramatically increase centralization in the market for block proposals, even without multi-block MEV concerns. Previous analyses have insufficiently or incorrectly mo…

Sharper Convergence Guarantees for Asynchronous SGD for Distributed and Federated Learning

2022-06-16 · Anastasia Koloskova, Sebastian U. Stich, Martin Jaggi

We study the asynchronous stochastic gradient descent algorithm for distributed training over $n$ workers which have varying computation and communication frequency over time. In this algorithm, workers compute stochasti…

AvgFederated Learning

Whose Text Is It Anyway? Exploring BigCode, Intellectual Property, and Ethics

2023-04-06 · Madiha Zahrah Choksi, David Goedicke

Intelligent or generative writing tools rely on large language models that recognize, summarize, translate, and predict content. This position paper probes the copyright interests of open data sets used to train large la…

EthicsPosition