Detailed content
Three paths to the same signal: continuous floats, redundant tokens per timestep, or a few compressed tokens via DCT (FAST).
📈 Continuous action: direct regression
The most natural representation: the head outputs floats directly for each action dimension (Δx, Δy, Δz, rotation, gripper). It’s simple, preserves full resolution, and wastes nothing on discretization. The problem, as seen in Module 1.4, is that when trained with MSE/L1 it is unimodal — collapses modes. That’s why continuous regression shines only when paired with an expressive head (diffusion/flow), rather than a simple MLP+MSE.
📊 When pure continuous works
- Unimodal tasks — a single clear solution per state.
- Minimum latency — one forward pass, no denoising steps.
- Baseline — starting point for measuring gains from the other options.
Regression
Emit floats per dimension.
L1/L2
Common regression losses.
Unimodality
Average limitation.
Full resolution
No loss from binning.
🔲 Discrete binning (RT-1/RT-2)
RT-1, RT-2, and OpenVLA discretize each dimension into uniform bins (RT-1 uses 256) and treat prediction as classification via cross-entropy. The advantage: it becomes a token problem, integrating seamlessly with the LLM’s vocabulary and capturing multimodality (categorical distribution). The drawbacks: loss of resolution (quantization) and loss of correlation between dimensions, since each one is tokenized independently.
✓ Advantages of binning
- ✓Integrates into the LLM vocabulary.
- ✓Captures multimodality via softmax.
- ✓Simple autoregressive training (cross-entropy).
✗ Disadvantages
- ✗Resolution limited by the number of bins.
- ✗Ignores correlation between dimensions.
- ✗Long sequences at high frequency (next topic).
Uniform binning
Divide interval into bins.
Quantization
Loss of resolution.
Cross-entropy
Action as classification.
Independence
Tokenized dimensions separately.
🌊 The high-frequency problem
This is where the pain that motivated FAST lives. At 50Hz, actions at consecutive timesteps are almost identical — the arm moves very little in 20ms. Tokenizing each timestep generates redundant tokens and enormous sequences: a 1-second chunk at 50Hz with 7 dimensions contains 350 tokens, most of them repeated. Long sequences make autoregressive training prohibitively expensive and degrade learning. Naive binning simply doesn't scale to high-frequency dynamic control.
# Custo de binning por timestep a 50Hz
chunk = 1s · 50Hz = 50 timesteps
dims = 7 (xyz + rot + gripper)
tokens = 50 × 7 = 350 ← maioria redundante
# treino autoregressivo nessa sequência: lento e instável
⚡ Practical tip
Redundancy is a clue: if the signal varies slowly between timesteps, it's compressible. Smooth signals concentrate energy in a few low frequencies—exactly what the DCT exploits in FAST.
Temporal redundancy
Nearly identical timesteps.
Long sequence
Hundreds of tokens per chunk.
Dynamic control
High frequency, fast motion.
Compressibility
Smooth signal → few coefficients.
⚡ FAST: DCT + BPE tokenization
FAST (Frequency-space Action Sequence Tokenization, Physical Intelligence, 2025) reverses the logic: instead of tokenizing in time, it transforms the trajectory into frequency domain via DCT (the same transform as JPEG), quantize the coefficients, and compress them with BPE. Since smooth signals concentrate energy in a few low frequencies, the result is few high-fidelity tokens. FAST makes autoregressive VLAs competitive with diffusion in high-frequency control—RT-2/OpenVLA-style, but dexterous.
Trajectory DCT
Transforms the action chunk into frequency coefficients.
Quantize and discard
Keeps the dominant coefficients (low frequency), zeros out the rest.
Compress with BPE
Byte-Pair Encoding groups patterns into a few dense tokens.
💡 Why FAST matters
FAST drastically reduces sequence length while maintaining fidelity, speeding up training and enabling autoregressive VLAs for dexterous tasks. It is the bridge between the simplicity of the token paradigm and the high-frequency demands of fine manipulation.
DCT
Frequency transform.
BPE
Byte-pair compression.
Frequency domain
Compress concentrated energy.
Competitive AR
Dexterous tokens at high frequency.
⚖️ Trade-offs: length × fidelity × speed
Every tokenization lives in a Pareto frontier: fewer tokens train faster but may lose fidelity; more tokens preserve detail but cost more in training and latency. Naive binning lands in a bad spot (many tokens, average fidelity). FAST shifts the frontier — few tokens AND high fidelity — by exploiting the signal's frequency structure. The right choice depends on how compressible your signal is.
Esquema Tokens/chunk Fidelidade Treino
contínuo 1 (vetor) total rápido* (*precisa head expressiva)
binning muitos média lento
FAST poucos alta rápido
📊 The FAST gain
- ↓ length — orders of magnitude fewer tokens than timestep binning.
- ↑ speed — much faster autoregressive training.
- = fidelity — quality comparable to diffusion on dexterous tasks.
Pareto
Length × fidelity trade-off.
Sequence length
Number of tokens per chunk.
Training speed
Fewer tokens → faster.
Shift the boundary
FAST improves both axes.
🎛 Choose by use case and impact on the action head
There is no universal tokenization—the choice shapes the entire action head. Slow, quasi-static task (paused pick-and-place)? Binning works. Dexterous, dynamic manipulation (folding clothes, insertions)? FAST (autoregressive) or diffusion/flow. The representation choice determines whether the head is a detokenizer, a generative action expert, or a regressor—closing the conceptual loop that began in Module 1.2.
Characterize the task
Frequency, dynamics, and multimodality required.
Choose the representation
Binning, FAST, or continuous+diffusion, depending on the profile.
Match the head
Detokenizer, action expert, or regressor—consistent with the representation.
⚡ Practical tip
In 2026, two paths win in practice: FAST + autoregressive backbone (simple, fast training) or flow matching (fluid, continuous action). Start with what your stack already supports and iterate.
Task dynamics
Slow vs. dynamic.
Head design
Head follows the representation.
Representation decision.
Defines the entire output.
Closed loop
Connects back to M1.2.
✅ Module and Track 1 summary
Next: Track 2 — Tools
M2.1 — Python + PyTorch: the dominant stack for implementing everything you learned here, from tensors and LoRA to inference at 10-50Hz.