arXiv subjects

Hui Jiang

Publications and source records attributed to Hui Jiang.

At least 55 records · Page 3Linked to original sources

arXiv2022

Ultrafast Two-electron Orbital Swap in Li Initiated by Attosecond pulses

A universal mechanism of ultrafast two-electron orbital swap is discovered through two-photon sequential double ionization of Li. After a $1s$ electron in Li is ionized by absorbing an EUV photon, the other two bound electrons located on two different shells have either parallel or antiparallel spin orientations. In the latter case, these two electrons are in the superposition of the singlet and triplet states with different energies, forming a quantum beat and giving rise to the two-electron orbital swap with a period of several hundred attoseconds. The orbital swap mechanism can be used to manipulate the spin polarization of photoelectron pairs by conceiving the attosecond-pump attosecond-probe strategy, and thus serves as a knob to control spin-resolved multielectron ultrafast dynamics.

physics.atom-ph↗

arXiv2022

The simulation of non-Hermitian disordered system in linear circuits

Non-Hermitian skin effect (NHSE) is a novel phenomenon appearing in non-Hermitian systems. Here, we report the experimental observation of NHSE. Different from the previous non-reciprocal circuit implementation scheme using logic components, we construct our one-dimensional (1D) circuits using linear components only. Besides, we achieve the non-reciprocity by proportionally varying the parameter value of the components. By measuring the voltage response of each site, the information of eigenstates can be mapped out. The results show that the voltage response is always larger on one end of the circuit no matter on which end voltage driving is applied, indicating clearly the presence of the NHSE. Furthermore, we also simulate the interplay of NHSE and Anderson localization (AL) when additional disorder is introduced. Upon increasing the disorder strength, we observe the transformation from the skin effect phase to the localized phase. In the regime of skin effect phase, the eigenstates are all localized at one edge while eigenstates are affected by the voltage supply input in localized phase. Our findings unveil a possible new route for simulation of topological phenomena in non-Hermitian systems.

cond-mat.dis-nn↗

arXiv2022

Modeling dynamic volatility under uncertain environment with fuzziness and randomness

The problem related to predicting dynamic volatility in financial market plays a crucial role in many contexts. We build a new generalized Barndorff-Nielsen and Shephard (BN-S) model suitable for uncertain environment with fuzziness and randomness. This new model considers the delay phenomenon between price fluctuation and volatility changes, solves the problem of the lack of long-range dependence of classic models. Through the experiment of Dow Jones futures price, we find that compared with the classical model, this method effectively combines the uncertain environmental characteristics, which makes the prediction of dynamic volatility has more ideal performance.

q-fin.MF↗

arXiv2022

Towards Robust k-Nearest-Neighbor Machine Translation

k-Nearest-Neighbor Machine Translation (kNN-MT) becomes an important research direction of NMT in recent years. Its main idea is to retrieve useful key-value pairs from an additional datastore to modify translations without updating the NMT model. However, the underlying retrieved noisy pairs will dramatically deteriorate the model performance. In this paper, we conduct a preliminary study and find that this problem results from not fully exploiting the prediction of the NMT model. To alleviate the impact of noise, we propose a confidence-enhanced kNN-MT model with robust training. Concretely, we introduce the NMT confidence to refine the modeling of two important components of kNN-MT: kNN distribution and the interpolation weight. Meanwhile we inject two types of perturbations into the retrieved pairs for robust training. Experimental results on four benchmark datasets demonstrate that our model not only achieves significant improvements over current kNN-MT models, but also exhibits better robustness. Our code is available at https://github.com/DeepLearnXMU/Robust-knn-mt.

cs.CL↗

arXiv2022

Kullback-Leibler-Based Discrete Failure Time Models for Integration of Published Prediction Models with New Time-To-Event Dataset

Prediction of time-to-event data often suffers from rare event rates, small sample sizes, high dimensionality and low signal-to-noise ratios. Incorporating published prediction models from large-scale studies is expected to improve the performance of prognosis prediction on internal individual-level time-to-event data. However, existing integration approaches typically assume that underlying distributions from the external and internal data sources are similar, which is often invalid. To account for challenges including heterogeneity, data sharing, and privacy constraints, we propose a discrete failure time modeling procedure, which utilizes a discrete hazard-based Kullback-Leibler discriminatory information measuring the discrepancy between the published models and the internal dataset. Simulations show the advantage of the proposed method compared with those solely based on the internal data or published models. We apply the proposed method to improve prediction performance on a kidney transplant dataset from a local hospital by integrating this small-scale dataset with published survival models obtained from the national transplant registry.

stat.ME↗

arXiv2022

DavarOCR: A Toolbox for OCR and Multi-Modal Document Understanding

This paper presents DavarOCR, an open-source toolbox for OCR and document understanding tasks. DavarOCR currently implements 19 advanced algorithms, covering 9 different task forms. DavarOCR provides detailed usage instructions and the trained models for each algorithm. Compared with the previous opensource OCR toolbox, DavarOCR has relatively more complete support for the sub-tasks of the cutting-edge technology of document understanding. In order to promote the development and application of OCR technology in academia and industry, we pay more attention to the use of modules that different sub-domains of technology can share. DavarOCR is publicly released at https://github.com/hikopensource/Davar-Lab-OCR.

cs.CV↗

arXiv2022

One-dimensional quasi bound states in the continuum in the ω~k space for nonlinear optical applications

The phenomenon of bound state in the continuum (BIC) with infinite quality factor and lifetime has emerged in recent years in photonics as a new tool of manipulating light-matter interactions. However, most of the investigated structures only support BIC resonances at very few discrete points in the w~k space. Even when the BIC is switched to a quasi-BIC(QBIC) resonance through perturbation, its frequency will still be located within a narrow spectral band close to that of the original BIC, restricting their applications in many fields where random or multiple input frequencies beyond the narrow band are required. In this work, we demonstrate that a new set of QBIC resonances can be supported by making use of a special binary grating consisting of two alternatingly aligned ridge arrays with the same period and zero-approaching ridge width difference on a slab waveguide. These QBIC resonances are distributed continuously over a broad band along a line in the w~k space and can thus be considered as one-dimensional QBICs. With the Q factors generally affected by the ridge difference, it is now possible to choose arbitrarily any frequencies on the dispersion line to achieve significantly enhanced light-matter interactions, facilitating many applications where multiple input wavelengths are required, e.g. sum or difference frequency generations in nonlinear optics.

physics.optics↗

arXiv2022

A Pattern Matching-Based Framework for Quantum Circuit Rewriting

The realization of quantum algorithms relies on specific quantum compilations according to the underlying quantum processors. However, there are various ways to physically implement qubits in different physical devices and manipulate those qubits. These differences lead to different communication methods and connection topologies, with each vendor implementing its own set of primitive gates. Therefore, quantum circuits have to be rewritten or transformed in order to be transplanted from one platform to another. We propose a pattern matching-based framework for rewriting quantum circuits, called QRewriting. It takes advantage of a new representation of quantum circuits using symbol sequences. Unlike the traditional way of using directed acyclic graphs, the new representation allows us to easily identify the patterns that appear non-consecutively but reducible. Then, we convert the problem of pattern matching into that of finding distinct subsequences and propose a polynomial-time dynamic programming-based pattern matching and replacement algorithm. We develop a rule library for basic optimizations and use it to rewrite the Arithmetic and Toffoli benchmarks from the $G_{IBM}$ gate set to the $G_{Sur}$ gate set. Compared with the existing tool PaF, QRewriting obtains an improvement of reducing depths (resp. gate counts) by 29\% (resp. 14\%).

quant-ph↗

arXiv2022

Functional large deviations for Stroock's approximation to a class of Gaussian processes with application to small noise diffusions

Letting~$N=\left\{N(t), t\geq0\right\}$ be a standard Poisson process, Stroock~ \cite{Stroock-1981} constructed a family of continuous processes by $$Θ_ε(t)=\int_0^tθ_ε(r)dr, \ \ \ \ \ 0 \le t \le 1,$$ where $θ_ε(r)=\frac{1}ε(-1)^{N(ε^{-2}r)}$, and proved that it weakly converges to a standard Brownian motion under the continuous function topology. We establish the functional large deviations principle (LDP) for the approximations of a class of Gaussian processes constructed by integrals over $Θ_ε(t)$, and find the explicit form for rate function. As an application, we consider the following (non-Markovian) stochastic differential equation \begin{equation*} \begin{aligned} X^ε(t) &=x_{0}+\int^{t}_{0}b(X^ε(s))ds+λ(ε)\int^{t}_{0}σ(X^ε(s))dΘ_ε(s), \end{aligned} \end{equation*} where $b$ and $σ$ are both Lipschitz functions, and establish its Freidlin-Wentzell type LDP as $ε\rightarrow 0$. The rate function indicates a phase transition phenomenon as $λ(ε)$ moves from one region to the other.

math.PR↗

arXiv2022

Analysis of stock index with a generalized BN-S model: an approach based on machine learning and fuzzy parameters

In this paper we implement a combination of data-science and fuzzy theory to improve the classical Barndorff-Nielsen and Shephard model, and implement this to analyze the S&P 500 index. We pre-process the index data based on fuzzy theory. After that, S&P 500 stock index data for the past ten years are analyzed, and a deterministic parameter is extracted using various machine and deep learning methods. The results show that the new model, where fuzzy parameters are incorporated, can incorporate the long-term dependence in the classical Barndorff-Nielsen and Shephard model. The modification is based on only a few changes compared to the classical model. At the same time, the resulting analysis effectively captures the stochastic dynamics of the stock index time series.

q-fin.MF↗

arXiv2021

Filling up complex spectral regions through non-Hermitian disordered chains

Eigenspectra that fill regions in the complex plane have been intriguing to many, inspiring research from random matrix theory to esoteric semi-infinite bounded non-Hermitian lattices. In this work, we propose a simple and robust ansatz for constructing models whose eigenspectra fill up generic prescribed regions. Our approach utilizes specially designed non-Hermitian random couplings that allow the co-existence of eigenstates with a continuum of localization lengths, mathematically emulating the effects of semi-infinite boundaries. While some of these couplings are necessarily long-ranged, they are still far more local than what is possible with known random matrix ensembles. Our ansatz can be feasibly implemented in physical platforms such as classical and quantum circuits, and harbors very high tolerance to imperfections due to its stochastic nature.

cond-mat.mes-hall↗

arXiv2021

Reciprocal Feature Learning via Explicit and Implicit Tasks in Scene Text Recognition

Text recognition is a popular topic for its broad applications. In this work, we excavate the implicit task, character counting within the traditional text recognition, without additional labor annotation cost. The implicit task plays as an auxiliary branch for complementing the sequential recognition. We design a two-branch reciprocal feature learning framework in order to adequately utilize the features from both the tasks. Through exploiting the complementary effect between explicit and implicit tasks, the feature is reliably enhanced. Extensive experiments on 7 benchmarks show the advantages of the proposed methods in both text recognition and the new-built character counting tasks. In addition, it is convenient yet effective to equip with variable networks and tasks. We offer abundant ablation studies, generalizing experiments with deeper understanding on the tasks. Code is available.

cs.CV↗

arXiv2021

Quantum Circuit Transformation Based on Tabu Search

The goal of quantum circuit transformation is to map a logical circuit to a physical device by inserting additional gates as few as possible in an acceptable amount of time. We present an effective approach called TSA to construct the mapping. It consists of two key steps: one makes use of a combined subgraph isomorphism and completion to initialize some candidate mappings, the other dynamically modifies the mappings by using tabu search-based adjustment. Our experiments show that, compared with state-of-the-art methods GA, SABRE and FiDLS proposed in the literature, TSA can generate mappings with a smaller number of additional gates and it has a better scalability for large-scale circuits.

quant-ph↗

arXiv2021

Exploring Dynamic Selection of Branch Expansion Orders for Code Generation

Due to the great potential in facilitating software development, code generation has attracted increasing attention recently. Generally, dominant models are Seq2Tree models, which convert the input natural language description into a sequence of tree-construction actions corresponding to the pre-order traversal of an Abstract Syntax Tree (AST). However, such a traversal order may not be suitable for handling all multi-branch nodes. In this paper, we propose to equip the Seq2Tree model with a context-based Branch Selector, which is able to dynamically determine optimal expansion orders of branches for multi-branch nodes. Particularly, since the selection of expansion orders is a non-differentiable multi-step operation, we optimize the selector through reinforcement learning, and formulate the reward function as the difference of model losses obtained through different expansion orders. Experimental results and in-depth analysis on several commonly-used datasets demonstrate the effectiveness and generality of our approach. We have released our code at https://github.com/DeepLearnXMU/CG-RL.

cs.CL↗

arXiv2021

Enhanced Aspect-Based Sentiment Analysis Models with Progressive Self-supervised Attention Learning

In aspect-based sentiment analysis (ABSA), many neural models are equipped with an attention mechanism to quantify the contribution of each context word to sentiment prediction. However, such a mechanism suffers from one drawback: only a few frequent words with sentiment polarities are tended to be taken into consideration for final sentiment decision while abundant infrequent sentiment words are ignored by models. To deal with this issue, we propose a progressive self-supervised attention learning approach for attentional ABSA models. In this approach, we iteratively perform sentiment prediction on all training instances, and continually learn useful attention supervision information in the meantime. During training, at each iteration, context words with the highest impact on sentiment prediction, identified based on their attention weights or gradients, are extracted as words with active/misleading influence on the correct/incorrect prediction for each instance. Words extracted in this way are masked for subsequent iterations. To exploit these extracted words for refining ABSA models, we augment the conventional training objective with a regularization term that encourages ABSA models to not only take full advantage of the extracted active context words but also decrease the weights of those misleading words. We integrate the proposed approach into three state-of-the-art neural ABSA models. Experiment results and in-depth analyses show that our approach yields better attention results and significantly enhances the performance of all three models. We release the source code and trained models at https://github.com/DeepLearnXMU/PSSAttention.

cs.CL↗

arXiv2020

Topological invariants, zero mode edge states and finite size effect for a generalized non-reciprocal Su-Schrieffer-Heeger model

Intriguing issues in one-dimensional non-reciprocal topological systems include the breakdown of usual bulk-edge correspondence and the occurrence of half-integer topological invariants. In order to understand these unusual topological properties, we investigate the topological phase diagrams and the zero-mode edge states of a generalized non-reciprocal Su-Schrieffer-Heeger model, based on some analytical results. Meanwhile, we provide a concise geometrical interpretation of the bulk topological invariants in terms of two independent winding numbers and also give an alternative interpretation related to the linking properties of curves in three-dimensional space. For the system under the open boundary condition, we construct analytically the wavefunctions of zero-mode edge states by properly considering a hidden symmetry of the system and the normalization condition with the use of biorthogonal eigenvectors. Our analytical results directly give the phase boundary for the existence of zero-mode edge states and unveil clearly the evolution behavior of edge states. In comparison with results via exact diagonalization of finite-size systems, we find our analytical results agree with the numerical results very well.

cond-mat.mes-hall↗

arXiv2020

Match$^2$: A Matching over Matching Model for Similar Question Identification

Community Question Answering (CQA) has become a primary means for people to acquire knowledge, where people are free to ask questions or submit answers. To enhance the efficiency of the service, similar question identification becomes a core task in CQA which aims to find a similar question from the archived repository whenever a new question is asked. However, it has long been a challenge to properly measure the similarity between two questions due to the inherent variation of natural language, i.e., there could be different ways to ask a same question or different questions sharing similar expressions. To alleviate this problem, it is natural to involve the existing answers for the enrichment of the archived questions. Traditional methods typically take a one-side usage, which leverages the answer as some expanded representation of the corresponding question. Unfortunately, this may introduce unexpected noises into the similarity computation since answers are often long and diverse, leading to inferior performance. In this work, we propose a two-side usage, which leverages the answer as a bridge of the two questions. The key idea is based on our observation that similar questions could be addressed by similar parts of the answer while different questions may not. In other words, we can compare the matching patterns of the two questions over the same answer to measure their similarity. In this way, we propose a novel matching over matching model, namely Match$^2$, which compares the matching patterns between two question-answer pairs for similar question identification. Empirical experiments on two benchmark datasets demonstrate that our model can significantly outperform previous state-of-the-art methods on the similar question identification task.

cs.IR↗

arXiv2020

On Approximation Capabilities of ReLU Activation and Softmax Output Layer in Neural Networks

In this paper, we have extended the well-established universal approximator theory to neural networks that use the unbounded ReLU activation function and a nonlinear softmax output layer. We have proved that a sufficiently large neural network using the ReLU activation function can approximate any function in $L^1$ up to any arbitrary precision. Moreover, our theoretical results have shown that a large enough neural network using a nonlinear softmax output layer can also approximate any indicator function in $L^1$, which is equivalent to mutually-exclusive class labels in any realistic multiple-class pattern classification problems. To the best of our knowledge, this work is the first theoretical justification for using the softmax output layers in neural networks for pattern classification.

cs.LG↗