Pith. sign in

REVIEW 4 major objections 6 minor 35 references

Multiple Consistency-guided Test-Time Adaptation for Contrastive Audio-Language Models with Unlabeled Audio

T0 review · 4 major / 6 minor · reviewed 2026-08-11 · deepseek-v4-flash

Pith's one-line read Test-time prompt adaptation with no labels lifts zero-shot audio classification accuracy by 4.41% on average across 12 datasets.

desk verdict Incremental but well-ablated TTA method for CLAP; the reported gains are undermined by an internal inconsistency in the highlighted per-dataset numbers. read the letter →

arxiv 2412.17306 v1 pith:TRKEA77F submitted 2024-12-23 cs.SD cs.CVeess.AS

classification cs.SDcs.CVeess.AS
keywords test-timeadaptationcontrastiveaudio-languagemodelspromptlearningself-entropyminimizationconsistencyregularizationzero-shotaudioclassificationSpecAugment
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Contrastive audio-language models such as CLAP can classify sounds zero-shot, but their accuracy depends on the text prompt and drops on unfamiliar domains. This paper claims that the model can adapt to unlabeled test audio at inference time by learning, for each test clip, two sets of prompt tokens—context tokens inserted into the class prompt and domain tokens prepended to it—driven only by unsupervised signals. The signals are minimum self-entropy of the model's averaged prediction across multiple augmented versions of the clip, plus a contrastive penalty that keeps different test clips' predictions distinct. On 12 audio classification benchmarks the method reports an average accuracy of 68.83%, up from 65.92% for the best previous test-time adapter and 62.93% for zero-shot CLAP. If the result holds, deployed audio classifiers can be adapted to new conditions without collecting labels.

What carries the argument

The central mechanism is the conditional test-time prompt, split into a context-aware branch and a domain-aware branch. Each branch is a three-layer MLP ('c-net' and 'd-net') that takes the audio embedding of augmented views and outputs learnable tokens; the tokens are inserted into the CLAP text prompt (context appended, domain prepended) before the frozen text encoder produces class features. The adaptation signal is the final loss $L_{final}=L_{consistency}+\lambda_{contrastive}L_{contrastive}$: the consistency term is the self-entropy of the averaged softmax distribution over augmented views, and the contrastive term is the negative sum of MSE between distributions of different test samples, encouraging diversity. Augmented views come from SpecAugment-style time masking, frequency masking, combined masking, and a time-reorder operation applied to the mel spectrogram. The average distribution $g_{avg}$ is the bridge that lets one unlabeled clip over 50 augmentations train both prompt networks in an end-to-end fashion.

What would settle it

On a set of test clips where the frozen CLAP model is known to be confidently wrong (for example, heavily corrupted or adversarial audio), run the adaptation and compare per-sample confidence before and after; if confidence rises while accuracy stays flat or falls, the consistency signal is reinforcing wrong predictions rather than correcting them.

Watch

Extended reading notes

Core claim

The paper's central claim is that two complementary prompt perturbations, together with a consistency objective computed over augmented views, let a frozen contrastive audio-language model adapt to a test-time domain shift without any labeled audio. The context-aware prompt ($p_{context}$) is generated by a lightweight network conditioned on the audio embedding and appended into the text prompt, while the domain-aware prompt ($p_{domain}$) is generated by a second network and prepended; both are updated per test sample. The unsupervised objective combines the self-entropy of the average class distribution over $M$ augmented views, $L_{consistency}=-g_{avg}\log g_{avg}$, with a contrastive loss $L_{contrastive}=-\sum_{k_1\neq k_2}\mathrm{MSE}(g_{k_1},g_{k_2})$ that penalizes different test samples from producing the same distribution. The reported result is a 4.41% average accuracy improvement (maximum 7.50%) over the strongest prior adapter across 12 datasets, with ablations showing that both losses and both prompt networks contribute to the gain.

Load-bearing premise

The method assumes that minimizing the self-entropy of the averaged distribution over augmented views of an unlabeled test clip pushes the prompts toward correct predictions; if the model starts out confidently wrong, that same pressure can lock the error in.

Editorial extensions

If this is right

  • On the 12 datasets evaluated, the method raises average zero-shot accuracy from 65.92% (DA CLAP with five test samples) to 68.83% using no labels.
  • Both loss terms matter: removing the contrastive loss drops the average to 64.42%, and removing the self-entropy term drops it to 67.75%, so the consistency and the diversity signals are complementary rather than redundant.
  • The two prompt branches are complementary: the full method reaches 68.83%, while the domain-only and context-only variants reach 67.51% and 66.96% respectively.
  • Cross-domain experiments show the adapted prompts transfer to other datasets better than the DA CLAP baseline under most train/test combinations and beat zero-shot CLAP on average for every training domain.
  • The gain is not an artifact of added parameters: doubling the MLP width of either branch produces lower accuracy than combining the two branches.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural extension, not tested in the paper, is to use the same consistency-plus-diversity objective for other contrastive audio-language tasks such as retrieval or captioning, where the prompt conditions the output format rather than a class list.
  • The success of the method depends on augmentations that preserve the semantic content of the audio; if time reorder or masking ever destroys the distinguishing event, the averaged distribution could become confidently wrong, so a future diagnostic could measure augmentation sensitivity per dataset.
  • An abstention or confidence-threshold mechanism could combine with this adapter to flag test clips where the consistency signal is reinforcing an initial wrong prediction; the paper does not evaluate such a safeguard.
  • The contrastive term currently operates on a batch of test samples; in a streaming deployment the same effect could be achieved with a small memory bank of recent predictions, which the paper does not discuss.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. The paper proposes a test-time adaptation method for contrastive audio-language models (CLAP) that tunes learnable prompts on unlabeled test audio. Two lightweight MLP networks generate context-aware and domain-aware prompt tokens conditioned on the audio embedding; the prompts are optimized by minimizing the self-entropy of the averaged class distribution over multiple augmented views, plus a contrastive loss that penalizes overly similar predicted distributions across different test samples. The method is evaluated on 12 audio classification datasets, reporting an average accuracy of 68.83% versus 65.92% for the DA CLAP (five) baseline, which corresponds to the 4.41% relative improvement cited in the abstract. Ablations show that both prompt networks and both loss terms contribute to the final accuracy.

Significance. If the reported results are reliable, the paper makes a useful incremental contribution to test-time prompt adaptation for audio-language models, extending the DA CLAP framework with additional consistency and contrastive guidance. The ablations (Table III) showing that both loss terms and both prompt networks contribute are a strength, as is the cross-domain generalization experiment in Table II. However, the central quantitative claim is currently undermined by internal numerical inconsistencies between the text and Table I, and the lack of repeated-seed experiments or error bars makes it impossible to assess whether the reported gains are statistically meaningful. The method is simple and potentially reproducible, which is a positive feature, but the evidence as presented is not yet convincing enough to support the headline improvement.

major comments (4)
  1. [Section IV.B and Table I] The text in Section IV.B gives per-dataset gains that do not match Table I. It states that SESA improved from 73.40% (DA five) to 76.19%, and RAVD from 34.45% to 43.71%, but Table I lists DA five for SESA as 74.35 and for RAVD as 33.19, with the proposed method achieving 76.19% on SESA and only 33.77% on RAVD. These two records cannot both be correct. Since the abstract's 4.41% average improvement is an arithmetic summary of the Table I per-dataset accuracies, this inconsistency is load-bearing: the current paper leaves the reader unable to determine which numbers are trustworthy, and the central claim is therefore unsupported until corrected.
  2. [Section IV.A, experimental setup] No repeated-seed experiments, error bars, or statistical significance tests are reported. Many of the claimed gains over DA CLAP are small relative to typical run-to-run variance on such benchmarks (e.g., ESC50 decreases from 95.05 to 94.65; D17T4 decreases from 52.30 to 51.69; US8K improves by 1.39 percentage points). Without multiple runs, the central claim that the method improves over the state of the art across 12 datasets is not statistically substantiated.
  3. [Section IV.A.2 and Appendix, Table III] The paper does not describe a validation split or a procedure for selecting hyperparameters such as lambda_contrastive, the learning rate, the number of augmented views M, or the number of MLP layers. The reported test-set accuracies appear to be the result of choosing these hyperparameters on the same test sets used for evaluation. This introduces a selection-bias risk, especially because the ablations in Table III show sensitivity to architecture choices (e.g., 1-layer vs. 4-layer MLP) and loss weighting is not ablated at all.
  4. [Section III.C.2 and Introduction] The paper motivates the method by stating that previous test-time adaptation methods 'tend to be stuck in incorrect model predictions,' but the proposed L_consistency is exactly a self-entropy minimization loss on the averaged distribution. If the model is confidently wrong for a test sample, that loss can reinforce the wrong prediction. The paper provides no diagnostic, analysis, or comparison case study showing how the added contrastive loss prevents this failure mode. As the main unsupervised signal, this assumption is load-bearing for the claimed advantage over prior methods and should be examined empirically.
minor comments (6)
  1. [Throughout] The phrase 'end-end' appears repeatedly (e.g., in the abstract and Section III.C) and should be 'end-to-end'.
  2. [Section IV.B] The sentence 'our method achieves better (+9.38%) zero-shot classification performance than directly testing the time domain prompt tuning (+5.99%), with a batch size of 5 (+4.41%)' is ambiguous and the percentages do not align with Table I; please clarify which baselines and which formula (relative vs. absolute) are being used.
  3. [Figure 1 and Section III.C.1] Figure 1 lists four augmentations (Time Masking, Frequency Masking, Time & Frequency Masking, Time Reorder), while Section IV.A.1 states that 'We augment each raw audio 50 times.' Please clarify how the four augmentation types are expanded to 50 augmented views.
  4. [Section IV.D, Table II] Table II is described as training on one target domain and testing on others, but the proposed method is test-time adaptation without training on a target domain. Please clarify the protocol used to produce Table II.
  5. [Table I] Several column headers contain stray spaces ('RA VD', 'V ocal', 'TU17'); these should be cleaned. Also, 'DA CLAP (five [19])' and similar labels are inconsistent in formatting.
  6. [References and related work] The paper compares only against DA CLAP [19] and zero-shot CLAP; no comparison is made to other test-time prompt tuning methods for audio or to the vision-language TPT method [18] that the approach builds on, which would help position the contribution.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the proposed losses are standard entropy/contrastive objectives, the baseline DA CLAP is external, and no self-citation chain or definitional reduction forces the reported improvement.

full rationale

The paper contains no derivation that reduces by construction to its own fitted inputs. The optimization is p* = argmin_p L(F,p,X_test) with L_final = L_consistency + lambda_contrastive * L_contrastive, where L_consistency = -g_avg log g_avg and L_contrastive = -sum_{k1 != k2} MSE(g_k1, g_k2). These are standard test-time entropy-minimization and contrastive regularizers; reported accuracy is computed from the argmax of g_avg against held-out labels, not from the loss itself, so the objective is not definitionally tied to the measured improvement. The prompt networks (c-net and d-net) are optimized per test sample without labels, and the state-of-the-art baseline DA CLAP is prior work by Deshmukh, Singh, and Raj, with no author overlap with the present paper, so the 4.41% comparison is against an external benchmark rather than a result imported from the authors' own prior claims. No uniqueness theorem, self-citation chain, or renaming of a known result is used to force the method's design; the appendix parameter-doubling ablation checks capacity effects, which is not a circular maneuver. The internal inconsistency between Section IV.B's stated SESA/RAVD gains and Table I is a report-consistency and evidence-quality problem, not a circularity: it undermines the trustworthiness of the arithmetic but does not show that the derivation is equivalent to its inputs. Therefore the circularity score is 0.

Assumptions & free parameters 4 free parameters · 4 assumptions · 0 invented entities

The method relies on a handful of hand-chosen hyperparameters and on two domain assumptions about entropy minimization and augmentation fidelity. No new physical or conceptual entities are introduced.

free parameters (4)
  • lambda_contrastive = not reported
    Weight balancing self-entropy and contrastive losses in L_final; chosen by hand on the benchmark test sets.
  • number of augmented views M = 50 (text says 50, figure suggests 4-5)
    Hyperparameter controlling averaging in gavg; inconsistent in paper.
  • MLP layers = 3
    Architecture of c-net and d-net; ablation shows 1 to 4 layers perform similarly, so this choice is not critical.
  • learning rate = 1e-6
    AdamW learning rate; chosen without sensitivity analysis.
assumptions (4)
  • domain assumption Entropy minimization on averaged augmented predictions is a valid proxy for accuracy under unlabeled domain shift.
    Used in L_consistency; if the model is confidently wrong, this reinforces errors; the paper itself notes prior TTA methods get stuck in incorrect predictions.
  • domain assumption The audio augmentations (time masking, frequency masking, time reorder) preserve the semantic class of the test audio.
    Augmented views must share labels for consistency to be meaningful; no verification of label preservation is provided.
  • domain assumption CLAP text prompts with learnable context and domain tokens can express the target class vocabulary for all 12 datasets.
    The entire method assumes the class names in the prompt text are sufficient and that audio embeddings align with text embeddings after prompt tuning.
  • standard math Softmax, entropy, and MSE are used as standard loss functions.
    Standard mathematical operations; no additional justification given.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Multiple Consistency-guided Test-Time Adaptation for Contrastive Audio-Language Models with Unlabeled Audio." pith.science (2026). https://pith.science/paper/TRKEA77F

@misc{pith2026241217306,
  author       = {Pith},
  title        = {Pith review of: Multiple Consistency-guided Test-Time Adaptation for Contrastive Audio-Language Models with Unlabeled Audio},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TRKEA77F}},
  note         = {Machine review of arXiv:2412.17306}
}
read the original abstract

One fascinating aspect of pre-trained Audio-Language Models (ALMs) learning is their impressive zero-shot generalization capability and test-time adaptation (TTA) methods aiming to improve domain performance without annotations. However, previous test time adaptation (TTA) methods for ALMs in zero-shot classification tend to be stuck in incorrect model predictions. In order to further boost the performance, we propose multiple guidance on prompt learning without annotated labels. First, guidance of consistency on both context tokens and domain tokens of ALMs is set. Second, guidance of both consistency across multiple augmented views of each single test sample and contrastive learning across different test samples is set. Third, we propose a corresponding end-end learning framework for the proposed test-time adaptation method without annotated labels. We extensively evaluate our approach on 12 downstream tasks across domains, our proposed adaptation method leads to 4.41% (max 7.50%) average zero-shot performance improvement in comparison with the state-of-the-art models.

Figures

Figures reproduced from arXiv: 2412.17306 by the authors.

Figure 1
Figure 1. Our end-end Test-time Tuning framework. (1) [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

35 extracted references · 22 canonical work pages

  1. [1]

    Natural language supervision for general-purpose audio representations,

    B. Elizalde, S. Deshmukh, and H. Wang, “Natural language supervision for general-purpose audio representations,” arXiv preprint arXiv:2309.05767, 2023

  2. [2]

    Pengi: An audio language model for audio tasks,

    S. Deshmukh, B. Elizalde, R. Singh, and H. Wang, “Pengi: An audio language model for audio tasks,” arXiv preprint arXiv:2305.11834, 2023

  3. [3]

    Listen, think, and understand,

    Y . Gong, H. Luo, A. H. Liu, L. Karlinsky, and J. Glass, “Listen, think, and understand,” arXiv preprint arXiv:2305.10790, 2023

  4. [4]

    Large-scale contrastive language- audio pretraining with feature fusion and keyword-to-caption augmentation,

    Y . Wu, K. Chen, T. Zhang, Y . Hui, M. Nezhurina, T. Berg- Kirkpatrick, and S. Dubnov, “Large-scale contrastive language- audio pretraining with feature fusion and keyword-to-caption augmentation,” arXiv preprint arXiv:2211.06687 , 2022

  5. [5]

    Clap learning audio concepts from natural language supervision,

    B. Elizalde, S. Deshmukh, M. A. Ismail, and H. Wang, “Clap learning audio concepts from natural language supervision,” in ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , 2023, pp. 1–5

  6. [6]

    Audio-free Prompt Tuning for Language-Audio Models

    Y . Li, X. Wang, and H. Liu, “Audio-free prompt tuning for language-audio models,” arXiv preprint arXiv:2309.08357 , 2023

  7. [7]

    Adapting language-audio models as few-shot audio learners,

    J. Liang, X. Liu, H. Liu, H. Phan, E. Benetos, M. D. Plumbley, and W. Wang, “Adapting language-audio models as few-shot audio learners,” arXiv preprint arXiv:2305.17719 , 2023

  8. [8]

    Learning to prompt for vision-language models,

    K. Zhou, J. Yang, C. C. Loy, and Z. Liu, “Learning to prompt for vision-language models,” Int. J. Comput. Vision , vol. 130, no. 9, p. 2337–2348, sep 2022

Show all 35 references
  1. [9]

    Conditional prompt learning for vision-language models,

    K. Zhou, J. Yang, C. Loy, and Z. Liu, “Conditional prompt learning for vision-language models,” in 2022 IEEE/CVF Con- ference on Computer Vision and Pattern Recognition (CVPR) , 2022, pp. 16 795–16 804

  2. [10]

    Self-regulating prompts: Foundational model adaptation without forgetting,

    M. U. Khattak, S. T. Wasim, M. Naseer, S. S. Khan, M. Yang, and F. S. Khan, “Self-regulating prompts: Foundational model adaptation without forgetting,” 2023 IEEE/CVF International Conference on Computer Vision (ICCV) , pp. 15 144–15 154, 2023

  3. [11]

    Learning transferable visual models from natural language supervision,

    A. Radford, J. W. Kim, C. Hallacy, A. Ramesh, G. Goh, S. Agar- wal, G. Sastry, A. Askell, P. Mishkin, J. Clark, G. Krueger, and I. Sutskever, “Learning transferable visual models from natural language supervision,” in International Conference on Machine Learning, 2021

  4. [12]

    Consistency-guided prompt learning for vision-language models,

    S. Roy and A. Etemad, “Consistency-guided prompt learning for vision-language models,” arXiv preprint arXiv:2306.01195 , 2023

  5. [13]

    Test-time training with self-supervision for generalization un- der distribution shifts,

    Y . Sun, X. Wang, Z. Liu, J. Miller, A. A. Efros, and M. Hardt, “Test-time training with self-supervision for generalization un- der distribution shifts,” in Proceedings of the 37th International Conference on Machine Learning , ser. ICML’20. JMLR.org, 2020

  6. [14]

    Ttt++: When does self-supervised test-time training fail or thrive?

    Y . Liu, P. Kothari, B. van Delft, B. Bellot-Gurlet, T. Mordan, and A. Alahi, “Ttt++: When does self-supervised test-time training fail or thrive?” in Advances in Neural Information Processing Systems, vol. 34. Curran Associates, Inc., 2021, pp. 21 808– 21 820

  7. [15]

    Tent: Fully test-time adaptation by entropy minimization,

    D. Wang, E. Shelhamer, S. Liu, B. A. Olshausen, and T. Darrell, “Tent: Fully test-time adaptation by entropy minimization,” in International Conference on Learning Representations , 2021

  8. [16]

    Test- time training with masked autoencoders,

    Y . Gandelsman, Y . Sun, X. Chen, and A. A. Efros, “Test- time training with masked autoencoders,” in Proceedings of the 36th International Conference on Neural Information Process- ing Systems , ser. NIPS ’22. Red Hook, NY , USA: Curran Associates Inc., 2024

  9. [17]

    Memo: Test time robust- ness via adaptation and augmentation,

    M. Zhang, S. Levine, and C. Finn, “Memo: Test time robust- ness via adaptation and augmentation,” in Advances in Neural Information Processing Systems , vol. 35. Curran Associates, Inc., 2022, pp. 38 629–38 642

  10. [18]

    Test-time prompt tuning for zero-shot gen- eralization in vision-language models,

    M. Shu, W. Nie, D.-A. Huang, Z. Yu, T. Goldstein, A. Anandku- mar, and C. Xiao, “Test-time prompt tuning for zero-shot gen- eralization in vision-language models,” in Advances in Neural Information Processing Systems , vol. 35. Curran Associates, Inc., 2022, pp. 14 274–14 289

  11. [19]

    Domain adapta- tion for contrastive audio-language models,

    S. Deshmukh, R. Singh, and B. Raj, “Domain adapta- tion for contrastive audio-language models,” arXiv preprint arXiv:2402.09585, 2024

  12. [20]

    Specaugment: A simple data augmenta- tion method for automatic speech recognition,

    D. S. Park, W. Chan, Y . Zhang, C.-C. Chiu, B. Zoph, E. D. Cubuk, and Q. V . Le, “Specaugment: A simple data augmenta- tion method for automatic speech recognition,” in Interspeech, 2019

  13. [21]

    Mixstyle-based contrastive test- time adaptation: Pathway to domain generalization,

    K. Yamashita and K. Hotta, “Mixstyle-based contrastive test- time adaptation: Pathway to domain generalization,” in Pro- ceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) Workshops, June 2024, pp. 1029– 1037

  14. [22]

    Hts-at: A hierarchical token-semantic audio trans- former for sound classification and detection,

    K. Chen, X. Du, B. Zhu, Z. Ma, T. Berg-Kirkpatrick, and S. Dubnov, “Hts-at: A hierarchical token-semantic audio trans- former for sound classification and detection,” in ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , 2022...

  15. [23]

    Training audio captioning models without au- dio,

    S. Deshmukh, B. Elizalde, D. Emmanouilidou, B. Raj, R. Singh, and H. Wang, “Training audio captioning models without au- dio,” arXiv preprint arXiv:2309.07372 , 2023

  16. [24]

    Language models are unsupervised multitask learners,

    A. Radford, J. Wu, R. Child, D. Luan, D. Amodei, and I. Sutskever, “Language models are unsupervised multitask learners,” 2019

  17. [25]

    Decoupled weight decay regular- ization,

    I. Loshchilov and F. Hutter, “Decoupled weight decay regular- ization,” in International Conference on Learning Representa- tions, 2017

  18. [26]

    Hear: Holistic evaluation of audio representations,

    J. Turian, J. Shier, H. R. Khan, B. Raj, and B. W. Schuller, “Hear: Holistic evaluation of audio representations,” arXiv preprint arXiv:2203.03022, 2022

  19. [27]

    Esc: Dataset for environmental sound classifica- tion,

    K. J. Piczak, “Esc: Dataset for environmental sound classifica- tion,” Proceedings of the 23rd ACM international conference on Multimedia, 2015

  20. [28]

    A dataset and taxonomy for urban sound research,

    J. Salamon, C. Jacoby, and J. P. Bello, “A dataset and taxonomy for urban sound research,” in Proceedings of the 22nd ACM International Conference on Multimedia , ser. MM ’14, New York, NY , USA, 2014, p. 1041–1044

  21. [29]

    DCASE 2017 challenge setup: tasks, datasets and baseline system,

    A. Mesaros, T. Heittola, A. Diment, B. Elizalde, A. Shah, E. Vincent, B. Raj, and T. Virtanen, “DCASE 2017 challenge setup: tasks, datasets and baseline system,” in Proceedings of the Detection and Classification of Acoustic Scenes and Events 2017 Workshop (DCASE2017), 2017, pp. 85–92

  22. [30]

    Automatic musical genre classification of audio signals,

    G. Tzanetakis, “Automatic musical genre classification of audio signals,” in International Society for Music Information Re- trieval Conference, 2001

  23. [31]

    Crema-d: Crowd-sourced emotional multimodal actors dataset,

    H. Cao, D. G. Cooper, M. K. Keutmann, R. C. Gur, A. Nenkova, and R. Verma, “Crema-d: Crowd-sourced emotional multimodal actors dataset,” IEEE Transactions on Affective Computing , vol. 5, no. 4, pp. 377–390, 2014

  24. [32]

    The ryerson audio-visual database of emotional speech and song (ravdess): A dynamic, multimodal set of facial and vocal expressions in north american english

    R. F. Livingstone SR, “The ryerson audio-visual database of emotional speech and song (ravdess): A dynamic, multimodal set of facial and vocal expressions in north american english.” PLoS One, 2018

  25. [33]

    V ocalsound: A dataset for improving human vocal sounds recognition,

    Y . Gong, J. Yu, and J. R. Glass, “V ocalsound: A dataset for improving human vocal sounds recognition,” ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , pp. 151–155, 2022

  26. [34]

    Sound events for surveillance applications,

    T. Spadini, “Sound events for surveillance applications,” 2019

  27. [35]

    Neural audio synthesis of musical notes with wavenet autoencoders,

    J. Engel, C. Resnick, A. Roberts, S. Dieleman, M. Norouzi, D. Eck, and K. Simonyan, “Neural audio synthesis of musical notes with wavenet autoencoders,” in Proceedings of the 34th International Conference on Machine Learning - Volume 70 , ser. ICML’17. JMLR.org, 2017, p. 1068–...

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.