arXiv subjects

Bin Yan

Publications and source records attributed to Bin Yan.

At least 109 records · Page 6Linked to original sources

arXiv2021

Probing the electroweak symmetry breaking with Higgs production at the LHC

The electroweak symmetry breaking (EWSB) mechanism is still an undecided question in particle physics. We propose to utilize the single top quark and Higgs associated production ($th$), $Zh$ production via gluon fusion at the LHC to probe the couplings between the Higgs and the gauge bosons and further to test the EWSB. We demonstrate that the $th$ and $gg\to Zh$ productions are sensitive to the relative sign of couplings ($ht\bar{t}$, $hWW$) and ($ht\bar{t}$, $hZZ$), respectively. We find that the relative sign between $hWW$ and $hZZ$ couplings could be fully determined after combining the present measurements from $gg\to h$, $t\bar{t}h$ and the $th$, $Zh$ channels, as well as $tZj$ and $Zt\bar{t}$ production at the 13 TeV LHC, and this conclusion is not sensitive to the possible new physics contribution induced by $Zt\bar{t}$ couplings in the $gg\to Zh$ production.

hep-ph↗

arXiv2021

Alpha-Refine: Boosting Tracking Performance by Precise Bounding Box Estimation

Visual object tracking aims to precisely estimate the bounding box for the given target, which is a challenging problem due to factors such as deformation and occlusion. Many recent trackers adopt the multiple-stage tracking strategy to improve the quality of bounding box estimation. These methods first coarsely locate the target and then refine the initial prediction in the following stages. However, existing approaches still suffer from limited precision, and the coupling of different stages severely restricts the method's transferability. This work proposes a novel, flexible, and accurate refinement module called Alpha-Refine (AR), which can significantly improve the base trackers' box estimation quality. By exploring a series of design options, we conclude that the key to successful refinement is extracting and maintaining detailed spatial information as much as possible. Following this principle, Alpha-Refine adopts a pixel-wise correlation, a corner prediction head, and an auxiliary mask head as the core components. Comprehensive experiments on TrackingNet, LaSOT, GOT-10K, and VOT2020 benchmarks with multiple base trackers show that our approach significantly improves the base trackers' performance with little extra latency. The proposed Alpha-Refine method leads to a series of strengthened trackers, among which the ARSiamRPN (AR strengthened SiamRPNpp) and the ARDiMP50 (ARstrengthened DiMP50) achieve good efficiency-precision trade-off, while the ARDiMPsuper (AR strengthened DiMP-super) achieves very competitive performance at a real-time speed. Code and pretrained models are available at https://github.com/MasterBin-IIAU/AlphaRefine.

cs.CV↗

arXiv2021

Energy storage and coherence in closed and open quantum batteries

We study the role of coherence in closed and open quantum batteries. We obtain upper bounds to the work performed or energy exchanged by both closed and open quantum batteries in terms of coherence. Specifically, we show that the energy storage can be bounded by the Hilbert-Schmidt coherence of the density matrix in the spectral basis of the unitary operator that encodes the evolution of the battery. We also show that an analogous bound can be obtained in terms of the battery's Hamiltonian coherence in the basis of the unitary operator by evaluating their commutator. We apply these bounds to a 4-state quantum system and the anisotropic XY Ising model in the closed system case, and the Spin-Boson model in the open case.

quant-ph↗

arXiv2021

Quantum simulation of operator spreading in the chaotic Ising model

There is great interest in using near-term quantum computers to simulate and study foundational problems in quantum mechanics and quantum information science, such as the scrambling measured by an out-of-time-ordered correlator (OTOC). Here we use an IBM Q processor, quantum error mitigation, and weaved Trotter simulation to study high-resolution operator spreading in a 4-spin Ising model as a function of space, time, and integrability. Reaching 4 spins while retaining high circuit fidelity is made possible by the use of a physically motivated fixed-node variant of the OTOC, allowing scrambling to be estimated without overhead. We find clear signatures of ballistic operator spreading in a chaotic regime, as well as operator localization in an integrable regime. The techniques developed and demonstrated here open up the possibility of using cloud-based quantum computers to study and visualize scrambling phenomena, as well as quantum information dynamics more generally.

quant-ph↗

arXiv2021

Improving the Transferability of Adversarial Examples with New Iteration Framework and Input Dropout

Deep neural networks(DNNs) is vulnerable to be attacked by adversarial examples. Black-box attack is the most threatening attack. At present, black-box attack methods mainly adopt gradient-based iterative attack methods, which usually limit the relationship between the iteration step size, the number of iterations, and the maximum perturbation. In this paper, we propose a new gradient iteration framework, which redefines the relationship between the above three. Under this framework, we easily improve the attack success rate of DI-TI-MIM. In addition, we propose a gradient iterative attack method based on input dropout, which can be well combined with our framework. We further propose a multi dropout rate version of this method. Experimental results show that our best method can achieve attack success rate of 96.2\% for defense model on average, which is higher than the state-of-the-art gradient-based attacks.

cs.LG↗

arXiv2021

Towards the Web of Quantum Chaos Diagnostics

We study the connections between three quantities that can be used as diagnostics for quantum chaos, i.e., the out-of-time-order correlator (OTOC), Loschmidt echo (LE), and complexity. We generalize the connection between OTOC and LE for infinite dimensions and extend it for higher-order OTOCs and multi-fold LEs. Novel applications of this intrinsic relation are proposed. We also propose a relationship between a specific circuit complexity and LE by using the inverted oscillator model. These relationships signal a deeper connection between these three probes of quantum chaos.

hep-th↗

arXiv2021

Dynamic Defense Approach for Adversarial Robustness in Deep Neural Networks via Stochastic Ensemble Smoothed Model

Deep neural networks have been shown to suffer from critical vulnerabilities under adversarial attacks. This phenomenon stimulated the creation of different attack and defense strategies similar to those adopted in cyberspace security. The dependence of such strategies on attack and defense mechanisms makes the associated algorithms on both sides appear as closely reciprocating processes. The defense strategies are particularly passive in these processes, and enhancing initiative of such strategies can be an effective way to get out of this arms race. Inspired by the dynamic defense approach in cyberspace, this paper builds upon stochastic ensemble smoothing based on defense method of random smoothing and model ensemble. Proposed method employs network architecture and smoothing parameters as ensemble attributes, and dynamically change attribute-based ensemble model before every inference prediction request. The proposed method handles the extreme transferability and vulnerability of ensemble models under white-box attacks. Experimental comparison of ASR-vs-distortion curves with different attack scenarios shows that even the attacker with the highest attack capability cannot easily exceed the attack success rate associated with the ensemble smoothed model, especially under untargeted attacks.

cs.CR↗

arXiv2021

LightTrack: Finding Lightweight Neural Networks for Object Tracking via One-Shot Architecture Search

Object tracking has achieved significant progress over the past few years. However, state-of-the-art trackers become increasingly heavy and expensive, which limits their deployments in resource-constrained applications. In this work, we present LightTrack, which uses neural architecture search (NAS) to design more lightweight and efficient object trackers. Comprehensive experiments show that our LightTrack is effective. It can find trackers that achieve superior performance compared to handcrafted SOTA trackers, such as SiamRPN++ and Ocean, while using much fewer model Flops and parameters. Moreover, when deployed on resource-constrained mobile chipsets, the discovered trackers run much faster. For example, on Snapdragon 845 Adreno GPU, LightTrack runs $12\times$ faster than Ocean, while using $13\times$ fewer parameters and $38\times$ fewer Flops. Such improvements might narrow the gap between academic models and industrial deployments in object tracking task. LightTrack is released at https://github.com/researchmm/LightTrack.

cs.CV↗

arXiv2021

Alpha-Refine: Boosting Tracking Performance by Precise Bounding Box Estimation

In recent years, the multiple-stage strategy has become a popular trend for visual tracking. This strategy first utilizes a base tracker to coarsely locate the target and then exploits a refinement module to obtain more accurate results. However, existing refinement modules suffer from the limited transferability and precision. In this work, we propose a novel, flexible and accurate refinement module called Alpha-Refine, which exploits a precise pixel-wise correlation layer together with a spatial-aware non-local layer to fuse features and can predict three complementary outputs: bounding box, corners and mask. To wisely choose the most adequate output, we also design a light-weight branch selector module. We apply the proposed Alpha-Refine module to five famous and state-of-the-art base trackers: DiMP, ATOM, SiamRPN++, RTMDNet and ECO. The comprehensive experiments on TrackingNet, LaSOT and VOT2018 benchmarks demonstrate that our approach significantly improves the tracking performance in comparison with other existing refinement methods. The source codes will be available at https://github.com/MasterBin-IIAU/AlphaRefine.

cs.CV↗

arXiv2021

Learning Spatio-Temporal Transformer for Visual Tracking

In this paper, we present a new tracking architecture with an encoder-decoder transformer as the key component. The encoder models the global spatio-temporal feature dependencies between target objects and search regions, while the decoder learns a query embedding to predict the spatial positions of the target objects. Our method casts object tracking as a direct bounding box prediction problem, without using any proposals or predefined anchors. With the encoder-decoder transformer, the prediction of objects just uses a simple fully-convolutional network, which estimates the corners of objects directly. The whole method is end-to-end, does not need any postprocessing steps such as cosine window and bounding box smoothing, thus largely simplifying existing tracking pipelines. The proposed tracker achieves state-of-the-art performance on five challenging short-term and long-term benchmarks, while running at real-time speed, being 6x faster than Siam R-CNN. Code and models are open-sourced at https://github.com/researchmm/Stark.

cs.CV↗

arXiv2021

Transformer Tracking

Correlation acts as a critical role in the tracking field, especially in recent popular Siamese-based trackers. The correlation operation is a simple fusion manner to consider the similarity between the template and the search region. However, the correlation operation itself is a local linear matching process, leading to lose semantic information and fall into local optimum easily, which may be the bottleneck of designing high-accuracy tracking algorithms. Is there any better feature fusion method than correlation? To address this issue, inspired by Transformer, this work presents a novel attention-based feature fusion network, which effectively combines the template and search region features solely using attention. Specifically, the proposed method includes an ego-context augment module based on self-attention and a cross-feature augment module based on cross-attention. Finally, we present a Transformer tracking (named TransT) method based on the Siamese-like feature extraction backbone, the designed attention-based fusion mechanism, and the classification and regression head. Experiments show that our TransT achieves very promising results on six challenging datasets, especially on large-scale LaSOT, TrackingNet, and GOT-10k benchmarks. Our tracker runs at approximatively 50 fps on GPU. Code and models are available at https://github.com/chenxin-dlut/TransT.

cs.CV↗

arXiv2021

Nonadiabatic Phase Transition with Broken Chiral Symmetry

We explore nonadiabatic quantum phase transitions in an Ising spin chain with a linearly time-dependent transverse field and two different spins per unit cell. Such a spin system passes through critical points with gapless excitations, which support nonadiabatic transitions. Nevertheless, we find that the excitations on one of the chain sub-lattices are suppressed in the nearly-adiabatic regime exponentially. Thus, we reveal a coherent mechanism to induce exponentially large density separation for different quasiparticles.

cond-mat.stat-mech↗

arXiv2021

The Multi-faceted Inverted Harmonic Oscillator: Chaos and Complexity

The harmonic oscillator is the paragon of physical models; conceptually and computationally simple, yet rich enough to teach us about physics on scales that span classical mechanics to quantum field theory. This multifaceted nature extends also to its inverted counterpart, in which the oscillator frequency is analytically continued to pure imaginary values. In this article we probe the inverted harmonic oscillator (IHO) with recently developed quantum chaos diagnostics such as the out-of-time-order correlator (OTOC) and the circuit complexity. In particular, we study the OTOC for the displacement operator of the IHO with and without a non-Gaussian cubic perturbation to explore genuine and quasi scrambling respectively. In addition, we compute the full quantum Lyapunov spectrum for the inverted oscillator, finding a paired structure among the Lyapunov exponents. We also use the Heisenberg group to compute the complexity for the time evolved displacement operator, which displays chaotic behaviour. Finally, we extended our analysis to N-inverted harmonic oscillators to study the behaviour of complexity at the different timescales encoded in dissipation, scrambling and asymptotic regimes.

hep-th↗

arXiv2020

Dual-energy CT Reconstruction from Dual Quarter Scans

Compared with conventional single-energy computed tomography (CT), dual-energy CT (DECT) provides better material differentiation but most DECT imaging systems require dual full-angle projection data at different X-ray spectra. Relaxing the requirement of data acquisition is a particularly attractive research to promote the applications of DECT in a wide range of imaging areas. In this work, we design a novel DECT imaging scheme with dual quarter scans and propose an efficient method to reconstruct the desired DECT images from dual limited-angle projection data, which enables DECT on imaging configurations with half-scan and largely reduces scanning angles and radiation doses. We first study the characteristics of image artifacts under dual quarter scans scheme, and find that the directional limited-angle artifacts of DECT images are complementarily distributed in image domain because the corresponding X-rays of high- and low-energy scans are orthogonal. Inspired by this finding, a fusion CT image is generated by integrating the limited-angle DECT images of dual quarter scans. This strategy largely reduces the limited-angle artifacts and preserves the image edges and inner structures. Utilizing the capability of neural network in the modeling of nonlinear problem, a novel Anchor network with single-entry double-out architecture is designed in this work to yield the desired DECT images from the generated fusion CT image. Experimental results on the simulated and real data verify the effectiveness of the proposed method.

physics.med-ph↗

arXiv2020

Probing $Zt\bar{t}$ couplings using $Z$ boson polarization in $ZZ$ production at hadron colliders

We propose to utilize the polarization information of the $Z$ bosons in $ZZ$ production, via the gluon-gluon fusion process $gg\to ZZ$, to probe the $Zt\bar{t}$ gauge coupling. The contribution of longitudinally polarized $Z$ bosons is sensitive to the axial-vector component ($a_t$) of the $Zt\bar{t}$ coupling. We demonstrate that the angular distribution of the charged lepton from $Z$ boson decays serves well for measuring the polarization of $Z$ bosons and the determination of $a_t$. We show that $ZZ$ production via the $gg\to ZZ$ process complement to $Zt\bar{t}$ and $tZj$ productions in measuring the $Zt\bar{t}$ coupling at hadron colliders.

hep-ph↗

arXiv2020

Generative Adversarial Network-Based Sinogram Super-Resolution for Computed Tomography Imaging

Compared with the conventional 1*1 acquisition mode of projection in computed tomography (CT) image reconstruction, the 2*2 acquisition mode improves the collection efficiency of the projection and reduces the X-ray exposure time. However, the collected projection based on the 2*2 acquisition mode has low resolution (LR) and the reconstructed image quality is poor, thus limiting the use of this mode in CT imaging systems. In this study, a novel sinogram-super-resolution generative adversarial network (SSR-GAN) model is proposed to obtain high-resolution (HR) sinograms from LR sinograms, thereby improving the reconstruction image quality under the 2*2 acquisition mode. The proposed generator is based on the residual network for LR sinogram feature extraction and super-resolution (SR) sinogram generation. A relativistic discriminator is designed to render the network capable of obtaining more realistic SR sinograms. Moreover, we combine the cycle consistency loss, sinogram domain loss, and reconstruction image domain loss in the total loss function to supervise SR sinogram generation. Then, a trained model can be obtained by inputting the paired LR/HR sinograms into the network. Finally, the classic FBP reconstruction algorithm is used for CT image reconstruction based on the generated SR sinogram. The qualitative and quantitative results of evaluations on digital and real data illustrate that the proposed model not only obtains clean SR sinograms from noisy LR sinograms but also outperforms its counterparts.

physics.med-ph↗

arXiv2020

Recovery of Damaged Information and the Out-of-Time-Ordered Correlators

A time-reversed dynamics unwinds information scrambling, which is induced during the time-forward evolution with a complex Hamiltonian. We show that if the scrambled information is, in addition, partially damaged by a local measurement, then such a damage can still be treated by application of the time-reversed protocol. This information recovery is described by the long-time saturation value of a certain out-of-time-ordered correlator of local variables. We also propose a simple test that distinguishes between quantum and reversible classical chaotic information scrambling.

quant-ph↗

arXiv2020

Dissociable neural representations of adversarially perturbed images in convolutional neural networks and the human brain

Despite the remarkable similarities between convolutional neural networks (CNN) and the human brain, CNNs still fall behind humans in many visual tasks, indicating that there still exist considerable differences between the two systems. Here, we leverage adversarial noise (AN) and adversarial interference (AI) images to quantify the consistency between neural representations and perceptual outcomes in the two systems. Humans can successfully recognize AI images as corresponding categories but perceive AN images as meaningless noise. In contrast, CNNs can correctly recognize AN images but mistakenly classify AI images into wrong categories with surprisingly high confidence. We use functional magnetic resonance imaging to measure brain activity evoked by regular and adversarial images in the human brain, and compare it to the activity of artificial neurons in a prototypical CNN-AlexNet. In the human brain, we find that the representational similarity between regular and adversarial images largely echoes their perceptual similarity in all early visual areas. In AlexNet, however, the neural representations of adversarial images are inconsistent with network outputs in all intermediate processing layers, providing no neural foundations for perceptual similarity. Furthermore, we show that voxel-encoding models trained on regular images can successfully generalize to the neural responses to AI images but not AN images. These remarkable differences between the human brain and AlexNet in the representation-perception relation suggest that future CNNs should emulate both behavior and the internal neural presentations of the human brain.

cs.CV↗