Miracle-dz/UniFAR-FTUs huggingface dataset:
Antiferromagnetic Parametric Resonance Driven by Voltage-Controlled Magnetic Anisotropy

Voltage controlled magnetic anisotropy (VCMA) is a low-energy alternative to manipulate the ferromagnetic state, which has been recently considered also in antiferromagnets (AFMs). Here, we theoretically demonstrate that VCMA can be used to excite linear and parametric resonant modes in easy-axis AFMs with perpendicular anisotropy, thus opening the way for an efficient electrical control of the Néel vector, and for detection of high-frequency dynamics. Our work leads to two key results: (i) VCMA parametric pumping experiences the so-called “exchange enhancement” of the coupling efficiency and, thus, is 1-2 orders of magnitude more efficient than microwave magnetic fields or spin-orbit-torques, and (ii) it also allows for zero-field parametric resonance, which cannot be achieved by other parametric pumping mechanisms in AFMs with out-of-plane easy axis. Therefore, we demonstrate that the VCMA parametric pumping is the most promising method for coherent excitation and manipulation of AFM order in perpendicular easy-axis AFMs.
Pipeflow: An Efficient Task-Parallel Pipeline Programming Framework using Modern C++

Pipeline is a fundamental parallel programming pattern. Mainstream pipeline programming frameworks count on data abstractions to perform pipeline scheduling. This design is convenient for data-centric pipeline applications but inefficient for algorithms that only exploit task parallelism in pipeline. As a result, we introduce a new task-parallel pipeline programming framework called Pipeflow. Pipeflow does not design yet another data abstraction but focuses on the pipeline scheduling itself, enabling more efficient implementation of task-parallel pipeline algorithms than existing frameworks. We have evaluated Pipeflow on both micro-benchmarks and real-world applications. As an example, Pipeflow outperforms oneTBB 24% and 10% faster in a VLSI placement and a timing analysis workloads that adopt pipeline parallelism to speed up runtimes, respectively.
A semi-static replication approach to efficient hedging and pricing of callable IR derivatives

We present a semi-static hedging algorithm for callable interest rate derivatives under an affine, multi-factor term-structure model. With a traditional dynamic hedge, the replication portfolio needs to be updated continuously through time as the market moves. In contrast, we propose a semi-static hedge that needs rebalancing on just a finite number of instances. We show, taking as an example Bermudan swaptions, that callable interest rate derivatives can be replicated with an options portfolio written on a basket of discount bonds. The static portfolio composition is obtained by regressing the target option's value using an interpretable, artificial neural network. Leveraging on the approximation power of neural networks, we prove that the hedging error can be arbitrarily small for a sufficiently large replication portfolio. A direct, a lower bound, and an upper bound estimator for the risk-neutral Bermudan swaption price is inferred from the hedging algorithm. Additionally, closed-form error margins to the price statistics are determined. We practically demonstrate the hedging and pricing performance through several numerical experiments.
The Interstellar Medium in the Environment of the Supernova-less Long-duration GRB 111005A

Long (>2 s) gamma-ray bursts (GRBs) are associated with explosions of massive stars, although in three instances, supernovae (SNe) have not been detected, despite deep observations. With new H i line and archival optical integral-field spectroscopy data, we characterize the interstellar medium (ISM) of the host galaxy of one of these events, GRB 111005A, in order to shed light on the unclear nature of these peculiar objects. We found that the atomic gas, radio continuum, and rotational patterns are in general very smooth throughout the galaxy, which does not indicate a recent gas inflow or outflow. There is also no gas concentration around the GRB position. The ISM in this galaxy differs from that in hosts of other GRBs and SNe, which may suggest that the progenitor of GRB 111005A was not an explosion of a very massive star (e.g., a compact object merger). However, there are subtle irregularities of the GRB 111005A host (most at a 2σ level), which may point to a weak gas inflow or interaction. Because in the SE part of the host there is 15% more atomic gas and half the molecular gas than in the NW part, the molecular gas fraction is low. In the SE part there is also a region with a very high Hα equivalent width. There is more continuum 1.4 GHz emission to the SE and an S-shaped warp in the UV. Finally, there is also a low-metallicity region 3. ″5 (1 kpc) from the GRB position. Two galaxies within 300 kpc or a past merger can be responsible for these irregularities.
Tonet: Tone-Octave Network for Singing Melody Extraction from Polyphonic Music

Singing melody extraction is an important problem in the field of music information retrieval. Existing methods typically rely on frequency-domain representations to estimate the sung frequencies. However, this design does not lead to human-level performance in the perception of melody information for both tone (pitch-class) and octave. In this paper, we propose TONet1, a plug-and-play model that improves both tone and octave perceptions by leveraging a novel input representation and a novel network architecture. First, we present an improved input representation, the Tone-CFP, that explicitly groups harmonics via a rearrangement of frequency-bins. Second, we introduce an encoder-decoder architecture that is designed to obtain a salience feature map, a tone feature map, and an octave feature map. Third, we propose a tone-octave fusion mechanism to improve the final salience feature map. Experiments are done to verify the capability of TONet with various baseline backbone models. Our results show that tone-octave fusion with Tone-CFP can significantly improve the singing voice extraction performance across various datasets – with substantial gains in octave and tone accuracy.
Make Some Noise: Reliable and Efficient Single-Step Adversarial Training

Recently, Wong et al. showed that adversarial training with single-step FGSM leads to a characteristic failure mode named Catastrophic Overfitting (CO), in which a model becomes suddenly vulnerable to multi-step attacks. Experimentally they showed that simply adding a random perturbation prior to FGSM (RS-FGSM) could prevent CO. However, Andriushchenko and Flammarion observed that RS-FGSM still leads to CO for larger perturbations, and proposed a computationally expensive regularizer (GradAlign) to avoid it. In this work, we methodically revisit the role of noise and clipping in single-step adversarial training. Contrary to previous intuitions, we find that using a stronger noise around the clean sample combined with \textit{not clipping} is highly effective in avoiding CO for large perturbation radii. We then propose Noise-FGSM (N-FGSM) that, while providing the benefits of single-step adversarial training, does not suffer from CO. Empirical analyses on a large suite of experiments show that N-FGSM is able to match or surpass the performance of previous state-of-the-art GradAlign, while achieving 3x speed-up. Code can be found in https://github.com/pdejorge/N-FGSM
Interpretability for Multimodal Emotion Recognition using Concept Activation Vectors

Multimodal Emotion Recognition refers to the classification of input video sequences into emotion labels based on multiple input modalities (usually video, audio and text). In recent years, Deep Neural networks have shown remarkable performance in recognizing human emotions, and are on par with human-level performance on this task. Despite of recent advancements in this field, emotion recognition systems are yet to be accepted for real world setups due to the obscure nature of their reasoning and decision-making process. Most of the research in this field deals with novel architectures to improve the performance for this task, with a few attempts at providing explanations for these models' decisions. In this paper, we address the issue of interpretability for neural networks in the context of emotion recognition using Concept Activation Vectors (CAVs). To analyse the model's latent space, we define human-understandable concepts specific to Emotion AI and map them to the widely-used IEMOCAP multimodal database. We then evaluate the influence of our proposed concepts at multiple layers of the Bi-directional Contextual LSTM (BC-LSTM) network to show that the reasoning process of neural networks for emotion recognition can be represented using human-understandable concepts. Finally, we perform hypothesis testing on our proposed concepts to show that they are significant for interpretability of this task.
Fairness of Machine Learning Algorithms in Demography

The paper is devoted to the study of the model fairness and process fairness of the Russian demographic dataset by making predictions of divorce of the 1st marriage, religiosity, 1st employment and completion of education. Our goal was to make classifiers more equitable by reducing their reliance on sensitive features while increasing or at least maintaining their accuracy. We took inspiration from"dropout"techniques in neural-based approaches and suggested a model that uses"feature drop-out"to address process fairness. To evaluate a classifier's fairness and decide the sensitive features to eliminate, we used"LIME Explanations". This results in a pool of classifiers due to feature dropout whose ensemble has been shown to be less reliant on sensitive features and to have improved or no effect on accuracy. Our empirical study was performed on four families of classifiers (Logistic Regression, Random Forest, Bagging, and Adaboost) and carried out on real-life dataset (Russian demographic data derived from Generations and Gender Survey), and it showed that all of the models became less dependent on sensitive features (such as gender, breakup of the 1st partnership, 1st partnership, etc.) and showed improvements or no impact on accuracy
2T-POT Hawkes model for dynamic left- and right-tail quantile forecasts of financial returns: out-of-sample validation of self-exciting extremes versus conditional volatility

Matthew F. Tomlinson, 2, ∗ David Greenwood, and Marcin Mucha-Kruczyński 4 Department of Physics, University of Bath, Bath BA2 7AY, United Kingdom Centre for Networks and Collective Behaviour, University of Bath, Bath BA2 7AY, United Kingdom CheckRisk LLP, 4 Miles’s Buildings, George Street, Bath BA1 2QS, United Kingdom Centre for Nanoscience and Nanotechnology, University of Bath, Bath BA2 7AY, United Kingdom (Dated: 2nd February 2022)
Growth Optimization and Device Integration of Narrow-Bandgap Graphene Nanoribbons.

The electronic, optical, and magnetic properties of graphene nanoribbons (GNRs) can be engineered by controlling their edge structure and width with atomic precision through bottom-up fabrication based on molecular precursors. This approach offers a unique platform for all-carbon electronic devices but requires careful optimization of the growth conditions to match structural requirements for successful device integration, with GNR length being the most critical parameter. In this work, the growth, characterization, and device integration of 5-atom wide armchair GNRs (5-AGNRs) are studied, which are expected to have an optimal bandgap as active material in switching devices. 5-AGNRs are obtained via on-surface synthesis under ultrahigh vacuum conditions from Br- and I-substituted precursors. It is shown that the use of I-substituted precursors and the optimization of the initial precursor coverage quintupled the average 5-AGNR length. This significant length increase allowed the integration of 5-AGNRs into devices and the realization of the first field-effect transistor based on narrow bandgap AGNRs that shows switching behavior at room temperature. The study highlights that the optimized growth protocols can successfully bridge between the sub-nanometer scale, where atomic precision is needed to control the electronic properties, and the scale of tens of nanometers relevant for successful device integration of GNRs.
Maintaining fairness across distribution shift: do we have viable solutions for real-world applications?

Fairness and robustness are often considered as orthogonal dimensions when evaluating machine learning models. However, recent work has revealed interactions between fairness and robustness, showing that fairness properties are not necessarily maintained under distribution shift. In healthcare settings, this can result in e.g. a model that performs fairly according to a selected metric in “hospital A” showing unfairness when deployed in “hospital B”. While a nascent field has emerged to develop provable fair and robust models, it typically relies on strong assumptions about the shift, limiting its impact for real-world applications. In this work, we explore the settings in which recently proposed mitigation strategies are applicable by referring to a causal framing. Using examples of predictive models in dermatology and electronic health records, we show that real-world applications are complex and often invalidate the assumptions of such methods. Our work hence highlights technical, practical, and engineering gaps that prevent the development of robustly fair machine learning models for real-world applications. Finally, we discuss potential remedies at each step of the machine learning pipeline.
Hierarchical Shrinkage: improving the accuracy and interpretability of tree-based methods

Tree-based models such as decision trees and random forests (RF) are a cornerstone of modern machine-learning practice. To mitigate overfitting, trees are typically regularized by a variety of techniques that modify their structure (e.g. pruning). We introduce Hierarchical Shrinkage (HS), a post-hoc algorithm that does not modify the tree structure, and instead regularizes the tree by shrinking the prediction over each node towards the sample means of its ancestors. The amount of shrinkage is controlled by a single regularization parameter and the number of data points in each ancestor. Since HS is a post-hoc method, it is extremely fast, compatible with any tree growing algorithm, and can be used synergistically with other regularization techniques. Extensive experiments over a wide variety of real-world datasets show that HS substantially increases the predictive performance of decision trees, even when used in conjunction with other regularization techniques. Moreover, we find that applying HS to each tree in an RF often improves accuracy, as well as its interpretability by simplifying and stabilizing its decision boundaries and SHAP values. We further explain the success of HS in improving prediction performance by showing its equivalence to ridge regression on a (supervised) basis constructed of decision stumps associated with the internal nodes of a tree. All code and models are released in a full-fledged package available on Github (github.com/csinva/imodels)
Robust Training of Neural Networks using Scale Invariant Architectures

In contrast to SGD, adaptive gradient methods like Adam allow robust training of modern deep networks, especially large language models. However, the use of adaptivity not only comes at the cost of extra memory but also raises the fundamental question: can non-adaptive methods like SGD enjoy similar benefits? In this paper, we provide an affirmative answer to this question by proposing to achieve both robust and memory-efficient training via the following general recipe: (1) modify the architecture and make it scale invariant, i.e. the scale of parameter doesn't affect the output of the network, (2) train with SGD and weight decay, and optionally (3) clip the global gradient norm proportional to weight norm multiplied by $\sqrt{\tfrac{2\lambda}{\eta}}$, where $\eta$ is learning rate and $\lambda$ is weight decay. We show that this general approach is robust to rescaling of parameter and loss by proving that its convergence only depends logarithmically on the scale of initialization and loss, whereas the standard SGD might not even converge for many initializations. Following our recipe, we design a scale invariant version of BERT, called SIBERT, which when trained simply by vanilla SGD achieves performance comparable to BERT trained by adaptive methods like Adam on downstream tasks.
Relative Position Prediction as Pre-training for Text Encoders

Meaning is defined by the company it keeps. However, company is two-fold: It's based on the identity of tokens and also on their position (topology). We argue that a position-centric perspective is more general and useful. The classic MLM and CLM objectives in NLP are easily phrased as position predictions over the whole vocabulary. Adapting the relative position encoding paradigm in NLP to create relative labels for self-supervised learning, we seek to show superior pre-training judged by performance on downstream tasks.
Auto-Transfer: Learning to Route Transferrable Representations

Knowledge transfer between heterogeneous source and target networks and tasks has received a lot of attention in recent times as large amounts of quality labeled data can be difficult to obtain in many applications. Existing approaches typically constrain the target deep neural network (DNN) feature representations to be close to the source DNNs feature representations, which can be limiting. We, in this paper, propose a novel adversarial multi-armed bandit approach that automatically learns to route source representations to appropriate target representations following which they are combined in meaningful ways to produce accurate target models. We see upwards of 5\% accuracy improvements compared with the state-of-the-art knowledge transfer methods on four benchmark (target) image datasets CUB200, Stanford Dogs, MIT67, and Stanford40 where the source dataset is ImageNet. We qualitatively analyze the goodness of our transfer scheme by showing individual examples of the important features focused on by our target network at different layers compared with the (closest) competitors. We also observe that our improvement over other methods is higher for smaller target datasets making it an effective tool for small data applications that may benefit from transfer learning.
MedNeRF: Medical Neural Radiance Fields for Reconstructing 3D-aware CT-Projections from a Single X-ray

Computed tomography (CT) is an effective med-ical imaging modality, widely used in the field of clinical medicine for the diagnosis of various pathologies. Advances in Multidetector CT imaging technology have enabled additional functionalities, including generation of thin slice multi planar cross-sectional body imaging and 3D reconstructions. However, this involves patients being exposed to a considerable dose of ionising radiation. Excessive ionising radiation can lead to deterministic and harmful effects on the body. This paper proposes a Deep Learning model that learns to reconstruct CT projections from a few or even a single-view X-ray. This is based on a novel architecture that builds from neural radiance fields, which learns a continuous representation of CT scans by disentangling the shape and volumetric depth of surface and internal anatomical structures from 2D images. Our model is trained on chest and knee datasets, and we demonstrate qual-itative and quantitative high-fidelity renderings and compare our approach to other recent radiance field-based methods. Our code and link to our datasets are available at https://qithub.com/abrilcf/mednerf Clinical relevance- Our model is able to infer the anatomical 3D structure from a few or a single-view X-ray showing future potential for reduced ionising radiation exposure during the imaging process.
The Quasar CTD 135 Is Not a Compact Symmetric Object

The radio-loud quasar CTD 135 (2234+282, J2236+2828) has been proposed as a candidate compact symmetric object (CSO), based on its symmetric radio structure revealed by multi-frequency very long baseline interferometry (VLBI) imaging observations on milliarcsec angular scales. CSOs are known as young jetted active galactic nuclei (AGN) whose relativistic plasma jets are misaligned with respect to the line of sight. The peculiarity of CTD 135 as a CSO candidate was its detection in γ-rays, while the vast majority of known γ-ray emitting AGN are blazars with jets pointing close to our viewing direction. Since only a handful of CSOs are known as γ-ray sources, the unambiguous identification of a single candidate is important for studying this rare class of objects. By collecting and interpreting observational data from the recent literature, we revisit the classification of CTD 135. We present evidence that the object, based on its flat-spectrum radio core with high brightness temperature, variability at multiple wavebands, and infrared colours should be classified as a blazar rather than a CSO.
Disaster Tweets Classification using BERT-Based Language Model

Social networking services have became an important communication channel in time of emergency. The aim of this study is to create a machine learning language model that is able to investigate if a person or area was in danger or not. The ubiquitousness of smartphones enables people to announce an emergency they are observing in real-time. Because of this, more agencies are interested in programmatically monitoring Twitter (i.e. disaster relief organizations and news agencies). Design a language model that is able to understand and acknowledge when a disaster is happening based on the social network posts will become more and more necessary over time.
Decentralized Autofocusing System with Hierarchical Agents

State-of-the-art object detection models are frequently trained offline using available datasets, such as ImageNet: large and overly diverse data that are unbalanced and hard to cluster semantically. This kind of training drops the object detection performance should the change in illumination, in the environmental conditions (e.g., rain), or in the lens positioning (out-of-focus blur) occur. We propose a decentralized hierarchical multi-agent deep reinforcement learning approach for intelligently controlling the camera and the lens focusing settings, leading to a significant improvement beyond the capacity of the popular detection models (YOLO, Faster R-CNN, and Retina are considered). The algorithm relies on the latent representation of the camera's stream and, thus, it is the first method to allow a completely no-reference tuning of the camera, where the system trains itself to auto-focus itself.