Searcharxiv⌕ Search

arXiv subjects

Yan Wang

Publications and source records attributed to Yan Wang.

At least 901 records · Page 50Linked to original sources

Improving the measurement of the Higgs boson-gluon coupling using convolutional neural networks at $e^+e^-$ colliders

In this paper we propose to use convolutional neural networks (CNNs) to improve the precision measurement of the Higgs boson-gluon effective coupling at lepton colliders. The CNN is employed to recognize the Higgs boson and a $Z$ boson associated production process, with the Higgs boson decaying to a gluon pair and the $Z$ boson decaying to a lepton pair at the center-of-mass energy 250 GeV and integrated luminosity 5 ab$^{-1}$. By using CNNs, the uncertainty of the effective coupling measurement can be decreased from $1.94\%$ to about $1.28\%$ using the PYTHIA data and from $1.82\%$ to about $1.22\%$ using the HERWIG data in the Monte Carlo simulation. Moreover, the performance of CNNs using different final state constituents shows that the energy distributions of the leading and subleading jets constituents play a major role in the identification and the optimal uncertainty of effective coupling using CNNs is reduced by about $35\%$ compared to that using conventional method.

hep-ph↗

Generate, Delete and Rewrite: A Three-Stage Framework for Improving Persona Consistency of Dialogue Generation

Maintaining a consistent personality in conversations is quite natural for human beings, but is still a non-trivial task for machines. The persona-based dialogue generation task is thus introduced to tackle the personality-inconsistent problem by incorporating explicit persona text into dialogue generation models. Despite the success of existing persona-based models on generating human-like responses, their one-stage decoding framework can hardly avoid the generation of inconsistent persona words. In this work, we introduce a three-stage framework that employs a generate-delete-rewrite mechanism to delete inconsistent words from a generated response prototype and further rewrite it to a personality-consistent one. We carry out evaluations by both human and automatic metrics. Experiments on the Persona-Chat dataset show that our approach achieves good performance.

cs.CL↗

Robust active flow control over a range of Reynolds numbers using an artificial neural network trained through deep reinforcement learning

This paper focuses on the active flow control of a computational fluid dynamics simulation over a range of Reynolds numbers using deep reinforcement learning (DRL). More precisely, the proximal policy optimization (PPO) method is used to control the mass flow rate of four synthetic jets symmetrically located on the upper and lower sides of a cylinder immersed in a two-dimensional flow domain. The learning environment supports four flow configurations with Reynolds numbers 100, 200, 300 and 400, respectively. A new smoothing interpolation function is proposed to help the PPO algorithm to learn to set continuous actions, which is of great importance to effectively suppress problematic jumps in lift and allow a better convergence for the training process. It is shown that the DRL controller is able to significantly reduce the lift and drag fluctuations and to actively reduce the drag by approximately 5.7%, 21.6%, 32.7%, and 38.7%, at $Re$=100, 200, 300, and 400 respectively. More importantly, it can also effectively reduce drag for any previously unseen value of the Reynolds number between 60 and 400. This highlights the generalization ability of deep neural networks and is an important milestone to active flow control.

physics.flu-dyn↗

Proposal Learning for Semi-Supervised Object Detection

In this paper, we focus on semi-supervised object detection to boost performance of proposal-based object detectors (a.k.a. two-stage object detectors) by training on both labeled and unlabeled data. However, it is non-trivial to train object detectors on unlabeled data due to the unavailability of ground truth labels. To address this problem, we present a proposal learning approach to learn proposal features and predictions from both labeled and unlabeled data. The approach consists of a self-supervised proposal learning module and a consistency-based proposal learning module. In the self-supervised proposal learning module, we present a proposal location loss and a contrastive loss to learn context-aware and noise-robust proposal features respectively. In the consistency-based proposal learning module, we apply consistency losses to both bounding box classification and regression predictions of proposals to learn noise-robust proposal features and predictions. Our approach enjoys the following benefits: 1) encouraging more context information to delivered in the proposals learning procedure; 2) noisy proposal features and enforcing consistency to allow noise-robust object detection; 3) building a general and high-performance semi-supervised object detection framework, which can be easily adapted to proposal-based object detectors with different backbone architectures. Experiments are conducted on the COCO dataset with all available labeled and unlabeled data. Results demonstrate that our approach consistently improves the performance of fully-supervised baselines. In particular, after combining with data distillation, our approach improves AP by about 2.0% and 0.9% on average compared to fully-supervised baselines and data distillation baselines respectively.

cs.CV↗

Graph Learning Approaches to Recommender Systems: A Review

Recent years have witnessed the fast development of the emerging topic of Graph Learning based Recommender Systems (GLRS). GLRS mainly employ the advanced graph learning approaches to model users' preferences and intentions as well as items' characteristics and popularity for Recommender Systems (RS). Differently from conventional RS, including content based filtering and collaborative filtering, GLRS are built on simple or complex graphs where various objects, e.g., users, items, and attributes, are explicitly or implicitly connected. With the rapid development of graph learning, exploring and exploiting homogeneous or heterogeneous relations in graphs is a promising direction for building advanced RS. In this paper, we provide a systematic review of GLRS, on how they obtain the knowledge from graphs to improve the accuracy, reliability and explainability for recommendations. First, we characterize and formalize GLRS, and then summarize and categorize the key challenges in this new research area. Then, we survey the most recent and important developments in the area. Finally, we share some new research directions in this vibrant area.

cs.IR↗

EchoLock: Towards Low Effort Mobile User Identification

User identification plays a pivotal role in how we interact with our mobile devices. Many existing authentication approaches require active input from the user or specialized sensing hardware, and studies on mobile device usage show significant interest in less inconvenient procedures. In this paper, we propose EchoLock, a low effort identification scheme that validates the user by sensing hand geometry via commodity microphones and speakers. These acoustic signals produce distinct structure-borne sound reflections when contacting the user's hand, which can be used to differentiate between different people based on how they hold their mobile devices. We process these reflections to derive unique acoustic features in both the time and frequency domain, which can effectively represent physiological and behavioral traits, such as hand contours, finger sizes, holding strength, and gesture. Furthermore, learning-based algorithms are developed to robustly identify the user under various environments and conditions. We conduct extensive experiments with 20 participants using different hardware setups in key use case scenarios and study various attack models to demonstrate the performance of our proposed system. Our results show that EchoLock is capable of verifying users with over 90% accuracy, without requiring any active input from the user.

cs.HC↗

WearID: Wearable-Assisted Low-Effort Authentication to Voice Assistants using Cross-Domain Speech Similarity

Due to the open nature of voice input, voice assistant (VA) systems (e.g., Google Home and Amazon Alexa) are under a high risk of sensitive information leakage (e.g., personal schedules and shopping accounts). Though the existing VA systems may employ voice features to identify users, they are still vulnerable to various acoustic attacks (e.g., impersonation, replay and hidden command attacks). In this work, we focus on the security issues of the emerging VA systems and aim to protect the users' highly sensitive information from these attacks. Towards this end, we propose a system, WearID, which uses an off-the-shelf wearable device (e.g., a smartwatch or bracelet) as a secure token to verify the user's voice commands to the VA system. In particular, WearID exploits the readily available motion sensors from most wearables to describe the command sound in vibration domain and check the received command sound across two domains (i.e., wearable's motion sensor vs. VA device's microphone) to ensure the sound is from the legitimate user.

cs.HC↗

Stylistic Dialogue Generation via Information-Guided Reinforcement Learning Strategy

Stylistic response generation is crucial for building an engaging dialogue system for industrial use. While it has attracted much research interest, existing methods often generate stylistic responses at the cost of the content quality (relevance and fluency). To enable better balance between the content quality and the style, we introduce a new training strategy, know as Information-Guided Reinforcement Learning (IG-RL). In IG-RL, a training model is encouraged to explore stylistic expressions while being constrained to maintain its content quality. This is achieved by adopting reinforcement learning strategy with statistical style information guidance for quality-preserving explorations. Experiments on two datasets show that the proposed approach outperforms several strong baselines in terms of the overall response performance.

cs.CL↗

Prototype-to-Style: Dialogue Generation with Style-Aware Editing on Retrieval Memory

The ability of a dialog system to express prespecified language style during conversations has a direct, positive impact on its usability and on user satisfaction. We introduce a new prototype-to-style (PS) framework to tackle the challenge of stylistic dialogue generation. The framework uses an Information Retrieval (IR) system and extracts a response prototype from the retrieved response. A stylistic response generator then takes the prototype and the desired language style as model input to obtain a high-quality and stylistic response. To effectively train the proposed model, we propose a new style-aware learning objective as well as a de-noising learning strategy. Results on three benchmark datasets from two languages demonstrate that the proposed approach significantly outperforms existing baselines in both in-domain and cross-domain evaluations

cs.CL↗

Experimental control of remote spatial indistinguishability of photons to realize entanglement and teleportation

Remote spatial indistinguishability of identical subsystems as a direct controllable quantum resource at distant sites has not been yet experimentally proven. We design a setup capable to tune the spatial indistinguishability of two photons by independently adjusting their spatial distribution in two distant regions, which leads to polarization entanglement starting from uncorrelated photons. The amount of entanglement uniquely depends on the degree of remote spatial indistinguishability, quantified by an entropic measure $\mathcal{I}$, which enables teleportation with fidelities above the classical threshold. This experiment realizes a basic nonlocal entangling gate by the inherent nature of identical quantum subsystems.

quant-ph↗

Two-path interference for enantiomer-selective state transfer of chiral molecules

With a microwave-regime cyclic three-state configuration, an enantiomer-selective state transfer~(ESST) is carried out through the two-path interference between a direct one-photon coupling and an effective two-photon coupling. The $π$-phase difference in the one-photon process between two enantiomers makes the interference constructive for one enantiomer but destructive for the other. Therefore only one enantiomer is excited into a higher rotational state while the other remains in the ground state. The scheme is of flexibility in the pulse waveforms and the time order of two paths. We simulate the scheme in a sample of cyclohexylmethanol~(C$_7$H$_{14}$O) molecules. Simulative results show the robust and high-fidelity ESST can be obtained when experimental concerns are considered. Finally, we propose to employ the finished ESST in implementing enantio-separation and determining enantiomeric excess.

quant-ph↗

Implications of light charged Higgs boson at the LHC Run III in the 2HDM

In this study, we focus on the bosonic decays of light charged Higgs boson (i.e., with $M_{H^\pm}<m_t$) in the 2-Higgs Doublet Model (2HDM) Type-I. To study the signal of such a charged Higgs state at the Large Hadron Collider (LHC), in a scenario where the $H^0$ boson is the Standard Model (SM)-like one already discovered, we assume that it decays mainly via $h^0W^{\pm *}$ and/or $H^\pm\to A^0W^{\pm *}$ (i.e., via an off-shell $W^{\pm}$ boson), which can reach a sizable Branching Ratio (BR) for $\tanβ\geq4$, when the exclusion bounds from $H^\pm\toτν$ and $c{s}$ searches get weaker. By using six Benchmark Points (BPs), which are consistent with current LHC constraints, we perform a Monte Carlo (MC) study and examine the sensitivity of the LHC to light charged Higgs boson decaying via the above bosonic modes and produced in top decay following both single top and top pair production processes. Our findings demonstrate that, when the integrated luminosity can reach 100 fb$^{-1}$, the LHC has the potential to either discover or rule out most of these BPs via either of these two production and decay channels or both.

hep-ph↗

HRank: Filter Pruning using High-Rank Feature Map

Neural network pruning offers a promising prospect to facilitate deploying deep neural networks on resource-limited devices. However, existing methods are still challenged by the training inefficiency and labor cost in pruning designs, due to missing theoretical guidance of non-salient network components. In this paper, we propose a novel filter pruning method by exploring the High Rank of feature maps (HRank). Our HRank is inspired by the discovery that the average rank of multiple feature maps generated by a single filter is always the same, regardless of the number of image batches CNNs receive. Based on HRank, we develop a method that is mathematically formulated to prune filters with low-rank feature maps. The principle behind our pruning is that low-rank feature maps contain less information, and thus pruned results can be easily reproduced. Besides, we experimentally show that weights with high-rank feature maps contain more important information, such that even when a portion is not updated, very little damage would be done to the model performance. Without introducing any additional constraints, HRank leads to significant improvements over the state-of-the-arts in terms of FLOPs and parameters reduction, with similar accuracies. For example, with ResNet-110, we achieve a 58.2%-FLOPs reduction by removing 59.2% of the parameters, with only a small loss of 0.14% in top-1 accuracy on CIFAR-10. With Res-50, we achieve a 43.8%-FLOPs reduction by removing 36.7% of the parameters, with only a loss of 1.17% in the top-1 accuracy on ImageNet. The codes can be available at https://github.com/lmbxmu/HRank.

cs.CV↗

Detection of magnetic impurities using electron vortex beams

Electron microscopy stands out as electron waves providing higher spatial resolving power compared to their optical counterpart. Here we investigate theoretically the interaction of twisted electrons generated in transmission electron microscope (TEM) and magnetic impurity, in which the magnetic dipole moment is taken as a demonstration element. In addition to the usual optical phase, the inhomogeneous vector potential generated by the magnetic dipole moment makes additional contribution to the intrinsic orbital angular momentum of electrons, resulting in a Gouy phase shift. By interfering the outgoing twisted electron beam with a reference Gaussian-cylindrical wave, one can determine the magnitude and orientation of magnetic dipole directly via the rotational and deformed interference pattern. The obtained results demonstrate the usefulness of twisted electron beams for probing the atomic- and nanoscale magnetism of impurity by TEM and the proposed model provides the conceptual basis for future developments of the TEM method.

cond-mat.mes-hall↗

Determining the Electron-Phonon Coupling in Superconducting Cuprates by Resonant Inelastic X-ray Scattering: Methods and Results on Nd$_{1+x}$Ba$_{2-x}$Cu$_3$O$_{7-δ}$

The coupling between lattice vibration quanta and valence electrons can induce charge density modulations and decisively influence the transport properties of materials, e.g. leading to conventional superconductivity. In high critical temperature superconductors, where electronic correlation is the main actor, the actual role of electron-phonon coupling (EPC) is being intensely debated theoretically and investigated experimentally. We present an in-depth study of how the EPC strength can be obtained directly from resonant inelastic x-ray scattering (RIXS) data through the theoretical approach derived by Ament et al. [EPL 95, 27008 (2011)]. The role of the model parameters (e.g. phonon energy $ω_0$, intermediate state lifetime $1/Γ$, EPC matrix element $M$, and detuning energy $Ω$) is thoroughly analyzed, providing general relations among them that can be used to make quantitative estimates of the dimensionless EPC $g = (M/ω_0)^2$ without detailed microscopic modeling. We then apply these methods to very high resolution Cu $L_3$ edge RIXS spectra of three Nd$_{1+x}$Ba$_{2-x}$Cu$_3$O$_{7-δ}$ films. For the insulating antiferromagnetic parent compound the value of $M$ as a function of the in-plane momentum transfer is obtained for Cu-O bond-stretching (breathing) and bond-bending (buckling) phonon branches. For the underdoped and the nearly optimally doped samples, the effects of Coulomb screening and of charge-density-wave correlations on $M$ are assessed. In light of the anticipated further improvements of the RIXS experimental resolution, this work provides a solid framework for an exhaustive investigation of the EPC in cuprates and other quantum materials.

cond-mat.supr-con↗

Effective Rabi dynamics of Rydberg atoms and robust high-fidelity quantum gates with a resonant amplitude-modulation field

With a resonant amplitude-modulation field on two Rydberg atoms, we propose a Rydberg antiblockade (RAB) regime, where the Rabi oscillation between collective ground and excited states is induced. A controlled-Z gate can be yielded through a Rabi cycle. Further, several common issues of the RAB gates are solved by modifying the parameter relation. The gate fidelity and the gate robustness against the control error are enhanced with a shaped pulse. The requirement of control precision of the Rydberg-Rydberg interaction strength is relaxed. In addition, the atomic excitation is restrained and therefore the gate robustness against the atomic decay is enhanced.

quant-ph↗

Skeleton-to-Response: Dialogue Generation Guided by Retrieval Memory

For dialogue response generation, traditional generative models generate responses solely from input queries. Such models rely on insufficient information for generating a specific response since a certain query could be answered in multiple ways. Consequentially, those models tend to output generic and dull responses, impeding the generation of informative utterances. Recently, researchers have attempted to fill the information gap by exploiting information retrieval techniques. When generating a response for a current query, similar dialogues retrieved from the entire training data are considered as an additional knowledge source. While this may harvest massive information, the generative models could be overwhelmed, leading to undesirable performance. In this paper, we propose a new framework which exploits retrieval results via a skeleton-then-response paradigm. At first, a skeleton is generated by revising the retrieved responses. Then, a novel generative model uses both the generated skeleton and the original query for response generation. Experimental results show that our approaches significantly improve the diversity and informativeness of the generated responses.

cs.CL↗

Pseudo-LiDAR from Visual Depth Estimation: Bridging the Gap in 3D Object Detection for Autonomous Driving

3D object detection is an essential task in autonomous driving. Recent techniques excel with highly accurate detection rates, provided the 3D input data is obtained from precise but expensive LiDAR technology. Approaches based on cheaper monocular or stereo imagery data have, until now, resulted in drastically lower accuracies --- a gap that is commonly attributed to poor image-based depth estimation. However, in this paper we argue that it is not the quality of the data but its representation that accounts for the majority of the difference. Taking the inner workings of convolutional neural networks into consideration, we propose to convert image-based depth maps to pseudo-LiDAR representations --- essentially mimicking the LiDAR signal. With this representation we can apply different existing LiDAR-based detection algorithms. On the popular KITTI benchmark, our approach achieves impressive improvements over the existing state-of-the-art in image-based performance --- raising the detection accuracy of objects within the 30m range from the previous state-of-the-art of 22% to an unprecedented 74%. At the time of submission our algorithm holds the highest entry on the KITTI 3D object detection leaderboard for stereo-image-based approaches. Our code is publicly available at https://github.com/mileyan/pseudo_lidar.

cs.CV↗