Miracle-dz/UniFAR-FTUs huggingface dataset:
Enigma: Privacy-Preserving Execution of QAOA on Untrusted Quantum Computers

Quantum computers can solve problems that are beyond the capabilities of conventional computers. As quantum computers are expensive and hard to maintain, the typical model for performing quantum computation is to send the circuit to a quantum cloud provider. This leads to privacy concerns for commercial entities as an untrusted server can learn protected information from the provided circuit. Current proposals for Secure Quantum Computing (SQC) either rely on emerging technologies (such as quantum networks) or incur prohibitive overheads (for Quantum Homomorphic Encryption). The goal of our paper is to enable low-cost privacy-preserving quantum computation that can be used with current systems. We propose Enigma, a suite of privacy-preserving schemes specifically designed for the Quantum Approximate Optimization Algorithm (QAOA). Unlike previous SQC techniques that obfuscate quantum circuits, Enigma transforms the input problem of QAOA, such that the resulting circuit and the outcomes are unintelligible to the server. We introduce three variants of Enigma. Enigma-I protects the coefficients of QAOA using random phase flipping and fudging of values. Enigma-II protects the nodes of the graph by introducing decoy qubits, which are indistinguishable from primary ones. Enigma-III protects the edge information of the graph by modifying the graph such that each node has an identical number of connections. For all variants of Enigma, we demonstrate that we can still obtain the solution for the original problem. We evaluate Enigma using IBM quantum devices and show that the privacy improvements of Enigma come at only a small reduction in fidelity (1%-13%).
K-polystability of the first secant varieties of rational normal curves

The first secant variety $\Sigma$ of a rational normal curve of degree $d \geq 3$ is known to be a $\mathbf{Q}$-Fano threefold. In this paper, we prove that $\Sigma$ is K-polystable, and hence, $\Sigma$ admits a weak K\"{a}hler-Einstein metric. We also show that there exists a $(-K_{\Sigma})$-polar cylinder in $\Sigma$.
SkyCharge: Deploying Unmanned Aerial Vehicles for Dynamic Load Optimization in Solar Small Cell 5G Networks

The power requirements posed by the fifth-generation and beyond cellular networks are an important constraint in network deployment and require energy-efficient solutions. In this work, we propose a novel user load transfer approach using airborne base stations (BS) mounted on drones for reliable and secure power redistribution across the micro-grid network comprising green small cell BSs. Depending on the user density and the availability of an aerial BS, the energy requirement of a cell with an energy deficit is accommodated by migrating the aerial BS from a high-energy to a low-energy cell. The proposed hybrid drone-based framework integrates long short-term memory with unique cost functions using an evolutionary neural network for drones and BSs and efficiently manages energy and load redistribution. The proposed algorithm reduces power outages at BSs and maintains consistent throughput stability, thereby demonstrating its capability to boost the reliability and robustness of wireless communication systems.
Physics-Informed Priors with Application to Boundary Layer Velocity

One of the most popular recent areas of machine learning predicates the use of neural networks augmented by information about the underlying process in the form of Partial Differential Equations (PDEs). These physics-informed neural networks are obtained by penalizing the inference with a PDE, and have been cast as a minimization problem currently lacking a formal approach to quantify the uncertainty. In this work, we propose a novel model-based framework which regards the PDE as a prior information of a deep Bayesian neural network. The prior is calibrated without data to resemble the PDE solution in the prior mean, while our degree in confidence on the PDE with respect to the data is expressed in terms of the prior variance. The information embedded in the PDE is then propagated to the posterior yielding physics-informed forecasts with uncertainty quantification. We apply our approach to a simulated viscous fluid and to experimentally-obtained turbulent boundary layer velocity in a wind tunnel using an appropriately simplified Navier-Stokes equation. Our approach requires very few observations to produce physically-consistent forecasts as opposed to non-physical forecasts stemming from non-informed priors, thereby allowing forecasting complex systems where some amount of data as well as some contextual knowledge is available.
REDS: Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints

Deep models deployed on edge devices frequently encounter resource variability, which arises from fluctuating energy levels, timing constraints, or prioritization of other critical tasks within the system. State-of-the-art machine learning pipelines generate resource-agnostic models, not capable to adapt at runtime. In this work we introduce Resource-Efficient Deep Subnetworks (REDS) to tackle model adaptation to variable resources. In contrast to the state-of-the-art, REDS use structured sparsity constructively by exploiting permutation invariance of neurons, which allows for hardware-specific optimizations. Specifically, REDS achieve computational efficiency by (1) skipping sequential computational blocks identified by a novel iterative knapsack optimizer, and (2) leveraging simple math to re-arrange the order of operations in REDS computational graph to take advantage of the data cache. REDS support conventional deep networks frequently deployed on the edge and provide computational benefits even for small and simple networks. We evaluate REDS on seven benchmark architectures trained on the Visual Wake Words, Google Speech Commands, Fashion-MNIST and CIFAR10 datasets, and test on four off-the-shelf mobile and embedded hardware platforms. We provide a theoretical result and empirical evidence for REDS outstanding performance in terms of submodels' test set accuracy, and demonstrate an adaptation time in response to dynamic resource constraints of under 40$\mu$s, utilizing a 2-layer fully-connected network on Arduino Nano 33 BLE.
Evolution of Convolutional Neural Network (CNN): Compute vs Memory bandwidth for Edge AI

Convolutional Neural Networks (CNNs) have greatly influenced the field of Embedded Vision and Edge Artificial Intelligence (AI), enabling powerful machine learning capabilities on resource-constrained devices. This article explores the relationship between CNN compute requirements and memory bandwidth in the context of Edge AI. We delve into the historical progression of CNN architectures, from the early pioneering models to the current state-of-the-art designs, highlighting the advancements in compute-intensive operations. We examine the impact of increasing model complexity on both computational requirements and memory access patterns. The paper presents a comparison analysis of the evolving trade-off between compute demands and memory bandwidth requirements in CNNs. This analysis provides insights into designing efficient architectures and potential hardware accelerators in enhancing CNN performance on edge devices.
Educational Assortative Mating in Hong Kong: 1981–2011

Abstract This article documents trends in educational assortative mating using samples of the 1981 to 2011 Hong Kong population censuses/by-censuses, with a particular focus on specific education groups and the Hong Kong-mainland China cross-border marriages. Results show an overall declining trend in educational assortative mating, which is driven mostly by the great increase of intermarriage between those with associate qualifications and those with lower secondary or less levels of education. Growing number of cross-border marriages is also accompanied by the substantive decline in educational homogamy for women from mainland China in recent years. It implies that immigrants from mainland China are more likely to exchange education for the Hong Kong permanent residency by marrying spouses with less education in Hong Kong in later periods. These findings suggest that a general declining trend in educational assortative mating does not necessarily indicate an increased openness of a society.
Tool Wear Segmentation in Blanking Processes with Fully Convolutional Networks based Digital Image Processing

The extend of tool wear significantly affects blanking processes and has a decisive impact on product quality and productivity. For this reason, numerous scientists have addressed their research to wear monitoring systems in order to identify or even predict critical wear at an early stage. Existing approaches are mainly based on indirect monitoring using time series, which are used to detect critical wear states via thresholds or machine learning models. Nevertheless, differentiation between types of wear phenomena affecting the tool during blanking as well as quantification of worn surfaces is still limited in practice. While time series data provides partial insights into wear occurrence and evolution, direct monitoring techniques utilizing image data offer a more comprehensive perspective and increased robustness when dealing with varying process parameters. However, acquiring and processing this data in real-time is challenging. In particular, high dynamics combined with increasing strokes rates as well as the high dimensionality of image data have so far prevented the development of direct image-based monitoring systems. For this reason, this paper demonstrates how high-resolution images of tools at 600 spm can be captured and subsequently processed using semantic segmentation deep learning algorithms, more precisely Fully Convolutional Networks (FCN). 125,000 images of the tool are taken from successive strokes, and microscope images are captured to investigate the worn surfaces. Based on findings from the microscope images, selected images are labeled pixel by pixel according to their wear condition and used to train a FCN (U-Net).
Personalization of Affective Models to Enable Neuropsychiatric Digital Precision Health Interventions: A Feasibility Study

Mobile digital therapeutics for autism spectrum disorder (ASD) often target emotion recognition and evocation, which is a challenge for children with ASD. While such mobile applications often use computer vision machine learning (ML) models to guide the adaptive nature of the digital intervention, a single model is usually deployed and applied to all children. Here, we explore the potential of model personalization, or training a single emotion recognition model per person, to improve the performance of these underlying emotion recognition models used to guide digital health therapies for children with ASD. We conducted experiments on the Emognition dataset, a video dataset of human subjects evoking a series of emotions. For a subset of 10 individuals in the dataset with a sufficient representation of at least two ground truth emotion labels, we trained a personalized version of three classical ML models on a set of 51 features extracted from each video frame. We measured the importance of each facial feature for all personalized models and observed differing ranked lists of top features across subjects, motivating the need for model personalization. We then compared the personalized models against a generalized model trained using data from all 10 participants. The mean F1-scores achieved by the personalized models were 90.48%, 92.66%, and 86.40%, respectively. By contrast, the mean F1-scores reached by non-personalized models trained on different human subjects and evaluated using the same test set were 88.55%, 91.78%, and 80.42%, respectively. The personalized models outperformed the generalized models for 7 out of 10 participants. PCA analyses on the remaining 3 participants revealed relatively facial configuration differences between emotion labels within each subject, suggesting that personalized ML will fail when the variation among data points within a subjects data is too low.
Accelerating Inference in Molecular Diffusion Models with Latent Representations of Protein Structure

Diffusion generative models have emerged as a powerful framework for addressing problems in structural biology and structure-based drug design. These models operate directly on 3D molecular structures. Due to the unfavorable scaling of graph neural networks (GNNs) with graph size as well as the relatively slow inference speeds inherent to diffusion models, many existing molecular diffusion models rely on coarse-grained representations of protein structure to make training and inference feasible. However, such coarse-grained representations discard essential information for modeling molecular interactions and impair the quality of generated structures. In this work, we present a novel GNN-based architecture for learning latent representations of molecular structure. When trained end-to-end with a diffusion model for de novo ligand design, our model achieves comparable performance to one with an all-atom protein representation while exhibiting a 3-fold reduction in inference time.
An O(log2 N) SMC2 Algorithm on Distributed Memory with an Approx. Optimal L-Kernel

Calibrating statistical models using Bayesian inference often requires both accurate and timely estimates of parameters of interest. Particle Markov Chain Monte Carlo (p-MCMC) and Sequential Monte Carlo Squared (SMC2) are two methods that use an unbiased estimate of the log-likelihood obtained from a particle filter (PF) to evaluate the target distribution. P-MCMC constructs a single Markov chain which is sequential by nature so cannot be readily parallelized using Distributed Memory (DM) architectures. This is in contrast to SMC2 which includes processes, such as importance sampling, that are described as embarrassingly parallel. However, difficulties arise when attempting to parallelize resampling. None-the-less, the choice of backward kernel, recycling scheme and compatibility with DM architectures makes SMC2 an attractive option when compared with p-MCMC. In this paper, we present an SMC2 framework that includes the following features: an optimal (in terms of time complexity) $\mathcal{O}(\log_2 N)$ parallelization for DM architectures, an approximately optimal (in terms of accuracy) backward kernel, and an efficient recycling scheme. On a cluster of 128 DM processors, the results on a biomedical application show that SMC2 achieves up to a 70× speed-up vs its sequential implementation. It is also more accurate and roughly 54× faster than p-MCMC. A GitHub link is given which provides access to the code.
Hierarchical Learning for Quantum ML: Novel Training Technique for Large-Scale Variational Quantum Circuits

We present hierarchical learning, a novel variational architecture for efficient training of large-scale variational quantum circuits. We test and benchmark our technique for distribution loading with quantum circuit born machines (QCBMs). With QCBMs, probability distributions are loaded into the squared amplitudes of computational basis vectors represented by bitstrings. Our key insight is to take advantage of the fact that the most significant (qu)bits have a greater effect on the final distribution and can be learned first. One can think of it as a generalization of layerwise learning, where some parameters of the variational circuit are learned first to prevent the phenomena of barren plateaus. We briefly review adjoint methods for computing the gradient, in particular for loss functions that are not expectation values of observables. We first compare the role of connectivity in the variational ansatz for the task of loading a Gaussian distribution on nine qubits, finding that 2D connectivity greatly outperforms qubits arranged on a line. Based on our observations, we then implement this strategy on large-scale numerical experiments with GPUs, training a QCBM to reproduce a 3-dimensional multivariate Gaussian distribution on 27 qubits up to $\sim4\%$ total variation distance. Though barren plateau arguments do not strictly apply here due to the objective function not being tied to an observable, this is to our knowledge the first practical demonstration of variational learning on large numbers of qubits. We also demonstrate hierarchical learning as a resource-efficient way to load distributions for existing quantum hardware (IBM's 7 and 27 qubit devices) in tandem with Fire Opal optimizations.
Inducing a Tunable Skyrmion-Antiskyrmion System through Ion Beam Modification of FeGe Films

Skyrmions and antiskyrmions are nanoscale swirling textures of magnetic moments formed by chiral interactions between atomic spins in magnetic non-centrosymmetric materials and multilayer films with broken inversion symmetry. These quasiparticles are of interest for use as information carriers in next-generation, low-energy spintronic applications. To develop skyrmion-based memory and logic, we must understand skyrmion-defect interactions with two main goals -- determining how skyrmions navigate intrinsic material defects and determining how to engineer disorder for optimal device operation. Here, we introduce a tunable means of creating a skyrmion-antiskyrmion system by engineering the disorder landscape in FeGe using ion irradiation. Specifically, we irradiate epitaxial B20-phase FeGe films with 2.8 MeV Au$^{4+}$ ions at varying fluences, inducing amorphous regions within the crystalline matrix. Using low-temperature electrical transport and magnetization measurements, we observe a strong topological Hall effect with a double-peak feature that serves as a signature of skyrmions and antiskyrmions. These results are a step towards the development of information storage devices that use skyrmions and anitskyrmions as storage bits and our system may serve as a testbed for theoretically predicted phenomena in skyrmion-antiskyrmion crystals.
Multi-Objective Optimization via Wasserstein-Fisher-Rao Gradient Flow

Multi-objective optimization (MOO) aims to optimize multiple, possibly conflicting objectives with widespread applications. We introduce a novel interacting particle method for MOO inspired by molecular dynamics simulations. Our approach combines overdamped Langevin and birth-death dynamics, incorporating a"dominance potential"to steer particles toward global Pareto optimality. In contrast to previous methods, our method is able to relocate dominated particles, making it particularly adept at managing Pareto fronts of complicated geometries. Our method is also theoretically grounded as a Wasserstein-Fisher-Rao gradient flow with convergence guarantees. Extensive experiments confirm that our approach outperforms state-of-the-art methods on challenging synthetic and real-world datasets.
Detecting out-of-distribution text using topological features of transformer-based language models

We attempt to detect out-of-distribution (OOD) text samples though applying Topological Data Analysis (TDA) to attention maps in transformer-based language models. We evaluate our proposed TDA-based approach for out-of-distribution detection on BERT, a transformer-based language model, and compare the to a more traditional OOD approach based on BERT CLS embeddings. We found that our TDA approach outperforms the CLS embedding approach at distinguishing in-distribution data (politics and entertainment news articles from HuffPost) from far out-of-domain samples (IMDB reviews), but its effectiveness deteriorates with near out-of-domain (CNN/Dailymail) or same-domain (business news articles from HuffPost) datasets.
Voltage control of electromagnetic properties in antiferromagnetic materials

Dynamic modulation of electromagnetic responses is theoretically examined in dielectric antiferromagnets. While both magneto-electric and magneto-elastic coupling can achieve robust electrical control of magnetic anisotropy, the latter is considered in a bilayer structure with a piezoelectric material. Numerical calculations based on the frequency-dependent permeability tensor clearly illustrate that the anisotropy proﬁle in the typical dielectric antiferromagnets such as NiO and Cr2O3 can be modiﬁed suﬃciently to induce a shift in the resonance frequency by as much as tens of percent in the sub-mm wavelength range (thus, an electrically tunable bandwidth over 10's of GHz). The polarization of the electromagnetic response is also aﬀected due to the anisotropic nature of the eﬀect, oﬀering a possibility to encode the signal. The intrinsic delay in switching may be minimized to the ns level by using a suﬃciently thin antiferromagnet. Application to speciﬁc devices such as a bandpass ﬁlter further illustrates the validity of the concept.
A catalog of observed geo-effective CME/ICME characteristics

One of the goals of Space Weather studies is to achieve a better understanding of impulsive phenomena, such as Coronal Mass Ejections (CMEs), in order to improve our ability to forecast them and mitigate the risk to our technologically driven society. The essential part of achieving this goal is to assess the performance of forecasting models. To this end, the quality and availability of suitable data are of paramount importance. In this work, we have merged already publicly available data of CMEs from both in-situ and remote instrumentation in order to build a database of CME properties. To evaluate the accuracy of such a database and confirm the relationship between in-situ and remote observations, we have employed the drag-based model (DBM) due to its simplicity and inexpensive cost of computational resources. In this study, we have also explored the parameter space for the drag parameter and solar wind speed using a Monte Carlo approach to evaluate how well the DBM determines the propagation of CMEs for the events in the dataset. The geoeffective CMEs selected as a result of this work are compliant with the hypothesis of DBM (isolated CME, constant solar wind speed) and also yield further insight into CME features like arrival time, arrival speed, lift-off time, etc. The preliminary analysis shows that almost 50 % of CME events in the dataset follow DBM approximation while propagating in the heliosphere. Furthermore, the dataset also provides statistical metrics for the DBM model parameters. Also, the probability distribution function for the free parameters of DBM has been derived through a Monte Carlo-like inversion procedure. Probability functions obtained from this work are comparable to distributions employed in previous works. The analysis showed that there exist two different most probable values of solar wind speed for DBM input based on slow (w slow ≈ 385.84 km/s) and fast (w f ast ≈ 546.99 km/s) solar wind type. While the most probable value for drag parameter (γ ≈ 0.687×10−7 km−1 ) input is somewhat higher compared to previous study. Using a data-driven approach, this procedure allows us to present a homogeneous, reliable, and robust dataset for the investigation of CME propagation. On the other hand, possible CME events are identified where DBM prediction is not valid due to model limitations and higher uncertainties in the input parameters, these events require more thorough investigation.