Akapulu Labs logo Akapulu Labs Research

Wait-Think-Answer Control

Learning When to Think While Listening in Large Audio-Language Models

Wait-Think-Answer Control — method overview

This paper learns when to externalize intermediate reasoning during streaming audio by training a controller to decide online whether to wait, emit a thinking update, or answer. It optimizes full trajectory with rewards covering correctness, timing, reasoning quality, and latency—not just final answer.

  • llm
  • multimodal
  • streaming
  • dialogue
  • reasoning
  • rlhf

Authors: Zhiyuan Song, Weici Zhao, Yang Xiao, Suhao Yu, Cheng Zhu, Jiatao Gu

Categories: cs.CL, cs.AI, cs.LG, cs.SD

Comment: 19 pages, 4 figures, 6 tables

Published 2026-05-26 · Updated 2026-05-26

Abstract

Recent advances in Large Audio-Language Models (LALMs) have made real-time, streaming spoken interaction increasingly practical. In this setting, reasoning quality and responsiveness are tightly coupled: delaying reasoning until the speech endpoint can improve answer quality but moves deliberation into user-visible response delay, while answering too early risks committing before decisive evidence arrives. We introduce a learnable wait-think-answer control formulation for LALMs. Motivated by the incremental nature of human conversation, the controller decides under partial audio evidence when to wait, when to externalize a compact reasoning update, and when to answer. Using Qwen2.5-Omni-7B as the base model, we construct aligned wait-think-answer traces from spoken reasoning data, train the controller with supervised fine-tuning (SFT), and then apply Decoupled Clip and Dynamic Sampling Policy Optimization (DAPO). The reward combines answer correctness, action validity, update timing, latency synchronization, reasoning quality, and chain consistency, optimizing the complete wait-think-answer trajectory and not the final answer alone. On a six-task synthetic spoken reasoning question answering (SRQA) benchmark, the six-reward DAPO controller improves the row-weighted accuracy from 67.6% to 70.3% while reducing post-endpoint final-think length by 14% under the same Qwen deployment harness. On a 186-item human-recorded Real Audio Bench, a transfer check beyond text-to-speech (TTS)-rendered speech, the controller family remains functional: SFT achieves the strongest accuracy, while the six-reward DAPO controller is the only learned variant whose final-think length falls below the base. These results suggest that a streaming model should learn when to make intermediate reasoning explicit during the audio stream.


Introduction and Motivation

Large Audio-Language Models (LALMs) are increasingly capable of participating in real-time spoken interaction. Systems like Moshi, Mini-Omni, Freeze-Omni, and Qwen2.5-Omni can process streaming audio and generate responses with low latency, making it practical to ask an audio model to reason while speech is still arriving. However, this creates a fundamental tension: answer quality and responsiveness are tightly coupled. Waiting until the full utterance has been heard allows more complete reasoning but pushes deliberation into user-visible response delay. Answering early is fast but risks committing to a wrong answer before decisive evidence arrives at the end of the utterance.

This temporal control problem is analogous to human conversation. Psycholinguistic and neuroscience research demonstrates that listeners frequently begin preparing responses before the current speaker's turn has ended — short response gaps in natural dialogue require overlap between comprehension and production planning. The paper draws on this intuition to motivate a learnable wait-think-answer controller for streaming LALMs: a model that, at each point along the audio stream, explicitly decides whether to wait for more evidence, emit a compact intermediate reasoning update, or commit to a final answer.

Most prior work on audio reasoning follows a complete-audio protocol: the model receives the full utterance, generates a reasoning chain, and then produces its response. This is useful for measuring final answer quality, but it sidesteps the online decision problem. Recent streaming systems have started to address this gap — for example, Shih et al. use an inference-time question-completeness signal to trigger a single post-utterance chain of thought, with accuracy–latency tradeoffs shaped by length-biased preference optimization. The present paper goes further: instead of a single terminal chain of thought triggered by a completeness signal, the model is trained end-to-end to emit multiple grounded intermediate state updates during the audio stream, each visible to and reusable by later controller decisions.

Problem Formulation: Wait-Think-Answer Control

The paper frames streaming speech reasoning as an online control problem over an explicit text memory. Let $x_{1:T}$ denote the full spoken input, let $0 < t_1 < \cdots < t_K \leq T$ be controller decision times, and let $z_{<k}$ be the visible reasoning states already emitted. The controller operates in full-prefix mode: at decision step $k$, it observes the complete audio prefix $x_{1:t_k}$ heard so far, together with the committed text memory $z_{<k}$.

The controller observation and action are:

$$o_k = (x_{1:t_k},\; z_{<k}), \qquad a_k = \arg\max_{a \in \mathcal{A}_k} \pi_\theta(a \mid o_k)$$

where $\pi_\theta$ is the controller policy with parameters $\theta$, and $\mathcal{A}_k$ is the legal action set at step $k$. The action space contains exactly three primitives:

  • <wait/> — advances the audio stream without changing the visible reasoning state.
  • <think>...</think> — emits a short grounded intermediate state update $z_k$, appended to the memory so all future controller calls can condition on it.
  • <answer>...</answer> — commits to the final response.

Before the speech endpoint, the legal actions are wait and think. After the endpoint, the controller emits one final think and then an answer. Answer timing is therefore not a learned pre-endpoint stopping decision in these experiments — the answer action is endpoint-gated. This design keeps timing trainable and inspectable while allowing open-ended text generation inside thinking and answering spans.

The key insight is that distributing reasoning across pre-endpoint think actions amortizes the total reasoning cost: each visible update emitted during listening absorbs deliberation that would otherwise accumulate into the final post-endpoint think, reducing residual deliberation as a proxy for user-visible response delay.

Wait-think-answer controller in full-prefix mode. At decision step k, the controller observes the audio prefix and the committed text memory, then emits wait, a visible state update, or a final answer.
Wait-think-answer controller in full-prefix mode. At decision step $k$, the controller observes the audio prefix $x_{1:t_k}$ and the committed text memory $z_{<k}$, then emits <wait/>, a visible state update, or a final answer. The diagram focuses on controller-level information flow, not the internal multimodal token layout.

Base Model and Deployment Semantics

The controller is instantiated on Qwen2.5-Omni-7B, a streaming Thinker–Talker omni-model that perceives audio, vision, and text while generating text and speech. The paper's implementation uses full-prefix replay: every controller call replays the observed audio prefix from scratch, while preserving the evidence available in the intended deployment semantics. This approximation is used because the available Qwen2.5-Omni serving path does not expose an official controller-style cache interface for the wait-think-answer loop — building an efficient cache-native implementation would require lower-level runtime and kernel work.

The authors also built an experimental stateful KV-cache controller prototype that appends audio chunks into a single persistent Qwen2.5-Omni thinker KV cache and forks temporary states for each controller decision. Mechanism checks confirm that cache lengths match attention lengths and that wait actions do not enter the persistent cache, but the prototype is not yet a score-producing batch runner. The full-prefix replay approach is used for all reported benchmarks.

The paper notes that the same information pattern would appear in a true cache-native streaming deployment: audio chunks would enter one persistent context, the KV cache would not be discarded between chunks, intermediate think text would be appended back into the visible context, and the final-think turn would see the complete cached audio plus all earlier thoughts.

Training Data Construction

The data pipeline constructs aligned wait-think-answer traces from spoken reasoning examples in three stages:

Synthetic Controller Corpus

An initial candidate corpus of 80,000 records (40,000 verifiable and 40,000 open-ended) is generated by prompting GPT-4o. Generation is stratified by verifiability, difficulty, and topic. Each record stores:

  • A spoken surface form (tts_text)
  • A TTS style instruction (tts_instruct)
  • Lexical anchors for answer-relevant state changes (anchor_words)
  • A semantic wait-think-answer trace (logical_actions)
  • The final answer (final_answer)

After validation, deduplication, and human spot checks, the aligned corpus contains 75,723 audio-text records: 38,213 verifiable and 37,510 open-ended, split into 73,675 training and 2,048 validation records. SFT uses the full aligned corpus. DAPO uses the verifiable training branch (37,180 scorable training records), augmented with a small set of training-split examples from ARC-Challenge, ARC-Easy, GSM8K, PIQA, and SocialIQA (kept below 2% of the DAPO mix; held-out evaluation examples are never included).

Speech Synthesis and Alignment

Each spoken input is synthesized as a single full utterance using Qwen3-TTS. Full-utterance synthesis preserves global prosody and avoids artificial prosodic breaks at action boundaries — segment-wise synthesis would inject unnatural pauses exactly where the model is supposed to learn natural timing. CTC-style forced alignment maps transcript words to audio timestamps, and controller boundaries are snapped upward to a 0.5-second decision grid. A tick sweep at 0.5s, 1.0s, and 1.5s grids showed tied validation token accuracy (0.6108, 0.6105, 0.6102 respectively), so 0.5s was chosen for finer timing resolution. Qwen2.5-Omni calls are padded to the 2.0s minimum audio window required by the model.

Real Audio Bench

For transfer evaluation beyond TTS-rendered speech, the authors collected Real Audio Bench: five speakers recorded 200 GPT-4o-generated candidate items designed for natural spoken delivery. Human screening removed ambiguous or unanswerable prompts and corrected answer keys, leaving 186 recordings. Each item is designed so that an early plausible answer becomes wrong or incomplete once a late decisive cue arrives. The benchmark spans categories such as mid-way reversal, adversarial pause, incremental accumulation, and noisy environment, across scenario families like travel logistics, workplace admin, and food/shopping. It is treated as a compact transfer benchmark for real human delivery, not a large-scale user study.

Supervised Fine-Tuning (SFT)

The controller is first trained with supervised fine-tuning on Qwen2.5-Omni-7B using Low-Rank Adaptation (LoRA; rank 8, alpha 32, dropout 0.05) via MS-Swift. The audio encoder and aligner are frozen; only the language model is trainable. Training runs for one epoch over the aligned controller export with a cosine learning rate schedule ($1 \times 10^{-5}$), effective batch size 32, and fused AdamW with weight decay 0.1.

The supervised objective teaches: (1) the action serialization format, (2) the short semantic state style for intermediate thoughts, (3) the distinction between ordinary waits, answer-relevant pre-endpoint thoughts, final-think compression, and the final answer. Training and validation curves show decreasing loss and increasing token accuracy, stabilizing during training. The SFT controller serves as the initialization for all DAPO runs.

SFT training curves from the audio-only cold-start run.
SFT training curves from the audio-only cold-start run. Training and validation metrics improve during supervised fine-tuning, providing the initialization for policy optimization.

DAPO Policy Optimization

After SFT, the controller is optimized using a controller-specific adaptation of Decoupled Clip and Dynamic Sampling Policy Optimization (DAPO), which belongs to the Group Relative Policy Optimization (GRPO) family. DAPO requires live streaming rollouts, controller-action parsing, local reward computation, dynamic resampling, and adapter updates inside the controller runtime — this motivates a custom trainer rather than the generic MS-Swift GRPO path.

Group Relative Advantages

Each prompt is sampled into a group of $G$ rollouts scored with the trajectory reward. Group-relative advantages are computed as:

$$A_i = \frac{R_i - \frac{1}{G}\sum_{j=1}^{G} R_j}{\operatorname{std}(R_1, \ldots, R_G) + \epsilon}$$

Token-Level Clipped Objective

Token-level credit assignment is applied because the policy mixes actions with different failure modes — bad waits, useful short thoughts, malformed final-think turns, and correct answers should not all receive identical pressure. With $r_{i,t}(\theta) = \exp(\log \pi_\theta(y_{i,t} \mid o_{i,t}) - \log \pi_\text{old}(y_{i,t} \mid o_{i,t}))$ denoting the per-token probability ratio:

$$\mathcal{L}_\text{DAPO} = -\frac{1}{|M|} \sum_{(i,t) \in M} \begin{cases} \min\!\left(r_{i,t} A_i,\; \operatorname{clip}(r_{i,t}, 1-\epsilon_l, 1+\epsilon_h) A_i\right), & A_i \geq 0 \\ \max\!\left(r_{i,t} A_i,\; \operatorname{clip}(r_{i,t}, 1-\epsilon_l, 1+\epsilon_h) A_i\right), & A_i < 0 \end{cases}$$

where $M$ is the completion-token mask. The asymmetric clipping uses $\epsilon_l = 0.20$ and $\epsilon_h = 0.28$. KL regularization is applied with coefficient 0.01. The actor learning rate is $4 \times 10^{-7}$ with 50 warmup steps over 1,000 total steps. Maximum rollout context is 8,192 tokens, with 48-token caps on think and answer spans.

Before a DAPO update, sampled groups must contain enough format-valid rollouts, at least one valid final-think rollout, and at least one valid pre-endpoint thought. Groups that collapse to all-wait or malformed final-think behavior are resampled up to a fixed retry budget; persistent failures are skipped and logged.

Reward Design

The reward function is central to the paper's contribution. The authors argue that optimizing only the final answer encourages a wait-all policy that shifts deliberation into user-visible response delay, while optimizing only latency can produce premature answers, empty thoughts, or malformed action traces. The reward therefore scores the full wait-think-answer trajectory.

Trajectory reward for wait-think-answer control.
Trajectory reward for wait-think-answer control. Rule-based terms enforce action format, update timing, answer correctness, and final-latency budget, while judge-assisted terms score local thought quality and chain consistency.

Six reward terms are combined, four rule-based and two judge-assisted:

Term Role Positive signal Failure mode discouraged
$R_a$ Answer correctness Correct final answer via deterministic task scoring; local judge as semantic-equivalence fallback for open short-answer cases Fluent but incorrect final answers
$R_f$ Protocol validity Valid wait-think-answer format: wait/think while listening, one final think, answer only after utterance ends Early answers, malformed tags, missing final-think turns, invalid action order
$R_s$ Response latency Short post-endpoint final-think state once audio stream is complete Repeating reasoning after endpoint that should have been resolved during listening
$R_u$ Update timing Intermediate thoughts placed near answer-relevant evidence updates in the audio Missing important state changes or inserting irrelevant thoughts
$R_t$ Thought quality Short, concrete, answer-supporting semantic states (judge-scored) Generic, verbose, or meta-level thoughts that do not update the answer state
$R_c$ Chain consistency Thought chain supports the final answer without unsupported jumps (judge-scored) Internally inconsistent chains or unsupported jumps to the final answer

The shaped reward for a valid trajectory is:

$$R_\text{valid}(\tau) = \underbrace{\lambda_a R_a}_{\text{answer}} + \underbrace{\lambda_f R_f}_{\text{format}} + \underbrace{\lambda_s R_s}_{\text{sync/latency}} + \underbrace{\lambda_u R_u}_{\text{update timing}} + \underbrace{\lambda_t R_t}_{\text{thought quality}} + \underbrace{\mathbf{1}[R_a > 0]\,\lambda_c R_a R_c}_{\text{consistency bonus}}$$

The final reward applies a protocol gate:

$$R(\tau) = \begin{cases} \lambda_f R_f, & R_f \leq 0 \\ R_\text{valid}(\tau), & R_f > 0 \end{cases}$$

Reward weights are $\lambda_a = 1.0$, $\lambda_f = 1.0$, $\lambda_s = 1.0$, $\lambda_u = 3.0$, $\lambda_t = 1.0$, $\lambda_c = 0.45$. The protocol gate gives format validity priority over all other objectives: if the model answers before the utterance is complete, omits the required final-think/answer structure, or emits an ill-formed trace, answer correctness cannot rescue the rollout. The consistency bonus is gated by $R_a > 0$, so a fluent but wrong chain does not receive extra credit for being self-consistent.

Key implementation details for specific reward terms:

  • $R_a$: Uses difficulty-aware effort calibration so a correct answer is not rewarded equally when the controller uses an implausibly empty or unnecessarily verbose reasoning state.
  • $R_s$: Applies a six-token free budget then a linear penalty with coefficient 0.30, capped at 3.0. A small bonus applies for compact answer cues of 3–6 tokens; an answer-shape guardrail penalizes question-form answers, label-only answers when a semantic answer is expected, and yes/no type mismatches.
  • $R_u$: Pre-endpoint thoughts are matched to answer-relevant evidence-update ticks with a tolerance of two 0.5s ticks; sparsity pressure penalizes both missing important updates and inserting thoughts at nearly every tick.
  • $R_t$, $R_c$: Scored by a local Qwen3.6-35B-A3B judge, with outputs mapped to coarse scores in $\{0, 0.5, 1\}$.

The update-timing weight $\lambda_u = 3.0$ and latency weight $\lambda_s = 1.0$ had the largest qualitative effect on the accuracy–residual-latency operating point during validation sweeps, because they directly shape when and how often the controller emits visible reasoning state.

Evaluation Benchmarks and Protocols

Synthetic SRQA Benchmark

The paper adopts the Spoken Reasoning Question Answering (SRQA) evaluation construction introduced by Shih et al. Text reasoning problems are rewritten into spoken questions, rendered with TTS, and evaluated as audio inputs. The benchmark contains 8,959 items across six tasks:

TaskCountType
ARC-Easy (ARC-E)2,376Multiple-choice science
ARC-Challenge (ARC-C)1,172Multiple-choice science
PIQA1,838Physical commonsense
SocialIQA (SIQA)1,954Social commonsense
GSM8K1,319Grade-school math
LLaMA-QS300Short-answer factual

A local Qwen3.6-35B-A3B judge is used for short-answer scoring, together with task-specific normalization for numeric and multiple-choice answers.

Evaluation Protocols

Two protocols are reported:

  • Offline mode: Complete-audio setting. The model receives the full spoken question once, emits one final <think> state, then emits the answer. This is the standard upper-bound reference for models without a controller interface.
  • Deployment mode: Streaming protocol. Audio arrives on a fixed 0.5s grid, each controller call sees the full audio prefix plus previous visible thoughts, and the policy chooses <wait/> or <think>...</think> before the endpoint. At the endpoint, the controller emits one final <think> and then an <answer>. Deployment mode is only available for Qwen-family rows.

The main latency metric is the length of the post-endpoint final-think state (in tokens), used as the controller-level measure of residual deliberation after the user stops speaking. Cross-family token-latency comparisons are treated as descriptive only.

Baselines

Within the Qwen family, the paper compares the base Qwen2.5-Omni-7B (in both offline and deployment modes), the SFT controller, and DAPO controllers trained with four, five, or six reward terms. External baselines evaluated in offline mode only include Audio Flamingo 3, Audio Flamingo 3 + AF-Think, and GLM-4-Voice-9B. Moshi rows from Shih et al. are included for context.

Results on Synthetic SRQA

Method ARC-E ARC-C SIQA PIQA GSM8K LLaMA-QS Avg. ↑ Final ↓
Complete-audio baselines
Qwen2.5-Omni-7B89.681.170.971.326.771.070.810.27
Audio Flamingo 375.559.442.232.710.166.347.44.97
Audio Flamingo 3 + AF-Think47.335.031.621.73.048.030.59.18
GLM-4-Voice-9B64.948.541.222.16.763.740.220.88
Qwen streaming controllers (deployment mode)
Qwen2.5-Omni-7B (base)87.880.868.663.522.871.067.610.44
SFT controller86.378.168.660.521.671.766.19.82
DAPO (4 rewards)88.981.768.465.124.670.368.510.87
DAPO (5 rewards)89.181.769.666.424.971.069.210.94
DAPO (6 rewards)89.681.771.069.225.971.070.38.99

The six-reward DAPO controller is the strongest accuracy row within the Qwen streaming-controller family and is second only to the complete-audio Qwen row in the full table. It improves the row-weighted synthetic average from 67.6% (base controller) and 66.1% (SFT controller) to 70.3%, with gains on ARC-C, ARC-E, SIQA, PIQA, and GSM8K. Crucially, it also reduces mean post-endpoint final-think length from 10.44 tokens (base) to 8.99 tokens — a 14% reduction — demonstrating that the controller has learned to move deliberation earlier in the stream.

The SFT controller provides the supervised initialization for DAPO and should be read as protocol learning under token-level supervision, not direct task-reward optimization. Its accuracy (66.1%) is slightly below the base controller, while its final-think length (9.82) is marginally shorter. The DAPO stage supplies the task-level reward that moves the controller back toward task-aligned behavior and beyond the base.

The ablation across reward stacks reveals a clear progression: adding reward terms progressively improves accuracy, but the key jump in both accuracy and latency reduction comes when the sixth reward ($R_c$, chain consistency) is added alongside the fifth ($R_t$, thought quality).

Per-task synthetic SRQA accuracy for the base controller and the six-reward DAPO controller.
Per-task synthetic SRQA accuracy for the base controller and the six-reward DAPO controller. GSM8K is shown in a separate panel because its accuracy lies near 25%.

Results on Real Audio Bench

Method Training signal Acc. ↑ ΔAcc. Final ↓ ΔFinal
Base controller64.06.52
SFT controllerSFT68.8+4.86.64+0.12
DAPO (4 rewards)$R_a+R_f+R_s+R_u$65.6+1.67.74+1.22
DAPO (5 rewards)$+R_t$67.7+3.77.39+0.87
DAPO (6 rewards)$+R_t+R_c$65.1+1.16.33−0.19

On Real Audio Bench, the controller family transfers beyond TTS-rendered speech, but the best accuracy and shortest final-think points come from different learned variants. The SFT controller achieves the strongest accuracy (+4.8 points over base), while the six-reward DAPO controller is the only learned variant whose final-think length falls below the base controller (6.33 vs. 6.52 tokens). The five-reward DAPO variant has the strongest real-audio accuracy among DAPO variants (67.7%).

The 95% bootstrap confidence intervals (computed over 10,000 resamples of the 186 items) overlap substantially across all controller lanes, so Real Audio Bench is treated as a compact transfer check rather than a fine-grained controller ranking benchmark:

LaneCorrect/TotalAcc.95% Bootstrap CI
Base controller119/1860.640[0.570, 0.710]
SFT controller128/1860.688[0.618, 0.753]
DAPO (4 rewards)122/1860.656[0.586, 0.726]
DAPO (5 rewards)126/1860.677[0.608, 0.742]
DAPO (6 rewards)121/1860.651[0.581, 0.720]

Runtime Analysis

Because full-prefix replay incurs repeated prefix prefill cost, the paper reports replay-harness real-time factor (RTF) — total controller wall-clock time divided by source-audio duration — as an implementation diagnostic separate from the final-think token metric:

ControllerLLaMA-QSReal AudioARC-CARC-ESIQAPIQAGSM8KMean
Base controller1.3171.1011.0911.1121.0881.0971.1551.137
SFT controller1.5841.1791.3171.3621.3161.3761.3361.353
DAPO (6 rewards)1.2781.1361.0801.1981.0351.0881.1231.134

The six-reward DAPO controller's replay-harness RTF is below the SFT controller and nearly matches the base controller on average (1.134 vs. 1.137). This suggests that the DAPO controller's shorter final-think states also translate into modestly faster overall runtime in the replay harness, reinforcing the use of final-think length as a residual reasoning metric.

Controller Behavior Analysis

Policy optimization changes the trace-level operating point of the streaming system in interpretable ways. The SFT controller sits at 66.1% synthetic accuracy with 9.82 final-think tokens — protocol learning under supervised signal, not yet task-reward-optimized. The four-reward DAPO variant recovers and exceeds the base accuracy (68.5%) but at a longer final-think length (10.87 tokens), suggesting that the basic accuracy–latency–timing reward stack does not yet sufficiently incentivize moving deliberation earlier into the stream. Adding thought quality ($R_t$, five rewards) further improves accuracy (69.2%) with only marginal change in final-think length. Adding chain consistency ($R_c$, six rewards) simultaneously achieves the best accuracy (70.3%) and the shortest final-think length (8.99), suggesting that asking the controller to maintain a consistent and correct-supporting thought chain across the stream encourages more useful intermediate reasoning and less post-endpoint rework.

On Real Audio Bench, the divergence between the SFT controller (best accuracy) and the six-reward DAPO controller (shortest final-think) exposes different operating points along the accuracy–residual-latency frontier. The DAPO variants optimize primarily for the synthetic SRQA task distribution; the SFT controller, trained on a broader corpus including open-ended items, generalizes more uniformly to the real-audio domain. This suggests that the choice of training variant should be made with the target deployment accuracy–latency trade-off in mind.

Comparison with Related Work

The paper situates itself relative to three prior lines of work:

Complete-audio audio reasoning

Audio-CoT, Audio-Reasoner, Audio-Thinker, SARI, AudSemThinker, and related systems improve reasoning in LALMs through chain-of-thought prompting, structured data, curriculum learning, or reward-based post-training — but all operate on the full audio input. Audio-Thinker is the closest prior work in the LALM space, deciding whether to produce a pre-answer rationale and training for chain consistency, but it acts only after hearing the complete utterance. The wait-think-answer formulation differs by requiring the controller to act repeatedly under partial audio evidence.

Think-while-listening systems

Shih et al. use an inference-time question-completeness signal (entropy decrease over streaming ASR distribution) to trigger a single post-utterance chain of thought, with accuracy–latency shaped by length-biased DPO. STITCH, SHANKS, and StreamingThinker study simultaneous reasoning over speech or text streams. The key distinction from the present work is that these systems either trigger a single terminal chain-of-thought or use inference-time heuristics, whereas the wait-think-answer formulation trains the controller end-to-end with a multi-term trajectory reward to emit multiple grounded intermediate updates during listening that accumulate in visible memory.

Streaming omni models

Moshi, Mini-Omni, Freeze-Omni, and Qwen2.5-Omni target real-time speech-to-speech dialogue. The present work uses Qwen2.5-Omni as a substrate but studies a different problem: how the model should update an explicit reasoning state while streaming audio is still arriving.

Stated Contributions and Novelty

The paper claims the following contributions:

  1. A training formulation for wait-think-answer control in LALMs — a learned policy over partial audio evidence, with a serialized three-action interface (<wait/>, <think>, <answer>) that is trainable, inspectable, and semantics-preserving.
  2. An aligned spoken-controller data pipeline — GPT-4o-generated traces, Qwen3-TTS synthesis, CTC-based forced alignment, and conversion to chained streaming windows, enabling both SFT and DAPO training.
  3. A six-term trajectory reward that scores correctness, protocol validity, response latency, update timing, thought quality, and chain consistency — optimizing the complete streaming trajectory rather than the final answer alone.
  4. Empirical evidence that post-training moves the controller along the accuracy–residual-latency frontier: the six-reward DAPO controller improves row-weighted accuracy from 67.6% to 70.3% while reducing post-endpoint final-think length by 14% on synthetic SRQA, and transfers to human-recorded audio with the six-reward variant being the only learned controller whose final-think length falls below the base.
  5. Real Audio Bench — a 186-item human-recorded transfer benchmark for evaluating streaming LALM controllers beyond TTS-rendered speech.

Limitations

The authors are explicit about several limitations:

  • Real Audio Bench scale: Only 186 recordings from five speakers, making it a compact transfer check rather than a large-scale user study. Scaling to broader speaker diversity, accents, environments, and interaction styles is planned follow-up work.
  • Full-prefix replay implementation: The current implementation replays the full audio prefix at each controller call rather than using a cache-native server. The RTF audit measures the paper implementation rather than an ideal cache-native server that would forward the audio KV cache and avoid repeated prefill. Cache-native serving remains future work.
  • Endpoint-gated answer timing: Answer commitment is endpoint-gated in these experiments; learning pre-endpoint answer timing is not explored.
  • Single base model: All controller experiments use Qwen2.5-Omni-7B; generalization to other model families is untested.
  • No head-to-head comparison with question-completeness controllers under the same Qwen harness, which is identified as useful future work.

Broader Impacts

The paper discusses both positive and negative societal implications. On the beneficial side, low-latency spoken reasoning supports accessibility tools, real-time captioning, on-device translation, and conversational tutoring — applications where response delay disproportionately harms users who rely on these aids. On the risk side, a controller reasoning over partial speech is a step toward systems that monitor or pre-empt conversations without user awareness, lowers the cost of real-time social engineering, and can create asymmetric advantage. The paper's design choices constrain the misuse surface: the action space is restricted to a three-element set with a hard format gate, and the reward explicitly penalizes spurious thinking, aligning the controller with non-interruptive conversational norms.

Conclusion

The paper presents a principled formulation of streaming speech reasoning as wait-think-answer control for LALMs. By training a stateful controller that accumulates intermediate reasoning updates during the audio stream — rather than emitting a single post-utterance chain of thought — the system learns when to externalize reasoning and when to wait, shifting the accuracy–residual-latency operating point without changing the base architecture. The six-reward DAPO controller achieves both the best accuracy and the shortest residual deliberation among the learned controller variants on synthetic SRQA, and the six-reward variant is the only learned controller whose post-endpoint reasoning length falls below the base on human-recorded audio. These results support the central claim: a streaming audio-language model should learn when to make intermediate reasoning explicit during the audio stream, not only what to reason about after it ends.

Code & Implementation

The repository provides a complete implementation of the learnable wait-think-answer control framework for large audio-language models. Core components map directly to the paper's method:

Module Mapping

  • run_grpo.py: Decoupled Clip and Dynamic Sampling Policy Optimization (DAPO) trainer, the main policy optimization loop with LoRA-adapted Qwen2.5-Omni-7B base model, vLLM service integration, and group-normalized advantage computation across 8 rollouts per prompt.
  • training/: Actor update logic, dataset schema, checkpointing, audio I/O, and local or external rollout policy service wrappers (vLLM, MS-Swift backends).
  • rewards/: Six-reward stack composed of R_a (answer correctness), R_f (format/validity), R_s (latency post-EOF), R_u (update-timing alignment to acoustic-semantic ticks), R_t (thought quality via LLM judge), and R_c (chain consistency). Episode-level assembly in combined.py implements the weighted trajectory reward with hybrid credit assignment for early wait/think decisions.
  • prompts/: Public controller and reward-judge prompt templates, including policy prompts for the streaming model and judge prompts for R_t and R_c evaluation.
  • scripts/train_sft_paper.sh and scripts/train_dapo_paper.sh: Wrapper scripts that expose paper hyperparameters: SFT via MS-Swift (rank-8 LoRA, 1e-5 LR, 8192 max length) and DAPO (1000 steps, 4e-7 actor LR, reward weights λ_a=1.0, λ_f=1.0, λ_s=1.0, λ_u=3.0, λ_t=1.0, λ_c=0.45). Supports multi-reward configurations (4, 5, 6 rewards) and local or external judge/policy endpoints.

Data Format

Training records are JSONL-formatted with audio paths, ground-truth answers, optional think annotations, and controller metadata (audio-tick intervals and update-timing annotation indices). The converter scripts/convert_controller_to_ms_swift.py transforms controller records into MS-Swift SFT format. The model operates in audio-only mode; text transcripts are metadata only.

Running the Pipeline

SFT trains the base model with wait-think-answer supervision; DAPO then optimizes the controller policy using the six-reward stack over 1000 steps with ε-clip ±0.20/0.28 and KL coefficient 0.01. The DAPO trainer manages local rollout and judge services by default or connects to external endpoints. Both pipelines use bfloat16 precision and LoRA rank 8.