arXiv subjects

Shuai Zhao

Publications and source records attributed to Shuai Zhao.

At least 145 records · Page 8Linked to original sources

arXiv2021

Robust self-testing of multipartite GHZ-state measurements in quantum networks

Self-testing is a device-independent examination of quantum devices based on correlations of observed statistics. Motivated by elegant progresses on self-testing strategies for measurements [Phys. Rev. Lett. 121, 250507 (2018)] and for states [New J. Phys. 20, 083041 (2018)], we develop a general self-testing procedure for multipartite generalized GHZ-state measurements. The key step is self-testing all measurement eigenstates for a general N-qubit multipartite GHZ-state measurement. Following our procedure, one only needs to perform local measurements on N-2 chosen parties of the N-partite eigenstate and maintain to achieve the maximal violation of tilted Clauser-Horne-Shimony-Holt (CHSH) Bell inequality for remaining two parties. Moreover, this approach is physically operational from an experimental point of view. It turns out that the existing result for three-qubit GHZ-state measurement is recovered as a special case. Meanwhile, we develop the self-testing method to be robust against certain white noise.

quant-ph↗

arXiv2021

Renormalization and Mixing of Staple-Shaped Wilson Line Operators on the Lattice Revisited

Transverse-momentum-dependent parton distribution functions and wave functions (TMDPDFs/TMDWFs) can be extracted from lattice calculations of appropriate Euclidean matrix elements of staple-shaped Wilson line operators. We investigate the mixing pattern of such operators under lattice renormalization using symmetry considerations. We perform an analysis for operators with all Dirac structures, which reveals mixings that are not present in one-loop lattice perturbation theory calculations. We also present the relevant one-loop matching in a renormalization scheme that does not introduce extra non-perturbative effects at large distances, both for the TMDPDFs and for the TMDWFs. Our results have the potential to greatly facilitate numerical calculations of TMDPDFs and TMDWFs on the lattice.

hep-ph↗

arXiv2021

Learning Dynamic Compact Memory Embedding for Deformable Visual Object Tracking

Recently, template-based trackers have become the leading tracking algorithms with promising performance in terms of efficiency and accuracy. However, the correlation operation between query feature and the given template only exploits accurate target localization, leading to state estimation error especially when the target suffers from severe deformable variations. To address this issue, segmentation-based trackers have been proposed that employ per-pixel matching to improve the tracking performance of deformable objects effectively. However, most of existing trackers only refer to the target features in the initial frame, thereby lacking the discriminative capacity to handle challenging factors, e.g., similar distractors, background clutter, appearance change, etc. To this end, we propose a dynamic compact memory embedding to enhance the discrimination of the segmentation-based deformable visual tracking method. Specifically, we initialize a memory embedding with the target features in the first frame. During the tracking process, the current target features that have high correlation with existing memory are updated to the memory embedding online. To further improve the segmentation accuracy for deformable objects, we employ a point-to-global matching strategy to measure the correlation between the pixel-wise query features and the whole template, so as to capture more detailed deformation information. Extensive evaluations on six challenging tracking benchmarks including VOT2016, VOT2018, VOT2019, GOT-10K, TrackingNet, and LaSOT demonstrate the superiority of our method over recent remarkable trackers. Besides, our method outperforms the excellent segmentation-based trackers, i.e., D3S and SiamMask on DAVIS2017 benchmark.

cs.CV↗

arXiv2021

One-loop structure of parton distribution for the gluon condensate and "zero modes"

We present results for one-loop corrections to the recently introduced "gluon condensate" PDF $F(x)$. In particular, we give expression for the $gg$-part of its evolution kernel. To enforce strict compliance with the gauge invariance requirements, we have used on-shell states for external gluons, and have obtained identical results both in Feynman and light-cone gauges. No "zero mode" $δ(x)$ terms were found for the twist-4 gluon PDF $F(x)$. However a $q^2 δ(x)$ term was found for the $ξ=0$ GPD $F(x,q^2)$ at nonzero momentum transfer $q$. Overall, our results do not agree with the original attempt of one-loop calculations of $F(x)$ for gluon states, which sets alarm warning for calculations that use matrix elements with virtual external gluons and for lattice renormalization procedures based on their results.

hep-ph↗

arXiv2021

FCM: A Fine-grained Comparison Model for Multi-turn Dialogue Reasoning

Despite the success of neural dialogue systems in achieving high performance on the leader-board, they cannot meet users' requirements in practice, due to their poor reasoning skills. The underlying reason is that most neural dialogue models only capture the syntactic and semantic information, but fail to model the logical consistency between the dialogue history and the generated response. Recently, a new multi-turn dialogue reasoning task has been proposed, to facilitate dialogue reasoning research. However, this task is challenging, because there are only slight differences between the illogical response and the dialogue history. How to effectively solve this challenge is still worth exploring. This paper proposes a Fine-grained Comparison Model (FCM) to tackle this problem. Inspired by human's behavior in reading comprehension, a comparison mechanism is proposed to focus on the fine-grained differences in the representation of each response candidate. Specifically, each candidate representation is compared with the whole history to obtain a history consistency representation. Furthermore, the consistency signals between each candidate and the speaker's own history are considered to drive a model to prefer a candidate that is logically consistent with the speaker's history logic. Finally, the above consistency representations are employed to output a ranking list of the candidate responses for multi-turn dialogue reasoning. Experimental results on two public dialogue datasets show that our method obtains higher ranking scores than the baseline models.

cs.CL↗

arXiv2021

Accelerate CNNs from Three Dimensions: A Comprehensive Pruning Framework

Most neural network pruning methods, such as filter-level and layer-level prunings, prune the network model along one dimension (depth, width, or resolution) solely to meet a computational budget. However, such a pruning policy often leads to excessive reduction of that dimension, thus inducing a huge accuracy loss. To alleviate this issue, we argue that pruning should be conducted along three dimensions comprehensively. For this purpose, our pruning framework formulates pruning as an optimization problem. Specifically, it first casts the relationships between a certain model's accuracy and depth/width/resolution into a polynomial regression and then maximizes the polynomial to acquire the optimal values for the three dimensions. Finally, the model is pruned along the three optimal dimensions accordingly. In this framework, since collecting too much data for training the regression is very time-costly, we propose two approaches to lower the cost: 1) specializing the polynomial to ensure an accurate regression even with less training data; 2) employing iterative pruning and fine-tuning to collect the data faster. Extensive experiments show that our proposed algorithm surpasses state-of-the-art pruning algorithms and even neural architecture search-based algorithms.

cs.CV↗

arXiv2021

FGLP: A Federated Fine-Grained Location Prediction System for Mobile Users

Fine-grained location prediction on smart phones can be used to improve app/system performance. Application scenarios include video quality adaptation as a function of the 5G network quality at predicted user locations, and augmented reality apps that speed up content rendering based on predicted user locations. Such use cases require prediction error in the same range as the GPS error, and no existing works on location prediction can achieve this level of accuracy. We present a system for fine-grained location prediction (FGLP) of mobile users, based on GPS traces collected on the phones. FGLP has two components: a federated learning framework and a prediction model. The framework runs on the phones of the users and also on a server that coordinates learning from all users in the system. FGLP represents the user location data as relative points in an abstract 2D space, which enables learning across different physical spaces. The model merges Bidirectional Long Short-Term Memory (BiLSTM) and Convolutional Neural Networks (CNN), where BiLSTM learns the speed and direction of the mobile users, and CNN learns information such as user movement preferences. FGLP uses federated learning to protect user privacy and reduce bandwidth consumption. Our experimental results, using a dataset with over 600,000 users, demonstrate that FGLP outperforms baseline models in terms of prediction accuracy. We also demonstrate that FGLP works well in conjunction with transfer learning, which enables model reusability. Finally, benchmark results on several types of Android phones demonstrate FGLP's feasibility in real life.

cs.LG↗

arXiv2021

Attacking Adversarial Attacks as A Defense

It is well known that adversarial attacks can fool deep neural networks with imperceptible perturbations. Although adversarial training significantly improves model robustness, failure cases of defense still broadly exist. In this work, we find that the adversarial attacks can also be vulnerable to small perturbations. Namely, on adversarially-trained models, perturbing adversarial examples with a small random noise may invalidate their misled predictions. After carefully examining state-of-the-art attacks of various kinds, we find that all these attacks have this deficiency to different extents. Enlightened by this finding, we propose to counter attacks by crafting more effective defensive perturbations. Our defensive perturbations leverage the advantage that adversarial training endows the ground-truth class with smaller local Lipschitzness. By simultaneously attacking all the classes, the misled predictions with larger Lipschitzness can be flipped into correct ones. We verify our defensive perturbation with both empirical experiments and theoretical analyses on a linear model. On CIFAR10, it boosts the state-of-the-art model from 66.16% to 72.66% against the four attacks of AutoAttack, including 71.76% to 83.30% against the Square attack. On ImageNet, the top-1 robust accuracy of FastAT is improved from 33.18% to 38.54% under the 100-step PGD attack.

cs.LG↗

arXiv2021

Integrating Subgraph-aware Relation and DirectionReasoning for Question Answering

Question Answering (QA) models over Knowledge Bases (KBs) are capable of providing more precise answers by utilizing relation information among entities. Although effective, most of these models solely rely on fixed relation representations to obtain answers for different question-related KB subgraphs. Hence, the rich structured information of these subgraphs may be overlooked by the relation representation vectors. Meanwhile, the direction information of reasoning, which has been proven effective for the answer prediction on graphs, has not been fully explored in existing work. To address these challenges, we propose a novel neural model, Relation-updated Direction-guided Answer Selector (RDAS), which converts relations in each subgraph to additional nodes to learn structure information. Additionally, we utilize direction information to enhance the reasoning ability. Experimental results show that our model yields substantial improvements on two widely used datasets.

cs.CL↗

arXiv2021

$B$-meson Ioffe-time distribution amplitude at short distances

We propose the approach for a lattice investigation of light-cone distribution amplitudes (LCDA) of heavy-light mesons, such as the $B$-meson, using the formalism of parton pseudo-distributions. A basic ingredient of the approach is the study of short-distance behavior of the $B$-meson Ioffe-time distribution amplitude (ITDA), which is a generalization of the $B$-meson LCDA in coordinate space. We construct a reduced ITDA for the $B$-meson, and derive the matching relation between the reduced ITDA and the LCDA. The reduced ITDA is ultraviolet finite, which guarantees that the continuum limit exists on the lattice.

hep-ph↗

arXiv2021

ES-Net: Erasing Salient Parts to Learn More in Re-Identification

As an instance-level recognition problem, re-identification (re-ID) requires models to capture diverse features. However, with continuous training, re-ID models pay more and more attention to the salient areas. As a result, the model may only focus on few small regions with salient representations and ignore other important information. This phenomenon leads to inferior performance, especially when models are evaluated on small inter-identity variation data. In this paper, we propose a novel network, Erasing-Salient Net (ES-Net), to learn comprehensive features by erasing the salient areas in an image. ES-Net proposes a novel method to locate the salient areas by the confidence of objects and erases them efficiently in a training batch. Meanwhile, to mitigate the over-erasing problem, this paper uses a trainable pooling layer P-pooling that generalizes global max and global average pooling. Experiments are conducted on two specific re-identification tasks (i.e., Person re-ID, Vehicle re-ID). Our ES-Net outperforms state-of-the-art methods on three Person re-ID benchmarks and two Vehicle re-ID benchmarks. Specifically, mAP / Rank-1 rate: 88.6% / 95.7% on Market1501, 78.8% / 89.2% on DuckMTMC-reID, 57.3% / 80.9% on MSMT17, 81.9% / 97.0% on Veri-776, respectively. Rank-1 / Rank-5 rate: 83.6% / 96.9% on VehicleID (Small), 79.9% / 93.5% on VehicleID (Medium), 76.9% / 90.7% on VehicleID (Large), respectively. Moreover, the visualized salient areas show human-interpretable visual explanations for the ranking results.

cs.CV↗

arXiv2020

Complete Matching for Quasi-distribution Functions in Large Momentum Effective Theory

We complete the procedure of extracting parton distribution functions (PDFs) using large momentum effective theory (LaMET) at leading power accuracy in the hadron momentum. We derive a general factorization formula for the quasi PDFs in the presence of mixing, and give the corresponding hard matching kernel at $\mathcal O(α_s)$, both for the unpolarized and for the polarized quark and gluon quasi-PDFs. Our calculation is performed in a regularization-independent momentum subtraction scheme. The results allow us to match the nonperturbatively renormalized quasi-PDFs to normal PDFs in the presence of mixing, and therefore can be used to extract flavor-singlet quark PDFs as well as gluon PDFs from lattice simulations.

hep-ph↗

arXiv2020

Open-destination measurement-device-independent quantum key distribution network

Quantum key distribution (QKD) networks hold promise for sharing secure randomness over multi-partities. Most existing QKD network schemes and demonstrations are based on trusted relays or limited to point-to-point scenario. Here, we propose a flexible and extensible scheme named as open-destination measurement-device-independent QKD network. The scheme enjoys security against untrusted relays and all detector side-channel attacks. Particularly, any users can accomplish key distribution under assistance of others in the network. As an illustration, we show in detail a four-user network where two users establish secure communication and present realistic simulations by taking into account imperfections of both sources and detectors.

quant-ph↗

arXiv2020

Multi-Objective Parameter-less Population Pyramid for Solving Industrial Process Planning Problems

Evolutionary methods are effective tools for obtaining high-quality results when solving hard practical problems. Linkage learning may increase their effectiveness. One of the state-of-the-art methods that employ linkage learning is the Parameter-less Population Pyramid (P3). P3 is dedicated to solving single-objective problems in discrete domains. Recent research shows that P3 is highly competitive when addressing problems with so-called overlapping blocks, which are typical for practical problems. In this paper, we consider a multi-objective industrial process planning problem that arises from practice and is NP-hard. To handle it, we propose a multi-objective version of P3. The extensive research shows that our proposition outperforms the competing methods for the considered practical problem and typical multi-objective benchmarks.

cs.NE↗

arXiv2020

$B$-meson light-cone distribution amplitude from the Euclidean quantity

A new method for the model-independent determination of the light-cone distribution amplitude (LCDA) of the $B$-meson in heavy quark effective theory (HQET) is proposed by combining the large momentum effective theory (LaMET) and the numerical simulation technique on the Euclidean lattice. We demonstrate the autonomous scale dependence of the non-local quasi-HQET operator with the aid of the auxiliary field approach, and further determine the perturbative matching coefficient entering the hard-collinear factorization formula for the $B$-meson quasi-distribution amplitude at the one-loop accuracy. These results will be crucial to explore the partonic structure of heavy-quark hadrons in the static limit and to improve the theory description of exclusive $B$-meson decay amplitudes based upon perturbative QCD factorization theorems.

hep-ph↗

arXiv2020

Value-driven Manufacturing Planning using Cloud-based Evolutionary Optimisation

This paper considers manufacturing planning and scheduling of manufacturing orders whose value decreases over time. The value decrease is modelled with a so-called value curve. Two genetic-algorithm-based methods for multi-objective optimisation have been proposed, implemented and deployed to a cloud. The first proposed method allocates and schedules manufacturing of all the ordered elements optimising both the makespan and the total value, whereas the second method selects only the profitable orders for manufacturing. The proposed evolutionary optimisation has been performed for a set of real-world-inspired manufacturing orders. Both the methods yield a similar total value, but the latter method leads to a shorter makespan.

cs.DC↗

arXiv2020

Phase-Matching Quantum Cryptographic Conferencing

Quantum cryptographic conferencing (QCC) holds promise for distributing information-theoretic secure keys among multiple users over long distance. Limited by the fragility of Greenberger-Horne-Zeilinger (GHZ) state, QCC networks based on directly distributing GHZ states at long distance still face big challenge. Another two potential approaches are measurement device independent QCC and conference key agreement with single-photon interference, which was proposed based on the post-selection of GHZ states and the post-selection of W state, respectively. However, implementations of the former protocol are still heavily constrained by the transmission rate $η$ of optical channels and the complexity of the setups for post-selecting GHZ states. Meanwhile, the latter protocol cannot be cast to a measurement device independent prepare-and-measure scheme. Combining the idea of post-selecting GHZ state and recently proposed twin-field quantum key distribution protocols, we report a QCC protocol based on weak coherent state interferences named phase-matching quantum cryptographic conferencing, which is immune to all detector side-channel attacks. The proposed protocol can improve the key generation rate from $\mathrm{O}(η^N)$ to $\mathrm{O}(η^{N-1})$ compared with the measurement device independent QCC protocols. Meanwhile, it can be easily scaled up to multiple parties due to its simple setup.

quant-ph↗

arXiv2020

Heavy quark expansion for heavy-light light-cone operators

We generalize the celebrated heavy quark expansion to nonlocal QCD operators. By taking nonlocal heavy-light current on the light-cone as an example, we confirm that the collinear singularities are common between QCD operator and the corresponding operator in heavy quark effective theory (HQET), at the leading power of $1/M$ expansion. Based on a perturbative calculation in operator form at one-loop level, a factorization formula linking QCD and HQET operators is investigated and the matching coefficient is determined. The matching between QCD and HQET light-cone distribution amplitudes (LCDAs) as well as other momentum distributions of hadron can be derived as a consequence.

hep-ph↗