Search arXiv⌕ Search

arXiv subjects

Yun Li

Publications and source records attributed to Yun Li.

At least 145 records · Page 8Linked to original sources

Imaging Stacking-Dependent Surface Plasmon Polaritons in Trilayer Graphene

We report a nano-infrared (IR) imaging study of trilayer graphene (TLG) with both ABA (Bernal) and ABC (rhombohedral) stacking orders using the scattering-type scanning near-field optical microscope (s-SNOM). With s-SNOM operating in the mid-IR region, we mapped in real space the surface plasmon polaritons (SPPs) of ABA-TLG and ABC-TLG, which are tunable with electrical gating. Through quantitative modeling of the plasmonic imaging data, we found that the plasmon wavelength of ABA-TLG is significantly larger than that of ABC-TLG, resulting in a sizable impedance mismatch and hence a strong plasmon reflection at the ABA/ABC lateral junction. Further analysis indicates that the different plasmonic responses of the two types of TLG are directly linked to their electronic structures and carrier properties. Our work uncovers the physics behind the stacking-dependent plasmonic responses of TLG and sheds light on future applications of TLG and the ABA/ABC junctions in IR plasmonics and planar nano-optics.

physics.optics↗

Deep Spatial Domain Generalization

Spatial autocorrelation and spatial heterogeneity widely exist in spatial data, which make the traditional machine learning model perform badly. Spatial domain generalization is a spatial extension of domain generalization, which can generalize to unseen spatial domains in continuous 2D space. Specifically, it learns a model under varying data distributions that generalizes to unseen domains. Although tremendous success has been achieved in domain generalization, there exist very few works on spatial domain generalization. The advancement of this area is challenged by: 1) Difficulty in characterizing spatial heterogeneity, and 2) Difficulty in obtaining predictive models for unseen locations without training data. To address these challenges, this paper proposes a generic framework for spatial domain generalization. Specifically, We develop the spatial interpolation graph neural network that handles spatial data as a graph and learns the spatial embedding on each node and their relationships. The spatial interpolation graph neural network infers the spatial embedding of an unseen location during the test phase. Then the spatial embedding of the target location is used to decode the parameters of the downstream-task model directly on the target location. Finally, extensive experiments on thirteen real-world datasets demonstrate the proposed method's strength.

cs.LG↗

Effects from Hadronic Structure of Photon on $B\toϕγ$ and $B_s\to(ρ^0,ω)γ$ Decays

Using the perturbative QCD approach, we studied the effects from hadronic structure of photon on the pure annihilation rediative decays $B\toϕγ$ and $B_s\to(ρ^0,ω)γ$. These decays have small branching fractions due to the power suppression by the $Λ/m_B$, which make them very sensitive to the next-leading power corrections. The quark components and the related two-particle distribution amplitudes of a final state photon are introduced. The branching fractions can be enhanced remarkably by the factorizable and nonfactorizable emission diagrams. The branching fraction of $B\to ϕγ$ even increases by about 40 times, and those of $B_s \to ρ^0γ$ and $B_s \to ωγ$ are at the order of ${\cal O}(10^{-10})$. We also note that the ratio of branching fractions of $B_s \to ρ^0γ$ and $B_s \to ωγ$ is very sensitive to the effects from hadronic structure of photon. All above results could be tested in future.

hep-ph↗

Disentangled and Side-aware Unsupervised Domain Adaptation for Cross-dataset Subjective Tinnitus Diagnosis

EEG-based tinnitus classification is a valuable tool for tinnitus diagnosis, research, and treatments. Most current works are limited to a single dataset where data patterns are similar. But EEG signals are highly non-stationary, resulting in model's poor generalization to new users, sessions or datasets. Thus, designing a model that can generalize to new datasets is beneficial and indispensable. To mitigate distribution discrepancy across datasets, we propose to achieve Disentangled and Side-aware Unsupervised Domain Adaptation (DSUDA) for cross-dataset tinnitus diagnosis. A disentangled auto-encoder is developed to decouple class-irrelevant information from the EEG signals to improve the classifying ability. The side-aware unsupervised domain adaptation module adapts the class-irrelevant information as domain variance to a new dataset and excludes the variance to obtain the class-distill features for the new dataset classification. It also align signals of left and right ears to overcome inherent EEG pattern difference. We compare DSUDA with state-of-the-art methods, and our model achieves significant improvements over competitors regarding comprehensive evaluation criteria. The results demonstrate our model can successfully generalize to a new dataset and effectively diagnose tinnitus.

eess.SP↗

Simple Primitives with Feasibility- and Contextuality-Dependence for Open-World Compositional Zero-shot Learning

The task of Compositional Zero-Shot Learning (CZSL) is to recognize images of novel state-object compositions that are absent during the training stage. Previous methods of learning compositional embedding have shown effectiveness in closed-world CZSL. However, in Open-World CZSL (OW-CZSL), their performance tends to degrade significantly due to the large cardinality of possible compositions. Some recent works separately predict simple primitives (i.e., states and objects) to reduce cardinality. However, they consider simple primitives as independent probability distributions, ignoring the heavy dependence between states, objects, and compositions. In this paper, we model the dependence of compositions via feasibility and contextuality. Feasibility-dependence refers to the unequal feasibility relations between simple primitives, e.g., \textit{hairy} is more feasible with \textit{cat} than with \textit{building} in the real world. Contextuality-dependence represents the contextual variance in images, e.g., \textit{cat} shows diverse appearances under the state of \textit{dry} and \textit{wet}. We design Semantic Attention (SA) and generative Knowledge Disentanglement (KD) to learn the dependence of feasibility and contextuality, respectively. SA captures semantics in compositions to alleviate impossible predictions, driven by the visual similarity between simple primitives. KD disentangles images into unbiased feature representations, easing contextual bias in predictions. Moreover, we complement the current compositional probability model with feasibility and contextuality in a compatible format. Finally, we conduct comprehensive experiments to analyze and validate the superior or competitive performance of our model, Semantic Attention and knowledge Disentanglement guided Simple Primitives (SAD-SP), on three widely-used benchmark OW-CZSL datasets.

cs.CV↗

SCA: Streaming Cross-attention Alignment for Echo Cancellation

End-to-End deep learning has shown promising results for speech enhancement tasks, such as noise suppression, dereverberation, and speech separation. However, most state-of-the-art methods for echo cancellation are either classical DSP-based or hybrid DSP-ML algorithms. Components such as the delay estimator and adaptive linear filter are based on traditional signal processing concepts, and deep learning algorithms typically only serve to replace the non-linear residual echo suppressor. This paper introduces an end-to-end echo cancellation network with a streaming cross-attention alignment (SCA). Our proposed method can handle unaligned inputs without requiring external alignment and generate high-quality speech without echoes. At the same time, the end-to-end algorithm simplifies the current echo cancellation pipeline for time-variant echo path cases. We test our proposed method on the ICASSP2022 and Interspeech2021 Microsoft deep echo cancellation challenge evaluation dataset, where our method outperforms some of the other hybrid and end-to-end methods.

eess.AS↗

Diversity-boosted Generalization-Specialization Balancing for Zero-shot Learning

Zero-Shot Learning (ZSL) aims to transfer classification capability from seen to unseen classes. Recent methods have proved that generalization and specialization are two essential abilities to achieve good performance in ZSL. However, focusing on only one of the abilities may result in models that are either too general with degraded classification ability or too specialized to generalize to unseen classes. In this paper, we propose an end-to-end network, termed as BGSNet, which equips and balances generalization and specialization abilities at the instance and dataset level. Specifically, BGSNet consists of two branches: the Generalization Network (GNet), which applies episodic meta-learning to learn generalized knowledge, and the Balanced Specialization Network (BSNet), which adopts multiple attentive extractors to extract discriminative features and achieve instance-level balance. A novel self-adjusted diversity loss is designed to optimize BSNet with redundancy reduced and diversity boosted. We further propose a differentiable dataset-level balance and update the weights in a linear annealing schedule to simulate network pruning and thus obtain the optimal structure for BSNet with dataset-level balance achieved. Experiments on four benchmark datasets demonstrate our model's effectiveness. Sufficient component ablations prove the necessity of integrating and balancing generalization and specialization abilities.

cs.CV↗

Generative Adversarial Learning for Trusted and Secure Clustering in Industrial Wireless Sensor Networks

Traditional machine learning techniques have been widely used to establish the trust management systems. However, the scale of training dataset can significantly affect the security performances of the systems, while it is a great challenge to detect malicious nodes due to the absence of labeled data regarding novel attacks. To address this issue, this paper presents a generative adversarial network (GAN) based trust management mechanism for Industrial Wireless Sensor Networks (IWSNs). First, type-2 fuzzy logic is adopted to evaluate the reputation of sensor nodes while alleviating the uncertainty problem. Then, trust vectors are collected to train a GAN-based codec structure, which is used for further malicious node detection. Moreover, to avoid normal nodes being isolated from the network permanently due to error detections, a GAN-based trust redemption model is constructed to enhance the resilience of trust management. Based on the latest detection results, a trust model update method is developed to adapt to the dynamic industrial environment. The proposed trust management mechanism is finally applied to secure clustering for reliable and real-time data transmission, and simulation results show that it achieves a high detection rate up to 96%, as well as a low false positive rate below 8%.

cs.NI↗

Near-real-time estimates of daily CO2 emissions from 1500 cities worldwide

Building on near-real-time and spatially explicit estimates of daily carbon dioxide (CO2) emissions, here we present and analyze a new city-level dataset of fossil fuel and cement emissions. Carbon Monitor Cities provides daily, city-level estimates of emissions from January 2019 through December 2021 for 1500 cities in 46 countries, and disaggregates five sectors: power generation, residential (buildings), industry, ground transportation, and aviation. The goal of this dataset is to improve the timeliness and temporal resolution of city-level emission inventories and includes estimates for both functional urban areas and city administrative areas that are consistent with global and regional totals. Comparisons with other datasets (i.e. CEADs, MEIC, Vulcan, and CDP) were performed, and we estimate the overall uncertainty to be 21.7%. Carbon Monitor Cities is a near-real-time, city-level emission dataset that includes cities around the world, including the first estimates for many cities in low-income countries. A more complete description of this dataset is published in Scientific Data (https://doi.org/10.1038/s41597-022-01657-z).

physics.soc-ph↗

Generative Adversarial Learning for Intelligent Trust Management in 6G Wireless Networks

Emerging six generation (6G) is the integration of heterogeneous wireless networks, which can seamlessly support anywhere and anytime networking. But high Quality-of-Trust should be offered by 6G to meet mobile user expectations. Artificial intelligence (AI) is considered as one of the most important components in 6G. Then AI-based trust management is a promising paradigm to provide trusted and reliable services. In this article, a generative adversarial learning-enabled trust management method is presented for 6G wireless networks. Some typical AI-based trust management schemes are first reviewed, and then a potential heterogeneous and intelligent 6G architecture is introduced. Next, the integration of AI and trust management is developed to optimize the intelligence and security. Finally, the presented AI-based trust management method is applied to secure clustering to achieve reliable and real-time communications. Simulation results have demonstrated its excellent performance in guaranteeing network security and service quality.

cs.NI↗

Functional law of large numbers and central limit theorem for slow-fast McKean-Vlasov equations

In this paper, we study the asymptotic behavior of a fully-coupled slow-fast McKean-Vlasov stochastic system. Using the non-linear Poisson equation on Wasserstein space, we first establish the strong convergence in the averaging principle of the functional law of large numbers type. In particular, the diffusion coefficient of the slow process can depend on the distribution of the fast motion. Then we consider the stochastic fluctuations of the original system around its average, and prove that the normalized difference will converge weakly to a linear McKean-Vlasov Ornstein-Uhlenbeck type process, which can be viewed as a functional central limit theorem. Extra drift and diffusion coefficients involving the expectation are characterized explicitly. Furthermore, the optimal rates of the convergence are also obtained.

math.PR↗

Antarctic Survey Telescope 3-3: Overview, System Performance and Preliminary Observations at Yaoan, Yunnan

The third Antarctic Survey Telescope array instrument at Dome A in Antarctica, the AST3-3 telescope, has been in commissioning from March 2021. We deployed AST3-3 at the Yaoan astronomical station in Yunnan Province for an automatic time-domain survey and follow-up observations with an optimised observation and protection system. The telescope system of AST3-3 is similar to that of AST3-1 and AST3-2, except that it is equipped with a 14K~$ \times$~10K QHY411 CMOS camera. AST3-3 has a field of view of $1.65^\circ \times 1.23^\circ$ and is currently using the $g$ band filter. During commissioning at Yaoan, AST3-3 aims to conduct an extragalactic transient survey, coupled with prompt follow-ups of opportunity targets. In this paper, we present the architecture of the AST3-3 automatic observation system. We demonstrate the data processing of observations by representatives SN 2022eyw and GRB 210420B.

astro-ph.IM↗

Weight-dependent Gates for Network Pruning

In this paper, a simple yet effective network pruning framework is proposed to simultaneously address the problems of pruning indicator, pruning ratio, and efficiency constraint. This paper argues that the pruning decision should depend on the convolutional weights, and thus proposes novel weight-dependent gates (W-Gates) to learn the information from filter weights and obtain binary gates to prune or keep the filters automatically. To prune the network under efficiency constraints, a switchable Efficiency Module is constructed to predict the hardware latency or FLOPs of candidate pruned networks. Combined with the proposed Efficiency Module, W-Gates can perform filter pruning in an efficiency-aware manner and achieve a compact network with a better accuracy-efficiency trade-off. We have demonstrated the effectiveness of the proposed method on ResNet34, ResNet50, and MobileNet V2, respectively achieving up to 1.33/1.28/1.1 higher Top-1 accuracy with lower hardware latency on ImageNet. Compared with state-of-the-art methods, W-Gates also achieves superior performance.

cs.CV↗

Side-aware Meta-Learning for Cross-Dataset Listener Diagnosis with Subjective Tinnitus

With the development of digital technology, machine learning has paved the way for the next generation of tinnitus diagnoses. Although machine learning has been widely applied in EEG-based tinnitus analysis, most current models are dataset-specific. Each dataset may be limited to a specific range of symptoms, overall disease severity, and demographic attributes; further, dataset formats may differ, impacting model performance. This paper proposes a side-aware meta-learning for cross-dataset tinnitus diagnosis, which can effectively classify tinnitus in subjects of divergent ages and genders from different data collection processes. Owing to the superiority of meta-learning, our method does not rely on large-scale datasets like conventional deep learning models. Moreover, we design a subject-specific training process to assist the model in fitting the data pattern of different patients or healthy people. Our method achieves a high accuracy of 73.8\% in the cross-dataset classification. We conduct an extensive analysis to show the effectiveness of side information of ears in enhancing model performance and side-aware meta-learning in improving the quality of the learned features.

eess.SP↗

Poisson equation on Wasserstein space and diffusion approximations for McKean-Vlasov equation

We consider the fully-coupled McKean-Vlasov equation with multi-time-scale potentials, and all the coefficients depend on the distributions of both the slow component and the fast motion. By studying the smoothness of the solution of the non-linear Poisson equation on Wasserstein space, we derive the asymptotic limit as well as the quantitative error estimate of the convergence for the slow process. Extra homogenized drift term containing derivative in the measure argument of the solution of the Poisson equation appears in the limit, which seems to be new and is unique for systems involving the fast distribution.

math.PR↗

Chinese Idiom Paraphrasing

Idioms, are a kind of idiomatic expression in Chinese, most of which consist of four Chinese characters. Due to the properties of non-compositionality and metaphorical meaning, Chinese Idioms are hard to be understood by children and non-native speakers. This study proposes a novel task, denoted as Chinese Idiom Paraphrasing (CIP). CIP aims to rephrase idioms-included sentences to non-idiomatic ones under the premise of preserving the original sentence's meaning. Since the sentences without idioms are easier handled by Chinese NLP systems, CIP can be used to pre-process Chinese datasets, thereby facilitating and improving the performance of Chinese NLP tasks, e.g., machine translation system, Chinese idiom cloze, and Chinese idiom embeddings. In this study, CIP task is treated as a special paraphrase generation task. To circumvent difficulties in acquiring annotations, we first establish a large-scale CIP dataset based on human and machine collaboration, which consists of 115,530 sentence pairs. We further deploy three baselines and two novel CIP approaches to deal with CIP problems. The results show that the proposed methods have better performances than the baselines based on the established CIP dataset.

cs.CL↗

Prompt-Learning for Short Text Classification

In the short text, the extremely short length, feature sparsity, and high ambiguity pose huge challenges to classification tasks. Recently, as an effective method for tuning Pre-trained Language Models for specific downstream tasks, prompt-learning has attracted a vast amount of attention and research. The main intuition behind the prompt-learning is to insert the template into the input and convert the text classification tasks into equivalent cloze-style tasks. However, most prompt-learning methods expand label words manually or only consider the class name for knowledge incorporating in cloze-style prediction, which will inevitably incur omissions and bias in short text classification tasks. In this paper, we propose a simple short text classification approach that makes use of prompt-learning based on knowledgeable expansion. Taking the special characteristics of short text into consideration, the method can consider both the short text itself and class name during expanding label words space. Specifically, the top $N$ concepts related to the entity in the short text are retrieved from the open Knowledge Graph like Probase, and we further refine the expanded label words by the distance calculation between selected concepts and class labels. Experimental results show that our approach obtains obvious improvement compared with other fine-tuning, prompt-learning, and knowledgeable prompt-tuning methods, outperforming the state-of-the-art by up to 6 Accuracy points on three well-known datasets.

cs.CL↗

Magnetotransport due to conductivity fluctuations in non-magnetic ZrTe2 nanoplates

Transition metal dichalcogenides with nontrivial band structures exhibit various fascinating physical properties and have sparked intensively research interest. Here, we performed systematic magnetotransport measurements on mechanical exfoliation prepared ZrTe2 nanoplates. We revealed that the negative longitudinal magnetoresistivity observed at high field region in the presence of parallel electric and magnetic fields could stem from the conductivity fluctuations due to the excess Zr in the nanoplates. In addition, the parametric plot, the planar Hall resistivity as function of the in-plane anisotropic magnetoresistivity, has an ellipse-shaped pattern with shifted orbital center, which further strengthen the evidence for the conductivity fluctuations. Our work provides some useful insights into transport phenomena in topological materials.

cond-mat.mes-hall↗