---
title: 'CarelessWhisper: Multi-Domain Whisper Analysis'
url: https://www.emergentmind.com/topics/carelesswhisper
type: topic
---

# CarelessWhisper: Multi-Domain Whisper Analysis

CarelessWhisper, also appearing as **Careless Whisper**, is not a single framework but a reused research label applied to multiple unrelated contributions. In the arXiv record represented here, the name denotes: a study of Whisper speech-to-text hallucination harms [2402.08021]; a lyrics-transcription pipeline that combines music source separation with Whisper [2506.15514]; a method for converting Whisper into a causal streaming model [2508.12301]; and a privacy attack that exploits silent delivery receipts in mobile instant messengers [2411.11194]. A related Whisper-specific literature extends the hallucination branch with architectural mitigation and post-hoc calibration under noise [2511.14219], [2509.07195].

## 1. Scope and disambiguation

The shared label spans at least four distinct technical domains: speech-to-text reliability analysis, automatic lyrics transcription, streaming ASR, and mobile-messenger privacy. The overlap is nominal rather than methodological.

| Variant | Domain | Core focus |
|---|---|---|
| Careless Whisper | ASR evaluation | Whisper hallucination harms |
| CarelessWhisper | Music information retrieval | Lyrics transcription with source separation |
| CarelessWhisper | Streaming ASR | Causal, low-latency Whisper |
| Careless Whisper | Security and privacy | Silent delivery-receipt monitoring |

A common misconception is that CarelessWhisper denotes a canonical Whisper modification. In the arXiv usage represented here, that is not the case. Two of the works are about Whisper model behavior in ASR [2402.08021], [2508.12301], one uses Whisper as the transcription backend for automatic lyrics transcription [2506.15514], and one is unrelated to ASR and instead targets WhatsApp and Signal receipt protocols [2411.11194].

## 2. Whisper hallucinations, harms, and later mitigation work

One usage of the label originates in a study of full-sentence hallucinations in Whisper transcriptions. That work defines a hallucination as generated text that is “nonsensical, or unfaithful to the provided source input,” operationalized as entire phrases or sentences that were never uttered in the audio. On AphasiaBank interview speech, using sentence-length utterances, the study reports \(N = 13{,}140\) segments and \(187\) segments yielding at least one hallucinated phrase in the April/May runs, with
\[
H = \frac{\text{number of hallucinated utterances}}{\text{total number of utterances}} \simeq 1.4\%.
\]
The same work reports that \(38\%\) of hallucinations include explicit harms, partitioned into Perpetuation of Violence (\(19\%\)), Inaccurate Associations (\(13\%\)), and False Authority (\(8\%\)) [2402.08021].

The paper also reports disparities associated with aphasia and non-vocal duration. The corpus contains \(7{,}805\) control segments and \(5{,}335\) aphasia segments; hallucination rates are \(1.7\%\) for aphasia speakers and \(1.2\%\) for controls, with \(p = 0.019\). Non-vocal duration is defined as
\[
s_i = \frac{\text{non-vocal seconds}}{\text{total seconds}}
\]
for segment \(i\). Mean \(s\) is \(41\%\) for aphasia speakers and \(15\%\) for controls, and hallucinated segments have \(s \simeq 29\%\) versus \(26\%\) for non-hallucinated segments. In the reported logistic regression, the coefficient for Share of Duration Non-Vocal is \(0.951^{**}\), alongside \(0.056^{***}\) for Number of Words and \(0.368^*\) for Has Aphasia [2402.08021].

Later Whisper-specific work addresses related failure modes under noisy acoustic conditions. One approach modifies the Whisper model itself through a two-stage architecture. Its Adaptive Layer Attention (ALA) stage computes inter-layer similarities
\[
C_{ij} = \cos(e_i, e_j) = \frac{e_i \cdot e_j}{\|e_i\|\|e_j\|}
\]
over the Whisper encoder’s \(12\) layers, clusters layers into coherent blocks, mean-pools each block as
\[
r_k = \frac{1}{|B_k|}\sum_{l \in B_k} e_l,
\]
adds sinusoidal positional encodings, and uses learnable multi-head attention with final-layer queries to fuse block summaries before passing \(\{h_t\}\) to the decoder. The second stage applies multi-objective knowledge distillation with encoder cosine loss, decoder cosine loss, MSE on decoder cross-attention maps, and token-level cross-entropy, combined as
\[
L_{total} = \lambda_1 L_{Enc\_Cos} + \lambda_2 L_{Dec\_Cos} + \lambda_3 L_{Att} + \lambda_4 L_{CE},
\]
with \(\lambda_2=\lambda_3=\lambda_4=1.0\) and \(\lambda_1 \approx 0.8\). On Hindi at \(-10\) dB / clean, the reported WER / SeMaScore progression is \(42.77 / 0.8027 \rightarrow 40.74 / 0.8257 \rightarrow 38.13 / 0.8455\) from Baseline-2 to W-ALA to W-MOKD. On English average across noise levels, WER drops from \(\sim 12.46\%\) to \(\sim 9.68\%\) and then \(\sim 8.56\%\), while English clean WER changes from \(3.44\%\) to \(3.19\%\) and \(3.18\%\) [2511.14219].

A complementary line of work studies overconfidence in noisy Whisper decoding rather than hallucinated content per se. In additive noise below roughly \(-5\) dB SNR, \(10\text{–}20\%\) of tokens are incorrectly predicted with confidence above \(0.7\). The paper defines token confidence as the maximum softmax probability over Whisper’s \(51\,865\)-token vocabulary and evaluates calibration with Expected Calibration Error (ECE) and Normalized Cross Entropy (NCE). Its post-hoc framework uses per-token features, a two-layer MLP overconfidence classifier trained with weighted BCE (\(w \approx 7\)), and selective temperature scaling
\[
T_i = 1 + \mathrm{softplus}(W_2 \cdot \mathrm{ReLU}(W_1 \cdot f_i + b_1) + b_2)
\]
applied only when \(\hat o_i \ge 0.5\). On R-SPIN in the \(-18\) dB to \(-5\) dB regime, baseline Whisper has ECE \(= 0.086\), NCE \(= 0.064\), and overconfident mass \(= 11.1\%\); the selective token-level calibrator yields ECE \(= 0.036\), NCE \(= 0.192\), and overconfident mass \(= 6.6\%\), with EER unchanged at \(\sim 27.8\%\) and WER unaffected [2509.07195].

## 3. CarelessWhisper in automatic lyrics transcription

In music information retrieval, CarelessWhisper denotes a lyrics-transcription system built around music source separation and Whisper. The system uses Hybrid Demucs (`mdx` and `mdx_extra`) to extract a vocal stem from full-mix audio. Hybrid Demucs is described as a U-Net–style time-domain separator augmented with spectral (STFT) branches and LSTM blocks, trained with a time-domain \(L_1\) loss plus a multi-resolution spectrogram \(L_2\) loss:
\[
\mathcal{L} = \sum_{c \in \{v,d,b,o\}} \|x_c - \hat y_c\|_1
+ \sum_{\ell \in \text{resolutions}} \|\mathrm{STFT}_\ell(x_c) - \mathrm{STFT}_\ell(\hat y_c)\|_2^2.
\]
The reported pretrained checkpoints are `mdx`, trained on MUSDB18 train only with vocals SDR \(\approx 7.97\) dB, and `mdx_extra`, trained on MUSDB train+test+800 songs with SDR \(\approx 8.76\) dB [2506.15514].

The preprocessing pipeline retains a \(44.1\) kHz sampling rate, saves the separated vocals as single-track WAV, and uses them as Whisper inputs for both short-form and long-form transcription. For short-form evaluation, segments are \(\le 30\) s. For VAD features, the system computes root-mean-square amplitude
\[
\mathrm{RMS}[n] = \sqrt{\frac{1}{N}\sum_{m=n-N+1}^{n} x[m]^2}, \qquad
\mathrm{VAD}[n] = \frac{\mathrm{RMS}[n]}{\max_m \mathrm{RMS}[m]}.
\]
Whisper integration uses Whisper large-v2 via Faster-Whisper, beam size \(= 5\), language set to ground-truth, and \(5\) random seeds whose results are averaged [2506.15514].

For short-form transcription, the method first merges overlapping lyric lines into non-overlapping “merged-lines,” merging transcripts when overlap is \(\ge 0.2\) s and discarding rare segments \(>30\) s. It then groups merged-lines by splitting whenever the gap exceeds \(7\) s, and further partitions each group into sub-groups of \(\le 30\) s while maximizing minimum segment duration. These “group” segments have mean duration \(\sim 20\) s, compared with \(\sim 4\) s for single lines. The paper states that lines alone yield \(5\text{–}8\%\) absolute worse WER [2506.15514].

For long-form transcription, CarelessWhisper replaces Whisper’s native timestamp-based segmentation with RMS-VAD plus the “Cut-Merge” algorithm from WhisperX. The thresholds are onset \(= 0.1\), offset \(= 0.1\), \(\mathrm{min\_silence} = 1\) s, and \(\mathrm{max\_segment} = 30\) s. Adjacent regions separated by less than \(\mathrm{min\_silence}\) are merged, and any region longer than \(30\) s is split at the local VAD minimum closest to the \(30\) s mark. Prompt conditioning is disabled in long-form mode to allow batching [2506.15514].

Evaluation uses Jam-ALT (\(79\) songs, \(283\) min, backing \(4.66\%\), non-lexical vocables \(4.64\%\)) and MUSDB-ALT (\(39\) songs, \(166\) min, backing \(4.90\%\), non-lexical \(3.27\%\)) in a zero-shot setting. WER is defined as
\[
\mathrm{WER} = \frac{S + D + I}{S + D + H}.
\]
In short-form transcription on MUSDB-ALT, WER is \(23.59\) for mix, \(23.98\) for `sep-mdx`, \(20.00\) for `sep-mdx_extra`, and \(14.19\) for vocal stem. In long-form transcription on Jam-ALT, mix/native yields \(23.02\), while mix/RMS-VAD yields \(20.35\); on MUSDB-ALT, vocal stem/native yields \(17.51\) and vocal stem/RMS-VAD yields \(14.98\). The paper states that CarelessWhisper (`sep-mdx_extra` + RMS-VAD on mix) sets a new open-source SOTA on Jam-ALT long form with WER \(= 20.35\%\), compared with vanilla Whisper at \(23.02\%\) [2506.15514].

The implementation notes emphasize that deletion rates on backing vocals and non-lexical vocables remain \(\sim 50\%\) and are an open research problem. This identifies a residual error mode even when source separation and improved segmentation reduce overall WER [2506.15514].

## 4. CarelessWhisper as a causal streaming Whisper model

In streaming ASR, CarelessWhisper is a method for turning Whisper into a causal, low-latency model. The central problem is that Whisper is an encoder-decoder Transformer trained offline on fixed-length inputs with \(T=1500\) frames, and its encoder uses full self-attention. Consequently, when only the first \(k\tau\) frames are available,
\[
\mathrm{Encoder}(X_{k\tau}) = Z_{k\tau}
\]
need not match the prefix of the offline representation \(Z_T = \mathrm{Encoder}(X_T)\), since
\[
[Z_T]_t \neq [Z_{k\tau}]_t \qquad (1 \le t \le k\tau).
\]
The paper formalizes this as a barrier to direct low-latency conversion [2508.12301].

The proposed solution replaces encoder self-attention with blocked causal attention. With chunk size \(\tau\) and initial priming chunk \(\tau_0\), the mask is
\[
M_{ij}(k,\tau,\tau_0)=
\begin{cases}
0 & \text{if } \lceil i/\tau \rceil \ge \lceil j/\tau \rceil \text{ or } 1 \le i,j \le \tau_0,\\
-\infty & \text{otherwise.}
\end{cases}
\]
The masked self-attention is
\[
\widetilde{SA}(X_{k\tau})=
\mathrm{Softmax}\!\left(\frac{Q_{k\tau}K_{k\tau}^\top + M(k,\tau,\tau_0)}{\sqrt d}\right)V_{k\tau}.
\]
Theorem 2 is reported to show that for all \(1 \le t \le k\tau\), chunked encoding reproduces the offline prefix exactly:
\[
[\tilde Z_{k\tau}]_t = [\tilde Z_T]_t.
\]
With cached \(K,V\) matrices, the encoder complexity becomes \(O(T^2 d + T d^2)\) and memory \(O(Td)\) [2508.12301].

Adaptation to the causal regime is performed by LoRA fine-tuning. For each projection matrix \(W \in \mathbb{R}^{d \times d}\),
\[
W \leftarrow W_0 + BA, \qquad A \in \mathbb{R}^{d \times r},\; B \in \mathbb{R}^{r \times d},
\]
with only \((A,B)\) trained. Reported ranks are \(r=32\) for Whisper-base/small and \(r=4\) for Whisper large-v2. Training uses weakly aligned data with sampled chunk-boundary time points \(\tilde I\), and minimizes cross-entropy on streaming predictions conditioned on the audio prefix and tokens whose end time is within that prefix [2508.12301].

Streaming inference combines the causal encoder with a decoder that can revise unstable tokens. In greedy decoding, a token \(y_i=v\) at chunk \(k\) is stable if either
\[
P(y_i=v \mid y_{<i}, X_{k\tau}) \ge P(y_i=v \mid y_{<i}, X_{(k-1)\tau})
\]
or
\[
v = \arg\max_u P(y_i=u \mid y_{<i}, X_{k\tau}).
\]
The algorithm checks the last \(n\) tokens, backtracks to the first unstable position, and resumes decoding; once a token remains stable across two chunks it is considered final. Theorem 3 states that the resulting path probability satisfies
\[
\rho_k^{CW} \ge \rho_k^G.
\]
Beam search generalizes this by requiring beam stability within \(\mathrm{TopK}(\cdot, b)\), with the reported practical setting \(b=5, n=2\). To avoid hallucinations, if any beam predicts EOT, decoding pauses until a new chunk arrives [2508.12301].

On LibriSpeech test-clean/test-other, with chunk sizes \(\tau \in \{40,100,200,300\}\) ms and \(\tau_0 = 2\tau\), the paper reports that CarelessWhisper outperforms or matches Simul-Whisper and Ufal-Whisper in most settings. One example on large-v2 at \(\tau = 200\) ms gives test-clean WER \(= 5.92\%\) for CarelessWhisper versus \(5.61\%\) for Simul-Whisper, while on test-other at \(\tau = 200\) ms the reported WERs are \(11.41\%\) versus \(13.24\%\). Offline Whisper large-v2 is listed at \(2.7\%\) on clean and \(5.2\%\) on other [2508.12301].

Latency and runtime are central results. For large-v2 with \(\tau = 300\) ms, average latency is reported as \(0.426\) s for Ufal-Whisper (beam \(=5\)), \(0.231\) s for Simul-Whisper (greedy), \(0.081\) s for CarelessWhisper (greedy), and \(0.110\) s for CarelessWhisper (beam \(=5\)). The paper further states that CarelessWhisper is \(\sim 3\text{–}4\times\) faster in RTF than baselines despite using unoptimized OpenAI Whisper code [2508.12301].

The same fine-tuning process is also used for word-level timestamps. On TIMIT test, at a \(240\) ms threshold, CarelessWhisper large-v2 with \(40\) ms chunks yields \(87.6\%\) precision, \(83.8\%\) recall, Start Difference \(= 70.7\) ms, and End Difference \(= 75.8\) ms. At the stricter \(80\) ms threshold, the paper reports \(\sim 64\text{–}65\%\) precision, compared with Canary’s \(\sim 38\text{–}42\%\) [2508.12301].

## 5. Careless Whisper as a privacy attack on mobile instant messengers

In security and privacy research, Careless Whisper is an attack that exploits delivery receipts in E2EE messengers. The protocol description distinguishes server-ack, device-ack, and read-ack. In a single-device case, the sender receives confirmation that the encrypted packet reached the service front-end, the recipient device confirms successful receipt and decryption, and the server forwards that device-ack back to the sender. In a multi-device client-fanout setup, delivery and device-ack steps are repeated independently for each recipient device, so the sender observes one device-ack per device. The paper states that delivery receipts cannot be disabled by the end user in WhatsApp or Signal [2411.11194].

The attack uses specially crafted messages that trigger device acknowledgments without any user-visible notification in many cases. The exploited packet types are reactions, message edits, and message deletions. The paper gives a simplified packet structure
\[
M_{\rm ping} = \{\text{Type}=\mathrm{REACTION},\; \text{Flags}=0x04,\; \text{MessageIDRef}=\text{“xyz123”},\; \text{Payload}=\text{“👍”}\},
\]
and states that even when the referenced message ID is invalid, the client still returns an `ack_device` [2411.11194].

For high-frequency profiling, the attacker sends a stream of stealth pings at rate \(r\) and timestamps the returned acknowledgments. The success probability within deadline \(\Delta\) is modeled as
\[
P_{\rm success}(r) = \Pr[\mathrm{RTT} \le \Delta \mid \text{ping rate } r].
\]
On WhatsApp, the authors report no server-side rate limiting up to \(r=20\) Hz, whereas on Signal burst rates above \(1\) Hz caused server-side queuing and the experiments therefore used \(r \le 1\) Hz. For WhatsApp at \(\Delta = 2\) s and \(r \le 20\) Hz, the paper reports \(P_{\rm success} \approx 0.995\) [2411.11194].

The side channel supports several inferences. Online/offline status can be tracked with second-level granularity. Device count is inferred directly from the number \(k\) of independent device acknowledgments per ping. OS and implementation fingerprinting can be derived from whether late receipts are stacked or separate, and from their ordering; the paper states that WhatsApp on iOS reverses stacked receipts, whereas Android does not stack at all. Screen and application state can be inferred from RTTs: screen off yields \(\mathrm{RTT} \approx 2\) s, screen on with app in background yields \(\mathrm{RTT} \approx 0.5\text{–}1\) s, and app in foreground yields \(\mathrm{RTT} \approx 0.3\) s. Using thresholds \(T_1=0.4\) s and \(T_2=1\) s in the average-RTT classifier gives \(>95\%\) correct classification in the reported tests [2411.11194].

The paper also presents resource-exhaustion attacks. If each reaction carries payload \(L\), victim download rate is
\[
\mathrm{DataRate}(r) = r \times L.
\]
With \(L \approx 1\) MB and \(r = 1\) Hz, the reported rate is \(\approx 3.7\) MB/s, or \(\approx 13.3\) GB/h. For battery drain, the paper writes
\[
E_{\rm ping} = P_{tx} t_{tx} + P_{rx} t_{rx}, \qquad E_{\rm total} = r E_{\rm ping},
\]
and reports additional battery draw of \(14\text{–}18\%\) per hour under stealth-ping bombardment, versus \(<1\%\)/h idle [2411.11194].

The proposed countermeasures are client-side validation of reactions/edits/deletions against causally available message IDs, receipt rate-limiting or random delay, optional receipt disabling, server-side per-recipient packet limits and abuse detection, and batching across devices so that only one acknowledgment is sent. The paper explicitly frames the trade-offs as latency versus privacy, usability versus security, and implementation complexity [2411.11194].

## 6. Comparative significance and recurring themes

Across the Whisper-centered uses of the term, the dominant problem is model behavior under adverse or incomplete context. The adverse conditions differ: long silences and disfluencies in interview speech [2402.08021], additive noise in multilingual ASR [2511.14219], severe low-SNR decoding with misleading confidences [2509.07195], musical accompaniment and segmentation error in lyrics transcription [2506.15514], and absence of future context in streaming transcription [2508.12301]. Each work introduces a different control mechanism: auditing hallucination harms and subgroup disparities, adaptive layer fusion and teacher-student alignment, selective temperature scaling, source separation plus RMS-VAD segmentation, or blocked causal masking with backtracking.

The privacy paper is technically unrelated to Whisper, but it exhibits a parallel structural motif: reliable-looking system signals conceal failure modes that are not apparent to end users. In the messenger case, silent delivery receipts expose activity, device, and resource signals [2411.11194]; in the ASR cases, aggregate transcription success can coexist with hallucinated phrases, overconfident token errors, or instability under chunked inference [2402.08021], [2509.07195], [2508.12301]. This suggests that the reused label functions less as the name of a stable software artifact than as a marker for hidden brittleness under conditions that standard interfaces obscure.

Taken together, the works associated with CarelessWhisper illustrate three distinct research patterns. First, reliability analysis can reveal harms not captured by conventional accuracy summaries, as in hallucination content analysis and calibration metrics. Second, targeted architectural or pipeline changes can substantially alter failure behavior without requiring a completely new backbone, as shown by ALA+KD, RMS-VAD segmentation, and LoRA-based causal conversion. Third, apparently auxiliary protocol features such as receipts can themselves become attack surfaces. The term therefore indexes a heterogeneous but methodologically serious body of work on failure detection, robustness intervention, and systems-level side channels.

Source: https://www.emergentmind.com/topics/carelesswhisper