arXiv subjects

Yi Xie

Publications and source records attributed to Yi Xie.

At least 109 records · Page 6Linked to original sources

arXiv2022

PowerFDNet: Deep Learning-Based Stealthy False Data Injection Attack Detection for AC-model Transmission Systems

Recent studies have demonstrated that smart grids are vulnerable to stealthy false data injection attacks (SFDIAs), as SFDIAs can bypass residual-based bad data detection mechanisms. The SFDIA detection has become one of the focuses of smart grid research. Methods based on deep learning technology have shown promising accuracy in the detection of SFDIAs. However, most existing methods rely on the temporal structure of a sequence of measurements but do not take account of the spatial structure between buses and transmission lines. To address this issue, we propose a spatiotemporal deep network, PowerFDNet, for the SFDIA detection in AC-model power grids. The PowerFDNet consists of two sub-architectures: spatial architecture (SA) and temporal architecture (TA). The SA is aimed at extracting representations of bus/line measurements and modeling the spatial structure based on their representations. The TA is aimed at modeling the temporal structure of a sequence of measurements. Therefore, the proposed PowerFDNet can effectively model the spatiotemporal structure of measurements. Case studies on the detection of SFDIAs on the benchmark smart grids show that the PowerFDNet achieved significant improvement compared with the state-of-the-art SFDIA detection methods. In addition, an IoT-oriented lightweight prototype of size 52 MB is implemented and tested for mobile devices, which demonstrates the potential applications on mobile devices. The trained model will be available at \textit{https://github.com/HubYZ/PowerFDNet}.

cs.CR↗

arXiv2022

Easy Begun is Half Done: Spatial-Temporal Graph Modeling with ST-Curriculum Dropout

Spatial-temporal (ST) graph modeling, such as traffic speed forecasting and taxi demand prediction, is an important task in deep learning area. However, for the nodes in graph, their ST patterns can vary greatly in difficulties for modeling, owning to the heterogeneous nature of ST data. We argue that unveiling the nodes to the model in a meaningful order, from easy to complex, can provide performance improvements over traditional training procedure. The idea has its root in Curriculum Learning which suggests in the early stage of training models can be sensitive to noise and difficult samples. In this paper, we propose ST-Curriculum Dropout, a novel and easy-to-implement strategy for spatial-temporal graph modeling. Specifically, we evaluate the learning difficulty of each node in high-level feature space and drop those difficult ones out to ensure the model only needs to handle fundamental ST relations at the beginning, before gradually moving to hard ones. Our strategy can be applied to any canonical deep learning architecture without extra trainable parameters, and extensive experiments on a wide range of datasets are conducted to illustrate that, by controlling the difficulty level of ST relations as the training progresses, the model is able to capture better representation of the data and thus yields better generalization.

cs.LG↗

arXiv2022

Experimental violation of Leggett-Garg inequality in a three-level trapped-ion system

Leggett-Garg inequality (LGI) studies the temporal correlation in the evolution of physical systems. Classical systems obey the LGI but quantum systems may violate it. The extent of the violation depends on the dimension of the quantum system and the state update rule. In this work, we experimentally test the LGI in a three-level trapped-ion system under the model of a large spin precessing in a magnetic field. The Von Neumann and Lüders state update rules are employed in our system for direct comparative analysis. The maximum observed value of Leggett-Garg correlator under the Von Neumann state update rule is $K_3 = 1.739 \pm 0.014$, which demonstrates a violation of the Lüders bound by 17 standard deviations and is by far the most significant violation in natural three-level systems.

quant-ph↗

arXiv2022

Revisiting the Evidence for an Intermediate-mass Black Hole in the Center of NGC 6624 with Simulations

The acceleration of LMXB 4U 1820-30 that derived from its orbital-period derivative $\dot P_{\rm b}$ was supposed to be the evidence for an Intermediate-mass Black Hole (IMBH) in the Galactic globular cluster (GC) NGC 6624. However, we find that the anomalous $\dot P_{\rm b}$ is mainly due to the gravitational wave emission, rather than the acceleration in cluster potential. Using the standard structure models of GCs, we simulate acceleration distributions for pulsars in the central region of the cluster. By fitting the acceleration of J1823-3021A with the simulated distribution profiles (maximum values), it is suggested that an IMBH with mass $M\gtrsim 950^{+550}_{-350}~M_{\odot}$ may reside in the cluster center. We further show that the second period derivative $\ddot P$ of J1823-3021A is probably due to the gravitational perturbation of a nearby star.

astro-ph.HE↗

arXiv2022

A Study on Representation Transfer for Few-Shot Learning

Few-shot classification aims to learn to classify new object categories well using only a few labeled examples. Transferring feature representations from other models is a popular approach for solving few-shot classification problems. In this work we perform a systematic study of various feature representations for few-shot classification, including representations learned from MAML, supervised classification, and several common self-supervised tasks. We find that learning from more complex tasks tend to give better representations for few-shot classification, and thus we propose the use of representations learned from multiple tasks for few-shot classification. Coupled with new tricks on feature selection and voting to handle the issue of small sample size, our direct transfer learning method offers performance comparable to state-of-art on several benchmark datasets.

cs.CV↗

arXiv2022

Instanton homology and knot detection on thickened surfaces

Suppose $Σ$ is a compact oriented surface (possibly with boundary) that has genus zero, and L is a link in the interior of $(-1,1)\timesΣ$. We prove that the Asaeda-Przytycki-Sikora (APS) homology of L has rank 2 if and only if L is isotopic to an embedded knot in $\{0\}\timesΣ$. As a consequence, the APS homology detects the unknot in $(-1,1)\timesΣ$. This is the first detection result for generalized Khovanov homology that is valid on an infinite family of manifolds, and it partially solves a conjecture in arxiv:2005.12863. Our proof is different from the previous detection results obtained by instanton homology because in this case, the second page of Kronheimer-Mrowka's spectral sequence is not isomorphic to the APS homology. We also characterize all links in product manifolds that have minimal sutured instanton homology, which may be of independent interest.

math.GT↗

arXiv2022

RIBAC: Towards Robust and Imperceptible Backdoor Attack against Compact DNN

Recently backdoor attack has become an emerging threat to the security of deep neural network (DNN) models. To date, most of the existing studies focus on backdoor attack against the uncompressed model; while the vulnerability of compressed DNNs, which are widely used in the practical applications, is little exploited yet. In this paper, we propose to study and develop Robust and Imperceptible Backdoor Attack against Compact DNN models (RIBAC). By performing systematic analysis and exploration on the important design knobs, we propose a framework that can learn the proper trigger patterns, model parameters and pruning masks in an efficient way. Thereby achieving high trigger stealthiness, high attack success rate and high model efficiency simultaneously. Extensive evaluations across different datasets, including the test against the state-of-the-art defense mechanisms, demonstrate the high robustness, stealthiness and model efficiency of RIBAC. Code is available at https://github.com/huyvnphan/ECCV2022-RIBAC

cs.CR↗

arXiv2022

Interfacial Charge-transfer Excitonic Insulator in a Two-dimensional Organic-inorganic Superlattice

Excitonic insulators are long-sought-after quantum materials predicted to spontaneously open a gap by the Bose condensation of bound electron-hole pairs, namely, excitons, in their ground state. Since the theoretical conjecture, extensive efforts have been devoted to pursuing excitonic insulator platforms for exploring macroscopic quantum phenomena in real materials. Reliable evidences of excitonic character have been obtained in layered chalcogenides as promising candidates. However, owing to the interference of intrinsic lattice instabilities, it is still debatable whether those features, such as charge density wave and gap opening, are primarily driven by the excitonic effect or by the lattice transition. Herein, we develop a novel charge-transfer excitonic insulator in organic-inorganic superlattice interfaces, which serves as an ideal platform to decouple the excitonic effect from the lattice effect. In this system, we observe the narrow gap opening and the formation of a charge density wave without periodic lattice distortion, providing visualized evidence of exciton condensation occurring in thermal equilibrium. Our findings identify spontaneous interfacial charge transfer as a new strategy for developing novel excitonic insulators and investigating their correlated many-body physics.

cond-mat.mtrl-sci↗

arXiv2022

Compute Cost Amortized Transformer for Streaming ASR

We present a streaming, Transformer-based end-to-end automatic speech recognition (ASR) architecture which achieves efficient neural inference through compute cost amortization. Our architecture creates sparse computation pathways dynamically at inference time, resulting in selective use of compute resources throughout decoding, enabling significant reductions in compute with minimal impact on accuracy. The fully differentiable architecture is trained end-to-end with an accompanying lightweight arbitrator mechanism operating at the frame-level to make dynamic decisions on each input while a tunable loss function is used to regularize the overall level of compute against predictive performance. We report empirical results from experiments using the compute amortized Transformer-Transducer (T-T) model conducted on LibriSpeech data. Our best model can achieve a 60% compute cost reduction with only a 3% relative word error rate (WER) increase.

cs.CL↗

arXiv2022

Investigation of the Effect of Quantum Measurement on Parity-Time Symmetry

Symmetry, including the parity-time ($\mathcal{PT}$)-symmetry, is a striking topic, widely discussed and employed in many fields. It is well-known that quantum measurement can destroy or disturb quantum systems. However, can and how does quantum measurement destroy the symmetry of the measured system? To answer the pertinent question, we establish the correlation between the quantum measurement and Floquet $\mathcal{PT}$-symmetry and investigate for the first time how the measurement frequency and measurement strength affect the $\mathcal{PT}$-symmetry of the measured system using the $^{40}\mathrm{Ca}^{+}$ ion. It is already shown that the measurement at high frequencies would break the $\mathcal{PT}$ symmetry. Notably, even for an inadequately fast measurement frequency, if the measurement strength is sufficiently strong, the $\mathcal{PT}$ symmetry breaking can occur. The current work can enhance our knowledge of quantum measurement and symmetry and may inspire further research on the effect of quantum measurement on symmetry.

quant-ph↗

arXiv2022

CHIP: CHannel Independence-based Pruning for Compact Neural Networks

Filter pruning has been widely used for neural network compression because of its enabled practical acceleration. To date, most of the existing filter pruning works explore the importance of filters via using intra-channel information. In this paper, starting from an inter-channel perspective, we propose to perform efficient filter pruning using Channel Independence, a metric that measures the correlations among different feature maps. The less independent feature map is interpreted as containing less useful information$/$knowledge, and hence its corresponding filter can be pruned without affecting model capacity. We systematically investigate the quantification metric, measuring scheme and sensitiveness$/$reliability of channel independence in the context of filter pruning. Our evaluation results for different models on various datasets show the superior performance of our approach. Notably, on CIFAR-10 dataset our solution can bring $0.90\%$ and $0.94\%$ accuracy increase over baseline ResNet-56 and ResNet-110 models, respectively, and meanwhile the model size and FLOPs are reduced by $42.8\%$ and $47.4\%$ (for ResNet-56) and $48.3\%$ and $52.1\%$ (for ResNet-110), respectively. On ImageNet dataset, our approach can achieve $40.8\%$ and $44.8\%$ storage and computation reductions, respectively, with $0.15\%$ accuracy increase over the baseline ResNet-50 model. The code is available at https://github.com/Eclipsess/CHIP_NeurIPS2021.

cs.CV↗

arXiv2022

Self-Testing of a Single Quantum System: Theory and Experiment

Certifying individual quantum devices with minimal assumptions is crucial for the development of quantum technologies. Here, we investigate how to leverage single-system contextuality to realize self-testing. We develop a robust self-testing protocol based on the simplest contextuality witness for the simplest contextual quantum system, the Klyachko-Can-Binicioğlu-Shumovsky (KCBS) inequality for the qutrit. We establish a lower bound on the fidelity of the state and the measurements (to an ideal configuration) as a function of the value of the witness under a pragmatic assumption on the measurements we call the KCBS orthogonality condition. We apply the method in an experiment with randomly chosen measurements on a single trapped $^{40}{\rm Ca}^+$ and near-perfect detection efficiency. The observed statistics allow us to self-test the system and provide the first experimental demonstration of quantum self-testing of a single system. Further, we quantify and report that deviations from our assumptions are minimal, an aspect previously overlooked by contextuality experiments.

quant-ph↗

arXiv2021

Parallel-Electromagnetically-Induced-Transparency Near Ground-State Cooling of a Trapped-ion Crystal

We theoretically propose and experimentally demonstrate a parallel-electromagnetically-induced transparency (parallel-EIT) cooling technique for ion crystals in the Paul trap. It has less stringent requirements on the cooling resonance condition than the standard electromagnetically-induced transparency (EIT) cooling, thus allowing, in principle, to simultaneously cool the motional mode spectrum with an arbitrary range. A proof-of-principle validation for this cooling scheme is experimentally demonstrated with up to 4 trapped 40Ca+ ions. We observe simultaneous near-ground-state cooling for all motional modes with best average phonon number about 0.2. By tuning the trap frequency in a large range to imitate a broadband motional mode spectrum, we can still reach almost the same cooling limit for all the modes while standard EIT cooling shows limited cooling range. Our method has a simple experimental configuration, requiring only appropriate modulation of the probe beam of standard EIT cooling, and can be applied to various types of ions (e.g., 171Yb+, 40Ca+). This cooling scheme provides a powerful tool for the initialization of the trapped-ion quantum computers and simulators.

quant-ph↗

arXiv2021

Probing Dark Contents in Globular Clusters With Timing Effects of Pulsar Acceleration

We investigate pulsar timing residuals due to the coupling effect of the pulsar transverse acceleration and the R$\rm{\ddot{o}}$mer delay. The effect is relatively small and usually negligible. Only for pulsars in globular clusters, it is possibly important. The maximum residual amplitude, which is from the pulsar near the surface of the core of the cluster, is about tens nanoseconds, and may hardly be identified for most of the globular clusters currently. However, an intermediate-mass black hole in the centre of a cluster can increase apparently the timing residual magnitudes. Particularly for the pulsars in the innermost core region, their residual magnitudes may be significant. The high-magnitude residuals, which above critical lines of each cluster, are strong evidences for the presence of a black hole or dark remnants of comparable total mass in the centre of the cluster. We also explored the timing effects of line-of-sight accelerations for the pulsars. The distribution of measured line-of-sight accelerations are simulated with a Monte Carlo method. A two-dimensional Kolmogorov-Smirnov tests are performed to reexamine the consistency of distributions of the simulated and reported data for various values of parameters of the clusters. It is shown that the structure parameters of Terzan 5 can be well constrained by comparing the distribution of measured line-of-sight accelerations with the distributions from Monte Carlo simulations. We provide that the cluster has an upper limit on the central black hole/dark remnant mass of $ \sim 6000 M_{\odot} $.

astro-ph.HE↗

arXiv2021

On Floer minimal knots in sutured manifolds

Suppose $(M, γ)$ is a balanced sutured manifold and $K$ is a rationally null-homologous knot in $M$. It is known that the rank of the sutured Floer homology of $M\backslash N(K)$ is at least twice the rank of the sutured Floer homology of $M$. This paper studies the properties of $K$ when the equality is achieved for instanton homology. As an application, we show that if $L\subset S^3$ is a fixed link and $K$ is a knot in the complement of $L$, then the instanton link Floer homology of $L\cup K$ achieves the minimum rank if and only if $K$ is the unknot in $S^3\backslash L$.

math.GT↗

arXiv2021

Graph Universal Adversarial Attacks: A Few Bad Actors Ruin Graph Learning Models

Deep neural networks, while generalize well, are known to be sensitive to small adversarial perturbations. This phenomenon poses severe security threat and calls for in-depth investigation of the robustness of deep learning models. With the emergence of neural networks for graph structured data, similar investigations are urged to understand their robustness. It has been found that adversarially perturbing the graph structure and/or node features may result in a significant degradation of the model performance. In this work, we show from a different angle that such fragility similarly occurs if the graph contains a few bad-actor nodes, which compromise a trained graph neural network through flipping the connections to any targeted victim. Worse, the bad actors found for one graph model severely compromise other models as well. We call the bad actors ``anchor nodes'' and propose an algorithm, named GUA, to identify them. Thorough empirical investigations suggest an interesting finding that the anchor nodes often belong to the same class; and they also corroborate the intuitive trade-off between the number of anchor nodes and the attack success rate. For the dataset Cora which contains 2708 nodes, as few as six anchor nodes will result in an attack success rate higher than 80\% for GCN and other three models.

cs.LG↗

arXiv2021

Instantons and Annular Khovanov Homology

In this paper, we introduce the annular instanton Floer homology which is defined for links in a thickened annulus. It is an analogue of the annular Khovanov homology. A spectral sequence whose second page is the annular Khovanov homology and which converges to the annular instanton Floer homology is constructed. As an application of this spectral sequence, we prove that the annular Khovanov homology detects the unlink in the thickened annulus (assuming all the components are null-homologous). Another application is a new proof of Grigsby and Ni's result that tangle Khovanov homology distinguishes braids from other tangles.

math.GT↗

arXiv2021

Abnormal Staebler-Wronski effect of amorphous silicon

Great achievements in last five years, such as record-efficient amorphous/crystalline silicon heterojunction (SHJ) solar cells and cutting-edge perovskite/SHJ tandem solar cells, place hydrogenated amorphous silicon (a-Si:H) at the forefront of emerging photovoltaics. Due to the extremely low doping efficiency of trivalent boron (B) in amorphous tetravalent silicon, light harvesting of aforementioned devices are limited by their fill factors (FF), which is a direct metric of the charge carrier transport. It is challenging but crucial to develop highly conductive doped a-Si:H for minimizing the FF losses. Here we report intensive light soaking can efficiently boost the dark conductance of B-doped a-Si:H "thin" films, which is an abnormal Staebler-Wronski effect. By implementing this abnormal effect to SHJ solar cells, we achieve a certificated power conversion efficiency (PCE) of 25.18% (26.05% on designated area) with FF of 85.42% on a 244.63-cm2 wafer. This PCE is one of the highest reported values for total-area "top/rear" contact silicon solar cells. The FF reaches 98.30 per cent of its Shockley-Queisser limit.

physics.app-ph↗