SearcharxivSearch

arXiv subjects

Alexander Wagner

Publications and source records attributed to Alexander Wagner.

15 recordsLinked to original sources

Explainable topological data analysis using persistence heatmaps

Topological data analysis (TDA) leverages tools from algebraic topology to aid in various machine learning tasks. Numerous TDA constructions are provably stable in the sense that changes in the input produce linearly bounded changes in the output, with a specified bound. We use representative cycles, which are unstable TDA constructions, to produce stable visualizations to aid in explaining TDA. For example, we produce stable heatmaps on images containing the data such that summing the values of the pixels gives the value of a learned regression function.

math.AT

Replay Attacks Against Audio Deepfake Detection

We show how replay attacks undermine audio deepfake detection: By playing and re-recording deepfake audio through various speakers and microphones, we make spoofed samples appear authentic to the detection model. To study this phenomenon in more detail, we introduce ReplayDF, a dataset of recordings derived from M-AILABS and MLAAD, featuring 109 speaker-microphone combinations across six languages and four TTS models. It includes diverse acoustic conditions, some highly challenging for detection. Our analysis of six open-source detection models across five datasets reveals significant vulnerability, with the top-performing W2V2-AASIST model's Equal Error Rate (EER) surging from 4.7% to 18.2%. Even with adaptive Room Impulse Response (RIR) retraining, performance remains compromised with an 11.0% EER. We release ReplayDF for non-commercial research use.

cs.SD

The elastic stiffness tensor of cellulosic viscose fibers measured with Brillouin spectroscopy

Brillouin light scattering spectroscopy (BLS) is applied to study the micromechanics of cellulosic viscose fibers, one of the commercially most important, man-made biobased fibers. Using an equal angle scattering geometry, we provide a thorough description of the procedure to determine the complete transversely isotropic elastic stiffness tensor. From the stiffness tensor the engineering-relevant material parameters such as Young's moduli, shear moduli, and Poisson's ratios in radial and axial fiber direction are evaluated. The investigated fiber type shows that, at ideal conditions, the material exhibits optical waveguide properties resulting in spontaneous Brillouin backscattering which can be used to obtain additional information from the Brillouin spectra, enabling the measurement of two different scattering processes and directions with only one scattering geometry.

physics.app-ph

Improving Metric Dimensionality Reduction with Distributed Topology

We propose a novel approach to dimensionality reduction combining techniques of metric geometry and distributed persistent homology, in the form of a gradient-descent based method called DIPOLE. DIPOLE is a dimensionality-reduction post-processing step that corrects an initial embedding by minimizing a loss functional with both a local, metric term and a global, topological term. By fixing an initial embedding method (we use Isomap), DIPOLE can also be viewed as a full dimensionality-reduction pipeline. This framework is based on the strong theoretical and computational properties of distributed persistent homology and comes with the guarantee of almost sure convergence. We observe that DIPOLE outperforms popular methods like UMAP, t-SNE, and Isomap on a number of popular datasets, both visually and in terms of precise quantitative metrics.

cs.LG

A Fast and Robust Method for Global Topological Functional Optimization

Topological statistics, in the form of persistence diagrams, are a class of shape descriptors that capture global structural information in data. The mapping from data structures to persistence diagrams is almost everywhere differentiable, allowing for topological gradients to be backpropagated to ordinary gradients. However, as a method for optimizing a topological functional, this backpropagation method is expensive, unstable, and produces very fragile optima. Our contribution is to introduce a novel backpropagation scheme that is significantly faster, more stable, and produces more robust optima. Moreover, this scheme can also be used to produce a stable visualization of dots in a persistence diagram as a distribution over critical, and near-critical, simplices in the data structure.

stat.ML

From Geometry to Topology: Inverse Theorems for Distributed Persistence

What is the "right" topological invariant of a large point cloud X? Prior research has focused on estimating the full persistence diagram of X, a quantity that is very expensive to compute, unstable to outliers, and far from a sufficient statistic. We therefore propose that the correct invariant is not the persistence diagram of X, but rather the collection of persistence diagrams of many small subsets. This invariant, which we call "distributed persistence," is perfectly parallelizable, more stable to outliers, and has a rich inverse theory. The map from the space of point clouds (with the quasi-isometry metric) to the space of distributed persistence invariants (with the Hausdorff-Bottleneck distance) is a global quasi-isometry. This is a much stronger property than simply being injective, as it implies that the inverse of a small neighborhood is a small neighborhood, and is to our knowledge the only result of its kind in the TDA literature. Moreover, the quasi-isometry bounds depend on the size of the subsets taken, so that as the size of these subsets goes from small to large, the invariant interpolates between a purely geometric one and a topological one. Lastly, we note that our inverse results do not actually require considering all subsets of a fixed size (an enormous collection), but a relatively small collection satisfying certain covering properties that arise with high probability when randomly sampling subsets. These theoretical results are complemented by two synthetic experiments demonstrating the use of distributed persistence in practice.

math.AT

Embeddings of Persistence Diagrams into Hilbert Spaces

Since persistence diagrams do not admit an inner product structure, a map into a Hilbert space is needed in order to use kernel methods. It is natural to ask if such maps necessarily distort the metric on persistence diagrams. We show that persistence diagrams with the bottleneck distance do not even admit a coarse embedding into a Hilbert space. As part of our proof, we show that any separable, bounded metric space isometrically embeds into the space of persistence diagrams with the bottleneck distance. As corollaries, we obtain the generalized roundness, negative type, and asymptotic dimension of this space.

cs.LG

Nonembeddability of Persistence Diagrams with $p>2$ Wasserstein Metric

Persistence diagrams do not admit an inner product structure compatible with any Wasserstein metric. Hence, when applying kernel methods to persistence diagrams, the underlying feature map necessarily causes distortion. We prove persistence diagrams with the p-Wasserstein metric do not admit a coarse embedding into a Hilbert space when p > 2.

math.FA

Portfolio Optimization with Expectile and Omega Functions

This paper proves equivalences of portfolio optimization problems with negative expectile and omega ratio. We derive subgradients for the negative expectile as a function of the portfolio from a known dual representation of expectile and general theory about subgradients of risk measures. We also give an elementary derivation of the gradient of negative expectile under some assumptions and provide an example where negative expectile is demonstrably not differentiable. We conducted a case study and solved portfolio optimization problems with negative expectile objective and constraint.

q-fin.RM

Stabilizing the unstable output of persistent homology computations

We propose a general technique for extracting a larger set of stable information from persistent homology computations than is currently done. The persistent homology algorithm is usually viewed as a procedure which starts with a filtered complex and ends with a persistence diagram. This procedure is stable (at least to certain types of perturbations of the input). This justifies the use of the diagram as a signature of the input, and the use of features derived from it in statistics and machine learning. However, these computations also produce other information of great interest to practitioners that is unfortunately unstable. For example, each point in the diagram corresponds to a simplex whose addition in the filtration results in the birth of the corresponding persistent homology class, but this correspondence is unstable. In addition, the persistence diagram is not stable with respect to other procedures that are employed in practice, such as thresholding a point cloud by density. We recast these problems as real-valued functions which are discontinuous but measurable, and then observe that convolving such a function with a suitable function produces a Lipschitz function. The resulting stable function can be estimated by perturbing the input and averaging the output. We illustrate this approach with a number of examples, including a stable localization of a persistent homology generator from brain imaging data.

cs.CG

Numerical Investigation of Second Mode Attenuation over Carbon/Carbon Surfaces on a Sharp Slender Cone

We have carried out axisymmetric numerical simulations of a spatially developing hypersonic boundary layer over a sharp 7$^{\circ{}}$-half-angle cone at $M_\infty=7.5$ inspired by the experimental investigations by Wagner (2015). Simulations are first performed with impermeable (or solid) walls with a one-time broadband pulse excitation applied upstream to determine the most convectively-amplified frequencies resulting in the range 260kHz -- 400kHz, consistent with experimental observations of second-mode instability waves. Subsequently, we introduce harmonic disturbances via continuous periodic suction and blowing at 270kHz and 350kHz. For each of these forcing frequencies complex impedance boundary conditions (IBC), modeling the acoustic response of two different carbon/carbon (C/C) ultrasonically absorptive porous surfaces, are applied at the wall. The IBCs are derived as an output of a pore-scale aeroacoustic analysis -- the inverse Helmholtz Solver (iHS) -- which is able to return the broadband real and imaginary components of the surface-averaged impedance. The introduction of the IBCs in all cases leads to a significant attenuation of the harmonically-forced second-mode wave. In particular, we observe a higher attenuation rate of the introduced waves with frequency of 350kHz in comparison with 270kHz, and, along with the iHS impedance results, we establish that the C/C surfaces absorb acoustic energy more effectively at higher frequencies.

physics.flu-dyn

Combined free-stream disturbance measurements and receptivity studies in hypersonic wind tunnels by means of a slender wedge probe and DNS

Combined free-stream disturbance measurements and receptivity studies in hypersonic wind tunnels were conducted by means of a slender wedge probe and direct numerical simulation. The study comprises comparative tunnel noise measurements at Mach 3, 6 and 7.4 in two Ludwieg tube facilities and a shock tunnel. Surface pressure fluctuations were measured over a wide range of frequencies and test conditions including harsh test environments not accessible to measurement techniques such as pitot probes and hot-wire anemometry. Quantitative results of the tunnel noise are provided in frequency ranges relevant for hypersonic boundary layer transition. In combination with the experimental studies, direct numerical simulations of the leading-edge receptivity to fast and slow acoustic waves were performed for the slender wedge probe at conditions corresponding to the experimental free-stream conditions. The receptivity to fast acoustic waves was found to be characterized by an early amplification of the induced fast mode. For slow acoustic waves an initial decay was found close to the leading edge. At all Mach numbers, and for all considered frequencies, the leading-edge receptivity to fast acoustic waves was found to be higher than the receptivity to slow acoustic waves. Further, the effect of inclination angles of the acoustic wave with respect to the flow direction was investigated. The combined numerical and experimental approach in the present study confirmed the previous suggestion that the slow acoustic wave is the dominant acoustic mode in noisy hypersonic wind tunnels.

physics.flu-dyn

Derivation of Hydrodynamics for Multi-Relaxation Time Lattice Boltzmann using the Moment-Approach

A general analysis of the hydrodynamic limit of multi-relaxation time lattice Boltzmann models is presented. We examine multi-relaxation time BGK collision operators that are constructed similarly to those for the MRT case, however, without explicitly moving into a moment space representation. The corresponding 'moments' are derived as left eigenvectors of said collision operator in velocity space. Consequently we can, in a representation independent of the chosen base velocity set, generate the conservation equations. We find a significant degree of freedom in the choice of the collision matrix and the associated basis which leaves the collision operator invariant. Therefore we can explain why MRT implementations in the literature reproduce identical hydrodynamics despite being based on different orthogonalization relations.

cond-mat.soft

Cross Correlators and Galilean Invariance in Fluctuating Ideal Gas Lattice Boltzmann Simulations

We analyze the Lattice Boltzmann method for the simulation of fluctuating hydrodynamics by Adhikari et al. [Europhys. Lett. 71, 473 (2005)] and find that it shows excellent agreement with theory even for small wavelengths as long as a stationary system is considered. This is in contrast to other finite difference and older lattice Boltzmann implementations that show convergence only in the limit of large wavelengths. In particular cross correlators vanish to less than 0.5%. For larger mean velocities, however, Galilean invariance violations manifest themselves through errors of a magnitude similar to those of the earlier implementations.

cond-mat.soft