arXiv subjects

Xin He

Publications and source records attributed to Xin He.

At least 145 records · Page 8Linked to original sources

arXiv2023

Effect of Measurement Backaction on Quantum Clock Precision Studied with a Superconducting Circuit

We theoretically and experimentally study the precision of a quantum clock near zero temperature, explicitly accounting for the effect of continuous measurement. The clock is created by a superconducting transmon qubit dispersively coupled to an open coplanar resonator. The cavity and qubit are driven by coherent fields, and the cavity output is monitored with a quantum-noise-limited amplifier. When the continuous measurement is weak, it induces persistent coherent oscillations (with fluctuating periods) in the conditional moments of the qubit's energy probability distribution, which are manifest in the output of the resonator. On the other hand, strong continuous measurement leads to an incoherent cycle of quantum jumps. We theoretically find an equality for the precision of the clock in each regime. Independently from the equalities, we derive a kinetic uncertainty relation for the precision, and find that both equalities satisfy this uncertainty relation. Finally, we experimentally verify that our quantum clock obeys the kinetic uncertainty relation for the precision, thus making an explicit link between the (kinetic) thermodynamic behavior of the clock and its precision, and achieving an experimental test of a kinetic uncertainty relation in the quantum domain.

quant-ph↗

arXiv2023

FusionAI: Decentralized Training and Deploying LLMs with Massive Consumer-Level GPUs

The rapid growth of memory and computation requirements of large language models (LLMs) has outpaced the development of hardware, hindering people who lack large-scale high-end GPUs from training or deploying LLMs. However, consumer-level GPUs, which constitute a larger market share, are typically overlooked in LLM due to their weaker computing performance, smaller storage capacity, and lower communication bandwidth. Additionally, users may have privacy concerns when interacting with remote LLMs. In this paper, we envision a decentralized system unlocking the potential vast untapped consumer-level GPUs in pre-training, inference and fine-tuning of LLMs with privacy protection. However, this system faces critical challenges, including limited CPU and GPU memory, low network bandwidth, the variability of peer and device heterogeneity. To address these challenges, our system design incorporates: 1) a broker with backup pool to implement dynamic join and quit of computing providers; 2) task scheduling with hardware performance to improve system efficiency; 3) abstracting ML procedures into directed acyclic graphs (DAGs) to achieve model and task universality; 4) abstracting intermediate represention and execution planes to ensure compatibility of various devices and deep learning (DL) frameworks. Our performance analysis demonstrates that 50 RTX 3080 GPUs can achieve throughputs comparable to those of 4 H100 GPUs, which are significantly more expensive.

cs.DC↗

arXiv2023

Terahertz nanospectroscopy of plasmon polaritons for the evaluation of doping in quantum devices

Terahertz (THz) waves are a highly sensitive probe of free carrier concentrations in semiconducting materials. However, most experiments operate in the far-field, which precludes the observation of nanoscale features that affect the material response. Here, we demonstrate the use of nanoscale THz plasmon polaritons as an indicator of surface quality in prototypical quantum devices properties. Using THz near-field hyperspectral measurements, we observe polaritonic features in doped silicon near a metal-semiconductor interface. The presence of the THz surface plasmon polariton indicates the existence of a thin film doped layer on the device. Using a multilayer extraction procedure utilising vector calibration, we quantitatively probe the doped surface layer and determine its thickness and complex permittivity. The recovered multilayer characteristics match the dielectric conditions necessary to support the THz surface plasmon polariton. Applying these findings to superconducting resonators, we show that etching of this doped layer leads to an increase of the quality factor as determined by cryogenic measurements. This study demonstrates that THz scattering-type scanning near-field optical microscopy (s-SNOM) is a promising diagnostic tool for characterization of surface dielectric properties of quantum devices.

physics.optics↗

arXiv2023

BS-GAT Behavior Similarity Based Graph Attention Network for Network Intrusion Detection

With the development of the Internet of Things (IoT), network intrusion detection is becoming more complex and extensive. It is essential to investigate an intelligent, automated, and robust network intrusion detection method. Graph neural networks based network intrusion detection methods have been proposed. However, it still needs further studies because the graph construction method of the existing methods does not fully adapt to the characteristics of the practical network intrusion datasets. To address the above issue, this paper proposes a graph neural network algorithm based on behavior similarity (BS-GAT) using graph attention network. First, a novel graph construction method is developed using the behavior similarity by analyzing the characteristics of the practical datasets. The data flows are treated as nodes in the graph, and the behavior rules of nodes are used as edges in the graph, constructing a graph with a relatively uniform number of neighbors for each node. Then, the edge behavior relationship weights are incorporated into the graph attention network to utilize the relationship between data flows and the structure information of the graph, which is used to improve the performance of the network intrusion detection. Finally, experiments are conducted based on the latest datasets to evaluate the performance of the proposed behavior similarity based graph attention network for the network intrusion detection. The results show that the proposed method is effective and has superior performance comparing to existing solutions.

cs.CR↗

arXiv2023

Superconductivity above 70 K observed in lutetium polyhydrides

The binary polyhydrides of heavy rare earth lutetium that shares a similar valence electron configuration to lanthanum have been experimentally discovered to be superconductive. The lutetium polyhydrides were successfully synthesized at high pressure and high temperature conditions using a diamond anvil cell in combinations with the in-situ high pressure laser heating technique. The resistance measurements as a function of temperature were performed at the same pressure of synthesis in order to study the transitions of superconductivity (SC). The superconducting transition with a maximum onset temperature (Tc) 71 K was observed at pressure of 218 GPa in the experiments. The Tc decreased to 65 K when pressure was at 181 GPa. From the evolution of SC at applied magnetic fields, the upper critical field at zero temperature μ0Hc2(0) was obtained to be ~36 Tesla. The in-situ high pressure X-ray diffraction experiments imply that the high Tc SC should arise from the Lu4H23 phase with Pm-3n symmetry that forms a new type of hydrogen cage framework different from those reported for previous light rare earth polyhydride superconductors.

cond-mat.supr-con↗

arXiv2023

Lformer: Text-to-Image Generation with L-shape Block Parallel Decoding

Generative transformers have shown their superiority in synthesizing high-fidelity and high-resolution images, such as good diversity and training stability. However, they suffer from the problem of slow generation since they need to generate a long token sequence autoregressively. To better accelerate the generative transformers while keeping good generation quality, we propose Lformer, a semi-autoregressive text-to-image generation model. Lformer firstly encodes an image into $h{\times}h$ discrete tokens, then divides these tokens into $h$ mirrored L-shape blocks from the top left to the bottom right and decodes the tokens in a block parallelly in each step. Lformer predicts the area adjacent to the previous context like autoregressive models thus it is more stable while accelerating. By leveraging the 2D structure of image tokens, Lformer achieves faster speed than the existing transformer-based methods while keeping good generation quality. Moreover, the pretrained Lformer can edit images without the requirement for finetuning. We can roll back to the early steps for regeneration or edit the image with a bounding box and a text prompt.

cs.CV↗

arXiv2022

NAS-LID: Efficient Neural Architecture Search with Local Intrinsic Dimension

One-shot neural architecture search (NAS) substantially improves the search efficiency by training one supernet to estimate the performance of every possible child architecture (i.e., subnet). However, the inconsistency of characteristics among subnets incurs serious interference in the optimization, resulting in poor performance ranking correlation of subnets. Subsequent explorations decompose supernet weights via a particular criterion, e.g., gradient matching, to reduce the interference; yet they suffer from huge computational cost and low space separability. In this work, we propose a lightweight and effective local intrinsic dimension (LID)-based method NAS-LID. NAS-LID evaluates the geometrical properties of architectures by calculating the low-cost LID features layer-by-layer, and the similarity characterized by LID enjoys better separability compared with gradients, which thus effectively reduces the interference among subnets. Extensive experiments on NASBench-201 indicate that NAS-LID achieves superior performance with better efficiency. Specifically, compared to the gradient-driven method, NAS-LID can save up to 86% of GPU memory overhead when searching on NASBench-201. We also demonstrate the effectiveness of NAS-LID on ProxylessNAS and OFA spaces. Source code: https://github.com/marsggbo/NAS-LID.

cs.CV↗

arXiv2022

Nonparametric augmented probability weighting with sparsity

Nonresponse frequently arises in practice, and simply ignoring it may lead to erroneous inference. Besides, the number of collected covariates may increase as the sample size in modern statistics, so parametric imputation or propensity score weighting usually leads to inefficiency without consideration of sparsity. In this paper, we propose a nonparametric imputation method with sparse learning by employing an efficient kernel-based learning gradient algorithm to identify truly informative covariates. Moreover, an augmented probability weighting framework is adopted to improve the estimation efficiency of the nonparametric imputation method and establish the limiting distribution of the corresponding estimator under regularity assumptions. The performance of the proposed method is also supported by several simulated examples and one real-life analysis.

stat.ME↗

arXiv2022

Fine-Grained Semantically Aligned Vision-Language Pre-Training

Large-scale vision-language pre-training has shown impressive advances in a wide range of downstream tasks. Existing methods mainly model the cross-modal alignment by the similarity of the global representations of images and texts, or advanced cross-modal attention upon image and text features. However, they fail to explicitly learn the fine-grained semantic alignment between visual regions and textual phrases, as only global image-text alignment information is available. In this paper, we introduce LOUPE, a fine-grained semantically aLigned visiOn-langUage PrE-training framework, which learns fine-grained semantic alignment from the novel perspective of game-theoretic interactions. To efficiently compute the game-theoretic interactions, we further propose an uncertainty-aware neural Shapley interaction learning module. Experiments show that LOUPE achieves state-of-the-art performance on a variety of vision-language tasks. Furthermore, without any object-level human annotations and fine-tuning, LOUPE achieves competitive performance on object detection and visual grounding. More importantly, LOUPE opens a new promising direction of learning fine-grained semantics from large-scale raw image-text pairs. The repository of this work is at https://github.com/YYJMJC/LOUPE.

cs.CV↗

arXiv2022

EAGAN: Efficient Two-stage Evolutionary Architecture Search for GANs

Generative adversarial networks (GANs) have proven successful in image generation tasks. However, GAN training is inherently unstable. Although many works try to stabilize it by manually modifying GAN architecture, it requires much expertise. Neural architecture search (NAS) has become an attractive solution to search GANs automatically. The early NAS-GANs search only generators to reduce search complexity but lead to a sub-optimal GAN. Some recent works try to search both generator (G) and discriminator (D), but they suffer from the instability of GAN training. To alleviate the instability, we propose an efficient two-stage evolutionary algorithm-based NAS framework to search GANs, namely EAGAN. We decouple the search of G and D into two stages, where stage-1 searches G with a fixed D and adopts the many-to-one training strategy, and stage-2 searches D with the optimal G found in stage-1 and adopts the one-to-one training and weight-resetting strategies to enhance the stability of GAN training. Both stages use the non-dominated sorting method to produce Pareto-front architectures under multiple objectives (e.g., model size, Inception Score (IS), and Fréchet Inception Distance (FID)). EAGAN is applied to the unconditional image generation task and can efficiently finish the search on the CIFAR-10 dataset in 1.2 GPU days. Our searched GANs achieve competitive results (IS=8.81$\pm$0.10, FID=9.91) on the CIFAR-10 dataset and surpass prior NAS-GANs on the STL-10 dataset (IS=10.44$\pm$0.087, FID=22.18). Source code: https://github.com/marsggbo/EAGAN.

cs.CV↗

arXiv2022

Evolutionary Multi-objective Architecture Search Framework: Application to COVID-19 3D CT Classification

The COVID-19 pandemic has threatened global health. Many studies have applied deep convolutional neural networks (CNN) to recognize COVID-19 based on chest 3D computed tomography (CT). Recent works show that no model generalizes well across CT datasets from different countries, and manually designing models for specific datasets requires expertise; thus, neural architecture search (NAS) that aims to search models automatically has become an attractive solution. To reduce the search cost on large 3D CT datasets, most NAS-based works use the weight-sharing (WS) strategy to make all models share weights within a supernet; however, WS inevitably incurs search instability, leading to inaccurate model estimation. In this work, we propose an efficient Evolutionary Multi-objective ARchitecture Search (EMARS) framework. We propose a new objective, namely potential, which can help exploit promising models to indirectly reduce the number of models involved in weights training, thus alleviating search instability. We demonstrate that under objectives of accuracy and potential, EMARS can balance exploitation and exploration, i.e., reducing search time and finding better models. Our searched models are small and perform better than prior works on three public COVID-19 3D CT datasets.

eess.IV↗

arXiv2022

Virtual Homogeneity Learning: Defending against Data Heterogeneity in Federated Learning

In federated learning (FL), model performance typically suffers from client drift induced by data heterogeneity, and mainstream works focus on correcting client drift. We propose a different approach named virtual homogeneity learning (VHL) to directly "rectify" the data heterogeneity. In particular, VHL conducts FL with a virtual homogeneous dataset crafted to satisfy two conditions: containing no private information and being separable. The virtual dataset can be generated from pure noise shared across clients, aiming to calibrate the features from the heterogeneous clients. Theoretically, we prove that VHL can achieve provable generalization performance on the natural distribution. Empirically, we demonstrate that VHL endows FL with drastically improved convergence speed and generalization performance. VHL is the first attempt towards using a virtual dataset to address data heterogeneity, offering new and effective means to FL.

cs.LG↗

arXiv2022

Inorganic Crystal Structure Prototype Database based on Unsupervised Learning of Local Atomic Environments

Recognition of structure prototypes from tremendous known inorganic crystal structures has been an important subject beneficial for material science research and new materials design. The existing databases of inorganic crystal structure prototypes were mostly constructed by classifying materials in terms of the crystallographic space group information. Herein, we employed a distinct strategy to construct the inorganic crystal structure prototype database, relying on the classification of materials in terms of local atomic environments (LAE) accompanied by unsupervised machine learning method. Specifically, we adopted a hierarchical clustering approach onto all experimentally known inorganic crystal structures data to identify structure prototypes. The criterion for hierarchical clustering is the LAE represented by the state-of-the-art structure fingerprints of the improved bond-orientational order parameters and the smooth overlap of atomic positions. This allows us to build up a LAE-based Inorganic Crystal Structure Prototype Database (LAE-ICSPD) containing 15,613 structure prototypes with defined stoichiometries. In addition, we have developed a Structure Prototype Generator Infrastructure (SPGI) package, which is a useful toolkit for structure prototype generation. Our developed SPGI toolkit and LAE-ICSPD are beneficial for investigating inorganic materials in a global way as well as accelerating materials discovery process in the data-driven mode.

cond-mat.mtrl-sci↗

arXiv2022

Fast primal-dual algorithm via dynamical system for a linearly constrained convex optimization problem

By time discretization of a second-order primal-dual dynamical system with damping $α/t$ where an inertial construction in the sense of Nesterov is needed only for the primal variable, we propose a fast primal-dual algorithm for a linear equality constrained convex optimization problem. Under a suitable scaling condition, we show that the proposed algorithm enjoys a fast convergence rate for the objective residual and the feasibility violation, and the decay rate can reach $\mathcal{O}(1/k^{α-1})$ at the most. We also study convergence properties of the corresponding primal-dual dynamical system to better understand the acceleration scheme. Finally, we report numerical experiments to demonstrate the effectiveness of the proposed algorithm.

math.OC↗

arXiv2022

Negative Zero-Point-Energy Parameter in the Meyer-Miller Mapping Model for Nonadiabatic Dynamics

The celebrated Meyer-Miller mapping model has been a useful approach for generating practical trajectory-based nonadiabatic dynamics methods. It is generally assumed that the zero-point-energy (ZPE) parameter is positive. The constraint implied in the conventional Meyer-Miller mapping Hamiltonian for an F-electronic-state system actually requires that parameter γis larger than -1/F for the ZPE parameter for each electronic degree of freedom. Both negative and positive values are possible for such a parameter. We first establish a rigorous formulation to construct exact mapping models in the Cartesian phase space when the constraint is applied. When nuclear dynamics is approximated by the linearized semiclassical initial value representation, a negative ZPE parameter could lead to reasonably good performance in describing dynamic behaviors in typical spin-boson models for condensed-phase two-state systems, even at challenging zero temperature.

quant-ph↗

arXiv2022

Unified Formulation of Phase Space Mapping Approaches for Nonadiabatic Quantum Dynamics

Nonadiabatic dynamical processes are one of the most important quantum mechanical phenomena in chemical, materials, biological, and environmental molecular systems, where the coupling between different electronic states is either inherent in the molecular structure or induced by the (intense) external field. The curse of dimensionality indicates the intractable exponential scaling of calculation effort with system size and restricts the implementation of numerically exact approaches for realistic large systems. The phase space formulation of quantum mechanics offers an important theoretical framework for constructing practical approximate trajectory-based methods for quantum dynamics. This Account reviews our recent progress in phase space mapping theory: a unified framework for constructing the mapping Hamiltonian on phase space for coupled F-state systems where the renowned Meyer-Miller Hamiltonian model is a special case, a general phase space formulation of quantum mechanics for nonadiabatic systems where the electronic degrees of freedom are mapped onto constraint space and the nuclear degrees of freedom are mapped onto infinite space, and an isomorphism between the mapping phase space approach for nonadiabatic systems and that for nonequilibrium electron transport processes.

physics.chem-ph↗

arXiv2022

"Second-Order Primal'' + "First-Order Dual'' Dynamical Systems with Time Scaling for Linear Equality Constrained Convex Optimization Problems

Second-order dynamical systems are important tools for solving optimization problems, and most of existing works in this field have focused on unconstrained optimization problems. In this paper, we propose an inertial primal-dual dynamical system with constant viscous damping and time scaling for the linear equality constrained convex optimization problem, which consists of a second-order ODE for the primal variable and a first-order ODE for the dual variable. When the scaling satisfies certain conditions, we prove its convergence property without assuming strong convexity. Even the convergence rate can become exponential when the scaling grows exponentially. We also show that the obtained convergence property of the dynamical system is preserved under a small perturbation.

math.OC↗

arXiv2022

New Phase Space Formulations and Quantum Dynamics Approaches

We report recent progress on the phase space formulation of quantum mechanics with coordinate-momentum variables, focusing more on new theory of (weighted) constraint coordinate-momentum phase space for discrete-variable quantum systems. This leads to a general coordinate-momentum phase space formulation of composite quantum systems, where conventional representations on infinite phase space are employed for continuous variables. It is convenient to utilize (weighted) constraint coordinate-momentum phase space for representing the quantum state and describing nonclassical features. Various numerical tests demonstrate that new trajectory-based quantum dynamics approaches derived from the (weighted) constraint phase space representation are useful and practical for describing dynamical processes of composite quantum systems in gas phase as well as in condensed phase.

quant-ph↗