Searcharxiv⌕ Search

arXiv subjects

Yang Zhao

Publications and source records attributed to Yang Zhao.

At least 199 records · Page 11Linked to original sources

2-in-1 Accelerator: Enabling Random Precision Switch for Winning Both Adversarial Robustness and Efficiency

The recent breakthroughs of deep neural networks (DNNs) and the advent of billions of Internet of Things (IoT) devices have excited an explosive demand for intelligent IoT devices equipped with domain-specific DNN accelerators. However, the deployment of DNN accelerator enabled intelligent functionality into real-world IoT devices still remains particularly challenging. First, powerful DNNs often come at prohibitive complexities, whereas IoT devices often suffer from stringent resource constraints. Second, while DNNs are vulnerable to adversarial attacks especially on IoT devices exposed to complex real-world environments, many IoT applications require strict security. Existing DNN accelerators mostly tackle only one of the two aforementioned challenges (i.e., efficiency or adversarial robustness) while neglecting or even sacrificing the other. To this end, we propose a 2-in-1 Accelerator, an integrated algorithm-accelerator co-design framework aiming at winning both the adversarial robustness and efficiency of DNN accelerators. Specifically, we first propose a Random Precision Switch (RPS) algorithm that can effectively defend DNNs against adversarial attacks by enabling random DNN quantization as an in-situ model switch. Furthermore, we propose a new precision-scalable accelerator featuring (1) a new precision-scalable MAC unit architecture which spatially tiles the temporal MAC units to boost both the achievable efficiency and flexibility and (2) a systematically optimized dataflow that is searched by our generic accelerator optimizer. Extensive experiments and ablation studies validate that our 2-in-1 Accelerator can not only aggressively boost both the adversarial robustness and efficiency of DNN accelerators under various attacks, but also naturally support instantaneous robustness-efficiency trade-offs adapting to varied resources without the necessity of DNN retraining.

cs.LG↗

ProjectedEx: Enhancing Generation in Explainable AI for Prostate Cancer

Prostate cancer, a growing global health concern, necessitates precise diagnostic tools, with Magnetic Resonance Imaging (MRI) offering high-resolution soft tissue imaging that significantly enhances diagnostic accuracy. Recent advancements in explainable AI and representation learning have significantly improved prostate cancer diagnosis by enabling automated and precise lesion classification. However, existing explainable AI methods, particularly those based on frameworks like generative adversarial networks (GANs), are predominantly developed for natural image generation, and their application to medical imaging often leads to suboptimal performance due to the unique characteristics and complexity of medical image. To address these challenges, our paper introduces three key contributions. First, we propose ProjectedEx, a generative framework that provides interpretable, multi-attribute explanations, effectively linking medical image features to classifier decisions. Second, we enhance the encoder module by incorporating feature pyramids, which enables multiscale feedback to refine the latent space and improves the quality of generated explanations. Additionally, we conduct comprehensive experiments on both the generator and classifier, demonstrating the clinical relevance and effectiveness of ProjectedEx in enhancing interpretability and supporting the adoption of AI in medical settings. Code will be released at https://github.com/Richardqiyi/ProjectedEx

eess.IV↗

Fast inverse lithography based on a model-driven block stacking convolutional neural network

In the realm of lithography, Optical Proximity Correction (OPC) is a crucial resolution enhancement technique that optimizes the transmission function of photomasks on a pixel-based to effectively counter Optical Proximity Effects (OPE). However, conventional pixel-based OPC methods often generate patterns that pose manufacturing challenges, thereby leading to the increased cost in practical scenarios. This paper presents a novel inverse lithographic approach to OPC, employing a model-driven, block stacking deep learning framework that expedites the generation of masks conducive to manufacturing. This method is founded on vector lithography modelling and streamlines the training process by eliminating the requirement for extensive labeled datasets. Furthermore, diversity of mask patterns is enhanced by employing a wave function collapse algorithm, which facilitates the random generation of a multitude of target patterns, therefore significantly expanding the range of mask paradigm. Numerical experiments have substantiated the efficacy of the proposed end-to-end approach, highlighting its superior capability to manage mask complexity within the context of advanced OPC lithography. This advancement is anticipated to enhance the feasibility and economic viability of OPC technology within actual manufacturing environments.

physics.optics↗

Audio-Infused Automatic Image Colorization by Exploiting Audio Scene Semantics

Automatic image colorization is inherently an ill-posed problem with uncertainty, which requires an accurate semantic understanding of scenes to estimate reasonable colors for grayscale images. Although recent interaction-based methods have achieved impressive performance, it is still a very difficult task to infer realistic and accurate colors for automatic colorization. To reduce the difficulty of semantic understanding of grayscale scenes, this paper tries to utilize corresponding audio, which naturally contains extra semantic information about the same scene. Specifically, a novel and pluggable audio-infused automatic image colorization (AIAIC) method is proposed, which consists of three stages. First, we take color image semantics as a bridge and pretrain a colorization network guided by color image semantics. Second, the natural co-occurrence of audio and video is utilized to learn the color semantic correlations between audio and visual scenes. Third, the implicit audio semantic representation is fed into the pretrained network to finally realize the audio-guided colorization. The whole process is trained in a self-supervised manner without human annotation. Experiments demonstrate that audio guidance can effectively improve the performance of automatic colorization, especially for some scenes that are difficult to understand only from visual modality.

cs.CV↗

Multimodal Class-aware Semantic Enhancement Network for Audio-Visual Video Parsing

The Audio-Visual Video Parsing task aims to recognize and temporally localize all events occurring in either the audio or visual stream, or both. Capturing accurate event semantics for each audio/visual segment is vital. Prior works directly utilize the extracted holistic audio and visual features for intra- and cross-modal temporal interactions. However, each segment may contain multiple events, resulting in semantically mixed holistic features that can lead to semantic interference during intra- or cross-modal interactions: the event semantics of one segment may incorporate semantics of unrelated events from other segments. To address this issue, our method begins with a Class-Aware Feature Decoupling (CAFD) module, which explicitly decouples the semantically mixed features into distinct class-wise features, including multiple event-specific features and a dedicated background feature. The decoupled class-wise features enable our model to selectively aggregate useful semantics for each segment from clearly matched classes contained in other segments, preventing semantic interference from irrelevant classes. Specifically, we further design a Fine-Grained Semantic Enhancement module for encoding intra- and cross-modal relations. It comprises a Segment-wise Event Co-occurrence Modeling (SECM) block and a Local-Global Semantic Fusion (LGSF) block. The SECM exploits inter-class dependencies of concurrent events within the same timestamp with the aid of a new event co-occurrence loss. The LGSF further enhances the event semantics of each segment by incorporating relevant semantics from more informative global video features. Extensive experiments validate the effectiveness of the proposed modules and loss functions, resulting in a new state-of-the-art parsing performance.

cs.CV↗

Latency Minimization for Movable Antennas-Enabled Relay-aided D2D Mobile Edge Computing Communication Systems

Device-to-device (D2D)-assisted mobile edge computing (MEC) is one of the critical technologies of future sixth generation (6G) networks. The core of D2D-assisted MEC is to reduce system latency for network edge UEs by supporting cloud computing services, thereby achieving high-speed transmission. Due to the sensitivity of communication signals to obstacles, relaying is adopted to enhance the D2D-assisted MEC system's performance and its coverage area. However, relay nodes and the base station (BS) are typically equipped with large-scale antenna arrays. This increases the cost of relay-assisted D2D MEC systems and limits their deployment. Movable antenna (MA) technology is used to work around this limitation without compromising performance. Specifically, the core of MA technology lies in optimizing the antenna positions to increase system capacity. Therefore, this paper proposes a novel resource allocation scheme for MA-enhanced relay-assisted D2D MEC systems. Specifically, the MA positions and beamforming of user equipments (UEs), relay, and BS as well as the allocation of resources and the computation task offloading rate at the MEC server, all are optimized herein with the objective of minimizing the maximum latency while satisfying computation and communication rate constraints. Since this is a multivariable non-convex problem, a parallel and distributed penalty dual decomposition (PDD) based algorithm is developed and combined with successive convex approximation (SCA) to solve this non-convex problem. The results of extensive numerical analyses show that the proposed algorithm significantly improves the performance of the MA-enhanced relay-assisted D2D communication system compared to a counterpart where relays and the BS are equiped with traditional fixed-position antenna (FPA).

eess.SP↗

Novel nonlinear system family generated from coupling effect of Sin-Cosine function

The Sine-Cosine function, which is widely adopted in mathematics and physics, has attracted our attention due to its unique properties. By delving into the coupling effect of the Sine-Cosine function, we discover a previously unreported class of nonlinear systems, namely the Sine-Cosine Nonlinear System Family (SCNSF). This discovery is motivated by the need to expand the repertoire of nonlinear systems and understand the complex behaviors that can emerge from the combination of basic trigonometric functions. The SCNSF has both chaotic characteristics in the real number domain and fractal characteristics in the complex number domain. The classification and general mathematical description of SCNSF provide a solid theoretical foundation for further research. The proposal of three types of classic systems within SCNSF and the investigation of their chaotic properties and hardware implementation open up new avenues for practical applications. The large chaotic range exhibited by these systems implies their potential applications in various fields such as secure communication and chaotic circuit design. Moreover, the discovery of the chaos generation mechanism based on the coupling effect of the Sine-Cosine function deepens our understanding of the origin of chaos. In the complex number domain, the high parameter sensitivity and rich fractal patterns of SCNSF can be can be harnessed to develop more advanced encryption algorithms and more sensitive signal detection methods, thereby contributing to the advancement of information security and signal processing technologies. Overall, the chaotic and fractal properties of SCNSF make it a valuable asset in the pursuit of innovative solutions in multiple scientific and engineering disciplines.

nlin.CD↗

Probing the equation of state of neutron stars with captured primordial black holes

Gravitational waves (GWs) from primordial black holes (PBHs) inspiraling within neutron stars (NSs) -- should they exist -- are detectable by ground-based detectors and offer a unique insight into the internal structure of NSs. To provide accurate templates for GW searches, we solve Einstein's equations within NSs and calculate the orbital motion of the captured PBH by considering dynamical friction, accretion, and gravitational radiation. Equipped with precise GW waveforms for PBHs inspiraling inside NSs, we find that the Einstein Telescope can differentiate between various equations of state for NSs. As PBHs inspiral deeper into NSs, the GW frequency rises near the surface, then decreases to a constant value deeper within NSs. The distinctive characteristics of GW frequency serve as the smoking gun for GW signals emitted by PBHs inspiraling inside NSs and can be used to probe the nuclear matter in the crust and core of NSs.

gr-qc↗

Lightweight Multiplane Images Network for Real-Time Stereoscopic Conversion from Planar Video

With the rapid development of stereoscopic display technologies, especially glasses-free 3D screens, and virtual reality devices, stereoscopic conversion has become an important task to address the lack of high-quality stereoscopic image and video resources. Current stereoscopic conversion algorithms typically struggle to balance reconstruction performance and inference efficiency. This paper proposes a planar video real-time stereoscopic conversion network based on multi-plane images (MPI), which consists of a detail branch for generating MPI and a depth-semantic branch for perceiving depth information. Unlike models that depend on explicit depth map inputs, the proposed method employs a lightweight depth-semantic branch to extract depth-aware features implicitly. To optimize the lightweight branch, a heavy training but light inference strategy is adopted, which involves designing a coarse-to-fine auxiliary branch that is only used during the training stage. In addition, the proposed method simplifies the MPI rendering process for stereoscopic conversion scenarios to further accelerate the inference. Experimental results demonstrate that the proposed method can achieve comparable performance to some state-of-the-art (SOTA) models and support real-time inference at 2K resolution. Compared to the SOTA TMPI algorithm, the proposed method obtains similar subjective quality while achieving over $40\times$ inference acceleration.

cs.CV↗

Controlling the Latent Diffusion Model for Generative Image Shadow Removal via Residual Generation

Large-scale generative models have achieved remarkable advancements in various visual tasks, yet their application to shadow removal in images remains challenging. These models often generate diverse, realistic details without adequate focus on fidelity, failing to meet the crucial requirements of shadow removal, which necessitates precise preservation of image content. In contrast to prior approaches that aimed to regenerate shadow-free images from scratch, this paper utilizes diffusion models to generate and refine image residuals. This strategy fully uses the inherent detailed information within shadowed images, resulting in a more efficient and faithful reconstruction of shadow-free content. Additionally, to revent the accumulation of errors during the generation process, a crosstimestep self-enhancement training strategy is proposed. This strategy leverages the network itself to augment the training data, not only increasing the volume of data but also enabling the network to dynamically correct its generation trajectory, ensuring a more accurate and robust output. In addition, to address the loss of original details in the process of image encoding and decoding of large generative models, a content-preserved encoder-decoder structure is designed with a control mechanism and multi-scale skip connections to achieve high-fidelity shadow-free image reconstruction. Experimental results demonstrate that the proposed method can reproduce high-quality results based on a large latent diffusion prior and faithfully preserve the original contents in shadow regions.

cs.CV↗

Multi-task CNN Behavioral Embedding Model For Transaction Fraud Detection

The burgeoning e-Commerce sector requires advanced solutions for the detection of transaction fraud. With an increasing risk of financial information theft and account takeovers, deep learning methods have become integral to the embedding of behavior sequence data in fraud detection. However, these methods often struggle to balance modeling capabilities and efficiency and incorporate domain knowledge. To address these issues, we introduce the multitask CNN behavioral Embedding Model for Transaction Fraud Detection. Our contributions include 1) introducing a single-layer CNN design featuring multirange kernels which outperform LSTM and Transformer models in terms of scalability and domain-focused inductive bias, and 2) the integration of positional encoding with CNN to introduce sequence-order signals enhancing overall performance, and 3) implementing multitask learning with randomly assigned label weights, thus removing the need for manual tuning. Testing on real-world data reveals our model's enhanced performance of downstream transaction models and comparable competitiveness with the Transformer Time Series (TST) model.

cs.LG↗

Entropy dynamics of the binary bond disordered Heisenberg chain

In this article, we study the quench dynamics of the binary bond disordered Heisenberg spin chain. First, we develop a new algorithm, the ancilla TEBD method, which combines the purification technique and the time-evolving block decimation (TEBD) algorithm to study the entanglement dynamics of binary bonded disordered spin chains. With the support of exact diagonalization (ED), we calculate the multifaractal dimension of the binary bond disordered Heisenberg spin model and study its dependence on the strength of the disorder potential; we find that the multifaractal dimension shows no critical behavior which rules out the existence of the many body localization transition. Then, we reproduce the long time scaling of the von Neumann entropy at the time scale that is beyond the reach of typical TEBD and time dependent density matrix renormalization group (tDMRG) algorithms. Based on the numerical analysis, we propose that such a long time scaling is due to the competition of the spin interaction and the disorder which can be seen as a new mechanism for the generating of long time scale entropy dynamics. At last, we numerically proved the existence of the transient Mpemba effect in the bond disordered Heisenberg chain.

cond-mat.str-el↗

Holographic multipartite entanglement from the upper bound of $n$-partite information

To analyze the holographic multipartite entanglement structure, we study the upper bound for holographic $n$-partite information $(-1)^n I_n$ that $n-1$ fixed boundary subregions participate together with an arbitrary region $E$. In general cases, we could find regions $E$ that make $I_n$ approach the upper bound. For $n=3$, we show that the upper bound of $-I_3$ is given by a quantity that we name the entanglement of state-constrained purification $EoSP(A:B)$. For $n\geq4$, we find that the upper bound of $I_n$ is finite in holographic CFT$_{1+1}$ but has UV divergences in higher dimensions, which reveals a fundamental difference in the entanglement structure in different dimensions. When $(-1)^n I_n$ reaches the information-theoretical upper bound, we argue that ( I_n ) fully accounts for multipartite global entanglement in these upper bound critical points, in contrast to usual cases where $I_n$ is not a perfect measure for multipartite entanglement. We further show that these results suggest that fewer-partite entanglement fully emerges from more-partite entanglement, and any $n-1$ distant regions are fully $n$-partite entangling in higher dimensions.

hep-th↗

Image Understanding Makes for A Good Tokenizer for Image Generation

Abstract Modern image generation (IG) models have been shown to capture rich semantics valuable for image understanding (IU) tasks. However, the potential of IU models to improve IG performance remains uncharted. We address this issue using a token-based IG framework, which relies on effective tokenizers to project images into token sequences. Currently, pixel reconstruction (e.g., VQGAN) dominates the training objective for image tokenizers. In contrast, our approach adopts the feature reconstruction objective, where tokenizers are trained by distilling knowledge from pretrained IU encoders. Comprehensive comparisons indicate that tokenizers with strong IU capabilities achieve superior IG performance across a variety of metrics, datasets, tasks, and proposal networks. Notably, VQ-KD CLIP achieves $4.10$ FID on ImageNet-1k (IN-1k). Visualization suggests that the superiority of VQ-KD can be partly attributed to the rich semantics within the VQ-KD codebook. We further introduce a straightforward pipeline to directly transform IU encoders into tokenizers, demonstrating exceptional effectiveness for IG tasks. These discoveries may energize further exploration into image tokenizer research and inspire the community to reassess the relationship between IU and IG. The code is released at https://github.com/magic-research/vector_quantization.

cs.CV↗

Corporate Fundamentals and Stock Price Co-Movement

We introduce an innovative framework that leverages advanced big data techniques to analyze dynamic co-movement between stocks and their underlying fundamentals using high-frequency stock market data. Our method identifies leading co-movement stocks through four distinct regression models: Forecast Error Variance Decomposition, transaction volume-normalized FEVD, Granger causality test frequency, and Granger causality test days. Validated using Chinese banking sector stocks, our framework uncovers complex relationships between stock price co-movements and fundamental characteristics, demonstrating its robustness and wide applicability across various sectors and markets. This approach not only enhances our understanding of market dynamics but also provides actionable insights for investors and policymakers, helping to mitigate broader market volatilities and improve financial stability. Our model indicates that banks' influence on their peers is significantly affected by their wealth management business, interbank activities, equity multiplier, non-performing loans, regulatory requirements, and reserve requirement ratios. This aids in mitigating the impact of broader market volatilities and provides deep insights into the unique influence of banks within the financial ecosystem.

q-fin.ST↗

CIT: Rethinking Class-incremental Semantic Segmentation with a Class Independent Transformation

Class-incremental semantic segmentation (CSS) requires that a model learn to segment new classes without forgetting how to segment previous ones: this is typically achieved by distilling the current knowledge and incorporating the latest data. However, bypassing iterative distillation by directly transferring outputs of initial classes to the current learning task is not supported in existing class-specific CSS methods. Via Softmax, they enforce dependency between classes and adjust the output distribution at each learning step, resulting in a large probability distribution gap between initial and current tasks. We introduce a simple, yet effective Class Independent Transformation (CIT) that converts the outputs of existing semantic segmentation models into class-independent forms with negligible cost or performance loss. By utilizing class-independent predictions facilitated by CIT, we establish an accumulative distillation framework, ensuring equitable incorporation of all class information. We conduct extensive experiments on various segmentation architectures, including DeepLabV3, Mask2Former, and SegViTv2. Results from these experiments show minimal task forgetting across different datasets, with less than 5% for ADE20K in the most challenging 11 task configurations and less than 1% across all configurations for the PASCAL VOC 2012 dataset.

cs.CV↗

Autonomous Decision Making for UAV Cooperative Pursuit-Evasion Game with Reinforcement Learning

The application of intelligent decision-making in unmanned aerial vehicle (UAV) is increasing, and with the development of UAV 1v1 pursuit-evasion game, multi-UAV cooperative game has emerged as a new challenge. This paper proposes a deep reinforcement learning-based model for decision-making in multi-role UAV cooperative pursuit-evasion game, to address the challenge of enabling UAV to autonomously make decisions in complex game environments. In order to enhance the training efficiency of the reinforcement learning algorithm in UAV pursuit-evasion game environment that has high-dimensional state-action space, this paper proposes multi-environment asynchronous double deep Q-network with priority experience replay algorithm to effectively train the UAV's game policy. Furthermore, aiming to improve cooperation ability and task completion efficiency, as well as minimize the cost of UAVs in the pursuit-evasion game, this paper focuses on the allocation of roles and targets within multi-UAV environment. The cooperative game decision model with varying numbers of UAVs are obtained by assigning diverse tasks and roles to the UAVs in different scenarios. The simulation results demonstrate that the proposed method enables autonomous decision-making of the UAVs in pursuit-evasion game scenarios and exhibits significant capabilities in cooperation.

cs.AI↗

Distribution alignment based transfer fusion frameworks on quantum devices for seeking quantum advantages

The scarcity of labelled data is specifically an urgent challenge in the field of quantum machine learning (QML). Two transfer fusion frameworks are proposed in this paper to predict the labels of a target domain data by aligning its distribution to a different but related labelled source domain on quantum devices. The frameworks fuses the quantum data from two different, but related domains through a quantum information infusion channel. The predicting tasks in the target domain can be achieved with quantum advantages by post-processing quantum measurement results. One framework, the quantum basic linear algebra subroutines (QBLAS) based implementation, can theoretically achieve the procedure of transfer fusion with quadratic speedup on a universal quantum computer. In addition, the other framework, a hardware-scalable architecture, is implemented on the noisy intermediate-scale quantum (NISQ) devices through a variational hybrid quantum-classical procedure. Numerical experiments on the synthetic and handwritten digits datasets demonstrate that the variatioinal transfer fusion (TF) framework can reach state-of-the-art (SOTA) quantum DA method performance.

cs.CV↗