arXiv subjects

Jing Li

Publications and source records attributed to Jing Li.

At least 523 records · Page 29Linked to original sources

arXiv2022

Comprehensive Demonstration of Spin-Hall Hanle Effects in Epitaxial Pt Thin Films

We demonstrate a nonlinear Hall effect due to the boundary spin accumulation in Pt films grown on Al2O3 substrates. This Hall effect and the previously demonstrated Hanle magnetoresistance provide a complete picture of the spin-precession control of the spin and charge transport at the boundary of a spin-orbit coupled material, which we refer to as spin-Hall Hanle effects (SHHE). We also show that the SHHE can be employed to measure the spin diffusion length, the spin-Hall angle, and the spin relaxation time of heavy metal without the need of magnetic interface or the input from other measurements. The comprehensive demonstration of SHHE in such a simple system suggests they may be ubiquitous and needs to be considered for unravelling the spin and charge transport in more complex thin film structures of spin-orbit coupled materials.

cond-mat.mtrl-sci↗

arXiv2022

Fast transport of Bose-Einstein condensates in anharmonic traps

We present a method to transport Bose-Einstein condensates (BECs) in anharmonic traps and in the presence of atom-atom interactions in short times without residual excitation. Using a combination of a variational approach and inverse engineering methods, we derive a set of Ermakov-like equations that take into account the coupling between the center of mass motion and the breathing mode. By an appropriate inverse engineering strategy of those equations, we then design the trap trajectory to achieve the desired boundary conditions. Numerical examples for cubic or quartic anharmonicities are provided for fast and high-fidelity transport of BECs. Potential applications are atom interferometry and quantum information processing.

cond-mat.quant-gas↗

arXiv2022

Time Will Change Things: An Empirical Study on Dynamic Language Understanding in Social Media Classification

Language features are ever-evolving in the real-world social media environment. Many trained models in natural language understanding (NLU), ineffective in semantic inference for unseen features, might consequently struggle with the deteriorating performance in dynamicity. To address this challenge, we empirically study social media NLU in a dynamic setup, where models are trained on the past data and test on the future. It better reflects the realistic practice compared to the commonly-adopted static setup of random data split. To further analyze model adaption to the dynamicity, we explore the usefulness of leveraging some unlabeled data created after a model is trained. The performance of unsupervised domain adaption baselines based on auto-encoding and pseudo-labeling and a joint framework coupling them both are examined in the experiments. Substantial results on four social media tasks imply the universally negative effects of evolving environments over classification accuracy, while auto-encoding and pseudo-labeling collaboratively show the best robustness in dynamicity.

cs.CL↗

arXiv2022

A Simple Single-Scale Vision Transformer for Object Localization and Instance Segmentation

This work presents a simple vision transformer design as a strong baseline for object localization and instance segmentation tasks. Transformers recently demonstrate competitive performance in image classification tasks. To adopt ViT to object detection and dense prediction tasks, many works inherit the multistage design from convolutional networks and highly customized ViT architectures. Behind this design, the goal is to pursue a better trade-off between computational cost and effective aggregation of multiscale global contexts. However, existing works adopt the multistage architectural design as a black-box solution without a clear understanding of its true benefits. In this paper, we comprehensively study three architecture design choices on ViT -- spatial reduction, doubled channels, and multiscale features -- and demonstrate that a vanilla ViT architecture can fulfill this goal without handcrafting multiscale features, maintaining the original ViT design philosophy. We further complete a scaling rule to optimize our model's trade-off on accuracy and computation cost / model size. By leveraging a constant feature resolution and hidden size throughout the encoder blocks, we propose a simple and compact ViT architecture called Universal Vision Transformer (UViT) that achieves strong performance on COCO object detection and instance segmentation tasks.

cs.CV↗

arXiv2022

On genuine entanglement for tripartite systems

We investigate the genuine entanglement in tripartite systems based on partial transposition and the norm of correlation tensors of the density matrices. We first derive an analytical sufficient criterion to detect genuine entanglement of tripartite qubit quantum states combining with the partial transposition of the density matrices. Then we use the norm of correlation tensors to study genuine entanglement for tripartite qudit quantum states and obtain a genuine entanglement criterion by constructing certain matrices. With detailed examples our results are seen to be able to detect more genuine tripartite entangled states than previous studies.

quant-ph↗

arXiv2022

SPTS: Single-Point Text Spotting

Existing scene text spotting (i.e., end-to-end text detection and recognition) methods rely on costly bounding box annotations (e.g., text-line, word-level, or character-level bounding boxes). For the first time, we demonstrate that training scene text spotting models can be achieved with an extremely low-cost annotation of a single-point for each instance. We propose an end-to-end scene text spotting method that tackles scene text spotting as a sequence prediction task. Given an image as input, we formulate the desired detection and recognition results as a sequence of discrete tokens and use an auto-regressive Transformer to predict the sequence. The proposed method is simple yet effective, which can achieve state-of-the-art results on widely used benchmarks. Most significantly, we show that the performance is not very sensitive to the positions of the point annotation, meaning that it can be much easier to be annotated or even be automatically generated than the bounding box that requires precise positions. We believe that such a pioneer attempt indicates a significant opportunity for scene text spotting applications of a much larger scale than previously possible. The code is available at https://github.com/shannanyinxiang/SPTS.

cs.CV↗

arXiv2022

Global Classical Solutions to the Full Compressible Navier-Stokes System in 3D Exterior Domains

The full compressible Navier-Stokes system (FNS) describing the motion of a viscous, compressible, heat-conductive, and Newtonian polytropic fluid in a three-dimensional (3D) exterior domain is studied. For the initial-boundary-value problem with the slip boundary conditions on the velocity and the Neumann one on the temperature, it is shown that there exists a unique global classical solutions with the initial data which are of small energy but possibly large oscillations. In particular, both the density and temperature are allowed to vanish initially. This is the first result about classical solutions of FNS system in 3D exterior domain.

math.AP↗

arXiv2022

An Efficient Coarse-to-Fine Facet-Aware Unsupervised Summarization Framework based on Semantic Blocks

Unsupervised summarization methods have achieved remarkable results by incorporating representations from pre-trained language models. However, existing methods fail to consider efficiency and effectiveness at the same time when the input document is extremely long. To tackle this problem, in this paper, we proposed an efficient Coarse-to-Fine Facet-Aware Ranking (C2F-FAR) framework for unsupervised long document summarization, which is based on the semantic block. The semantic block refers to continuous sentences in the document that describe the same facet. Specifically, we address this problem by converting the one-step ranking method into the hierarchical multi-granularity two-stage ranking. In the coarse-level stage, we propose a new segment algorithm to split the document into facet-aware semantic blocks and then filter insignificant blocks. In the fine-level stage, we select salient sentences in each block and then extract the final summary from selected sentences. We evaluate our framework on four long document summarization datasets: Gov-Report, BillSum, arXiv, and PubMed. Our C2F-FAR can achieve new state-of-the-art unsupervised summarization results on Gov-Report and BillSum. In addition, our method speeds up 4-28 times more than previous methods.\footnote{\url{https://github.com/xnliang98/c2f-far}}

cs.CL↗

arXiv2022

XPS core-level chemical shift by ab initio many-body theory

X-ray photoemission spectroscopy (XPS) provides direct information on the atomic composition and stoichiometry by measuring core electron binding energies. Moreover, according to the shift of the binding energy, so-called chemical shift, the precise chemical type of bonds can be inferred, which brings additional information on the local structure. In this work, we present a theoretical study of the chemical shift firstly by comparing different theories, from Hartree-Fock (HF) and density-functional theory (DFT) to many-body perturbation theory (MBPT) approaches like the GW approximation and its static version (COHSEX). The accuracy of each theory is assessed by benchmarking against the experiment on the chemical shift of the carbon 1s electron in a set of molecules. More importantly, by decomposing the chemical shift into different contributions according to terms in the total Hamiltonian, the physical origin of the chemical shift is identified as classical electrostatics.

physics.chem-ph↗

arXiv2022

Cross-domain Trajectory Prediction with CTP-Net

Most pedestrian trajectory prediction methods rely on a huge amount of trajectories annotation, which is time-consuming and expensive. Moreover, a well-trained model may not effectively generalize to a new scenario captured by another camera. Therefore, it is desirable to adapt the model trained on an annotated source domain to the target domain. To achieve domain adaptation for trajectory prediction, we propose a Cross-domain Trajectory Prediction Network (CTP-Net). In this framework, encoders are used in both domains to encode the observed trajectories, then their features are aligned by a cross-domain feature discriminator. Further, considering the consistency between the observed and the predicted trajectories, a target domain offset discriminator is utilized to adversarially regularize the future trajectory predictions to be in line with the observed trajectories. Extensive experiments demonstrate the effectiveness of our method on domain adaptation for pedestrian trajectory prediction.

cs.CV↗

arXiv2022

Multi-scale temporal network for continuous sign language recognition

Continuous Sign Language Recognition (CSLR) is a challenging research task due to the lack of accurate annotation on the temporal sequence of sign language data. The recent popular usage is a hybrid model based on "CNN + RNN" for CSLR. However, when extracting temporal features in these works, most of the methods using a fixed temporal receptive field and cannot extract the temporal features well for each sign language word. In order to obtain more accurate temporal features, this paper proposes a multi-scale temporal network (MSTNet). The network mainly consists of three parts. The Resnet and two fully connected (FC) layers constitute the frame-wise feature extraction part. The time-wise feature extraction part performs temporal feature learning by first extracting temporal receptive field features of different scales using the proposed multi-scale temporal block (MST-block) to improve the temporal modeling capability, and then further encoding the temporal features of different scales by the transformers module to obtain more accurate temporal features. Finally, the proposed multi-level Connectionist Temporal Classification (CTC) loss part is used for training to obtain recognition results. The multi-level CTC loss enables better learning and updating of the shallow network parameters in CNN, and the method has no parameter increase and can be flexibly embedded in other models. Experimental results on two publicly available datasets demonstrate that our method can effectively extract sign language features in an end-to-end manner without any prior knowledge, improving the accuracy of CSLR and achieving competitive results.

cs.CV↗

arXiv2022

A Knowledge Distillation-Based Backdoor Attack in Federated Learning

Federated Learning (FL) is a novel framework of decentralized machine learning. Due to the decentralized feature of FL, it is vulnerable to adversarial attacks in the training procedure, e.g. , backdoor attacks. A backdoor attack aims to inject a backdoor into the machine learning model such that the model will make arbitrarily incorrect behavior on the test sample with some specific backdoor trigger. Even though a range of backdoor attack methods of FL has been introduced, there are also methods defending against them. Many of the defending methods utilize the abnormal characteristics of the models with backdoor or the difference between the models with backdoor and the regular models. To bypass these defenses, we need to reduce the difference and the abnormal characteristics. We find a source of such abnormality is that backdoor attack would directly flip the label of data when poisoning the data. However, current studies of the backdoor attack in FL are not mainly focus on reducing the difference between the models with backdoor and the regular models. In this paper, we propose Adversarial Knowledge Distillation(ADVKD), a method combine knowledge distillation with backdoor attack in FL. With knowledge distillation, we can reduce the abnormal characteristics in model result from the label flipping, thus the model can bypass the defenses. Compared to current methods, we show that ADVKD can not only reach a higher attack success rate, but also successfully bypass the defenses when other methods fails. To further explore the performance of ADVKD, we test how the parameters affect the performance of ADVKD under different scenarios. According to the experiment result, we summarize how to adjust the parameter for better performance under different scenarios. We also use several methods to visualize the effect of different attack and explain the effectiveness of ADVKD.

cs.LG↗

arXiv2022

Recognition of Handwritten Chinese Text by Segmentation: A Segment-annotation-free Approach

Online and offline handwritten Chinese text recognition (HTCR) has been studied for decades. Early methods adopted oversegmentation-based strategies but suffered from low speed, insufficient accuracy, and high cost of character segmentation annotations. Recently, segmentation-free methods based on connectionist temporal classification (CTC) and attention mechanism, have dominated the field of HCTR. However, people actually read text character by character, especially for ideograms such as Chinese. This raises the question: are segmentation-free strategies really the best solution to HCTR? To explore this issue, we propose a new segmentation-based method for recognizing handwritten Chinese text that is implemented using a simple yet efficient fully convolutional network. A novel weakly supervised learning method is proposed to enable the network to be trained using only transcript annotations; thus, the expensive character segmentation annotations required by previous segmentation-based methods can be avoided. Owing to the lack of context modeling in fully convolutional networks, we propose a contextual regularization method to integrate contextual information into the network during the training stage, which can further improve the recognition performance. Extensive experiments conducted on four widely used benchmarks, namely CASIA-HWDB, CASIA-OLHWDB, ICDAR2013, and SCUT-HCCDoc, show that our method significantly surpasses existing methods on both online and offline HCTR, and exhibits a considerably higher inference speed than CTC/attention-based approaches.

cs.CV↗

arXiv2022

Saliency in Augmented Reality

With the rapid development of multimedia technology, Augmented Reality (AR) has become a promising next-generation mobile platform. The primary theory underlying AR is human visual confusion, which allows users to perceive the real-world scenes and augmented contents (virtual-world scenes) simultaneously by superimposing them together. To achieve good Quality of Experience (QoE), it is important to understand the interaction between two scenarios, and harmoniously display AR contents. However, studies on how this superimposition will influence the human visual attention are lacking. Therefore, in this paper, we mainly analyze the interaction effect between background (BG) scenes and AR contents, and study the saliency prediction problem in AR. Specifically, we first construct a Saliency in AR Dataset (SARD), which contains 450 BG images, 450 AR images, as well as 1350 superimposed images generated by superimposing BG and AR images in pair with three mixing levels. A large-scale eye-tracking experiment among 60 subjects is conducted to collect eye movement data. To better predict the saliency in AR, we propose a vector quantized saliency prediction method and generalize it for AR saliency prediction. For comparison, three benchmark methods are proposed and evaluated together with our proposed method on our SARD. Experimental results demonstrate the superiority of our proposed method on both of the common saliency prediction problem and the AR saliency prediction problem over benchmark methods. Our dataset and code are available at: https://github.com/DuanHuiyu/ARSaliency.

cs.CV↗

arXiv2022

Testing the seesaw mechanisms via displaced right-handed neutrinos from a light scalar at the HL-LHC

We investigate the pair production of right-handed neutrinos from the decay of a light $B-L$ scalar in the $U(1)_{B-L}$ model. The $B-L$ scalar mixes to the SM Higgs, and the physical scalar is required to be lighter than the observed Higgs. The produced right-handed neutrinos are predicted to be long-lived according to the type-I seesaw mechanism, and yield potentially distinct signatures such as displaced vertex and time-delayed leptons at the CMS/ATLAS/LHCb, as well as signatures at the far detectors including the CODEX-b, FACET, FASER, MoEDAL-MAPP and MATHUSLA. We analyze the sensitivity reach at the HL-LHC for the right-handed neutrinos with masses of 2.5 $\sim$ 30 GeV, showing that the active-sterile mixing to muons can be probed to $V_{μN} \sim 10^{-5}$ at the CMS/ATLAS/LHCb using the displaced vertex searches, and one magnitude lower at the MATHUSLA/CMS using time-delayed leptons searches, reaching the parameter space interesting for type-I seesaw mechanisms.

hep-ph↗

arXiv2022

Rethinking Attention-Model Explainability through Faithfulness Violation Test

Attention mechanisms are dominating the explainability of deep models. They produce probability distributions over the input, which are widely deemed as feature-importance indicators. However, in this paper, we find one critical limitation in attention explanations: weakness in identifying the polarity of feature impact. This would be somehow misleading -- features with higher attention weights may not faithfully contribute to model predictions; instead, they can impose suppression effects. With this finding, we reflect on the explainability of current attention-based techniques, such as Attentio$\odot$Gradient and LRP-based attention explanations. We first propose an actionable diagnostic methodology (henceforth faithfulness violation test) to measure the consistency between explanation weights and the impact polarity. Through the extensive experiments, we then show that most tested explanation methods are unexpectedly hindered by the faithfulness violation issue, especially the raw attention. Empirical analyses on the factors affecting violation issues further provide useful observations for adopting explanation methods in attention models.

cs.LG↗

arXiv2022

Continuous Sign Language Recognition via Temporal Super-Resolution Network

Aiming at the problem that the spatial-temporal hierarchical continuous sign language recognition model based on deep learning has a large amount of computation, which limits the real-time application of the model, this paper proposes a temporal super-resolution network(TSRNet). The data is reconstructed into a dense feature sequence to reduce the overall model computation while keeping the final recognition accuracy loss to a minimum. The continuous sign language recognition model(CSLR) via TSRNet mainly consists of three parts: frame-level feature extraction, time series feature extraction and TSRNet, where TSRNet is located between frame-level feature extraction and time-series feature extraction, which mainly includes two branches: detail descriptor and rough descriptor. The sparse frame-level features are fused through the features obtained by the two designed branches as the reconstructed dense frame-level feature sequence, and the connectionist temporal classification(CTC) loss is used for training and optimization after the time-series feature extraction part. To better recover semantic-level information, the overall model is trained with the self-generating adversarial training method proposed in this paper to reduce the model error rate. The training method regards the TSRNet as the generator, and the frame-level processing part and the temporal processing part as the discriminator. In addition, in order to unify the evaluation criteria of model accuracy loss under different benchmarks, this paper proposes word error rate deviation(WERD), which takes the error rate between the estimated word error rate (WER) and the reference WER obtained by the reconstructed frame-level feature sequence and the complete original frame-level feature sequence as the WERD. Experiments on two large-scale sign language datasets demonstrate the effectiveness of the proposed model.

cs.CV↗

arXiv2022

Global Existence of Classical Solutions to Full Compressible Navier-Stokes System with Large Oscillations and Vacuum in 3D Bounded Domains

The full compressible Navier-Stokes system describing the motion of a viscous, compressible, heat-conductive, and Newtonian polytropic fluid is studied in a three-dimensional simply connected bounded domain with smooth boundary having a finite number of two-dimensional connected components. For the initial-boundary-value problem with slip boundary conditions on the velocity and Neumann boundary one on the temperature, the global existence of classical and weak solutions which are of small energy but possibly large oscillations is established. In particular, both the density and temperature are allowed to vanish initially. Finally, the exponential stability of the density, velocity, and temperature is also obtained. Moreover, it is shown that for the classical solutions, the oscillation of the density will grow unboundedly in the long run with an exponential rate provided vacuum appears (even at a point) initially. This is the first result concerning the global existence of classical solutions to the full compressible Navier-Stokes equations with vacuum in general three-dimensional bounded smooth domains.

math.AP↗