Miracle-dz/UniFAR-FTUs huggingface dataset:
Human-in-the-loop Speaker Adaptation for DNN-based Multi-speaker TTS

This paper proposes a human-in-the-loop speaker-adaptation method for multi-speaker text-to-speech. With a conventional speaker-adaptation method, a target speaker’s embedding vector is extracted from his/her reference speech using a speaker encoder trained on a speaker-discriminative task. However, this method cannot obtain an embedding vector for the target speaker when the reference speech is unavailable. Our method is based on a human-in-the-loop optimization framework, which incorporates a user to explore the speakerembedding space to ﬁnd the target speaker’s embedding. The proposed method uses a sequential line search algorithm that repeatedly asks a user to select a point on a line segment in the embedding space. To efﬁciently choose the best speech sam-ple from multiple stimuli, we also developed a system in which a user can switch between multiple speakers’ voices for each phoneme while looping an utterance. Experimental results indicate that the proposed method can achieve comparable per-formance to the conventional one in objective and subjective evaluations even if reference speech is not used as the input of a speaker encoder directly.
On the effectiveness of persistent homology

Persistent homology (PH) is one of the most popular methods in Topological Data Analysis. Even though PH has been used in many different types of applications, the reasons behind its success remain elusive; in particular, it is not known for which classes of problems it is most effective, or to what extent it can detect geometric or topological features. The goal of this work is to identify some types of problems where PH performs well or even better than other methods in data analysis. We consider three fundamental shape analysis tasks: the detection of the number of holes, curvature and convexity from 2D and 3D point clouds sampled from shapes. Experiments demonstrate that PH is successful in these tasks, outperforming several baselines, including PointNet, an architecture inspired precisely by the properties of point clouds. In addition, we observe that PH remains effective for limited computational resources and limited training data, as well as out-of-distribution test data, including various data transformations and noise. For convexity detection, we provide a theoretical guarantee that PH is effective for this task in $\mathbb{R}^d$, and demonstrate the detection of a convexity measure on the FLAVIA data set of plant leaf images. Due to the crucial role of shape classification in understanding mathematical and physical structures and objects, and in many applications, the findings of this work will provide some knowledge about the types of problems that are appropriate for PH, so that it can - to borrow the words from Wigner 1960 - ``remain valid in future research, and extend, to our pleasure", but to our lesser bafflement, to a variety of applications.
A simple principal stratum estimator for failure to initiate treatment

A common intercurrent event affecting many trials is when some participants do not begin their assigned treatment. For example, in a trial comparing two different methods for fluid delivery during surgery, some participants may have their surgery cancelled. Similarly, in a double-blind drug trial, some participants may not receive any dose of study medication. The commonly used intention-totreat analysis preserves the randomisation structure, thus protecting against biases from postrandomisation exclusions. However, it estimates a treatment policy effect (i.e. addresses the question “what is the effect of the intervention, regardless of whether the participant actually begins treatment? ”), which may not be the most clinically relevant estimand. A principal stratum approach, estimating the treatment effect in the subpopulation of participants who would initiate treatment (regardless of treatment arm), may be a more clinically relevant estimand for many trials. We show that a simple principal stratum estimator based on a “modified intention-to-treat” population, where participants who experience the intercurrent event are excluded, is unbiased for the principal stratum estimand under certain assumptions that are likely to be plausible in many trials, namely that participants who initiate the intervention under one treatment condition would also do so under the other treatment condition. We provide several examples of trials where this assumption is plausible, and several instances where it is not. We conclude that this simple principal stratum estimator can be a useful strategy for handling failure to initiate treatment.
Parameterized-NL Completeness of Combinatorial Problems by Short Logarithmic-Space Reductions and Immediate Consequences of the Linear Space Hypothesis

The concept of space-bounded computability has become significantly important in handling vast data sets on memory-limited computing devices. To replenish the existing short list of NL-complete problems whose instance sizes are dictated by log-space size parameters, we propose new additions obtained directly from natural parameterizations of three typical NP-complete problems -- the vertex cover problem, the exact cover by 3-sets problem, and the 3-dimensional matching problem. With appropriate restrictions imposed on their instances, the proposed decision problems parameterized by appropriate size parameters are proven to be equivalent in computational complexity to either the parameterized $3$-bounded 2CNF Boolean formula satisfiability problem or the parameterized degree-$3$ directed $s$-$t$ connectivity problem by ``short'' logarithmic-space reductions. Under the assumption of the linear space hypothesis, furthermore, none of the proposed problems can be solved in polynomial time if the memory usage is limited to sub-linear space.
Hands-on Wireless Sensing with Wi-Fi: A Tutorial

With the rapid development of wireless communication technology, wireless access points (AP) and internet of things (IoT) devices have been widely deployed in our surroundings. Various types of wireless signals (e.g., Wi-Fi, LoRa, LTE) are filling out our living and working spaces. Previous researches reveal the fact that radio waves are modulated by the spatial structure during the propagation process (e.g., reflection, diffraction, and scattering) and superimposed on the receiver. This observation allows us to reconstruct the surrounding environment based on received wireless signals, called “wireless sensing”. Wireless sensing is an emerging technology that enables a wide range of applications, such as gesture recognition for human-computer interaction, vital signs monitoring for health care, and intrusion detection for security management. Compared with other sensing paradigms, such as vision-based and IMU-based sensing, wireless sensing solutions have unique advantages such as high coverage, pervasiveness, low cost, and robustness under adverse light and texture scenarios. Besides, wireless sensing solutions are generally lightweight in terms of both computation overhead and device size. This tutorial takes Wi-Fi sensing as an example. It introduces both the theoretical principles and the code implementation 1 of data collection, signal processing, features extraction, and model design. In addition, this tutorial highlights state-of-the-art deep learning models (e.g., CNN, RNN, and adversarial learning models) and their applications in wireless sensing systems. We hope this tutorial will help people in other research fields to break into wireless sensing research and learn more about its theories, designs, and implementation skills, promoting prosperity in the wireless sensing research field.
Robust Imitation Learning against Variations in Environment Dynamics

In this paper, we propose a robust imitation learning (IL) framework that improves the robustness of IL when environment dynamics are perturbed. The existing IL framework trained in a single environment can catastrophically fail with perturbations in environment dynamics because it does not capture the situation that underlying environment dynamics can be changed. Our framework effectively deals with environments with varying dynamics by imitating multiple experts in sampled environment dynamics to enhance the robustness in general variations in environment dynamics. In order to robustly imitate the multiple sample experts, we minimize the risk with respect to the Jensen-Shannon divergence between the agent's policy and each of the sample experts. Numerical results show that our algorithm significantly improves robustness against dynamics perturbations compared to conventional IL baselines.
The analytic extension of solutions to initial-boundary value problems outside their domain of definition

We examine the analytic extension of solutions of linear, constant-coefficient initial-boundary value problems outside their spatial domain of definition. We use the Unified Transform Method or Method of Fokas, which gives a representation for solutions to half-line and finite-interval initial-boundary value problems as integrals of kernels with explicit spatial and temporal dependence. These solution representations are defined within the spatial domain of the problem. We obtain the extension of these representation formulae via Taylor series outside these spatial domains and find the extension of the initial condition that gives rise to a whole-line initial-value problem solved by the extended solution. In general, the extended initial condition is not differentiable or continuous unless the boundary and initial conditions satisfy compatibility conditions. We analyze dissipative and dispersive problems, and problems with continuous and discrete spatial variables.
Multi-channel end-to-end neural network for speech enhancement, source localization, and voice activity detection

Speech enhancement and source localization has been active research for several decades with a wide range of real-world applications. Recently, the Deep Complex Convolution Recurrent network (DCCRN) has yielded impressive enhancement performance for single-channel systems. In this study, a neural beamformer consisting of a beamformer and a novel multi-channel DCCRN is proposed for speech enhancement and source localization. Complex-valued filters estimated by the multi-channel DCCRN serve as the weights of beamformer. In addition, a one-stage learning-based procedure is employed for speech enhancement and source localization. The proposed network composed of the multi-channel DCCRN and the auxiliary network models the sound field, while minimizing the distortionless response loss function. Simulation results show that the proposed neural beamformer is effective in enhancing speech signals, with speech quality well preserved. The proposed neural beamformer also provides source localization and voice activity detection (VAD) functions.
Boosting Cross-Domain Speech Recognition With Self-Supervision

The cross-domain performance of automatic speech recognition (ASR) could be severely hampered due to the mismatch between training and testing distributions. Since the target domain usually lacks labeled data, and domain shifts exist at acoustic and linguistic levels, it is challenging to perform unsupervised domain adaptation (UDA) for ASR. Previous work has shown that self-supervised learning (SSL) or pseudo-labeling (PL) is effective in UDA by exploiting the self-supervisions of unlabeled data. However, these self-supervisions also face performance degradation in mismatched domain distributions, which previous work fails to address. This work presents a systematic UDA framework to fully utilize the unlabeled data with self-supervision in the pre-training and fine-tuning paradigm. On the one hand, we apply continued pre-training and data replay techniques to mitigate the domain mismatch of the SSL pre-trained model. On the other hand, we propose a domain-adaptive fine-tuning approach based on the PL technique with three unique modifications: Firstly, we design a dual-branch PL method to decrease the sensitivity to the erroneous pseudo-labels; Secondly, we devise an uncertainty-aware confidence filtering strategy to improve pseudo-label correctness; Thirdly, we introduce a two-step PL approach to incorporate target domain linguistic knowledge, thus generating more accurate target domain pseudo-labels. Experimental results on various cross-domain scenarios demonstrate that the proposed approach effectively boosts the cross-domain performance and significantly outperforms previous approaches.
The only true ( 2 + 1 )-dimensional nonlocal KdV , fifth-order KdV , and Gardner equations derived from the ideal fluid model

Piotr Rozmej† Institute of Physics, Faculty of Physics and Astronomy, University of Zielona Góra, Szafrana 4a, 65-516 Zielona Góra, Poland (Dated: June 22, 2022) Abstract We study the problem of gravity surface waves for an ideal fluid model in the (2+1)-dimensional case. We apply a systematic procedure to derive the Boussinesq equations for a given relation between the orders of four expansion parameters, the amplitude parameter α, the long-wavelength parameter β, the transverse wavelength parameter γ, and the bottom variation parameter δ. In three special cases we derived the only true (2+1)-dimensional extensions to the Korteweg-de Vries equation, fifth-order KdV equation, and the Gardner equation. All these equations are non-local. When the bottom is flat, the (2+1)-dimensional KdV equation can be transformed into the Kadomtsev-Petviashvili equation.
GaLeNet: Multimodal Learning for Disaster Prediction, Management and Relief

After a natural disaster, such as a hurricane, millions are left in need of emergency assistance. To allocate resources optimally, human planners need to accurately analyze data that can flow in large volumes from several sources. This motivates the development of multimodal machine learning frameworks that can integrate multiple data sources and leverage them efficiently. To date, the research community has mainly focused on unimodal reasoning to provide granular assessments of the damage. Moreover, previous studies mostly rely on post-disaster images, which may take several days to become available. In this work, we propose a multimodal framework (GaLeNet) for assessing the severity of damage by complementing pre-disaster images with weather data and the trajectory of the hurricane. Through extensive experiments on data from two hurricanes, we demonstrate (i) the merits of multimodal approaches compared to unimodal methods, and (ii) the effectiveness of GaLeNet at fusing various modalities. Furthermore, we show that GaLeNet can leverage pre-disaster images in the absence of post-disaster images, preventing substantial delays in decision making.
SynWMD: Syntax-aware Word Mover's Distance for Sentence Similarity Evaluation

Word Mover's Distance (WMD) computes the distance between words and models text similarity with the moving cost between words in two text sequences. Yet, it does not offer good performance in sentence similarity evaluation since it does not incorporate word importance and fails to take inherent contextual and structural information in a sentence into account. An improved WMD method using the syntactic parse tree, called Syntax-aware Word Mover's Distance (SynWMD), is proposed to address these two shortcomings in this work. First, a weighted graph is built upon the word co-occurrence statistics extracted from the syntactic parse trees of sentences. The importance of each word is inferred from graph connectivities. Second, the local syntactic parsing structure of words is considered in computing the distance between words. To demonstrate the effectiveness of the proposed SynWMD, we conduct experiments on 6 textual semantic similarity (STS) datasets and 4 sentence classification datasets. Experimental results show that SynWMD achieves state-of-the-art performance on STS tasks. It also outperforms other WMD-based methods on sentence classification tasks.
On The Memory Complexity of Uniformity Testing

In this paper we consider the problem of uniformity testing with limited memory. We observe a sequence of independent identically distributed random variables drawn from a distribution $p$ over $[n]$, which is either uniform or is $\varepsilon$-far from uniform under the total variation distance, and our goal is to determine the correct hypothesis. At each time point we are allowed to update the state of a finite-memory machine with $S$ states, where each state of the machine is assigned one of the hypotheses, and we are interested in obtaining an asymptotic probability of error at most $0<\delta<1/2$ uniformly under both hypotheses. The main contribution of this paper is deriving upper and lower bounds on the number of states $S$ needed in order to achieve a constant error probability $\delta$, as a function of $n$ and $\varepsilon$, where our upper bound is $O(\frac{n\log n}{\varepsilon})$ and our lower bound is $\Omega (n+\frac{1}{\varepsilon})$. Prior works in the field have almost exclusively used collision counting for upper bounds, and the Paninski mixture for lower bounds. Somewhat surprisingly, in the limited memory with unlimited samples setup, the optimal solution does not involve counting collisions, and the Paninski prior is not hard. Thus, different proof techniques are needed in order to attain our bounds.
What Can be Seen is What You Get: Structure Aware Point Cloud Augmentation

To train a well performing neural network for semantic segmentation, it is crucial to have a large dataset with available ground truth for the network to generalize on unseen data. In this paper we present novel point cloud augmentation methods to artificially diversify a dataset. Our sensor-centric methods keep the data structure consistent with the lidar sensor capabilities. Due to these new methods, we are able to enrich low-value data with high-value instances, as well as create entirely new scenes. We validate our methods on multiple neural networks with the public SemanticKITTI [3] dataset and demonstrate that all networks improve compared to their respective baseline. In addition, we show that our methods enable the use of very small datasets, saving annotation time, training time and the associated costs.
VALIDITY OF GARBER MODEL IN PREDICTING PAVEMENT CONDITION INDEX OF FLEXIBLE PAVEMENT IN KERBALA CITY

Pavement Condition Index (PCI) is one of the important basics in pavement maintenance management system (PMMS), and it is used to evaluate the current and future pavement condition. This importantance in decision making to limit the maintenance needs, types of treatment, and maintenance priority. The aim of this research is to estimate the PCI value for flexible pavement urban roads in the study area (kerbala city) by using Garber et al. developed model. Based on previous researches, data are collected for variables that have a significant impact on pavement condition. Data for pavement age (AGE), average daily traffic (ADT), and structural number (SN) were collected for 44 sections in the network roads. A field survey (destructive test (core test) and laboratory test (Marshall Test)) were used to determine the capacity of structure layer of pavement (SN). The condition index (CI) output from a developed model was compared with the PCI output of PAVER 6.5. 7 by using statistical analysis test. The developed model overestimates value of CI rather than PCI estimated from PAVER 6.5. 7 due to statistical test to a 95% degree of confidence, (R = 0.771) for 44 sections (arterial and collector).
Augmented Imagefication: A Data-driven Fault Detection Method for Aircraft Air Data Sensors

In this paper, a novel data-driven approach named Augmented Imagefication for Fault detection (FD) of aircraft air data sensors (ADS) is proposed. Exemplifying the FD problem of aircraft air data sensors, an online FD scheme on edge device based on deep neural network (DNN) is developed. First, the aircraft inertial reference unit measurements is adopted as equivalent inputs, which is scalable to different aircraft/flight cases. Data associated with 6 different aircraft/flight conditions are collected to provide diversity (scalability) in the training/testing database. Then Augmented Imagefication is proposed for the DNN-based prediction of flying conditions. The raw data are reshaped as a grayscale image for convolutional operation, and the necessity of augmentation is analyzed and pointed out. Different kinds of augmented method, i.e. Flip, Repeat, Tile and their combinations are discussed, the result shows that the All Repeat operation in both axes of image matrix leads to the best performance of DNN. The interpretability of DNN is studied based on Grad-CAM, which provide a better understanding and further solidifies the robustness of DNN. Next the DNN model, VGG-16 with augmented imagefication data is optimized for mobile hardware deployment. After pruning of DNN, a lightweight model (98.79% smaller than original VGG-16) with high accuracy (slightly up by 0.27%) and fast speed (time delay is reduced by 87.54%) is obtained. And the hyperparameters optimization of DNN based on TPE is implemented and the best combination of hyperparameters is determined (learning rate 0.001, iterative epochs 600, and batch size 100 yields the highest accuracy at 0.987). Finally, a online FD deployment based on edge device, Jetson Nano, is developed and the real time monitoring of aircraft is achieved. We believe that this method is instructive for addressing the FD problems in other similar fields.
Large-Period Multichannel Metagratings For Broad-Angle Absorption

We present an alternative scheme for obtaining effective power dissipation in planar composites, extending the recently proposed concept of metagrating (MGs), sparse arrangements of polarizable particles (meta-atoms), to realize multifunctional absorbers. In contrast to typical metasurface solutions, where periodicities are limited to half of a wavelength at most to avoid high-order Floquet-Bloch modes, we purposely consider large-period MGs, relying on their proven ability to effectively mitigate spurious scattering. The absorption process is thus implemented via precise engineering of the mutual coupling between numerous individual scatterers fitting in the enlarged period, with these additional degrees of freedom further utilized to enforce the perfect absorption conditions for multiple excitation angles simultaneously. The resultant devices, utilizing a standard printed circuit board configuration obtained semianalytically while featuring relaxed fabrication demands, exhibit high absorption across a wide angular range, useful for radar cross section reduction and energy harvesting applications.
Provable Generalization of Overparameterized Meta-learning Trained with SGD

Despite the superior empirical success of deep meta-learning, theoretical understanding of overparameterized meta-learning is still limited. This paper studies the generalization of a widely used meta-learning approach, Model-Agnostic Meta-Learning (MAML), which aims to find a good initialization for fast adaptation to new tasks. Under a mixed linear regression model, we analyze the generalization properties of MAML trained with SGD in the overparameterized regime. We provide both upper and lower bounds for the excess risk of MAML, which captures how SGD dynamics affect these generalization bounds. With such sharp characterizations, we further explore how various learning parameters impact the generalization capability of overparameterized MAML, including explicitly identifying typical data and task distributions that can achieve diminishing generalization error with overparameterization, and characterizing the impact of adaptation learning rate on both excess risk and the early stopping time. Our theoretical findings are further validated by experiments.