Probabilistic attribute embeddings derived from countermeasure embeddings match raw embedding performance on spoofed speech detection and attack attribution while providing component-level explanations.
Exponential inequalities for sampling designs
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this work we introduce a general approach, based on the mar-tingale representation of a sampling design and Azuma-Hoeffding's inequality , to derive exponential inequalities for the difference between a Horvitz-Thompson estimator and its expectation. Applying this idea, we establish such inequalities for Chao's procedure, Till{\'e}'s elimination procedure, the generalized Midzuno method as well as for Brewer's method. As a by-product, we prove that the first three sampling designs are (conditionally) negatively associated. For such sampling designs, we show that that the inequality we obtain is usually sharper than the one obtained by applying known results for negatively associated random variables.
citation-role summary
citation-polarity summary
fields
eess.AS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Towards Explainable Spoofed Speech Attribution and Detection:a Probabilistic Approach for Characterizing Speech Synthesizer Components
Probabilistic attribute embeddings derived from countermeasure embeddings match raw embedding performance on spoofed speech detection and attack attribution while providing component-level explanations.