Miracle-dz/UniFAR-FTUs huggingface dataset:
Randomized Overdrive Neural Networks

By processing audio signals in the time-domain with randomly weighted temporal convolutional networks (TCNs), we uncover a wide range of novel, yet controllable overdrive effects. We discover that architectural aspects, such as the depth of the network, the kernel size, the number of channels, the activation function, as well as the weight initialization, all have a clear impact on the sonic character of the resultant effect, without the need for training. In practice, these effects range from conventional overdrive and distortion, to more extreme effects, as the receptive field grows, similar to a fusion of distortion, equalization, delay, and reverb. To enable use by musicians and producers, we provide a real-time plugin implementation. This allows users to dynamically design networks, listening to the results in real-time. We provide a demonstration and code at https://ronn.ml.
Quantitative rapid and finite time stabilization of the heat equation

The null controllability of the heat equation is known for decades [19,23,30]. The finite time stabilizability of the one dimensional heat equation was proved by Coron--Nguyen [13], while the same question for high dimensional spaces remained widely open. Inspired by Coron--Trelat [14] we find explicit stationary feedback laws that quantitatively exponentially stabilize the heat equation with decay rate $\lambda$ and $Ce^{C\sqrt{\lambda}}$ estimates, where Lebeau--Robbiano's spectral inequality [30] is naturally used. Then a piecewise controlling argument leads to null controllability with optimal cost $Ce^{C/T}$, as well as finite time stabilization.
NutCracker at WNUT-2020 Task 2: Robustly Identifying Informative COVID-19 Tweets using Ensembling and Adversarial Training

We experiment with COVID-Twitter-BERT and RoBERTa models to identify informative COVID-19 tweets. We further experiment with adversarial training to make our models robust. The ensemble of COVID-Twitter-BERT and RoBERTa obtains a F1-score of 0.9096 (on the positive class) on the test data of WNUT-2020 Task 2 and ranks 1st on the leaderboard. The ensemble of the models trained using adversarial training also produces similar result.
Converging to a Desired Orientation in a Flock of Agents

This work concentrates on different aspects of the \textit{consensus problem}, when applying it to a swarm of flocking agents. We examine the possible influence an external agent, referred to as {\em influencing agent} has on the flock. We prove that even a single influencing agent with a \textit{Face Desired Orientation behaviour} that is injected into the flock is sufficient for guaranteeing desired consensus of the flock of agents which follow a Vicsek-inspired Model. We further show that in some cases this can be guaranteed also in dynamic environments.
S0-2 Star, G1- and G2-objects, and Flaring Activity of the Milky Way’s Galactic Center Black Hole in 2019

In 2019, the Galactic center black hole Sgr A* produced an unusually high number of bright near-infrared flares, including the brightest-ever detected flare. We propose that this activity was triggered by the near simultaneous infall of material shed by G1 and G2 objects due to their interaction with the background accretion flow. We discuss mechanisms by which S-stars and G-objects shed material, and estimate both the quantity of material and the infall time to reach the black hole.
MLQE-PE: A Multilingual Quality Estimation and Post-Editing Dataset

We present MLQE-PE, a new dataset for Machine Translation (MT) Quality Estimation (QE) and Automatic Post-Editing (APE). The dataset contains annotations for eleven language pairs, including both high- and low-resource languages. Specifically, it is annotated for translation quality with human labels for up to 10,000 translations per language pair in the following formats: sentence-level direct assessments and post-editing effort, and word-level binary good/bad labels. Apart from the quality-related scores, each source-translation sentence pair is accompanied by the corresponding post-edited sentence, as well as titles of the articles where the sentences were extracted from, and information on the neural MT models used to translate the text. We provide a thorough description of the data collection and annotation process as well as an analysis of the annotation distribution for each language pair. We also report the performance of baseline systems trained on the MLQE-PE dataset. The dataset is freely available and has already been used for several WMT shared tasks.
Synthetic MRI-aided Head-and-Neck Organs-at-Risk Auto-Delineation for CBCT-guided Adaptive Radiotherapy.

Purpose: Organ-at-risk (OAR) delineation is a key step for cone-beam CT (CBCT) based adaptive radiotherapy planning that can be a time-consuming, labor-intensive, and subject-to-variability process. We aim to develop a fully automated approach aided by synthetic MRI for rapid and accurate CBCT multi-organ contouring in head-and-neck (HN) cancer patients. MRI has superb soft-tissue contrasts, while CBCT offers bony-structure contrasts. Using the complementary information provided by MRI and CBCT is expected to enable accurate multi-organ segmentation in HN cancer patients. In our proposed method, MR images are firstly synthesized using a pre-trained cycle-consistent generative adversarial network given CBCT. The features of CBCT and synthetic MRI are then extracted using dual pyramid networks for final delineation of organs. CBCT images and their corresponding manual contours were used as pairs to train and test the proposed model. Quantitative metrics including Dice similarity coefficient (DSC) were used to evaluate the proposed method. The proposed method was evaluated on a cohort of 65 HN cancer patients. CBCT images were collected from those patients who received proton therapy. Overall, DSC values of 0.87, 0.79/0.79, 0.89/0.89, 0.90, 0.75/0.77, 0.86, 0.66, 0.78/0.77, 0.96, 0.89/0.89, 0.832, and 0.84 for commonly used OARs for treatment planning including brain stem, left/right cochlea, left/right eye, larynx, left/right lens, mandible, optic chiasm, left/right optic nerve, oral cavity, left/right parotid, pharynx, and spinal cord, respectively, were achieved. In this study, we developed a synthetic MRI-aided HN CBCT auto-segmentation method based on deep learning. It provides a rapid and accurate OAR auto-delineation approach, which can be used for adaptive radiation therapy.
Non-Attentive Tacotron: Robust and Controllable Neural TTS Synthesis Including Unsupervised Duration Modeling

This paper presents Non-Attentive Tacotron based on the Tacotron 2 text-to-speech model, replacing the attention mechanism with an explicit duration predictor. This improves robustness significantly as measured by unaligned duration ratio and word deletion rate, two metrics introduced in this paper for large-scale robustness evaluation using a pre-trained speech recognition model. With the use of Gaussian upsampling, Non-Attentive Tacotron achieves a 5-scale mean opinion score for naturalness of 4.41, slightly outperforming Tacotron 2. The duration predictor enables both utterance-wide and per-phoneme control of duration at inference time. When accurate target durations are scarce or unavailable in the training data, we propose a method using a fine-grained variational auto-encoder to train the duration predictor in a semi-supervised or unsupervised manner, with results almost as good as supervised training.
An energy, momentum, and angular momentum conserving scheme for a regularization model of incompressible flow

Abstract We introduce a new regularization model for incompressible fluid flow, which is a regularization of the EMAC (energy, momentum, and angular momentum conserving) formulation of the Navier–Stokes equations (NSE) that we call EMAC-Reg. The EMAC formulation has proved to be a useful formulation because it conserves energy, momentum, and angular momentum even when the divergence constraint is only weakly enforced. However, it is still a NSE formulation and so cannot resolve higher Reynolds number flows without very fine meshes. By carefully introducing regularization into the EMAC formulation, we create a model more suitable for coarser mesh computations but that still conserves the same quantities as EMAC, i.e., energy, momentum, and angular momentum. We show that EMAC-Reg, when semi-discretized with a finite element spatial discretization is well-posed and optimally accurate. Numerical results are provided that show EMAC-Reg is a robust coarse mesh model.
Convex Obstacles from Travelling Times

We consider situations where rays are reflected according to geometrical optics by a set of unknown obstacles. The aim is to recover information about the obstacles from the travelling-time data of the reflected rays using geometrical methods and observations of singularities. Suppose that, for a disjoint union of finitely many strictly convex smooth obstacles in the Euclidean plane, no Euclidean line meets more than two of them. We then give a construction for complete recovery of the obstacles from the travelling times of reflected rays.
New MDS Symbol-Pair Codes from Repeated-Root Cyclic Codes over Finite Fields

Symbol-pair codes are introduced to guard against pair-errors in symbol-pair read channels. One main task in symbol-pair coding theory is to design codes with large minimum symbol-pair distance. Maximum distance separable (\,MDS\,) symbol-pair codes are optimal in the sense that such codes attain the Singleton bound. In this paper, three new classes of MDS symbol-pair codes with minimum symbol-pair distance seven or eight are proposed by virtue of repeated-root cyclic codes. The main results are obtained by determining the solutions of certain equations over finite fields.
Dissecting Hessian: Understanding Common Structure of Hessian in Neural Networks

Hessian captures important properties of the deep neural network loss landscape. We observe that eigenvectors and eigenspaces of the layer-wise Hessian for neural network objective have several interesting structures -- top eigenspaces for different models have high overlap, and top eigenvectors form low rank matrices when they are reshaped into the same shape as the corresponding weight matrix. These structures, as well as the low rank structure of the Hessian observed in previous studies, can be explained by approximating the Hessian using Kronecker factorization. Our new understanding can also explain why some of these structures become weaker when the network is trained with batch normalization. Finally, we show that the Kronecker factorization can be combined with PAC-Bayes techniques to get better explicit generalization bounds.
Deep Sequence Learning for Video Anticipation: From Discrete and Deterministic to Continuous and Stochastic

Video anticipation is the task of predicting one/multiple future representation(s) given limited, partial observation. This is a challenging task due to the fact that given limited observation, the future representation can be highly ambiguous. Based on the nature of the task, video anticipation can be considered from two viewpoints: the level of details and the level of determinism in the predicted future. In this research, we start from anticipating a coarse representation of a deterministic future and then move towards predicting continuous and fine-grained future representations of a stochastic process. The example of the former is video action anticipation in which we are interested in predicting one action label given a partially observed video and the example of the latter is forecasting multiple diverse continuations of human motion given partially observed one. In particular, in this thesis, we make several contributions to the literature of video anticipation.
Self-Paced Learning for Neural Machine Translation

Recent studies have proven that the training of neural machine translation (NMT) can be facilitated by mimicking the learning process of humans. Nevertheless, achievements of such kind of curriculum learning rely on the quality of artificial schedule drawn up with the handcrafted features, e.g. sentence length or word rarity. We ameliorate this procedure with a more flexible manner by proposing self-paced learning, where NMT model is allowed to 1) automatically quantify the learning confidence over training examples; and 2) flexibly govern its learning via regulating the loss in each iteration step. Experimental results over multiple translation tasks demonstrate that the proposed model yields better performance than strong baselines and those models trained with human-designed curricula on both translation quality and convergence speed.
Learning to Locomote: Understanding How Environment Design Matters for Deep Reinforcement Learning

Learning to locomote is one of the most common tasks in physics-based animation and deep reinforcement learning (RL). A learned policy is the product of the problem to be solved, as embodied by the RL environment, and the RL algorithm. While enormous attention has been devoted to RL algorithms, much less is known about the impact of design choices for the RL environment. In this paper, we show that environment design matters in significant ways and document how it can contribute to the brittle nature of many RL results. Specifically, we examine choices related to state representations, initial state distributions, reward structure, control frequency, episode termination procedures, curriculum usage, the action space, and the torque limits. We aim to stimulate discussion around such choices, which in practice strongly impact the success of RL when applied to continuous-action control problems of interest to animation, such as learning to locomote.
Be Your Own Best Competitor! Multi-Branched Adversarial Knowledge Transfer

Deep neural network architectures have attained remarkable improvements in scene understanding tasks. Utilizing an efficient model is one of the most important constraints for limited-resource devices. Recently, several compression methods have been proposed to diminish the heavy computational burden and memory consumption. Among them, the pruning and quantizing methods exhibit a critical drop in performances by compressing the model parameters. While the knowledge distillation methods improve the performance of compact models by focusing on training lightweight networks with the supervision of cumbersome networks. In the proposed method, the knowledge distillation has been performed within the network by constructing multiple branches over the primary stream of the model, known as the self-distillation method. Therefore, the ensemble of sub-neural network models has been proposed to transfer the knowledge among themselves with the knowledge distillation policies as well as an adversarial learning strategy. Hence, The proposed ensemble of sub-models is trained against a discriminator model adversarially. Besides, their knowledge is transferred within the ensemble by four different loss functions. The proposed method has been devoted to both lightweight image classification and encoder-decoder architectures to boost the performance of small and compact models without incurring extra computational overhead at the inference process. Extensive experimental results on the main challenging datasets show that the proposed network outperforms the primary model in terms of accuracy at the same number of parameters and computational cost. The obtained results show that the proposed model has achieved significant improvement over earlier ideas of self-distillation methods. The effectiveness of the proposed models has also been illustrated in the encoder-decoder model.
From Hard Spheres to Hardcore Spins.

A system of hard spheres exhibits physics that is controlled only by their density. This comes about because the interaction energy is either infinite or zero, so all allowed configurations have exactly the same energy. The low density phase is liquid, while the high density phase is crystalline, an example of "order by disorder" as it is driven purely by entropic considerations. Here we introduce and study a family of hard spin models, which we call hardcore spin models, where we replace the translational degrees of freedom of hard spheres with the orientational degrees of freedom of lattice spins. Their hardcore interaction serves analogously to divide configurations of the many spin system into allowed and disallowed sectors. We present detailed results on the square lattice in $d=2$ for a set of models with $\mathbb{Z}_n$ symmetry which generalize Potts models and their $U(1)$ limits---for ferromagnetic and antiferromagnetic senses of the interaction which we refer to as exclusion and inclusion models. As the exclusion/inclusion angles are varied, we find a Kosterlitz-Thouless phase transition between a disordered phase and an ordered phase with quasi-long ranged order, which is the form order by disorder takes in these systems. These results follow from a set of height representations, an ergodic cluster algorithm, and transfer matrix calculations.
MIMO ILC for Precision SEA robots using Input-weighted Complex-Kernel Regression

This work improves the positioning precision of lightweight robots with series elastic actuators (SEAs). Lightweight SEA robots, along with low-impedance control, can maneuver without causing damage in uncertain, confined spaces such as inside an aircraft wing during aircraft assembly. Nevertheless, substantial modeling uncertainties in SEA robots reduce the precision achieved by model-based approaches such as inversion-based feedforward. Therefore, this article improves the precision of SEA robots around specified operating points, through a multi-input multi-output (MIMO), iterative learning control (ILC) approach. The main contributions of this article are to (i) introduce an input-weighted complex kernel to estimate local MIMO models using complex Gaussian process regression (c-GPR) (ii) develop Gersgorin-theorem-based conditions on the iteration gains for ensuring ILC convergence to precision within noise-related limits, even with errors in the estimated model; and (iii) demonstrate precision positioning with an experimental SEA robot. Comparative experimental results, with and without ILC, show around 90% improvement in the positioning precision (close to the repeatability limit of the robot) and a 10-times increase in the SEA robot's operating speed with the use of the MIMO ILC.
A Survey of Knowledge-enhanced Text Generation

The goal of text-to-text generation is to make machines express like a human in many applications such as conversation, summarization, and translation. It is one of the most important yet challenging tasks in natural language processing (NLP). Various neural encoder-decoder models have been proposed to achieve the goal by learning to map input text to output text. However, the input text alone often provides limited knowledge to generate the desired output, so the performance of text generation is still far from satisfaction in many real-world scenarios. To address this issue, researchers have considered incorporating (i) internal knowledge embedded in the input text and (ii) external knowledge from outside sources such as knowledge base and knowledge graph into the text generation system. This research topic is known as knowledge-enhanced text generation. In this survey, we present a comprehensive review of the research on this topic over the past five years. The main content includes two parts: (i) general methods and architectures for integrating knowledge into text generation; (ii) specific techniques and applications according to different forms of knowledge data. This survey can have broad audiences, researchers and practitioners, in academia and industry.
Audio-Visual Speech Inpainting with Deep Learning

In this paper, we present a deep-learning-based framework for audio-visual speech inpainting, i.e., the task of restoring the missing parts of an acoustic speech signal from reliable audio context and uncorrupted visual information. Recent work focuses solely on audio-only methods and generally aims at inpainting music signals, which show highly different structure than speech. Instead, we inpaint speech signals with gaps ranging from 100 ms to 1600 ms to investigate the contribution that vision can provide for gaps of different duration. We also experiment with a multi-task learning approach where a phone recognition task is learned together with speech inpainting. Results show that the performance of audio-only speech inpainting approaches degrades rapidly when gaps get large, while the proposed audio-visual approach is able to plausibly restore missing information. In addition, we show that multi-task learning is effective, although the largest contribution to performance comes from vision.
Orthogonal decomposition of tensor trains

In this paper, we study the problem of decomposing a given tensor into a tensor train such that the tensors at the vertices are orthogonally decomposable. When the tensor train has length two, and the orthogonally decomposable tensors at the two vertices are symmetric, we recover the decomposition by considering random linear combinations of slices. Furthermore, if the tensors at the vertices are symmetric and low-rank but not orthogonally decomposable, we show that a whitening procedure can transform the problem into the orthogonal case. When the tensor network has length three or more and the tensors at the vertices are symmetric and orthogonally decomposable, we provide an algorithm for recovering them subject to some rank conditions. Finally, in the case of tensor trains of length two in which the tensors at the vertices are orthogonally decomposable but not necessarily symmetric, we show that the decomposition problem reduces to the novel problem of decomposing a matrix into an orthogonal matrix multiplied by diagonal matrices on either side. We provide and compare two solutions, one based on Sinkhorn's theorem and one on Procrustes' algorithm. We conclude with a multitude of open problems in linear and multilinear algebra that arose in our study.
Evaluating the Effectiveness of Efficient Neural Architecture Search for Sentence-Pair Tasks

Neural Architecture Search (NAS) methods, which automatically learn entire neural model or individual neural cell architectures, have recently achieved competitive or state-of-the-art (SOTA) performance on variety of natural language processing and computer vision tasks, including language modeling, natural language inference, and image classification. In this work, we explore the applicability of a SOTA NAS algorithm, Efficient Neural Architecture Search (ENAS) (Pham et al., 2018) to two sentence pair tasks, paraphrase detection and semantic textual similarity. We use ENAS to perform a micro-level search and learn a task-optimized RNN cell architecture as a drop-in replacement for an LSTM. We explore the effectiveness of ENAS through experiments on three datasets (MRPC, SICK, STS-B), with two different models (ESIM, BiLSTM-Max), and two sets of embeddings (Glove, BERT). In contrast to prior work applying ENAS to NLP tasks, our results are mixed – we find that ENAS architectures sometimes, but not always, outperform LSTMs and perform similarly to random architecture search.