aiqbench analysis
This research introduces WST-Graph, a novel architecture that preserves the topological relationships of wavelet scattering coefficients to enhance speech deepfake detection. By maintaining parent-child relations within the carrier-modulation grid, the model achieves competitive performance with roughly 60% fewer trainable parameters than existing graph-based backends. The approach demonstrates significant gains on out-of-domain benchmarks, highlighting the efficacy of physically grounded interfaces for forensic audio analysis.
WST-Graph: Topology-Preserving Wavelet Scattering Front-End for Speech Deepfake Detection
arXiv:2609.29372v1 Announce Type: cross Abstract: The acoustic front-end determines which forensic cues a speech deepfake detector can exploit. The wavelet scattering transform (WST) provides stable multiscale coefficients with explicit coordinates, yet direct flattening obscures the parent relation between paths. We introduce WST-Graph, reconstructing these paths as a sparse modulation-carrier grid for an AASIST graph backend. Modulation-level normalization and length-aware adaptive local attention pooling produce fixed relative-time representations while retaining the acoustic axes before learned adaptation. This yields a waveform-to-graph interface with a fixed, parameter-free WST. Our configurations remain competitive with AASIST while using approximately 60% fewer trainable parameters and show clear gains on selected out-of-domain benchmarks. These results underscore the value of preserving parent-child relations within the carrier-modulation topology when constructing a compact, physically grounded interface for graph-based speech deepfake detection. Code will be released at https://github.com/saki-ciallo/wst-graph.
Abstract:The acoustic front-end determines which forensic cues a speech deepfake detector can exploit. The wavelet scattering transform (WST) provides stable multiscale coefficients with explicit coordinates, yet direct flattening obscures the parent relation between paths. We introduce WST-Graph, reconstructing these paths as a sparse modulation-carrier grid for an AASIST graph backend. Modulation-level normalization and length-aware adaptive local attention pooling produce fixed relative-time representations while retaining the acoustic axes before learned adaptation. This yields a waveform-to-graph interface with a fixed, parameter-free WST. Our configurations remain competitive with AASIST while using approximately 60% fewer trainable parameters and show clear gains on selected out-of-domain benchmarks. These results underscore the value of preserving parent-child relations within the carrier-modulation topology when constructing a compact, physically grounded interface for graph-based speech deepfake detection. Code will be released at this https URL.
Audio and Speech Processing (eess.AS); Artificial Intelligence (cs.AI); Sound (cs.SD)
arXiv:2609.29372 [eess.AS]
(or arXiv:2609.29372v1 [eess.AS] for this version)
https://doi.org/10.48550/arXiv.2609.29372 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 235 words
Related coverage
WaveScat: Wavelet Scattering Front-Ends with Self-Supervised Features for Speech Deepfake Detection
arXiv · Oct 8, 2026

FrozenLGP Achieves 100% Graph Decomposition Up To 10,000 Vertices
Quantum Zeitgeist · Jul 21, 2026

I Did This Without Your Knowledge
LessWrong · Oct 17, 2026

BRICS Draws a New Global Line: Full Text of New Delhi Declaration
slguardian.org · Sep 12, 2026