Reviewerly/exHarmony huggingface dataset:
Quantum advantage and noise reduction in distributed quantum computing

Distributed quantum computing can give substantial noise reduction due to shallower circuits. An experiment illustrates the advantages in the case of Grover search. This motivates studying the quantum advantage of the distributed version of the Simon and Deutsch-Jozsa algorithm. We show that the distributed Simon algorithm retains the exponential advantage, but the complexity deteriorates from O(n) to O(n^2), where n = log2(N). The distributed Deutsch-Jozsa deteriorates to being probabilistic but retains a quantum advantage over classical random sampling.
Resource-Constrained Federated Edge Learning With Heterogeneous Data: Formulation and Analysis

Efficient collaboration between collaborative machine learning and wireless communication technology, forming a Federated Edge Learning (FEEL), has spawned a series of next-generation intelligent applications. However, due to the openness of network connections, the FEEL framework generally involves hundreds of remote devices (or clients), resulting in expensive communication costs, which is not friendly to resource-constrained FEEL. To address this issue, we propose a distributed approximate Newton-type algorithm with fast convergence speed to alleviate the problem of FEEL resource (in terms of communication resources) constraints. Specifically, the proposed algorithm is improved based on distributed L-BFGS algorithm and allows each client to approximate the high-cost Hessian matrix by computing the low-cost Fisher matrix in a distributed manner to find a "better" descent direction, thereby speeding up convergence. Second, we prove that the proposed algorithm has linear convergence in strongly convex and non-convex cases and analyze its computational and communication complexity. Similarly, due to the heterogeneity of the connected remote devices, FEEL faces the challenge of heterogeneous data and non-IID (Independent and Identically Distributed) data. To this end, we design a simple but elegant training scheme, namely FedOVA, to solve the heterogeneous statistical challenge brought by heterogeneous data. In this way, FedOVA first decomposes a multi-class classification problem into more straightforward binary classification problems and then combines their respective outputs using ensemble learning. In particular, the scheme can be well integrated with our communication efficient algorithm to serve FEEL. Numerical results verify the effectiveness and superiority of the proposed algorithm.
Prediction of genetic alterations from gastric cancer histopathology images using a fully automated deep learning approach

Studies correlating specific genetic mutations and treatment response are ongoing to establish an effective treatment strategy for gastric cancer (GC). To facilitate this research, a cost- and time-effective method to analyze the mutational status is necessary. Deep learning (DL) has been successfully applied to analyze hematoxylin and eosin (H and E)-stained tissue slide images.To test the feasibility of DL-based classifiers for the frequently occurring mutations from the H and E-stained GC tissue whole slide images (WSIs).From the GC dataset of The Cancer Genome Atlas (TCGA-STAD), wild-type/mutation classifiers for CDH1, ERBB2, KRAS, PIK3CA, and TP53 genes were trained on 360 × 360-pixel patches of tissue images.The area under the curve (AUC) for the receiver operating characteristic (ROC) curves ranged from 0.727 to 0.862 for the TCGA frozen WSIs and 0.661 to 0.858 for the TCGA formalin-fixed paraffin-embedded (FFPE) WSIs. The performance of the classifier can be improved by adding new FFPE WSI training dataset from our institute. The classifiers trained for mutation prediction in colorectal cancer completely failed to predict the mutational status in GC, indicating that DL-based mutation classifiers are incompatible between different cancers.This study concluded that DL could predict genetic mutations in H and E-stained tissue slides when they are trained with appropriate tissue data.
Comparison of Resampling Techniques for Imbalanced Datasets in Machine Learning: Application to Epileptogenic Zone Localization From Interictal Intracranial EEG Recordings in Patients With Focal Epilepsy

Aim: In neuroscience research, data are quite often characterized by an imbalanced distribution between the majority and minority classes, an issue that can limit or even worsen the prediction performance of machine learning methods. Different resampling procedures have been developed to face this problem and a lot of work has been done in comparing their effectiveness in different scenarios. Notably, the robustness of such techniques has been tested among a wide variety of different datasets, without considering the performance of each specific dataset. In this study, we compare the performances of different resampling procedures for the imbalanced domain in stereo-electroencephalography (SEEG) recordings of the patients with focal epilepsies who underwent surgery. Methods: We considered data obtained by network analysis of interictal SEEG recorded from 10 patients with drug-resistant focal epilepsies, for a supervised classification problem aimed at distinguishing between the epileptogenic and non-epileptogenic brain regions in interictal conditions. We investigated the effectiveness of five oversampling and five undersampling procedures, using 10 different machine learning classifiers. Moreover, six specific ensemble methods for the imbalanced domain were also tested. To compare the performances, Area under the ROC curve (AUC), F-measure, Geometric Mean, and Balanced Accuracy were considered. Results: Both the resampling procedures showed improved performances with respect to the original dataset. The oversampling procedure was found to be more sensitive to the type of classification method employed, with Adaptive Synthetic Sampling (ADASYN) exhibiting the best performances. All the undersampling approaches were more robust than the oversampling among the different classifiers, with Random Undersampling (RUS) exhibiting the best performance despite being the simplest and most basic classification method. Conclusions: The application of machine learning techniques that take into consideration the balance of features by resampling is beneficial and leads to more accurate localization of the epileptogenic zone from interictal periods. In addition, our results highlight the importance of the type of classification method that must be used together with the resampling to maximize the benefit to the outcome.
Adversarial Attacks Against Deep Generative Models on Data: A Survey

Deep generative models have gained much attention given their ability to generate data for applications as varied as healthcare to financial technology to surveillance, and many more - the most popular models being generative adversarial networks (GANs) and variational auto-encoders (VAEs). Yet, as with all machine learning models, ever is the concern over security breaches and privacy leaks and deep generative models are no exception. In fact, these models have advanced so rapidly in recent years that work on their security is still in its infancy. In an attempt to audit the current and future threats against these models, and to provide a roadmap for defense preparations in the short term, we prepared this comprehensive and specialized survey on the security and privacy preservation of GANs and VAEs. Our focus is on the inner connection between attacks and model architectures and, more specifically, on five components of deep generative models: the training data, the latent code, the generators/decoders of GANs/VAEs, the discriminators/encoders of GANs/VAEs, and the generated data. For each model, component and attack, we review the current research progress and identify the key challenges. The paper concludes with a discussion of possible future attacks and research directions in the field.
MRA: Metaverse Reference Architecture

On the basis of introducing the metaverse and the digital economy and supporting the development trend of new technologies, the concept of service-to-service (S2S) ecosystem is defined. The metaverse is used to build a virtual digital world and link the physical world. This paper focuses on the connotation of the two words Meta and Verse of the metaverse, and proposes a management framework of metaverse resources (Non-fungible token, 3D space, experience, avatar, etc.) in scenarios that support interactions such as the management of work, life, transaction, and customers. Then the paper proposes a metaverse reference architecture (MRA) for systematically constructing metaverse solutions. Finally, this paper also looks forward to the future development trend of the metaverse.
Syndrome Decoding Estimator

The selection of secure parameter sets requires an estimation of the attack cost to break the respective cryptographic scheme instantiated under these parameters. The current NIST standardization process for post-quantum schemes makes this an urgent task, especially considering the announcement to select final candidates by the end of 2021. For code-based schemes, recent estimates seemed to contradict the claimed security of most proposals, leading to a certain doubt about the correctness of those estimates. Furthermore, none of the available estimates include most recent algorithmic improvements on decoding linear codes, which are based on information set decoding (ISD) in combination with nearest neighbor search. In this work we observe that all major ISD improvements are build on nearest neighbor search, explicitly or implicitly. This allows us to derive a framework from which we obtain practical variants of all relevant ISD algorithms including the most recent improvements. We derive formulas for the practical attack costs and make those online available in an easy to use estimator tool written in python and C. Eventually, we provide classical and quantum estimates for the bit security of all parameter sets of current code-based NIST proposals.
Discrete-Time Quantum-Walk &amp; Floquet Topological Insulators via Distance-Selective Rydberg-Interaction

This article proposes the first discrete-time implementation of Rydberg quantum walk in multi-dimensional spatial space that could ideally simulate different classes of topological insulators. Using distance-selective exchange-interaction between Rydberg excited atoms in an atomic-array with dual lattice-constants, the new setup operates both coined and coin-less models of discrete-time quantum walk (DTQW). Here, complicated coupling tessellations are performed by global laser that exclusively excite the site at the anti-blockade region. The long-range interaction provides a new feature of designing different topologically ordered periodic boundary conditions. Limiting the Rydberg population to two excitations, coherent QW over hundreds of lattice sites and steps are achievable with the current technology. These features would improve the performance of this quantum machine in running the quantum search algorithm over topologically ordered databases as well as diversifying the range of topological insulators that could be simulated.
Solving the Hubbard model using density matrix embedding theory and the variational quantum eigensolver

Calculating the ground state properties of a Hamiltonian can be mapped to the problem of finding the ground state of a smaller Hamiltonian through the use of embedding methods. These embedding techniques have the ability to drastically reduce the problem size, and hence the number of qubits required when running on a quantum computer. However, the embedding process can produce a relatively complicated Hamiltonian, leading to a more complex quantum algorithm. In this paper we carry out a detailed study into how density matrix embedding theory (DMET) could be implemented on a quantum computer to solve the Hubbard model. We consider the variational quantum eigensolver (VQE) as the solver for the embedded Hamiltonian within the DMET algorithm. We derive the exact form of the embedded Hamiltonian and use it to construct efficient ansatz circuits and measurement schemes. We conduct detailed numerical simulations up to 16 qubits, the largest to date, for a range of Hubbard model parameters and find that the combination of DMET and VQE is effective for reproducing ground state properties of the model.
StruBERT: Structure-aware BERT for Table Search and Matching

A table is composed of data values that are organized in rows and columns providing implicit structural information. A table is usually accompanied by secondary information such as the caption, page title, etc., that form the textual information. Understanding the connection between the textual and structural information is an important, yet neglected aspect in table retrieval, as previous methods treat each source of information independently. In this paper, we propose StruBERT, a structure-aware BERT model that fuses the textual and structural information of a data table to produce context-aware representations for both textual and tabular content of a data table. We introduce the concept of horizontal self-attention, which extends the idea of vertical self-attention introduced in TaBERT and allows us to treat both dimensions of a table equally. StruBERT features are integrated in a new end-to-end neural ranking model to solve three table-related downstream tasks: keyword- and content-based table retrieval, and table similarity. We evaluate our approach using three datasets, and we demonstrate substantial improvements in terms of retrieval and classification metrics over state-of-the-art methods.
Geometric mean of bipartite concurrences as a genuine multipartite entanglement measure

In this paper, we propose the geometric mean of bipartite concurrences as a genuine multipartite entanglement measure. This measure achieves the maximum value for absolutely maximally entangled states and has desirable properties for quantifying potential quantum resources. The simplicity and symmetry in the definition facilitates its computation for various multipartite entangled states including the GHZ states and the $W$ states. With explicit examples, we show that our measure results in distinct entanglement orderings from other measures and can detect differences in certain types of genuine multipartite entanglement while other measures cannot. These results justify the potential application of our measure for tasks involving genuine multipartite entanglement.
Watermarking Images in Self-Supervised Latent Spaces

We revisit watermarking techniques based on pre-trained deep networks, in the light of self-supervised approaches. We present a way to embed both marks and binary messages into their latent spaces, leveraging data augmentation at marking time. Our method can operate at any resolution and creates watermarks robust to a broad range of transformations (rotations, crops, JPEG, contrast, etc). It significantly outperforms the previous zero-bit methods, and its performance on multi-bit watermarking is on par with state-of-the-art encoder-decoder architectures trained end-to-end for watermarking. The code is available at github.com/facebookresearch/ssl_watermarking.
CORE: A knowledge graph entity type prediction method via complex space regression and embedding

Entity type prediction is an important problem in knowledge graph (KG) research. A new KG entity type prediction method, named CORE (COmplex space Regression and Embedding), is proposed in this work. The proposed CORE method leverages the expressive power of two complex space embedding models; namely, RotatE and ComplEx models. It embeds entities and types in two different complex spaces using either RotatE or ComplEx. Then, we derive a complex regression model to link these two spaces. Finally, a mechanism to optimize embedding and regression parameters jointly is introduced. Experiments show that CORE outperforms benchmarking methods on representative KG entity type inference datasets. Strengths and weaknesses of various entity type prediction methods are analyzed.
Quality assessment of anatomical MRI images from generative adversarial networks: Human assessment and image quality metrics

Generative Adversarial Networks (GANs) can synthesize brain images from image or noise input. So far, the gold standard for assessing the quality of the generated images has been human expert ratings. However, due to limitations of human assessment in terms of cost, scalability, and the limited sensitivity of the human eye to more subtle statistical relationships, a more automated approach towards evaluating GANs is required.We investigated to what extent visual quality can be assessed using image quality metrics and we used group analysis and spatial independent components analysis to verify that the GAN reproduces multivariate statistical relationships found in real data. Reference human data was obtained by recruiting neuroimaging experts to assess real Magnetic Resonance (MR) images and images generated by a GAN. Image quality was manipulated by exporting images at different stages of GAN training.Experts were sensitive to changes in image quality as evidenced by ratings and reaction times, and the generated images reproduced group effects (age, gender) and spatial correlations moderately well. We also surveyed a number of image quality metrics. Overall, Fréchet Inception Distance (FID), Maximum Mean Discrepancy (MMD) and Naturalness Image Quality Evaluator (NIQE) showed sensitivity to image quality and good correspondence with the human data, especially for lower-quality images (i.e., images from early stages of GAN training). However, only a Deep Quality Assessment (QA) model trained on human ratings was able to reproduce the subtle differences between higher-quality images.We recommend a combination of group analyses, spatial correlation analyses, and both distortion metrics (FID, MMD, NIQE) and perceptual models (Deep QA) for a comprehensive evaluation and comparison of brain images produced by GANs.
Multiple-Phase Quantum Interferometry: Real and Apparent Gains of Measuring All the Phases Simultaneously

We characterize operationally meaningful quantum gains in a paradigmatic model of lossless multiple-phase interferometry and stress insufficiency of the analysis based solely on the concept of quantum Fisher information. We show that the advantage of the optimal simultaneous estimation scheme amounts to a constant factor improvement when compared with schemes where each phase is estimated separately -- contrary to a widely cited results claiming a better precision scaling in terms of the number of phases involved.
Anti-aliasing phase reconstruction via a non-uniform phase-shifting technique

The conventional phase-shifting techniques commonly suffer from frequency aliasing because of their number of phase shifts below the critical sampling rate. As a result, fringe harmonics induce ripple-like artifacts in their reconstructed phase maps. For solving this issue, this paper presents an anti-aliasing phase-measuring technique. Theoretical analysis shows that, with phase-shifting, the harmonics aliased with the fundamental frequency component of a fringe signal depend on the greatest common divisor (GCD) of the used phase shifts. This fact implies a possibility of removing such aliasing effects by selecting non-uniform phase shifts that together with 2π have no common divisors. However, even if we do so, it remains challenging to separate harmonics from the fundamental fringe signals, because the systems of equations available from the captured fringe patterns are generally under-determined, especially when the number of phase shifts is very few. To overcome this difficulty, we practically presume that all the points over the fringe patterns have an identical characteristic of harmonics. Under this constraint, using an alternate iterative least-squares fitting procedure allows us to estimate the fringe phases and the harmonic coefficients accurately. Simulation and experimental results demonstrate that this proposed method enables separating high order harmonics from as few as 4 fringe patterns having non-uniform phase shifts, thus significantly suppressing the ripple-like phase errors caused by the frequency aliasing.
A secured cloud storage auditing with empirical outsourcing of key updates

Cloud computing is promising and considered next generation technology for computing. The current cloud storage auditing models require the client to update his secret keys in each time period which bring in local burdens to the client. The aim of the project is to make the key updates transpicuous to the client and present a new model for auditing cloud storage with provable outsourcing of updated keys. In this model, the key updates are sent to a third party auditor (TPA) who reduces the local burden on the client. In addition, the TPA will audit whether the files in cloud are stored correctly by a challenge-response protocol between the cloud and TPA at regular time. The proposed paradigm permits the client to authenticate the validity of the encrypted secret key produced by the TPA for uploading data to the cloud.
Cross-domain deep code search with meta learning

Recently, pre-trained programming language models such as CodeBERT have demonstrated substantial gains in code search. Despite showing great performance, they rely on the availability of large amounts of parallel data to fine-tune the semantic mappings between queries and code. This restricts their practicality in domain-specific languages with relatively scarce and expensive data. In this paper, we propose CroCS, a novel approach for domain-specific code search. CroCS employs a transfer learning framework where an initial program representation model is pre-trained on a large corpus of common programming languages (such as Java and Python) and is further adapted to domain-specific languages such as SQL and Solidity. Unlike cross-language CodeBERT, which is directly fine-tuned in the target language, CroCS adapts a few-shot meta-learning algorithm called MAML to learn the good initialization of model parameters, which can be best reused in a domain-specific language. We evaluate the proposed approach on two domain-specific languages, namely, SQL and Solidity, with model transferred from two widely used languages (Python and Java). Experimental results show that CDCS significantly outperforms conventional pre-trained code models that are directly fine-tuned in domain-specific languages, and it is particularly effective for scarce data.
Improving Fairness for Data Valuation in Horizontal Federated Learning

Federated learning is an emerging decentralized machine learning scheme that allows multiple data owners to work collaboratively while ensuring data privacy. The success of federated learning depends largely on the participation of data owners. To sustain and encourage data owners' participation, it is crucial to fairly evaluate the quality of the data provided by the data owners and reward them correspondingly. Federated Shapley value, recently proposed by Wang et al. [Federated Learning, 2020], is a measure for data value under the framework of federated learning that satisfies many desired properties for data valuation. However, there are still factors of potential unfairness in the design of federated Shapley value because two data owners with the same local data may not receive the same evaluation. We propose a new measure called completed federated Shapley value to improve the fairness of federated Shapley value. The design depends on completing a matrix consisting of all the possible contributions by different subsets of the data owners. It is shown under mild conditions that this matrix is approximately low-rank by leveraging concepts and tools from optimization. Both theoretical analysis and empirical evaluation verify that the proposed measure does improve fairness in many circumstances.