Miracle-dz/UniFAR-FTUs huggingface dataset:
Learning Speech Emotion Representations in the Quaternion Domain

The modeling of human emotion expression in speech signals is an important, yet challenging task. The high resource demand of speech emotion recognition models, combined with the general scarcity of emotion-labelled data are obstacles to the development and application of effective solutions in this field. In this paper, we present an approach to jointly circumvent these difficulties. Our method, named RH-emo, is a novel semi-supervised architecture aimed at extracting quaternion embeddings from real-valued monoaural spectrograms, enabling the use of quaternion-valued networks for speech emotion recognition tasks. RH-emo is a hybrid real/quaternion autoencoder network that consists of a real-valued encoder in parallel to a real-valued emotion classifier and a quaternion-valued decoder. On the one hand, the classifier permits to optimization of each latent axis of the embeddings for the classification of a specific emotion-related characteristic: valence, arousal, dominance, and overall emotion. On the other hand, quaternion reconstruction enables the latent dimension to develop intra-channel correlations that are required for an effective representation as a quaternion entity. We test our approach on speech emotion recognition tasks using four popular datasets: IEMOCAP, RAVDESS, EmoDB, and TESS, comparing the performance of three well-established real-valued CNN architectures (AlexNet, ResNet-50, VGG) and their quaternion-valued equivalent fed with the embeddings created with RH-emo. We obtain a consistent improvement in the test accuracy for all datasets, while drastically reducing the resources' demand of models. Moreover, we performed additional experiments and ablation studies that confirm the effectiveness of our approach.
Distinguishing Homophenes Using Multi-Head Visual-Audio Memory for Lip Reading

Recognizing speech from silent lip movement, which is called lip reading, is a challenging task due to 1) the inherent information insufficiency of lip movement to fully represent the speech, and 2) the existence of homophenes that have similar lip movement with different pronunciations. In this paper, we try to alleviate the aforementioned two challenges in lip reading by proposing a Multi-head Visual-audio Memory (MVM). Firstly, MVM is trained with audio-visual datasets and remembers audio representations by modelling the inter-relationships of paired audio-visual representations. At the inference stage, visual input alone can extract the saved audio representation from the memory by examining the learned inter-relationships. Therefore, the lip reading model can complement the insufficient visual information with the extracted audio representations. Secondly, MVM is composed of multi-head key memories for saving visual features and one value memory for saving audio knowledge, which is designed to distinguish the homophenes. With the multi-head key memories, MVM extracts possible candidate audio features from the memory, which allows the lip reading model to consider the possibility of which pronunciations can be represented from the input lip movement. This also can be viewed as an explicit implementation of the one-to-many mapping of viseme-to-phoneme. Moreover, MVM is employed in multi-temporal levels to consider the context when retrieving the memory and distinguish the homophenes. Extensive experimental results verify the effectiveness of the proposed method in lip reading and in distinguishing the homophenes.
Cancer Subtyping via Embedded Unsupervised Learning on Transcriptomics Data

Cancer is one of the deadliest diseases worldwide. Accurate diagnosis and classification of cancer subtypes are indispensable for effective clinical treatment. Promising results on automatic cancer subtyping systems have been published recently with the emergence of various deep learning methods. However, such automatic systems often overfit the data due to the high dimensionality and scarcity. In this paper, we propose to investigate automatic subtyping from an unsupervised learning perspective by directly constructing the underlying data distribution itself, hence sufficient data can be generated to alleviate the issue of overfitting. Specifically, we bypass the strong Gaussianity assumption that typically exists but fails in the unsupervised learning subtyping literature due to small-sized samples by vector quantization. Our proposed method better captures the latent space features and models the cancer subtype manifestation on a molecular basis, as demonstrated by the extensive experimental results.
GLAT: Glancing at Latent Variables for Parallel Text Generation

Recently, parallel text generation has received widespread attention due to its success in generation efficiency. Although many advanced techniques are proposed to improve its generation quality, they still need the help of an autoregressive model for training to overcome the one-to-many multi-modal phenomenon in the dataset, limiting their applications. In this paper, we propose GLAT, which employs the discrete latent variables to capture word categorical information and invoke an advanced curriculum learning technique, alleviating the multi-modality problem. Experiment results show that our method outperforms strong baselines without the help of an autoregressive model, which further broadens the application scenarios of the parallel decoding paradigm.
Existence, uniqueness and approximation of solutions of SDEs with superlinear coefficients in the presence of discontinuities of the drift coefficient

Existence, uniqueness, and L p -approximation results are presented for scalar stochastic diﬀerential equations (SDEs) by considering the case where, the drift coeﬃcient has ﬁnitely many spatial discontinuities while both coeﬃcients can grow superlinearly (in the space variable). These discontinuities are described by a piecewise local Lipschitz continuity and a piecewise monotone-type condition while the diﬀusion coeﬃcient is assumed to be locally Lipschitz continuous and non-degenerate at the discontinuity points of the drift coeﬃcient. Moreover, the superlinear nature of the coeﬃcients is dictated by a suitable coercivity condition and a polynomial growth of the (local) Lipschitz constants of the coeﬃcients. Existence and uniqueness of strong solutions of such SDEs are obtained. Furthermore, the classical L p -error rate 1 / 2, for a suitable range of values of p , is recovered for a tamed Euler scheme which is used for approximating these solutions. To the best of the authors’ knowledge, these are the ﬁrst existence, uniqueness and approximation results for this class of SDEs.
Towards Digital Twin-enabled DevOps for CPS providing Architecture-Based Service Adaptation & Verification at Runtime

Background: Industrial Product-Service Systems (IPSS) denote a service-oriented way of providing access to cyber-physical systems’ (CPS) capabilities. The design of such systems bears high risk due to uncertainty in requirements related to service function and behavior, operation environments, and evolving customer needs. Such risks and uncertainties are well known in the IT sector, where DevOps principles ensure continuous system improvement through reliable and frequent delivery processes. A modular and service-oriented system architecture complements these processes to facilitate IT system adaptation and evolution.Objective: This work proposes a method to use and extend the Digital Twins (DTs) of IPSS assets for enabling the continuous optimization of CPS service delivery and the latter’s adaptation to changing needs and environments. This reduces uncertainty during design and operations by assuring IPSS integrity and availability, especially for design and service adaptations at CPS runtime.Methodology: The method builds on transferring IT DevOps principles to DT-enabled CPS IPSS. The chosen design approach integrates, reuses, and aligns the DT processing and communication resources with DevOps requirements derived from literature.Results: We use these requirements to propose a DT-enabled self-adaptive CPS model, which guides the realization of DT-enabled DevOps in CPS IPSS. We further propose detailed design models for operation-critical DTs that integrate CPS closed-loop control and architecture-based CPS adaptation. This integrated approach enables the implementation of A/B testing as a use case and central concept to enable CPS IPSS service adaptation and reconfiguration.Conclusion: The self-adaptive CPS model and DT design concept have been validated in an evaluation environment for operation-critical CPS IPSS. The demonstrator achieved sub-millisecond cycle times during service A/B testing at runtime without causing CPS operation interferences and downtime.CCS CONCEPTS• Computer systems organization~Embedded and cyber-physical systems •Computer systems organization~Architectures
Unsupervised Data Selection via Discrete Speech Representation for ASR

Self-supervised learning of speech representations has achieved impressive results in improving automatic speech recognition (ASR). In this paper, we show that data selection is important for self-supervised learning. We propose a simple and effective unsupervised data selection method which selects acoustically similar speech to a target domain. It takes the discrete speech representation available in common self-supervised learning frameworks as input, and applies a contrastive data selection method on the discrete tokens. Through extensive empirical studies we show that our proposed method reduces the amount of required pre-training data and improves the downstream ASR performance. Pre-training on a selected subset of 6% of the general data pool results in 11.8% relative improvements in LibriSpeech test-other compared to pre-training on the full set. On Multilingual LibriSpeech French, German, and Spanish test sets, selecting 6% data for pre-training reduces word error rate by more than 15% relatively compared to the full set, and achieves competitive results compared to current state-of-the-art performances.
Planets Across Space and Time (PAST). III. Morphology of the Planetary Radius Valley as a Function of Stellar Age and Metallicity in the Galactic Context Revealed by the LAMOST-Gaia-Kepler Sample

The radius valley, a dip in the radius distribution of exoplanets at ∼1.9 R ⊕, separates compact rocky super-Earths and sub-Neptunes with lower density. Various hypotheses have been put forward to explain the radius valley. Characterizing the radius valley morphology and its correlation to stellar properties will provide crucial observation constraints on its origin mechanism and deepen the understanding of planet formation and evolution. In this paper, the third part of the Planets Across Space and Time series, using the LAMOST-Gaia-Kepler catalog, we perform a systematical investigation into how the radius valley morphology varies in the Galactic context, i.e., thin/thick galactic disks, stellar age, and metallicity abundance ([Fe/H] and [α/Fe]). We find the following: (1) The valley becomes more prominent with the increase of both age and [Fe/H]. (2) The number ratio of super-Earths to sub-Neptunes monotonically increases with age but decreases with [Fe/H] and [α/Fe]. (3) The average radius of planets above the valley (2.1–6 R ⊕) decreases with age but increases with [Fe/H]. (4) In contrast, the average radius of planets below the valley (R < 1.7 R ⊕) is broadly independent of age and metallicity. Our results demonstrate that the valley morphology, as well as the whole planetary radius distribution, evolves on a long timescale of gigayears, and metallicities (not only Fe but also other metal elements, e.g., Mg, Si, Ca, Ti) play important roles in planet formation and in the long-term planetary evolution.
Nearly minimax robust estimator of the mean vector by iterative spectral dimension reduction

We study the problem of robust estimation of the mean vector of a sub-Gaussian distribution. We introduce an estimator based on spectral dimension reduction (SDR) and establish a finite sample upper bound on its error that is minimax-optimal up to a logarithmic factor. Furthermore, we prove that the breakdown point of the SDR estimator is equal to $1/2$, the highest possible value of the breakdown point. In addition, the SDR estimator is equivariant by similarity transforms and has low computational complexity. More precisely, in the case of $n$ vectors of dimension $p$ -- at most $\varepsilon n$ out of which are adversarially corrupted -- the SDR estimator has a squared error of order $\big(\frac{r_\Sigma}{n} + \varepsilon^2\log(1/\varepsilon)\big){\log p}$ and a running time of order $p^3 + n p^2$. Here, $r_\Sigma\le p$ is the effective rank of the covariance matrix of the reference distribution. Another advantage of the SDR estimator is that it does not require knowledge of the contamination rate and does not involve sample splitting. We also investigate extensions of the proposed algorithm and of the obtained results in the case of (partially) unknown covariance matrix.
Inverse Orbital Torque via Spin-Orbital Entangled States

While current-induced torque by orbital current has been experimentally found in various structures, evidence for its reciprocity has been missing so far. Here, we report experimental evidences of strong inverse orbital torque in YIG/Pt/CuO x (YIG = Y 3 Fe 5 O 12 ) mediated by spin-orbital entangled electronic states in Pt. By injecting spin current from YIG to Pt by the spin pumping via ferromagnetic resonance and by the spin Seebeck effect, we find a pronounced inverse spin Hall effect-like signal. While a part of the signal is explained as due to the inverse spin-orbital Hall effect in Pt, we also find substantial increase of the signal in YIG/Pt/CuO x structures compared to the signal in YIG/Pt. We attribute this to the inverse orbital Edelstein effect at Pt/CuO x interface mediated by the spin-orbital entangled states in Pt. Our work paves the way toward understanding of spin-orbital entangled physics in nonequilibrium and provides a way for electrical detection of the orbital current in orbitronic device applications.
RL4ReAl: Reinforcement Learning for Register Allocation

We aim to automate decades of research and experience in register allocation, leveraging machine learning. We tackle this problem by embedding a multi-agent reinforcement learning algorithm within LLVM, training it with the state of the art techniques. We formalize the constraints that precisely define the problem for a given instruction-set architecture, while ensuring that the generated code preserves semantic correctness. We also develop a gRPC based framework providing a modular and efficient compiler interface for training and inference. Our approach is architecture independent: we show experimental results targeting Intel x86 and ARM AArch64. Our results match or out-perform the heavily tuned, production-grade register allocators of LLVM.
SE(3)-Equivariant Attention Networks for Shape Reconstruction in Function Space

We propose a method for 3D shape reconstruction from unoriented point clouds. Our method consists of a novel SE(3)-equivariant coordinate-based network (TF-ONet), that parametrizes the occupancy field of the shape and respects the inherent symmetries of the problem. In contrast to previous shape reconstruction methods that align the input to a regular grid, we operate directly on the irregular point cloud. Our architecture leverages equivariant attention layers that operate on local tokens. This mechanism enables local shape modelling, a crucial property for scalability to large scenes. Given an unoriented, sparse, noisy point cloud as input, we produce equivariant features for each point. These serve as keys and values for the subsequent equivariant cross-attention blocks that parametrize the occupancy field. By querying an arbitrary point in space, we predict its occupancy score. We show that our method outperforms previous SO(3)-equivariant methods, as well as non-equivariant methods trained on SO(3)-augmented datasets. More importantly, local modelling together with SE(3)-equivariance create an ideal setting for SE(3) scene reconstruction. We show that by training only on single, aligned objects and without any pre-segmentation, we can reconstruct novel scenes containing arbitrarily many objects in random poses without any performance loss.
Aggregating distribution forecasts from deep ensembles

The importance of accurately quantifying forecast uncertainty has motivated much recent research on probabilistic forecasting. In particular, a variety of deep learning approaches has been proposed, with forecast distributions obtained as output of neural networks. These neural network-based methods are often used in the form of an ensemble based on multiple model runs from different random initializations, resulting in a collection of forecast distributions that need to be aggregated into a final probabilistic prediction. With the aim of consolidating findings from the machine learning literature on ensemble methods and the statistical literature on forecast combination, we address the question of how to aggregate distribution forecasts based on such deep ensembles. Using theoretical arguments, simulation experiments and a case study on wind gust forecasting, we systematically compare probability- and quantile-based aggregation methods for three neural network-based approaches with different forecast distribution types as output. Our results show that combining forecast distributions can substantially improve the predictive performance. We propose a general quantile aggregation framework for deep ensembles that shows superior performance compared to a linear combination of the forecast densities. Finally, we investigate the effects of the ensemble size and derive recommendations of aggregating distribution forecasts from deep ensembles in practice.
Self-supervised learning - A way to minimize time and effort for precision agriculture?

Abstract. Machine learning, satellites or local sensors are key factors for a sustainable and resource-saving optimisation of agriculture and proved its values for the management of agricultural land. Up to now, the main focus was on the enlargement of data which were evaluated by means of supervised learning methods. Nevertheless, the need for labels is also a limiting and time-consuming factor, while in contrast, ongoing technological development is already providing an ever-increasing amount of unlabeled data. Self-supervised learning (SSL) could overcome this limitation and incorporate existing unlabeled data. Therefore, a crop type data set was utilized to conduct experiments with SSL and compare it to supervised methods. A unique feature of our data set from 2016 to 2018 was a divergent climatological condition in 2018 that reduced yields and affected the spectral fingerprint of the plants. Our experiments focused on predicting 2018 using SLL without or a few labels to clarify whether new labels should be collected for an unknown year. Despite these challenging conditions, the results showed that SSL contributed to higher accuracies. We believe that the results will encourage further improvements in the field of precision farming, why the SSL framework and data will be published (Marszalek, 2021).
A diagrammatic view of differential equations in physics

Presenting systems of differential equations in the form of diagrams has become common in certain parts of physics, especially electromagnetism and computational physics. In this work, we aim to put such use of diagrams on a firm mathematical footing, while also systematizing a broadly applicable framework to reason formally about systems of equations and their solutions. Our main mathematical tools are category-theoretic diagrams, which are well known, and morphisms between diagrams, which have been less appreciated. As an application of the diagrammatic framework, we show how complex, multiphysical systems can be modularly constructed from basic physical principles. A wealth of examples, drawn from electromagnetism, transport phenomena, fluid mechanics, and other fields, is included.
Stratospheric Modulation of the MJO through Cirrus Cloud Feedbacks

Recent observations have indicated significant modulation of the Madden Julian Oscillation (MJO) by the phase of the stratospheric Quasi-Biennial Oscillation (QBO) during boreal winter. Composites of the MJO show that upper tropospheric ice cloud fraction and water vapor anomalies are generally collocated, and that an eastward tilt with height in cloud fraction exists. Through radiative transfer calculations, it is shown that ice clouds have a stronger tropospheric radiative forcing than do water vapor anomalies, highlighting the importance of incorporating upper tropospheric/lower stratospheric processes into simple models of the MJO. The coupled troposphere-stratosphere linear model previously developed by the authors is extended by including a mean wind in the stratosphere and a prognostic equation for cirrus clouds, which are forced dynamically and allowed to modulate tropospheric radiative cooling, similar to the effect of tropospheric water vapor in previous formulations. Under these modifications, the model still produces a slow, eastward propagating mode that resembles the MJO. The sign of zonal mean wind in the stratosphere is shown to control both the upward wave propagation and tropospheric vertical structure of the mode. Under varying stratospheric wind and interactive cirrus cloud radiation, the MJO-like mode has weaker growth rates under stratospheric westerlies than easterlies, consistent with the observed MJO-QBO relationship. These results are directly attributable to an enhanced barotropic mode under QBO easterlies. It is also shown that differential zonal advection of cirrus clouds leads to weaker growth rates under stratospheric westerlies than easterlies. Implications and limitations of the linear theory are discussed.
A Survey on Graph Representation Learning Methods

Graphs representation learning has been a very active research area in recent years. The goal of graph representation learning is to generate graph representation vectors that capture the structure and features of large graphs accurately. This is especially important because the quality of the graph representation vectors will affect the performance of these vectors in downstream tasks such as node classification, link prediction and anomaly detection. Many techniques have been proposed for generating effective graph representation vectors, which generally fall into two categories: traditional graph embedding methods and graph neural nets (GNN) based methods. These methods can be applied to both static and dynamic graphs. A static graph is a single fixed graph, while a dynamic graph evolves over time and its nodes and edges can be added or deleted from the graph. In this survey, we review the graph embedding methods in both traditional and GNN-based categories for both static and dynamic graphs and include the recent papers published until the time of submission. In addition, we summarize a number of limitations of GNNs and the proposed solutions to these limitations. Such a summary has not been provided in previous surveys. Finally, we explore some open and ongoing research directions for future work.
Slow Star Formation in the Milky Way: Theory Meets Observations

The observed star formation rate of the Milky Way can be explained by applying a metallicity-dependent factor to convert CO luminosity to molecular gas mass and a star formation efficiency per freefall time that depends on the virial parameter of a molecular cloud. These procedures also predict the trend of star formation rate surface density with Galactocentric radius. The efficiency per freefall time variation with virial parameter plays a major role in bringing theory into agreement with observations for the total star formation rate, while the metallicity dependence of the CO luminosity-to-mass conversion is most notable in the variation with Galactocentric radius. Application of these changes resolves a factor of over 100 discrepancy between observed and theoretical star formation rates that has been known for nearly 50 yr.