Papers
arxiv:2603.20538

Understanding Behavior Cloning with Action Quantization

Published on Mar 20
· Submitted by
Tengyang Xie
on Mar 24
Authors:
,

Abstract

Behavior cloning with quantized actions in autoregressive models achieves optimal sample complexity under stability and smoothness conditions, with quantization error affecting horizon-dependent performance.

AI-generated summary

Behavior cloning is a fundamental paradigm in machine learning, enabling policy learning from expert demonstrations across robotics, autonomous driving, and generative models. Autoregressive models like transformer have proven remarkably effective, from large language models (LLMs) to vision-language-action systems (VLAs). However, applying autoregressive models to continuous control requires discretizing actions through quantization, a practice widely adopted yet poorly understood theoretically. This paper provides theoretical foundations for this practice. We analyze how quantization error propagates along the horizon and interacts with statistical sample complexity. We show that behavior cloning with quantized actions and log-loss achieves optimal sample complexity, matching existing lower bounds, and incurs only polynomial horizon dependence on quantization error, provided the dynamics are stable and the policy satisfies a probabilistic smoothness condition. We further characterize when different quantization schemes satisfy or violate these requirements, and propose a model-based augmentation that provably improves the error bound without requiring policy smoothness. Finally, we establish fundamental limits that jointly capture the effects of quantization error and statistical complexity.

Community

Paper author Paper submitter

We found that when you tokenize continuous robot actions for autoregressive models (like VLAs), the quantization error can compound catastrophically over long horizons if the tokenizer isn't "smooth". We showed that simple binning-based approaches naturally avoids this problem while fancier learned tokenizers can fail silently, looking great on training data but blowing up at deployment because small state perturbations map to completely different tokens. We also propose a model-based trick where the policy runs on simulated states instead of real ones to stay in-distribution, which further tightens the error. Our theory matches information-theoretic lower bounds, confirming that binning-based tokenization (as used in RT-2 and FAST) is theoretically well-grounded.

This is an automated message from the Librarian Bot. I found the following papers similar to this paper.

The following papers were recommended by the Semantic Scholar API

Please give a thumbs up to this comment if you found it helpful!

If you want recommendations for any Paper on Hugging Face checkout this Space

You can directly ask Librarian Bot for paper recommendations by tagging it in a comment: @librarian-bot recommend

Sign up or log in to comment

Models citing this paper 0

No model linking this paper

Cite arxiv.org/abs/2603.20538 in a model README.md to link it from this page.

Datasets citing this paper 0

No dataset linking this paper

Cite arxiv.org/abs/2603.20538 in a dataset README.md to link it from this page.

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/2603.20538 in a Space README.md to link it from this page.

Collections including this paper 1