Searcharxiv⌕ Search

arXiv subjects

Yang Xiao

Publications and source records attributed to Yang Xiao.

At least 235 records · Page 13Linked to original sources

Continual Learning For On-Device Environmental Sound Classification

Continuously learning new classes without catastrophic forgetting is a challenging problem for on-device environmental sound classification given the restrictions on computation resources (e.g., model size, running memory). To address this issue, we propose a simple and efficient continual learning method. Our method selects the historical data for the training by measuring the per-sample classification uncertainty. Specifically, we measure the uncertainty by observing how the classification probability of data fluctuates against the parallel perturbations added to the classifier embedding. In this way, the computation cost can be significantly reduced compared with adding perturbation to the raw data. Experimental results on the DCASE 2019 Task 1 and ESC-50 dataset show that our proposed method outperforms baseline continual learning methods on classification accuracy and computational efficiency, indicating our method can efficiently and incrementally learn new classes without the catastrophic forgetting problem for on-device environmental sound classification.

cs.SD↗

Rainbow Keywords: Efficient Incremental Learning for Online Spoken Keyword Spotting

Catastrophic forgetting is a thorny challenge when updating keyword spotting (KWS) models after deployment. This problem will be more challenging if KWS models are further required for edge devices due to their limited memory. To alleviate such an issue, we propose a novel diversity-aware incremental learning method named Rainbow Keywords (RK). Specifically, the proposed RK approach introduces a diversity-aware sampler to select a diverse set from historical and incoming keywords by calculating classification uncertainty. As a result, the RK approach can incrementally learn new tasks without forgetting prior knowledge. Besides, the RK approach also proposes data augmentation and knowledge distillation loss function for efficient memory management on the edge device. Experimental results show that the proposed RK approach achieves 4.2% absolute improvement in terms of average accuracy over the best baseline on Google Speech Command dataset with less required memory. The scripts are available on GitHub.

cs.SD↗

Finite-time quantum Otto engine with a squeezed thermal bath: Role of quantum coherence and squeezing in the performance and fluctuations

We consider a finite-time quantum Otto heat engine that consists of two isochoric (thermal-contact) process, where the system is alternatively coupled to a hot squeezed and a cold thermal reservoir, and two unitary driven strokes, where the system is isolated from these two baths and its von Neumann entropy keeps constant. Both quantum inner friction and coherence are generated along the driven stroke and coherence cannot be fully erased after the finite-time hot isochore. Using full counting statistics, we present the probability distribution functions of heat injection and total work per cycle, which are dependent on the time duration along each process. With these, we derive the analytical expressions for the thermodynamic quantities of the two-level heat engine, such as total work, thermodynamic efficiency, entropy production, and work fluctuations, in which effects of coherence, squeezing, inner friction and finite-time heat exchange are included. We then numerically determine the thermodynamic quantities and the fluctuations using the parameters employed in the experimental implementation. Our results clarify the role of coherence and squeezing in the performance and fluctuations in the quantum Otto engines.

quant-ph↗

On the Robustness of Reading Comprehension Models to Entity Renaming

We study the robustness of machine reading comprehension (MRC) models to entity renaming -- do models make more wrong predictions when the same questions are asked about an entity whose name has been changed? Such failures imply that models overly rely on entity information to answer questions, and thus may generalize poorly when facts about the world change or questions are asked about novel entities. To systematically audit this issue, we present a pipeline to automatically generate test examples at scale, by replacing entity names in the original test sample with names from a variety of sources, ranging from names in the same test set, to common names in life, to arbitrary strings. Across five datasets and three pretrained model architectures, MRC models consistently perform worse when entities are renamed, with particularly large accuracy drops on datasets constructed via distant supervision. We also find large differences between models: SpanBERT, which is pretrained with span-level masking, is more robust than RoBERTa, despite having similar accuracy on unperturbed test data. We further experiment with different masking strategies as the continual pretraining objective and find that entity-based masking can improve the robustness of MRC models.

cs.CL↗

Are All the Datasets in Benchmark Necessary? A Pilot Study of Dataset Evaluation for Text Classification

In this paper, we ask the research question of whether all the datasets in the benchmark are necessary. We approach this by first characterizing the distinguishability of datasets when comparing different systems. Experiments on 9 datasets and 36 systems show that several existing benchmark datasets contribute little to discriminating top-scoring systems, while those less used datasets exhibit impressive discriminative power. We further, taking the text classification task as a case study, investigate the possibility of predicting dataset discrimination based on its properties (e.g., average sentence length). Our preliminary experiments promisingly show that given a sufficient number of training experimental records, a meaningful predictor can be learned to estimate dataset discrimination over unseen datasets. We released all datasets with features explored in this work on DataLab: \url{https://datalab.nlpedia.ai}.

cs.CL↗

Small Footprint Multi-channel ConvMixer for Keyword Spotting with Centroid Based Awareness

It is critical for a keyword spotting model to have a small footprint as it typically runs on-device with low computational resources. However, maintaining the previous SOTA performance with reduced model size is challenging. In addition, a far-field and noisy environment with multiple signals interference aggravates the problem causing the accuracy to degrade significantly. In this paper, we present a multi-channel ConvMixer for speech command recognitions. The novel architecture introduces an additional audio channel mixing for channel audio interaction in a multi-channel audio setting to achieve better noise-robust features with more efficient computation. Besides, we proposed a centroid based awareness component to enhance the system by equipping it with additional spatial geometry information in the latent feature projection space. We evaluate our model using the new MISP challenge 2021 dataset. Our model achieves significant improvement against the official baseline with a 55% gain in the competition score (0.152) on raw microphone array input and a 63% (0.126) boost upon front-end speech enhancement.

cs.SD↗

Templates for 3D Object Pose Estimation Revisited: Generalization to New Objects and Robustness to Occlusions

We present a method that can recognize new objects and estimate their 3D pose in RGB images even under partial occlusions. Our method requires neither a training phase on these objects nor real images depicting them, only their CAD models. It relies on a small set of training objects to learn local object representations, which allow us to locally match the input image to a set of "templates", rendered images of the CAD models for the new objects. In contrast with the state-of-the-art methods, the new objects on which our method is applied can be very different from the training objects. As a result, we are the first to show generalization without retraining on the LINEMOD and Occlusion-LINEMOD datasets. Our analysis of the failure modes of previous template-based approaches further confirms the benefits of local features for template matching. We outperform the state-of-the-art template matching methods on the LINEMOD, Occlusion-LINEMOD and T-LESS datasets. Our source code and data are publicly available at https://github.com/nv-nguyen/template-pose

cs.CV↗

Can electron and muon $g-2$ anomalies be jointly explained in SUSY?

The FNAL+BNL measurements for muon $g-2$ is $4.2σ$ above the SM prediction, and the Berkeley $^{133}$Cs measurement for the fine-structure constant $α_{\rm em}$ leads to the SM prediction for electron $g-2$ which is $2.4σ$ above the experimental value. Hence, a joint explanation of both anomalies requires a positive contribution to muon $g-2$ and a negative contribution to electron $g-2$, which is rather challenging. In this work we explore the possibility of such a joint explanation in the minimal supersymmetric standard model (MSSM). Assuming no universality between smuon and selectron soft masses, we find out a part of parameter space for a joint explanation at $2σ$ level, i.e., $μM_1,μM_2<0$, $m_{L1}, m_{E2}<200$ GeV, $m_{L2}$ being much larger than the soft masses of other sleptons, $|M_1|<125$ GeV and $μ<400$ GeV. This part of parameter space can survive LHC and LEP constraints, but gives an over-abundance for dark matter if the bino-like lightest neutralino is assumed to be the dark matter candidate. With the assumption that the dark matter candidate is a superWIMP (say a pseudo-goldstino in multi-sector SUSY breaking scenarios, whose mass can be as light as GeV and produced from the late-decay of the thermally freeze-out lightest neutralino), the dark matter problem can be avoided. So, we conclude that the MSSM may give a joint explanation for the muon and electron $g-2$ anomalies at $2σ$ level (the muon $g-2$ anomaly can be even ameliorated to $1σ$).

hep-ph↗

An accurate relativistic chiral nucleon-nucleon interaction up to the next-to-next-to-leading order

We report on the construction of an accurate relativistic chiral nucleon-nucleon interaction up to the next-to-next-to-leading (NNLO) order. We compare the so-obtained neutron-proton phaseshifts with the next-to-next-to-next-to-leading order (N$^3$LO) nonrelativistic ones and we show that up to $T_\mathrm{lab.}=200$ MeV, the relativistic chiral nuclear force can describe the PWA93 phaseshifts and inelasticities as well as its N$^3$LO nonrelativistic counterparts. As a result, the relativistic chiral nuclear force can be readily used for relativistic ab initio nuclear structure, reaction, as well astrophysical studies.

nucl-th↗

Accurate relativistic chiral nucleon-nucleon interaction up to NNLO

We construct a relativistic chiral nucleon-nucleon interaction up to the next-to-next-to-leading order in covariant baryon chiral perturbation theory. We show that a good description of the $np$ phase shifts up to $T_\mathrm{lab}=200$ MeV and even higher can be achieved with a $\tildeχ^2/\mathrm{d.o.f.}$ less than 1. Both the next-to-leading order results and the next-to-next-to-leading order results describe the phase shifts equally well up to $T_\mathrm{lab}=200$ MeV, but for higher energies, the latter behaves better, showing satisfactory convergence. The relativistic chiral potential provides the most essential inputs for relativistic ab initio studies of nuclear structure and reactions, which has been in need for almost two decades.

nucl-th↗

DataLab: A Platform for Data Analysis and Intervention

Despite data's crucial role in machine learning, most existing tools and research tend to focus on systems on top of existing data rather than how to interpret and manipulate data. In this paper, we propose DataLab, a unified data-oriented platform that not only allows users to interactively analyze the characteristics of data, but also provides a standardized interface for different data processing operations. Additionally, in view of the ongoing proliferation of datasets, \toolname has features for dataset recommendation and global vision analysis that help researchers form a better view of the data ecosystem. So far, DataLab covers 1,715 datasets and 3,583 of its transformed version (e.g., hyponyms replacement), where 728 datasets support various analyses (e.g., with respect to gender bias) with the help of 140M samples annotated by 318 feature functions. DataLab is under active development and will be supported going forward. We have released a web platform, web API, Python SDK, PyPI published package and online documentation, which hopefully, can meet the diverse needs of researchers.

cs.LG↗

Performance of quantum heat engines via adiabatic deformation of potential

We present a quantum Otto engine model consisting of two isochoric and two adiabatic strokes, where the adiabatic expansion or compression is realized by adiabatically changing the shape of the potential. Here we show that such an adiabatic deformation may alter operation mode and enhance machine performance by increasing output work and efficiency, even with the advantage of decreasing work fluctuations. If the heat engine operates under maximal power by optimizing the control parameter, the efficiency shows certain universal behavior.

quant-ph↗

Nonperturbative two-pion exchange contributions to the nucleon-nucleon interaction in covariant baryon chiral perturbation theory

We calculate the nonperturbative two-pion exchange (TPE) contributions to the $NN$ interaction in covariant baryon chiral perturbation theory. We study how the nonperturbative resummation affects the $NN$ phase shifts for partial waves with $J \geq 3$ and $L \leq 6$. No significant differences are observed between the nonperturbative phase shifts and perturbative ones for most partial waves except for $^3D_3$, for which the nonperturbative resummation greatly improves the description of the phase shifts. However, a significant cutoff dependence is found for this partial wave and a reasonable description of the phase shifts can only be obtained with a particular cutoff. Furthermore, we compare the so-obtained nonperturbative phase shifts with those obtained in the heavy baryon chiral perturbation theory. We show that the contributions from relativistic nonperturbative TPE are more moderate than those from the nonrelativistic TPE obtained in the dimensional regularization scheme. A proper convergence pattern is observed for most of the partial waves studied except for $^3F_3$, $^3F_4$, and $^3H_6$, for which the subleading TPE contributions are a bit strong. We find that for $H$ and $I$ partial waves, the OPE alone can already describe the phase shifts reasonably well.

nucl-th↗

Decentralized Spectrum Access System: Vision, Challenges, and a Blockchain Solution

Spectrum access system (SAS) is widely considered the de facto solution to coordinating dynamic spectrum sharing (DSS) and protecting incumbent users. The current SAS paradigm prescribed by the FCC for the CBRS band and standardized by the WInnForum follows a centralized service model in that a spectrum user subscribes to a SAS server for spectrum allocation service. This model, however, neither tolerates SAS server failures (crash or Byzantine) nor resists dishonest SAS administrators, leading to serious concerns on SAS system reliability and trustworthiness. This is especially concerning for the evolving DSS landscape where an increasing number of SAS service providers and heterogeneous user requirements are coming up. To address these challenges, we propose a novel blockchain-based decentralized SAS architecture called BD-SAS that provides SAS services securely and efficiently, without relying on the trust of each individual SAS server for the overall system trustworthiness. In BD-SAS, a global blockchain (G-Chain) is used for spectrum regulatory compliance while smart contract-enabled local blockchains (L-Chains) are instantiated in individual spectrum zones for automating spectrum access assignment per user request. We hope our vision of a decentralized SAS, the BD-SAS architecture, and discussion on future challenges can open up a new direction towards reliable spectrum management in a decentralized manner.

cs.DC↗

Constraining CP-phases in SUSY: an interplay of muon/electron $g-2$ and electron EDM

The minimal supersymmetric standard model (MSSM) with complex parameters can contribute sizably to muon/electron anomalous magnetic dipole momemnt ($g-2$) and electric dipole moment (EDM). The electron $g-2$ interplays with electron EDM; the muon $g-2$ can also interplay with electron EDM assuming the universality between smuon and selectron masses, either of which can constrain the relevant CP-phases in the MSSM. In this work, we first use such an interplay to derive an approximate analytical upper limit on the relevant CP-phase. Then we extensively scan the parameter space to obtain more accurate upper limits. We obtain the following observations: (i) The muon $g-2$ in the $2σ$ range combined with the electron EDM upper limit (assuming the universality between smuon and selectron masses) typically constrains the relevant CP-phase under $1.9\times 10^{-5} (\text{rad})$; (ii) The electron $g-2$ in the $2σ$ range (Berkeley) interplays with the electron EDM upper limit (without assuming the universality between smuon and selectron masses) constrains the relevant CP-phase under $3.9\times 10^{-6}(\text{rad})$ (also requiring muon $g-2$ in the allowed $2σ$ range). We also find some special cancellations in the parameter space which can relax the constraints by a couple of orders. Such stringent limits on CP-phases may pose a challenge for model building of SUSY, i.e., how to naturally suppress these phases.

hep-ph↗

UVO Challenge on Video-based Open-World Segmentation 2021: 1st Place Solution

In this report, we introduce our (pretty straightforard) two-step "detect-then-match" video instance segmentation method. The first step performs instance segmentation for each frame to get a large number of instance mask proposals. The second step is to do inter-frame instance mask matching with the help of optical flow. We demonstrate that with high quality mask proposals, a simple matching mechanism is good enough for tracking. Our approach achieves the first place in the UVO 2021 Video-based Open-World Segmentation Challenge.

cs.CV↗

PoseContrast: Class-Agnostic Object Viewpoint Estimation in the Wild with Pose-Aware Contrastive Learning

Motivated by the need for estimating the 3D pose of arbitrary objects, we consider the challenging problem of class-agnostic object viewpoint estimation from images only, without CAD model knowledge. The idea is to leverage features learned on seen classes to estimate the pose for classes that are unseen, yet that share similar geometries and canonical frames with seen classes. We train a direct pose estimator in a class-agnostic way by sharing weights across all object classes, and we introduce a contrastive learning method that has three main ingredients: (i) the use of pre-trained, self-supervised, contrast-based features; (ii) pose-aware data augmentations; (iii) a pose-aware contrastive loss. We experimented on Pascal3D+, ObjectNet3D and Pix3D in a cross-dataset fashion, with both seen and unseen classes. We report state-of-the-art results, including against methods that additionally use CAD models as input.

cs.CV↗

A pedagogical review on muon $g-2$

This note is a pedagogical mini review on the muon anomalous magnetic moment ($g-2$), translated and adapted from our article published in Modern Physics 4 (2021) 40-47. The contents include: (i) The magnetic moment of an electric-current coil; (ii) The magnetic moment of a charged lepton estimated as a classical charged ball with spin; (iii) The magnetic moment of a charged lepton from Dirac equation with electromagnetic interaction; (iv) The $g-2$ of a charged lepton from QED beyond tree level with effective couplings; (v) The measurement of muon $g-2$; (vi) The muon $g-2$ in low energy supersymmetric models. Finally, we give an outlook.

hep-ph↗