Searcharxiv⌕ Search

arXiv subjects

Li Yang

Publications and source records attributed to Li Yang.

At least 217 records · Page 12Linked to original sources

Observation of the out-of-plane polarized spin current from CVD grown WTe2

Weyl semimetal Td-phase WTe2 possesses the spin-resolved band structure with strong spin-orbit coupling, holding promises as a useful spin source material. The noncentrosymmetric crystalline structure of Td-WTe2 endows the generation of the out-of-plane polarized spin, which is of great interest in magnetic memory applications. Previously, WTe2 was explored in spin devices based on mechanically exfoliated single crystal flakes with a size of micrometers. For practical spintronics applications, it is highly desirable to implement wafer-scale thin films. In this work, we utilize centimeter-scale chemical vapor deposition (CVD)-grown Td-WTe2 thin films and study the spin current generation by the spin torque ferromagnetic resonance technique. We find the in-plane and out-of-plane spin conductivities of 7.36 x 10^3 (h/2e) (ohm-m)^-1 and 1.76 x 10^3 (h/2e) (ohm-m)^-1, respectively, in CVD-growth 5 nm-WTe2. We further demonstrate the current-induced magnetization switching in WTe2/NiFe at room temperature in the domain wall motion regime, which may invigorate potential spintronic device innovations based on Weyl semimetals.

cond-mat.mtrl-sci↗

Diffusion approximation for multi-scale stochastic reaction-diffusion equations

In this paper, we study the diffusion approximation for singularly perturbed stochastic reaction-diffusion equation with a fast oscillating term. The asymptotic limit for the original system is obtained, where an extra Gaussian term appears. Such a term is explicitly given in terms of the solution of Poisson equation in Hilbert space. Moreover, we also obtain the optimal rate of convergence, and the convergence rate is shown not to depend on the regularity of the coefficients of the original system with respect to the fast variable, which coincides with the intuition since the fast component has been totally homogenized out in the limit equation.

math.PR↗

Quantum Key Recovery Attack on SIMON Block Cipher

The quantum security of lightweight block ciphers is receiving more and more attention. However, the existing quantum attacks on lightweight block ciphers mainly focused on the quantum exhaustive search, while the quantum dedicated attacks combined with classical cryptanalysis methods haven't been well studied. In this paper, we study quantum key recovery attack on SIMON block cipher using Quantum Amplitude Amplification algorithm in Q1 model. At first, we reanalyze the quantum circuit complexity of quantum master key exhaustive search on SIMON block cipher. The Clifford gates count is estimated more accurately and the T gate count is reduced. We also reduce the T-depth and Full-depth due to some minor modifications to the circuit. Then, based on the differential cryptanalysis on SIMON32, SIMON48 and SIMON64 given by Biryukov et al. in FSE 2014, we give quantum round key recovery attacks on these SIMON variants and analyze quantum circuit complexity separately. We take the quantum attack on 19-round SIMON32/64 for an example and design the quantum circuit of the key recovery process. The two phases of this attack could be regarded as two QAA instances separately, and the first QAA instance consists of four sub-QAA instances. We conclude that the encryption complexity and circuit complexity of quantum dedicated attacks on 19-round SIMON32/64, 19-round SIMON 48 and 26-round SIMON64/128 are both lower than those of the quantum exhaustive search on these variants separately. Our work firstly studies the quantum dedicated attack on SIMON block cipher from the perspective of quantum circuit complexity, which is a more fine-grained analysis of quantum dedicated attacks' complexity.

quant-ph↗

MTH-IDS: A Multi-Tiered Hybrid Intrusion Detection System for Internet of Vehicles

Modern vehicles, including connected vehicles and autonomous vehicles, nowadays involve many electronic control units connected through intra-vehicle networks to implement various functionalities and perform actions. Modern vehicles are also connected to external networks through vehicle-to-everything technologies, enabling their communications with other vehicles, infrastructures, and smart devices. However, the improving functionality and connectivity of modern vehicles also increase their vulnerabilities to cyber-attacks targeting both intra-vehicle and external networks due to the large attack surfaces. To secure vehicular networks, many researchers have focused on developing intrusion detection systems (IDSs) that capitalize on machine learning methods to detect malicious cyber-attacks. In this paper, the vulnerabilities of intra-vehicle and external networks are discussed, and a multi-tiered hybrid IDS that incorporates a signature-based IDS and an anomaly-based IDS is proposed to detect both known and unknown attacks on vehicular networks. Experimental results illustrate that the proposed system can detect various types of known attacks with 99.99% accuracy on the CAN-intrusion-dataset representing the intra-vehicle network data and 99.88% accuracy on the CICIDS2017 dataset illustrating the external vehicular network data. For the zero-day attack detection, the proposed system achieves high F1-scores of 0.963 and 0.800 on the above two datasets, respectively. The average processing time of each data packet on a vehicle-level machine is less than 0.6 ms, which shows the feasibility of implementing the proposed system in real-time vehicle systems. This emphasizes the effectiveness and efficiency of the proposed IDS.

cs.CR↗

Testing for Treatment Effect in Covariate-Adaptive Randomized Clinical Trials with Generalized Linear Models and Omitted Covariates

Concerns have been expressed over the validity of statistical inference under covariate-adaptive randomization despite the extensive use in clinical trials. In the literature, the inferential properties under covariate-adaptive randomization have been mainly studied for continuous responses; in particular, it is well known that the usual two sample t-test for treatment effect is typically conservative, in the sense that the actual test size is smaller than the nominal level. This phenomenon of invalid tests has also been found for generalized linear models without adjusting for the covariates and are sometimes more worrisome due to inflated Type I error. The purpose of this study is to examine the unadjusted test for treatment effect under generalized linear models and covariate-adaptive randomization. For a large class of covariate-adaptive randomization methods, we obtain the asymptotic distribution of the test statistic under the null hypothesis and derive the conditions under which the test is conservative, valid, or anti-conservative. Several commonly used generalized linear models, such as logistic regression and Poisson regression, are discussed in detail. An adjustment method is also proposed to achieve a valid size based on the asymptotic results. Numerical studies confirm the theoretical findings and demonstrate the effectiveness of the proposed adjustment method.

stat.ME↗

A Lightweight Concept Drift Detection and Adaptation Framework for IoT Data Streams

In recent years, with the increasing popularity of "Smart Technology", the number of Internet of Things (IoT) devices and systems have surged significantly. Various IoT services and functionalities are based on the analytics of IoT streaming data. However, IoT data analytics faces concept drift challenges due to the dynamic nature of IoT systems and the ever-changing patterns of IoT data streams. In this article, we propose an adaptive IoT streaming data analytics framework for anomaly detection use cases based on optimized LightGBM and concept drift adaptation. A novel drift adaptation method named Optimized Adaptive and Sliding Windowing (OASW) is proposed to adapt to the pattern changes of online IoT data streams. Experiments on two public datasets show the high accuracy and efficiency of our proposed adaptive LightGBM model compared against other state-of-the-art approaches. The proposed adaptive LightGBM model can perform continuous learning and drift adaptation on IoT data streams without human intervention.

cs.LG↗

PT-symmetry enabled spin circular photogalvanic effect in antiferromagnetic insulators

The short timescale spin dynamics in antiferromagnets is an attractive feature from the standpoint of ultrafast spintronics. Yet generating highly polarized spin currents at room temperature remains a fundamental challenge for antiferromagnets. We propose a spin circular photogalvanic effect (spin-CPGE), in which circularly polarized light can produce a spin current without net charge current at room temperature, through an "injection-current-like" mechanism in parity-time(PT)-symmetric antiferromagnetic (AFM) insulators. We demonstrate this effect by first-principles simulations of bilayer CrI3 and room-temperature AFM hematite. Our calculations show that the spin-CPGE is significant, and the magnitude of spin photo-current is comparable with the widely observed charge photocurrent in ferroelectric materials. Interestingly, this spin photocurrent is not sensitive to spin-orbit interactions, which were regarded as fundamental mechanisms for generating spin current. Given the fast response of light-matter interactions, large energy scale, and insensitivity to spin-orbit interactions, our work gives hope to realizing a fast-dynamic and temperature-robust pure spin current in a wide range of PT-symmetric AFM materials, including weak-relativistic magnetic insulators and topological axion insulators.

cond-mat.mtrl-sci↗

Flat-Bands-Enabled Triplet Excitonic Insulator in a Di-atomic Kagome Lattice

The excitonic insulator (EI) state is a strongly correlated many-body ground state, arising from an instability in the band structure towards exciton formation. We show that the flat valence and conduction bands of a semiconducting diatomic Kagome lattice, as exemplified in a superatomic graphene lattice, can possibly conspire to enable an interesting triplet EI state, based on density functional theory (DFT) calculations combined with many-body GW and Bethe-Salpeter Equation(BSE). Our results indicate that massive carriers in flat bands with highly localized electron and hole wavefunctions significantly reduce the screening and enhance the exchange interaction, leading to an unusually large triplet exciton binding energy (~1.1 eV) exceeding the GW band gap by ~0.2 eV and a large singlet-triplet splitting of ~0.4 eV. Our findings enrich once again the intriguing physics of flat bands and extend the scope of EI materials.

cond-mat.mtrl-sci↗

Adaptive Degradation Process with Deep Learning-Driven Trajectory

Remaining useful life (RUL) estimation is a crucial component in the implementation of intelligent predictive maintenance and health management. Deep neural network (DNN) approaches have been proven effective in RUL estimation due to their capacity in handling high-dimensional non-linear degradation features. However, the applications of DNN in practice face two challenges: (a) online update of lifetime information is often unavailable, and (b) uncertainties in predicted values may not be analytically quantified. This paper addresses these issues by developing a hybrid DNN-based prognostic approach, where a Wiener-based-degradation model is enhanced with adaptive drift to characterize the system degradation. An LSTM-CNN encoder-decoder is developed to predict future degradation trajectories by jointly learning noise coefficients as well as drift coefficients, and adaptive drift is updated via Bayesian inference. A computationally efficient algorithm is proposed for the calculation of RUL distributions. Numerical experiments are presented using turbofan engines degradation data to demonstrate the superior accuracy of RUL prediction of our proposed approach.

stat.ML↗

RA-BNN: Constructing Robust & Accurate Binary Neural Network to Simultaneously Defend Adversarial Bit-Flip Attack and Improve Accuracy

Recently developed adversarial weight attack, a.k.a. bit-flip attack (BFA), has shown enormous success in compromising Deep Neural Network (DNN) performance with an extremely small amount of model parameter perturbation. To defend against this threat, we propose RA-BNN that adopts a complete binary (i.e., for both weights and activation) neural network (BNN) to significantly improve DNN model robustness (defined as the number of bit-flips required to degrade the accuracy to as low as a random guess). However, such an aggressive low bit-width model suffers from poor clean (i.e., no attack) inference accuracy. To counter this, we propose a novel and efficient two-stage network growing method, named Early-Growth. It selectively grows the channel size of each BNN layer based on channel-wise binary masks training with Gumbel-Sigmoid function. Apart from recovering the inference accuracy, our RA-BNN after growing also shows significantly higher resistance to BFA. Our evaluation of the CIFAR-10 dataset shows that the proposed RA-BNN can improve the clean model accuracy by ~2-8 %, compared with a baseline BNN, while simultaneously improving the resistance to BFA by more than 125 x. Moreover, on ImageNet, with a sufficiently large (e.g., 5,000) amount of bit-flips, the baseline BNN accuracy drops to 4.3 % from 51.9 %, while our RA-BNN accuracy only drops to 37.1 % from 60.9 % (9 % clean accuracy improvement).

cs.LG↗

Spatial Attention-based Non-reference Perceptual Quality Prediction Network for Omnidirectional Images

Due to the strong correlation between visual attention and perceptual quality, many methods attempt to use human saliency information for image quality assessment. Although this mechanism can get good performance, the networks require human saliency labels, which is not easily accessible for omnidirectional images (ODI). To alleviate this issue, we propose a spatial attention-based perceptual quality prediction network for non-reference quality assessment on ODIs (SAP-net). To drive our SAP-net, we establish a large-scale IQA dataset of ODIs (IQA-ODI), which is composed of subjective scores of 200 subjects on 1,080 ODIs. In IQA-ODI, there are 120 high quality ODIs as reference, and 960 ODIs with impairments in both JPEG compression and map projection. Without any human saliency labels, our network can adaptively estimate human perceptual quality on impaired ODIs through a self-attention manner, which significantly promotes the prediction performance of quality scores. Moreover, our method greatly reduces the computational complexity in quality assessment task on ODIs. Extensive experiments validate that our network outperforms 9 state-of-the-art methods for quality assessment on ODIs. The dataset and code have been available on \url{ https://github.com/yanglixiaoshen/SAP-Net}.

eess.IV↗

Fast Outage Analysis of Large-scale Production Clouds with Service Correlation Mining

Cloud-based services are surging into popularity in recent years. However, outages, i.e., severe incidents that always impact multiple services, can dramatically affect user experience and incur severe economic losses. Locating the root-cause service, i.e., the service that contains the root cause of the outage, is a crucial step to mitigate the impact of the outage. In current industrial practice, this is generally performed in a bootstrap manner and largely depends on human efforts: the service that directly causes the outage is identified first, and the suspected root cause is traced back manually from service to service during diagnosis until the actual root cause is found. Unfortunately, production cloud systems typically contain a large number of interdependent services. Such a manual root cause analysis is often time-consuming and labor-intensive. In this work, we propose COT, the first outage triage approach that considers the global view of service correlations. COT mines the correlations among services from outage diagnosis data. After learning from historical outages, COT can infer the root cause of emerging ones accurately. We implement COT and evaluate it on a real-world dataset containing one year of data collected from Microsoft Azure, one of the representative cloud computing platforms in the world. Our experimental results show that COT can reach a triage accuracy of 82.1%~83.5%, which outperforms the state-of-the-art triage approach by 28.0%~29.7%.

cs.SE↗

Switchable enhanced spin photocurrent in Rashba and cubic Dresselhaus ferroelectric semiconductors

Generating and controlling spin current (SC) are of central interest in spin physics and applications. To date, the spin-orbit interaction (SOI) is an established pathway to generate SC through the spin-charge current conversion. We predict an efficient spin-light conversion via the Rashba and higher-order cubic Dresselhaus SOIs in ferroelectrics. Different from the known Edelstein effect, where SC is created by the nonequilibrium spin density, our predicted spin-polarized current is from direct interactions between light and unique spin textures generated by SOI in ferroelectrics. Using first-principles simulations, we demonstrate these concepts by calculating the DC spin photocurrent in a prototypical Rashba ferroelectric, α-GeTe. The photo-induced SC is about two orders of magnitude larger than the charge photocurrent. More importantly, we can conveniently switch the direction of SC by an applied electric field via inverting the spin textures. These predictions give hope to generating and controlling light-driven SC via nonvolatile electric-field.

cond-mat.mtrl-sci↗

Big Bird: Transformers for Longer Sequences

Transformers-based models, such as BERT, have been one of the most successful deep learning models for NLP. Unfortunately, one of their core limitations is the quadratic dependency (mainly in terms of memory) on the sequence length due to their full attention mechanism. To remedy this, we propose, BigBird, a sparse attention mechanism that reduces this quadratic dependency to linear. We show that BigBird is a universal approximator of sequence functions and is Turing complete, thereby preserving these properties of the quadratic, full attention model. Along the way, our theoretical analysis reveals some of the benefits of having $O(1)$ global tokens (such as CLS), that attend to the entire sequence as part of the sparse attention mechanism. The proposed sparse attention can handle sequences of length up to 8x of what was previously possible using similar hardware. As a consequence of the capability to handle longer context, BigBird drastically improves performance on various NLP tasks such as question answering and summarization. We also propose novel applications to genomics data.

cs.LG↗

MetaGater: Fast Learning of Conditional Channel Gated Networks via Federated Meta-Learning

While deep learning has achieved phenomenal successes in many AI applications, its enormous model size and intensive computation requirements pose a formidable challenge to the deployment in resource-limited nodes. There has recently been an increasing interest in computationally-efficient learning methods, e.g., quantization, pruning and channel gating. However, most existing techniques cannot adapt to different tasks quickly. In this work, we advocate a holistic approach to jointly train the backbone network and the channel gating which enables dynamical selection of a subset of filters for more efficient local computation given the data input. Particularly, we develop a federated meta-learning approach to jointly learn good meta-initializations for both backbone networks and gating modules, by making use of the model similarity across learning tasks on different nodes. In this way, the learnt meta-gating module effectively captures the important filters of a good meta-backbone network, based on which a task-specific conditional channel gated network can be quickly adapted, i.e., through one-step gradient descent, from the meta-initializations in a two-stage procedure using new samples of that task. The convergence of the proposed federated meta-learning algorithm is established under mild conditions. Experimental results corroborate the effectiveness of our method in comparison to related work.

cs.LG↗

Scalable variational Monte Carlo with graph neural ansatz

Deep neural networks have been shown as a potentially powerful ansatz in variational Monte Carlo for solving quantum many-body problems. We propose two improvements in this direction. The first is graph neural ansatz (GNA), which is a variational wavefunction universal to arbitrary geometry. GNA results in accurate ground-state energies on 2D Kagome lattices, triangular lattices, and randomly connected graphs. Secondly, we design a distributed workflow on multiple accelerators to scale up the computation. We compute Kagome lattices with sizes up to 432 sites on 128 TPU cores. The parameter sharing nature of the GNA also leads to transferability across different system sizes and geometries.

cond-mat.str-el↗

Averaging principle and normal deviations for multi-scale stochastic hyperbolic-parabolic equations

We study the asymptotic behavior of stochastic hyperbolic parabolic equations with slow and fast time scales. Both the strong and weak convergence in the averaging principe are established, which can be viewed as a functional law of large numbers. Then we study the stochastic fluctuations of the original system around its averaged equation. We show that the normalized difference converges weakly to the solution of a linear stochastic wave equation, which is a form of functional central limit theorem. We provide a unified proof for the above convergence by using the Poisson equation in Hilbert spaces. Moreover, sharp rates of convergence are obtained, which are shown not to depend on the regularity of the coefficients in the equation for the fast variable.

math.PR↗

ETC: Encoding Long and Structured Inputs in Transformers

Transformer models have advanced the state of the art in many Natural Language Processing (NLP) tasks. In this paper, we present a new Transformer architecture, Extended Transformer Construction (ETC), that addresses two key challenges of standard Transformer architectures, namely scaling input length and encoding structured inputs. To scale attention to longer inputs, we introduce a novel global-local attention mechanism between global tokens and regular input tokens. We also show that combining global-local attention with relative position encodings and a Contrastive Predictive Coding (CPC) pre-training objective allows ETC to encode structured inputs. We achieve state-of-the-art results on four natural language datasets requiring long and/or structured inputs.

cs.LG↗