Reviewerly/exHarmony huggingface dataset:
Teleportation-based noiseless quantum amplification of coherent states of light

We propose and theoretically analyze a teleportation-based scheme for the high-fidelity noiseless quantum amplification of coherent states of light. In our approach, the probabilistic noiseless quantum amplification operation is encoded into a suitable auxiliary two-mode entangled state and then applied to the input coherent state via continuous-variable quantum teleportation. The scheme requires conditioning on the outcomes of homodyne measurements in the teleportation protocol. In contrast to high-fidelity noiseless quantum amplifiers based on combination of conditional single-photon addition and subtraction, the present scheme requires only photon subtraction in combination with auxiliary Gaussian squeezed vacuum states. We first provide a pure-state description of the protocol which allows us to to clearly explain its principles and functioning. Next we develop a more comprehensive model based on phase-space representation of quantum states, that accounts for various experimental imperfections such as excess noise in the auxiliary squeezed states or limited efficiency of the single-photon detectors that can only distinguish the presence or absence of photons. We present and analyze predictions of this phase-space model of the noiseless teleamplifier.
A Domain Gap Aware Generative Adversarial Network for Multi-Domain Image Translation

Recent image-to-image translation models have shown great success in mapping local textures between two domains. Existing approaches rely on a cycle-consistency constraint that supervises the generators to learn an inverse mapping. However, learning the inverse mapping introduces extra trainable parameters and it is unable to learn the inverse mapping for some domains. As a result, they are ineffective in the scenarios where (i) multiple visual image domains are involved; (ii) both structure and texture transformations are required; and (iii) semantic consistency is preserved. To solve these challenges, the paper proposes a unified model to translate images across multiple domains with significant domain gaps. Unlike previous models that constrain the generators with the ubiquitous cycle-consistency constraint to achieve the content similarity, the proposed model employs a perceptual self-regularization constraint. With a single unified generator, the model can maintain consistency over the global shapes as well as the local texture information across multiple domains. Extensive qualitative and quantitative evaluations demonstrate the effectiveness and superior performance over state-of-the-art models. It is more effective in representing shape deformation in challenging mappings with significant dataset variation across multiple domains.
Data-enhanced variational Monte Carlo simulations for Rydberg atom arrays

Rydberg atom arrays are programmable quantum simulators capable of preparing interacting qubit systems in a variety of quantum states. Due to long experimental preparation times, obtaining projective measurement data can be relatively slow for large arrays, which poses a challenge for state reconstruction methods such as tomography. Today, novel ground-state wave-function Ans\"atze like recurrent neural networks (RNNs) can be efficiently trained not only from projective measurement data, but also through Hamiltonian-guided variational Monte Carlo (VMC). In this paper, we demonstrate how pretraining modern RNNs on even small amounts of data significantly reduces the convergence time for a subsequent variational optimization of the wave function. This suggests that essentially any amount of measurements obtained from a state prepared in an experimental quantum simulator could provide significant values for neural-network-based VMC strategies.
BI-RADS BERT and Using Section Segmentation to Understand Radiology Reports

Radiology reports are one of the main forms of communication between radiologists and other clinicians, and contain important information for patient care. In order to use this information for research and automated patient care programs, it is necessary to convert the raw text into structured data suitable for analysis. State-of-the-art natural language processing (NLP) domain-specific contextual word embeddings have been shown to achieve impressive accuracy for these tasks in medicine, but have yet to be utilized for section structure segmentation. In this work, we pre-trained a contextual embedding BERT model using breast radiology reports and developed a classifier that incorporated the embedding with auxiliary global textual features in order to perform section segmentation. This model achieved 98% accuracy in segregating free-text reports, sentence by sentence, into sections of information outlined in the Breast Imaging Reporting and Data System (BI-RADS) lexicon, which is a significant improvement over the classic BERT model without auxiliary information. We then evaluated whether using section segmentation improved the downstream extraction of clinically relevant information such as modality/procedure, previous cancer, menopausal status, purpose of exam, breast density, and breast MRI background parenchymal enhancement. Using the BERT model pre-trained on breast radiology reports, combined with section segmentation, resulted in an overall accuracy of 95.9% in the field extraction tasks. This is a 17% improvement, compared to an overall accuracy of 78.9% for field extraction with models using classic BERT embeddings and not using section segmentation. Our work shows the strength of using BERT in the analysis of radiology reports and the advantages of section segmentation by identifying the key features of patient factors recorded in breast radiology reports.
Corporate social responsibility effect on firm's financial performance in Jordan

The aim of the study investigates the impact of dimensions of corporate social responsibility (CSR) (environmental, community service, and human resources) on financial performance measured by return on assets (ROA). The sample of the study included the used (15) Jordanian companies listed in Amman stock exchange as a sample of this research during the period 2012-2016. To achieve the purposes of the study, and to analyse the data extracted from the annual reports, the researcher used simple and multiple linear regression methods. Social responsibility (environmental, community service, and human resources) on financial performance measured by ROA.
Deep Learning

This chapter deals with a brief introduction to deep learning. We deal with the perceptron classifier and its training. We then deal with feedforward networks and the multilayer perceptron (MLP). Training MLP using the well-known backpropagation algorithm is examined. An introduction to convolutional neural networks (CNNs), recurrent neural networks (RNNs), Long Short-TermMemory (LSTM), and autoencoders is provided.
ARCHIE: A User-Focused Framework for Testing Augmented Reality Applications in the Wild

In this paper, we present ARCHIE, a framework for testing augmented reality applications in the wild. ARCHIE collects user feedback and system state data in situ to help developers identify and debug issues important to testers. It also supports testing of multiple application versions (called "profiles") in a single evaluation session, prioritizing those versions which the tester finds more appealing. To evaluate ARCHIE, we implemented four distinct test case applications and used these applications to examine the performance overhead and context switching cost of incorporating our framework into a pre-existing code base. With these, we demonstrate that ARCHIE provides no significant overhead for AR applications, and introduces at most 2% processing overhead when switching among large groups of testable profiles.
Self-healing of multipartite entanglement in optical quantum networks

Multipartite entanglement serves as an essential resource for constructing quantum networks and makes it possible to realize multi-user quantum information protocols outperforming their classical counterparts. Unfortunately, multipartite entanglement is fragile when distributed in complex environments. Therefore, it is urgent to address the issue of multipartite entanglement decoherence caused by complex environments. Here we demonstrate the self-healing of multipartite continuous-variable (CV) entanglement after an obstruction. In our experiment, the tripartite entanglement destroyed by the obstruction-introduced noise and loss can self-heal after free-space propagation of a certain distance due to the self-healing property of a Bessel–Gaussian (BG) beam. We show that the BG beam provides a more robust mode basis for free-space CV quantum entanglement distribution than the widely used fundamental Gaussian beam under similar conditions. In addition, we also demonstrate the self-healing of five sets of tripartite entanglement and 10 sets of bipartite entanglement in orbital-angular-momentum-multiplexed optical quantum networks. Our results pave the way for constructing obstruction-tolerant high-capacity CV optical quantum networks.
Deep learning for survival analysis in breast cancer with whole slide image data

Abstract Motivation Whole slide tissue images contain detailed data on the sub-cellular structure of cancer. Quantitative analyses of this data can lead to novel biomarkers for better cancer diagnosis and prognosis and can improve our understanding of cancer mechanisms. Such analyses are challenging to execute because of the sizes and complexity of whole slide image data and relatively limited volume of training data for machine learning methods. Results We propose and experimentally evaluate a multi-resolution deep learning method for breast cancer survival analysis. The proposed method integrates image data at multiple resolutions and tumor, lymphocyte and nuclear segmentation results from deep learning models. Our results show that this approach can significantly improve the deep learning model performance compared to using only the original image data. The proposed approach achieves a c-index value of 0.706 compared to a c-index value of 0.551 from an approach that uses only color image data at the highest image resolution. Furthermore, when clinical features (sex, age and cancer stage) are combined with image data, the proposed approach achieves a c-index of 0.773. Availability and implementation https://github.com/SBU-BMI/deep_survival_analysis
BlindFL: Vertical Federated Machine Learning without Peeking into Your Data

Due to the rising concerns on privacy protection, how to build machine learning (ML) models over different data sources with security guarantees is gaining more popularity. Vertical federated learning (VFL) describes such a case where ML models are built upon the private data of different participated parties that own disjoint features for the same set of instances, which fits many real-world collaborative tasks. Nevertheless, we find that existing solutions for VFL either support limited kinds of input features or suffer from potential data leakage during the federated execution. To this end, this paper aims to investigate both the functionality and security of ML modes in the VFL scenario.
Adaptive Model Pooling for Online Deep Anomaly Detection from a Complex Evolving Data Stream

Online anomaly detection from a data stream is critical for the safety and security of many applications but is facing severe challenges due to complex and evolving data streams from IoT devices and cloud-based infrastructures. Unfortunately, existing approaches fall too short for these challenges; online anomaly detection methods bear the burden of handling the complexity while offline deep anomaly detection methods suffer from the evolving data distribution. This paper presents a framework for online deep anomaly detection, ARCUS, which can be instantiated with any autoencoder-based deep anomaly detection methods. It handles the complex and evolving data streams using an adaptive model pooling approach with two novel techniques: concept-driven inference and drift-aware model pool update; the former detects anomalies with a combination of models most appropriate for the complexity, and the latter adapts the model pool dynamically to fit the evolving data streams. In comprehensive experiments with ten data sets which are both high-dimensional and concept-drifted, ARCUS improved the anomaly detection accuracy of the streaming variants of state-of-the-art autoencoder-based methods and that of the state-of-the-art streaming anomaly detection methods by up to 22% and 37%, respectively.
CREIME—A <i>C</i> onvolutional <i>R</i> ecurrent Model for <i>E</i> arthquake <i>I</i> dentification and <i>M</i> agnitude <i>E</i> stimation

The detection and rapid characterisation of earthquake parameters such as magnitude are of prime importance in seismology, particularly in applications such as Earthquake Early Warning (EEW). Traditionally, algorithms such as STA/LTA are used for event detection, while frequency or amplitude domain parameters calculated from 1-3 seconds of first P-arrival data are sometimes used to provide a first estimate of (body wave) magnitude. Owing to extensive involvement of human experts in parameter determination, these approaches are often found to be insufficient. Moreover, these methods are sensitive to the signal to noise ratio and may often lead to false or missed alarms depending on the choice of parameters. We, therefore, propose a multitasking deep learning model the Convolutional Recurrent model for Earthquake Identification and Magnitude Estimation (CREIME) that: (i) detects the first earthquake signal, from background seismic noise, (ii) determines first P arrival time as well as (iii) estimates the magnitude using the raw 3-component waveform data from a single station as model input. Considering, speed is of essence in EEW, we use up to two seconds of P-wave information which, to the best of our knowledge, is a significantly smaller data window (5 second window with up to of P wave data) compared to the previous studies. To examine the robustness of CREIME we test it on two independent datasets and find that it achieves an average accuracy of 98 percent for event vs noise discrimination and is able to estimate first P arrival time and local magnitude with average root mean squared errors of 0.13 seconds and 0.65 units, respectively. We also compare CREIME architecture with architectures of other baseline models, by training them on the same data, and also with traditional algorithms such as STA/LTA, and show that our architecture outperforms these methods.
Reliable Representations Make A Stronger Defender

Benefiting from the message passing mechanism, Graph Neural Networks (GNNs) have been successful on flourish tasks over graph data. However, recent studies have shown that attackers can catastrophically degrade the performance of GNNs by maliciously modifying the graph structure. A straightforward solution to remedy this issue is to model the edge weights by learning a metric function between pairwise representations of two end nodes, which attempts to assign low weights to adversarial edges. The existing methods use either raw features or representations learned by supervised GNNs to model the edge weights. However, both strategies are faced with some immediate problems: raw features cannot represent various properties of nodes (e.g., structure information), and representations learned by supervised GNN may suffer from the poor performance of the classifier on the poisoned graph. We need representations that carry both feature information and as mush correct structure information as possible and are insensitive to structural perturbations. To this end, we propose an unsupervised pipeline, named STABLE, to optimize the graph structure. Finally, we input the well-refined graph into a downstream classifier. For this part, we design an advanced GCN that significantly enhances the robustness of vanilla GCN [24] without increasing the time complexity. Extensive experiments on four real-world graph benchmarks demonstrate that STABLE outperforms the state-of-the-art methods and successfully defends against various attacks.
Blockchain for Genomics: A Systematic Literature Review

Human genomic data carry unique information about an individual and offer unprecedented opportunities for healthcare. The clinical interpretations derived from large genomic datasets can greatly improve healthcare and pave the way for personalized medicine. Sharing genomic datasets, however, pose major challenges, as genomic data is different from traditional medical data, indirectly revealing information about descendants and relatives of the data owner and carrying valid information even after the owner passes away. Therefore, stringent data ownership and control measures are required when dealing with genomic data. In order to provide secure and accountable infrastructure, blockchain technologies offer a promising alternative to traditional distributed systems. Indeed, the research on blockchain-based infrastructures tailored to genomics is on the rise. However, there is a lack of a comprehensive literature review that summarizes the current state-of-the-art methods in the applications of blockchain in genomics. In this paper, we systematically look at the existing work both commercial and academic, and discuss the major opportunities and challenges. Our study is driven by five research questions that we aim to answer in our review. We also present our projections of future research directions which we hope the researchers interested in the area can benefit from.
DS-Net++: Dynamic Weight Slicing for Efficient Inference in CNNs and Vision Transformers

Dynamic networks have shown their promising capability in reducing theoretical computation complexity by adapting their architectures to the input during inference. However, their practical runtime usually lags behind the theoretical acceleration due to inefficient sparsity. In this paper, we explore a hardware-efficient dynamic inference regime, named dynamic weight slicing, that can generalized well on multiple dimensions in both CNNs and transformers (<i>e.g</i>. kernel size, embedding dimension, number of heads, <i>etc</i>.). Instead of adaptively selecting important weight elements in a sparse way, we pre-define dense weight slices with different importance level by nested residual learning. During inference, weights are progressively sliced beginning with the most important elements to less important ones to achieve different model capacity for inputs with diverse difficulty levels. Based on this conception, we present DS-CNN++ and DS-ViT++, by carefully designing the double headed dynamic gate and the overall network architecture. We further propose dynamic idle slicing to address the drastic reduction of embedding dimension in DS-ViT++. To ensure sub-network generality and routing fairness, we propose a disentangled two-stage optimization scheme. In Stage I, in-place bootstrapping (IB) and multi-view consistency (MvCo) are proposed to stablize and improve the training of DS-CNN++ and DS-ViT++ supernet, respectively. In Stage II, sandwich gate sparsification (SGS) is proposed to assist the gate training. Extensive experiments on 4 datasets and 3 different network architectures demonstrate our methods consistently outperform the state-of-the-art static and dynamic model compression methods by a large margin (up to 6.6&#x0025;). Typically, we achieves 2-4&#x00D7; computation reduction and up to 61.5&#x0025; real-world acceleration on MobileNet, ResNet-50 and Vision Transformer, with minimal accuracy drops on ImageNet. Code release: <uri>https://github.com/changlin31/DS-Net</uri>
DVR

Recommender systems are prone to be misled by biases in the data. Models trained with biased data fail to capture the real interests of users, thus it is critical to alleviate the impact of bias to achieve unbiased recommendation. In this work, we focus on an essential bias in micro-video recommendation, duration bias. Specifically, existing micro-video recommender systems usually consider watch time as the most critical metric, which measures how long a user watches a video. Since videos with longer duration tend to have longer watch time, there exists a kind of duration bias, making longer videos tend to be recommended more against short videos. In this paper, we empirically show that commonly-used metrics are vulnerable to duration bias, making them NOT suitable for evaluating micro-video recommendation. To address it, we further propose an unbiased evaluation metric, called WTG (short for Watch Time Gain). Empirical results reveal that WTG can alleviate duration bias and better measure recommendation performance. Moreover, we design a simple yet effective model named DVR (short for Debiased Video Recommendation) that can provide unbiased recommendation of micro-videos with varying duration, and learn unbiased user preferences via adversarial learning. Extensive experiments based on two real-world datasets demonstrate that DVR successfully eliminates duration bias and significantly improves recommendation performance with over 30% relative progress. Codes and datasets are released at https://github.com/tsinghua-fib-lab/WTG-DVR.
Continual semi-supervised learning through contrastive interpolation consistency

Continual Learning (CL) investigates how to train Deep Networks on a stream of tasks without incurring forgetting. CL settings proposed in literature assume that every incoming example is paired with ground-truth annotations. However, this clashes with many real-world applications: gathering labeled data, which is in itself tedious and expensive, becomes infeasible when data flow as a stream. This work explores Continual Semi-Supervised Learning (CSSL): here, only a small fraction of labeled input examples are shown to the learner. We assess how current CL methods (e.g.: EWC, LwF, iCaRL, ER, GDumb, DER) perform in this novel and challenging scenario, where overfitting entangles forgetting. Subsequently, we design a novel CSSL method that exploits metric learning and consistency regularization to leverage unlabeled examples while learning. We show that our proposal exhibits higher resilience to diminishing supervision and, even more surprisingly, relying only on 25% supervision suffices to outperform SOTA methods trained under full supervision.
Towards Better Domain Adaptation for Self-Supervised Models: A Case Study of Child ASR

Recently, self-supervised learning (SSL) from unlabelled speech data has gained increased attention in the automatic speech recognition (ASR) community. Typical SSL methods include autoregressive predictive coding (APC), Wav2vec2.0, and hidden unit BERT (HuBERT). However, SSL models are biased to the pretraining data. When SSL models are finetuned with data from another domain, domain shifting occurs and might cause limited knowledge transfer for downstream tasks. In this paper, we propose a novel framework, domain responsible adaptation and finetuning (DRAFT), to reduce domain shifting in pretrained speech models, and evaluate it for a causal and non-causal transformer. For the causal transformer, an extension of APC (E-APC) is proposed to learn richer information from unlabelled data by using multiple temporally-shifted sequences to perform prediction. For the non-causal transformer, various solutions for using the bidirectional APC (Bi-APC) are investigated. In addition, the DRAFT framework is examined for Wav2vec2.0 and HuBERT methods, which use non-causal transformers as the backbone. The experiments are conducted on child ASR (using the OGI and MyST databases) using SSL models trained with unlabelled adult speech data from Librispeech. The relative WER improvements of up to 19.7% on the two child tasks are observed when compared to the pretrained models without adaptation. With the proposed methods (E-APC and DRAFT), the relative WER improvements are even larger (30% and 19% on the OGI and MyST data, respectively) when compared to the models without using pretraining methods.