arXiv subjects

Yuan Gao

Publications and source records attributed to Yuan Gao.

At least 253 records · Page 14Linked to original sources

arXiv2025

Bounds and Optimal Constructions of Generalized Merge-Convertible Codes for Code Conversion into LRCs

Error-correcting codes are essential for ensuring fault tolerance in modern distributed data storage systems. However, in practice, factors such as the failure rates of storage devices can vary significantly over time, resulting in changes to the optimal code parameters. To reduce storage cost while maintaining efficiency, Maturana and Rashmi introduced a theoretical framework known as code conversion, which enables dynamic adjustment of code parameters according to device performance. In this paper, we focus exclusively on the bounds and constructions of generalized merge-convertible codes. First, we establish a new lower bound on the access cost when the final code is an $(r,δ)$-LRC. This bound unifies and generalizes all previously known bounds for merge conversion, where the initial and final codes are either LRCs or MDS codes. We then construct a family of access-optimal MDS convertible codes by leveraging subgroups of the automorphism group of a rational function field. It is worth noting that our construction is also per-symbol read access-optimal. Next, we further extend our MDS-based construction to design access-optimal convertible codes for the conversion between $(r,δ)$-LRCs with parameters that have not been previously reported. Finally, using the parity-check matrix approach, we present a construction of access-optimal convertible codes that enable merge conversion from MDS codes to an $(r,δ)$-LRC. To the best of our knowledge, this is the first explicit optimal construction of code conversion between MDS codes and LRCs. All of our constructions are performed over finite fields whose sizes grow linearly with the code length.

cs.IT↗

arXiv2025

Giant Magnetocaloric Effect in Spin Supersolid Candidate Na$_2$BaCo(PO$_4$)$_2$

Supersolid, an exotic quantum state of matter that consists of particles forming an incompressible solid structure while simultaneously showing superfluidity of zero viscosity [1], is one of the long-standing pursuits in fundamental research [2, 3]. Although the initial report of $^4$He supersolid turned out to be an artifact [4], this intriguing quantum matter has inspired enthusiastic investigations into ultracold quantum gases [5-8]. Nevertheless, the realization of supersolidity in condensed matter remains elusive. Here we find evidence for a quantum magnetic analogue of supersolid -- the spin supersolid -- in the recently synthesized triangular-lattice antiferromagnet Na$_2$BaCo(PO$_4$)$_2$ [9]. Notably, a giant magnetocaloric effect related to the spin supersolidity is observed in the demagnetization cooling process, manifesting itself as two prominent valley-like regimes, with the lowest temperature attaining below 100 mK. Not only is there an experimentally determined series of critical fields but the demagnetization cooling profile also shows excellent agreement with the theoretical simulations with an easy-axis Heisenberg model. Neutron diffractions also successfully locate the proposed spin supersolid phases by revealing the coexistence of three-sublattice spin solid order and interlayer incommensurability indicative of the spin superfluidity. Thus, our results indicate a strong entropic effect of the spin supersolid phase in a frustrated quantum magnet and open up a viable and promising avenue for applications in sub-Kelvin refrigeration, especially in the context of persistent concerns about helium shortages [10, 11].

cond-mat.str-el↗

arXiv2025

Accelerated Distributed Optimization with Compression and Error Feedback

Modern machine learning tasks often involve massive datasets and models, necessitating distributed optimization algorithms with reduced communication overhead. Communication compression, where clients transmit compressed updates to a central server, has emerged as a key technique to mitigate communication bottlenecks. However, the theoretical understanding of stochastic distributed optimization with contractive compression remains limited, particularly in conjunction with Nesterov acceleration -- a cornerstone for achieving faster convergence in optimization. In this paper, we propose a novel algorithm, ADEF (Accelerated Distributed Error Feedback), which integrates Nesterov acceleration, contractive compression, error feedback, and gradient difference compression. We prove that ADEF achieves the first accelerated convergence rate for stochastic distributed optimization with contractive compression in the general convex regime. Numerical experiments validate our theoretical findings and demonstrate the practical efficacy of ADEF in reducing communication costs while maintaining fast convergence.

math.OC↗

arXiv2025

ATOM: A Framework of Detecting Query-Based Model Extraction Attacks for Graph Neural Networks

Graph Neural Networks (GNNs) have gained traction in Graph-based Machine Learning as a Service (GMLaaS) platforms, yet they remain vulnerable to graph-based model extraction attacks (MEAs), where adversaries reconstruct surrogate models by querying the victim model. Existing defense mechanisms, such as watermarking and fingerprinting, suffer from poor real-time performance, susceptibility to evasion, or reliance on post-attack verification, making them inadequate for handling the dynamic characteristics of graph-based MEA variants. To address these limitations, we propose ATOM, a novel real-time MEA detection framework tailored for GNNs. ATOM integrates sequential modeling and reinforcement learning to dynamically detect evolving attack patterns, while leveraging $k$-core embedding to capture the structural properties, enhancing detection precision. Furthermore, we provide theoretical analysis to characterize query behaviors and optimize detection strategies. Extensive experiments on multiple real-world datasets demonstrate that ATOM outperforms existing approaches in detection performance, maintaining stable across different time steps, thereby offering a more effective defense mechanism for GMLaaS environments.

cs.LG↗

arXiv2025

Temperature inhomogeneity in non-equilibrium field theory for electrons in a nanowire: thermodynamic and transport properties

A nanowire with its two ends fixed at two different temperatures by external baths is the simplest example of a fermionic system with a temperature inhomogeneity, and could be an easy platform to study thermodynamic and transport properties of a boundary-driven open quantum system. Starting with a temperature-dependent pseudo free energy derived from an exact reduced density matrix and assuming a small temperature gradient $γ$ across the wire, we show within perturbation theory that electron dispersion relation and therefore the Fermi distribution becomes $γ$ and space coordinates dependent, leading to non-linear effects of the temperature inhomogeneity. In particular, we show that in the non-linear response regime, the Widemann-Franz Law for the ratio of thermal and electrical conductivities is generalized, and that the thermopower increases with increasing temperature gradient $γ$.

cond-mat.mes-hall↗

arXiv2025

Non-equilibrium field theory with a temperature gradient: Thermal current in a nanowire

A perturbative framework is developed within the standard non-equilibrium field theory techniques to incorporate a temperature gradient across a thermoelectric device. The framework uses a temperature-dependent pseudo-Hamiltonian generated from the exact density matrix in the presence of non-uniform temperatures. We develop a perturbation theory for small temperature gradients in long wires and obtain the non-linear thermal conductance as a function of temperature difference. The framework should be adaptable to more general cases of temperature inhomogeneities in either fermionic or bosonic systems.

cond-mat.mes-hall↗

arXiv2025

Enhancing Vision-Language Pre-training with Rich Supervisions

We propose Strongly Supervised pre-training with ScreenShots (S4) - a novel pre-training paradigm for Vision-Language Models using data from large-scale web screenshot rendering. Using web screenshots unlocks a treasure trove of visual and textual cues that are not present in using image-text pairs. In S4, we leverage the inherent tree-structured hierarchy of HTML elements and the spatial localization to carefully design 10 pre-training tasks with large scale annotated data. These tasks resemble downstream tasks across different domains and the annotations are cheap to obtain. We demonstrate that, compared to current screenshot pre-training objectives, our innovative pre-training method significantly enhances performance of image-to-text model in nine varied and popular downstream tasks - up to 76.1% improvements on Table Detection, and at least 1% on Widget Captioning.

cs.CV↗

arXiv2025

X2CT-CLIP: Enable Multi-Abnormality Detection in Computed Tomography from Chest Radiography via Tri-Modal Contrastive Learning

Computed tomography (CT) is a key imaging modality for diagnosis, yet its clinical utility is marred by high radiation exposure and long turnaround times, restricting its use for larger-scale screening. Although chest radiography (CXR) is more accessible and safer, existing CXR foundation models focus primarily on detecting diseases that are readily visible on the CXR. Recently, works have explored training disease classification models on simulated CXRs, but they remain limited to recognizing a single disease type from CT. CT foundation models have also emerged with significantly improved detection of pathologies in CT. However, the generalized application of CT-derived labels on CXR has remained illusive. In this study, we propose X2CT-CLIP, a tri-modal knowledge transfer learning framework that bridges the modality gap between CT and CXR while reducing the computational burden of model training. Our approach is the first work to enable multi-abnormality classification in CT, using CXR, by transferring knowledge from 3D CT volumes and associated radiology reports to a CXR encoder via a carefully designed tri-modal alignment mechanism in latent space. Extensive evaluations on three multi-label CT datasets demonstrate that our method outperforms state-of-the-art baselines in cross-modal retrieval, few-shot adaptation, and external validation. These results highlight the potential of CXR, enriched with knowledge derived from CT, as a viable efficient alternative for disease detection in resource-limited settings.

cs.CV↗

arXiv2025

Remote Sensing Object Counting with Online Knowledge Learning

Efficient models for remote sensing object counting are urgently required for applications in scenarios with limited computing resources, such as drones or embedded systems. A straightforward yet powerful technique to achieve this is knowledge distillation, which steers the learning of student networks by leveraging the experience of already-trained teacher networks. However, it faces a pair of challenges: Firstly, due to its two-stage training nature, a longer training period is essential, especially as the training samples increase. Secondly, despite the proficiency of teacher networks in transmitting assimilated knowledge, they tend to overlook the latent insights gained during their learning process. To address these challenges, we introduce an online distillation learning method for remote sensing object counting. It builds an end-to-end training framework that seamlessly integrates two distinct networks into a unified one. It comprises a shared shallow module, a teacher branch, and a student branch. The shared module serving as the foundation for both branches is dedicated to learning some primitive information. The teacher branch utilizes prior knowledge to reduce the difficulty of learning and guides the student branch in online learning. In parallel, the student branch achieves parameter reduction and rapid inference capabilities by means of channel reduction. This design empowers the student branch not only to receive privileged insights from the teacher branch but also to tap into the latent reservoir of knowledge held by the teacher branch during the learning process. Moreover, we propose a relation-in-relation distillation method that allows the student branch to effectively comprehend the evolution of the relationship of intra-layer teacher features among different inter-layer features. Extensive experiments demonstrate the effectiveness of our method.

cs.CV↗

arXiv2025

C2S-AE: CSI to Sensing enabled by an Auto-Encoder-based Framework

Next-generation mobile networks are set to utilize integrated sensing and communication (ISAC) as a critical technology, providing significant support for sectors like the industrial Internet of Things (IIoT), extended reality (XR), and smart home applications. A key challenge in ISAC implementation is the extraction of sensing parameters from radio signals, a task that conventional methods struggle to achieve due to the complexity of acquiring sensing channel data. In this paper, we introduce a novel auto-encoder (AE)-based framework to acquire sensing information using channel state information (CSI). Specifically, our framework, termed C2S (CSI to sensing)-AE, learns the relationship between CSI and the delay power spectrum (DPS), from which the range information can be readily accessed. To validate our framework's performance, we conducted measurements of DPS and CSI in real-world scenarios and introduced the dataset 'SHU7'. Our extensive experiments demonstrate that the framework excels in C2S extrapolation, surpassing existing methods in terms of accuracy for both delay and signal strength of individual paths. This innovative approach holds the potential to greatly enhance sensing capabilities in future mobile networks, paving the way for more robust and versatile ISAC applications.

eess.SP↗

arXiv2025

A MIMO Wireless Channel Foundation Model via CIR-CSI Consistency

In the field of artificial intelligence, self-supervised learning has demonstrated superior generalization capabilities by leveraging large-scale unlabeled datasets for pretraining, which is especially critical for wireless communication models to adapt to a variety of scenarios. This paper innovatively treats Channel State Information (CSI) and Channel Impulse Response (CIR) as naturally aligned multi-modal data and proposes the first MIMO wireless channel foundation model, named CSI-CLIP. By effectively capturing the joint representations of both CIR and CSI, CSI-CLIP exhibits remarkable adaptability across scenarios and robust feature extraction capabilities. Experimental results show that in positioning task, CSI-CLIP reduces the mean error distance by 22%; in beam management task, it increases accuracy by 1% compared to traditional supervised methods, as well as in the channel identification task. These improvements not only highlight the potential and value of CSI-CLIP in integrating sensing and communication but also demonstrate its significant advantages over existing techniques. Moreover, viewing CSI and CIR as multi-modal pairs and contrastive learning for wireless channel foundation model open up new research directions in the domain of MIMO wireless communications.

eess.SP↗

arXiv2025

MTCA: Multi-Task Channel Analysis for Wireless Communication

In modern wireless communication systems, the effective processing of Channel State Information (CSI) is crucial for enhancing communication quality and reliability. However, current methods often handle different tasks in isolation, thereby neglecting the synergies among various tasks and leading to extract CSI features inadequately for subsequent analysis. To address these limitations, this paper introduces a novel Multi-Task Channel Analysis framework named MTCA, aimed at improving the performance of wireless communication even sensing. MTCA is designed to handle four critical tasks, including channel prediction, antenna-domain channel extrapolation, channel identification, and scenario classification. Experiments conducted on a multi-scenario, multi-antenna dataset tailored for UAV-based communications demonstrate that the proposed MTCA exhibits superior comprehension of CSI, achieving enhanced performance across all evaluated tasks. Notably, MTCA reached 100% prediction accuracy in channel identification and scenario classification. Compared to the previous state-of-the-art methods, MTCA improved channel prediction performance by 20.1% and antenna-domain extrapolation performance by 54.5%.

eess.SP↗

arXiv2025

BeamVQ: Beam Search with Vector Quantization to Mitigate Data Scarcity in Physical Spatiotemporal Forecasting

In practice, physical spatiotemporal forecasting can suffer from data scarcity, because collecting large-scale data is non-trivial, especially for extreme events. Hence, we propose \method{}, a novel probabilistic framework to realize iterative self-training with new self-ensemble strategies, achieving better physical consistency and generalization on extreme events. Following any base forecasting model, we can encode its deterministic outputs into a latent space and retrieve multiple codebook entries to generate probabilistic outputs. Then BeamVQ extends the beam search from discrete spaces to the continuous state spaces in this field. We can further employ domain-specific metrics (e.g., Critical Success Index for extreme events) to filter out the top-k candidates and develop the new self-ensemble strategy by combining the high-quality candidates. The self-ensemble can not only improve the inference quality and robustness but also iteratively augment the training datasets during continuous self-training. Consequently, BeamVQ realizes the exploration of rare but critical phenomena beyond the original dataset. Comprehensive experiments on different benchmarks and backbones show that BeamVQ consistently reduces forecasting MSE (up to 39%), enhancing extreme events detection and proving its effectiveness in handling data scarcity.

cs.LG↗

arXiv2025

DiffGAD: A Diffusion-based Unsupervised Graph Anomaly Detector

Graph Anomaly Detection (GAD) is crucial for identifying abnormal entities within networks, garnering significant attention across various fields. Traditional unsupervised methods, which decode encoded latent representations of unlabeled data with a reconstruction focus, often fail to capture critical discriminative content, leading to suboptimal anomaly detection. To address these challenges, we present a Diffusion-based Graph Anomaly Detector (DiffGAD). At the heart of DiffGAD is a novel latent space learning paradigm, meticulously designed to enhance its proficiency by guiding it with discriminative content. This innovative approach leverages diffusion sampling to infuse the latent space with discriminative content and introduces a content-preservation mechanism that retains valuable information across different scales, significantly improving its adeptness at identifying anomalies with limited time and space complexity. Our comprehensive evaluation of DiffGAD, conducted on six real-world and large-scale datasets with various metrics, demonstrated its exceptional performance.

cs.LG↗

arXiv2025

Statistical Inference for Fisher Market Equilibrium

Statistical inference under market equilibrium effects has attracted increasing attention recently. In this paper we focus on the specific case of linear Fisher markets. They have been widely use in fair resource allocation of food/blood donations and budget management in large-scale Internet ad auctions. In resource allocation, it is crucial to quantify the variability of the resource received by the agents (such as blood banks and food banks) in addition to fairness and efficiency properties of the systems. For ad auction markets, it is important to establish statistical properties of the platform's revenues in addition to their expected values. To this end, we propose a statistical framework based on the concept of infinite-dimensional Fisher markets. In our framework, we observe a market formed by a finite number of items sampled from an underlying distribution (the "observed market") and aim to infer several important equilibrium quantities of the underlying long-run market. These equilibrium quantities include individual utilities, social welfare, and pacing multipliers. Through the lens of sample average approximation (SSA), we derive a collection of statistical results and show that the observed market provides useful statistical information of the long-run market. In other words, the equilibrium quantities of the observed market converge to the true ones of the long-run market with strong statistical guarantees. These include consistency, finite sample bounds, asymptotics, and confidence. As an extension, we discuss revenue inference in quasilinear Fisher markets.

econ.EM↗

arXiv2025

On the Convergence of Tâtonnement for Linear Fisher Markets

Tâtonnement is a simple, intuitive market process where prices are iteratively adjusted based on the difference between demand and supply. Many variants under different market assumptions have been studied and shown to converge to a market equilibrium, in some cases at a fast rate. However, the classical case of linear Fisher markets have long eluded the analyses, and it remains unclear whether tâtonnement converges in this case. We show that, for a sufficiently small step size, the prices given by the tâtonnement process are guaranteed to converge to equilibrium prices, up to a small approximation radius that depends on the stepsize. To achieve this, we consider the dual Eisenberg-Gale convex program in the price space, view tâtonnement as subgradient descent on this convex program, and utilize last-iterate convergence results for subgradient descent under error bound conditions. In doing so, we show that the convex program satisfies a particular error bound condition, the quadratic growth condition, and that the price sequence generated by tâtonnement is bounded above and away from zero. We also show that a similar convergence result holds for tâtonnement in quasi-linear Fisher markets. Numerical experiments are conducted to demonstrate that the theoretical linear convergence aligns with empirical observations.

cs.GT↗

arXiv2025

Understanding of the BESIII measurement of (anti)hyperon-nucleon scattering

Focusing on the recent measurements of the scattering processes $\barΛ p \rightarrow \barΛ p$ and $Λp \rightarrow Λp$ reported by BESIII, we offer a dynamical interpretation of the differences in the measured total and differential cross sections for both processes. This discrepancy arises because the $u$-channel contribution is forbidden for $\barΛ p \rightarrow \barΛ p$ but allowed for $Λp \rightarrow Λp$. Additionally, we examine the enhancement effect in the forward angle region of the differential cross section for $\barΛ p$ elastic scattering, attributed to the $t$-channel contribution. This work serves as a test to the scattering mechanism involved in these reactions.

hep-ph↗

arXiv2025

Slow Patterns in Multilayer Dislocation Evolution with Dynamic Boundary Conditions

In this paper, we study the slow patterns of multilayer dislocation dynamics modeled by a multiscale parabolic equation in the half-plane coupled with a dynamic boundary condition on the interface. We focus on the influence of bulk dynamics with various relaxation time scales, on the slow motion pattern on the interface governed by an ODE system. Starting from a superposition of N stationary transition layers, at a specific time scale for the interface dynamics, we prove that the dynamic solution approaches the superposition of N explicit transition profiles whose centers solve the ODE system with a repulsive force. Notably, this ODE system is identical to the one obtained in the slow motion patterns of the one-dimensional fractional Allen-Cahn equation, where the elastic bulk is assumed to be static. Due to the fully coupled bulk and interface dynamics, new corrector functions with delicate estimates are constructed to stabilize the bulk dynamics and characterize the limiting behavior of the dynamic solution throughout the entire half-plane.

math.AP↗