Search arXiv⌕ Search

arXiv subjects

Yang Hu

Publications and source records attributed to Yang Hu.

At least 109 records · Page 6Linked to original sources

Generalization-aware Remote Sensing Change Detection via Domain-agnostic Learning

Change detection has essential significance for the region's development, in which pseudo-changes between bitemporal images induced by imaging environmental factors are key challenges. Existing transformation-based methods regard pseudo-changes as a kind of style shift and alleviate it by transforming bitemporal images into the same style using generative adversarial networks (GANs). However, their efforts are limited by two drawbacks: 1) Transformed images suffer from distortion that reduces feature discrimination. 2) Alignment hampers the model from learning domain-agnostic representations that degrades performance on scenes with domain shifts from the training data. Therefore, oriented from pseudo-changes caused by style differences, we present a generalizable domain-agnostic difference learning network (DonaNet). For the drawback 1), we argue for local-level statistics as style proxies to assist against domain shifts. For the drawback 2), DonaNet learns domain-agnostic representations by removing domain-specific style of encoded features and highlighting the class characteristics of objects. In the removal, we propose a domain difference removal module to reduce feature variance while preserving discriminative properties and propose its enhanced version to provide possibilities for eliminating more style by decorrelating the correlation between features. In the highlighting, we propose a cross-temporal generalization learning strategy to imitate latent domain shifts, thus enabling the model to extract feature representations more robust to shifts actively. Extensive experiments conducted on three public datasets demonstrate that DonaNet outperforms existing state-of-the-art methods with a smaller model size and is more robust to domain shift.

cs.CV↗

Enhancing 3D Gaussian Splatting Compression via Spatial Condition-based Prediction

Recently, 3D Gaussian Spatting (3DGS) has gained widespread attention in Novel View Synthesis (NVS) due to the remarkable real-time rendering performance. However, the substantial cost of storage and transmission of vanilla 3DGS hinders its further application (hundreds of megabytes or even gigabytes for a single scene). Motivated by the achievements of prediction in video compression, we introduce the prediction technique into the anchor-based Gaussian representation to effectively reduce the bit rate. Specifically, we propose a spatial condition-based prediction module to utilize the grid-captured scene information for prediction, with a residual compensation strategy designed to learn the missing fine-grained information. Besides, to further compress the residual, we propose an instance-aware hyper prior, developing a structure-aware and instance-aware entropy model. Extensive experiments demonstrate the effectiveness of our prediction-based compression framework and each technical component. Even compared with SOTA compression method, our framework still achieves a bit rate savings of 24.42 percent. Code is to be released!

cs.CV↗

Optimal Static Dictionary with Worst-Case Constant Query Time

In this paper, we design a new succinct static dictionary with worst-case constant query time. A dictionary data structure stores a set of key-value pairs with distinct keys in $[U]$ and values in $[σ]$, such that given a query $x\in [U]$, it quickly returns if $x$ is one of the input keys, and if so, also returns its associated value. The textbook solution to dictionaries is hash tables. On the other hand, the (information-theoretical) optimal space to encode such a set of key-value pairs is only $\text{OPT} := \log\binom{U}{n}+n\log σ$. We construct a dictionary that uses $\text{OPT} + n^ε$ bits of space, and answers queries in constant time in worst case. Previously, constant-time dictionaries are only known with $\text{OPT} + n/\text{poly}\log n$ space [Pǎtraşcu 2008], or with $\text{OPT}+n^ε$ space but expected constant query time [Yu 2020]. We emphasize that most of the extra $n^ε$ bits are used to store a lookup table that does not depend on the input, and random bits for hash functions. The "main" data structure only occupies $\text{OPT}+\text{poly}\log n$ bits.

cs.DS↗

Ten-channel Hong-Ou-Mandel interference between independent optical combs

Dissipative Kerr soliton (DKS) frequency comb exhibits broad and narrow-linewidth frequency modes, which make it suitable for quantum communication. However, scalable quantum network based on multiple independent combs is still a challenge due to their fabrication-induced frequency mismatches. This limitation becomes critical in measurement-device-independent quantum key distribution, which requires high visibility of Hong-Ou-Mandel interference between multiple frequency channels. Here, we experimentally demonstrate two independent DKS combs with ten spectrally aligned lines without any frequency locking system. The visibility for individual comb-line pairs reaches up to $46.72 \pm 0.63\%$ via precision frequency translation, establishing a foundation for deploying DKS combs in multi-user quantum networks.

quant-ph↗

Hydroxylation-driven surface reconstruction at the origin of compressive-to-tensile stress transition in metal oxide nanoparticles

Experiments reveal negative (non-Laplacian) surface stresses in metal oxide nanoparticles, partly associated with humidity during fabrication and annealing. Using a neural network interatomic potential for MgO, we prove that water adsorption induces surface hydroxylation, shifting facets from {100} to {110} to {111} and switching the average surface stress from positive to negative. Predicted lattice strains versus nanoparticle size agree well with experiments, clarifying experimental correlations. The new framework informs broad applications in catalysis, sensors, batteries, and biomedicine.

cond-mat.mtrl-sci↗

BotUmc: An Uncertainty-Aware Twitter Bot Detection with Multi-view Causal Inference

Social bots have become widely known by users of social platforms. To prevent social bots from spreading harmful speech, many novel bot detections are proposed. However, with the evolution of social bots, detection methods struggle to give high-confidence answers for samples. This motivates us to quantify the uncertainty of the outputs, informing the confidence of the results. Therefore, we propose an uncertainty-aware bot detection method to inform the confidence and use the uncertainty score to pick a high-confidence decision from multiple views of a social network under different environments. Specifically, our proposed BotUmc uses LLM to extract information from tweets. Then, we construct a graph based on the extracted information, the original user information, and the user relationship and generate multiple views of the graph by causal interference. Lastly, an uncertainty loss is used to force the model to quantify the uncertainty of results and select the result with low uncertainty in one view as the final decision. Extensive experiments show the superiority of our method.

cs.SI↗

RM-PoT: Reformulating Mathematical Problems and Solving via Program of Thoughts

Recently, substantial advancements have been made in training language models to carry out step-by-step reasoning for solving intricate numerical reasoning tasks. Beyond the methods used to solve these problems, the structure and formulation of the problems themselves also play a crucial role in determining the performance of large language models. We observe that even small changes in the surface form of mathematical problems can have a profound impact on both the answer distribution and solve rate. This highlights the vulnerability of LLMs to surface-level variations, revealing its limited robustness when reasoning through complex problems. In this paper, we propose RM-PoT, a three-stage framework that integrates problem reformulation (RM), code-aided reasoning (PoT), and domain-aware few-shot learning to address these limitations. Our approach first reformulates the input problem into diverse surface forms to reduce structural bias, then retrieves five semantically aligned examples from a pre-constructed domain-specific question bank to provide contextual guidance, and finally generates executable Python code for precise computation.

cs.AI↗

FlowTS: Time Series Generation via Rectified Flow

Diffusion-based models have significant achievements in time series generation but suffer from inefficient computation: solving high-dimensional ODEs/SDEs via iterative numerical solvers demands hundreds to thousands of drift function evaluations per sample, incurring prohibitive costs. To resolve this, we propose FlowTS, an ODE-based model that leverages rectified flow with straight-line transport in probability space. By learning geodesic paths between distributions, FlowTS achieves computational efficiency through exact linear trajectory simulation, accelerating training and generation while improving performances. We further introduce an adaptive sampling strategy inspired by the exploration-exploitation trade-off, balancing noise adaptation and precision. Notably, FlowTS enables seamless adaptation from unconditional to conditional generation without retraining, ensuring efficient real-world deployment. Also, to enhance generation authenticity, FlowTS integrates trend and seasonality decomposition, attention registers (for global context aggregation), and Rotary Position Embedding (RoPE) (for position information). For unconditional setting, extensive experiments demonstrate that FlowTS achieves state-of-the-art performance, with context FID scores of 0.019 and 0.011 on Stock and ETTh datasets (prev. best: 0.067, 0.061). For conditional setting, we have achieved superior performance in solar forecasting (MSE 213, prev. best: 375) and MuJoCo imputation tasks (MSE 7e-5, prev. best 2.7e-4). The code is available at https://github.com/UNITES-Lab/FlowTS.

cs.LG↗

Refining interface stress measurement in nanomultilayers through layer corrugation and interface roughness corrections

We introduce new models that incorporate layer corrugation and interface roughness into standard approaches for measuring interface stress in nanomultilayers (NMLs). Applied to Cu/W NMLs, these models show that ignoring such features can inflate measured interface stress by up to 0.4 J/m^2. However, corrugation and roughness alone cannot account for the extreme stresses reported, suggesting that atomic-scale phenomena (e.g., intermixing and metastable phase formation at the interfaces) dominate. These findings highlight the importance of balancing bilayer counts and thickness-to-roughness ratios for reliable stress quantification, providing a practical pathway to designing and characterizing advanced nanocomposite coatings with improved accuracy.

cond-mat.mtrl-sci↗

MADiff: Text-Guided Fashion Image Editing with Mask Prediction and Attention-Enhanced Diffusion

Text-guided image editing model has achieved great success in general domain. However, directly applying these models to the fashion domain may encounter two issues: (1) Inaccurate localization of editing region; (2) Weak editing magnitude. To address these issues, the MADiff model is proposed. Specifically, to more accurately identify editing region, the MaskNet is proposed, in which the foreground region, densepose and mask prompts from large language model are fed into a lightweight UNet to predict the mask for editing region. To strengthen the editing magnitude, the Attention-Enhanced Diffusion Model is proposed, where the noise map, attention map, and the mask from MaskNet are fed into the proposed Attention Processor to produce a refined noise map. By integrating the refined noise map into the diffusion model, the edited image can better align with the target prompt. Given the absence of benchmarks in fashion image editing, we constructed a dataset named Fashion-E, comprising 28390 image-text pairs in the training set, and 2639 image-text pairs for four types of fashion tasks in the evaluation set. Extensive experiments on Fashion-E demonstrate that our proposed method can accurately predict the mask of editing region and significantly enhance editing magnitude in fashion image editing compared to the state-of-the-art methods.

cs.CV↗

FashionFAE: Fine-grained Attributes Enhanced Fashion Vision-Language Pre-training

Large-scale Vision-Language Pre-training (VLP) has demonstrated remarkable success in the general domain. However, in the fashion domain, items are distinguished by fine-grained attributes like texture and material, which are crucial for tasks such as retrieval. Existing models often fail to leverage these fine-grained attributes from both text and image modalities. To address the above issues, we propose a novel approach for the fashion domain, Fine-grained Attributes Enhanced VLP (FashionFAE), which focuses on the detailed characteristics of fashion data. An attribute-emphasized text prediction task is proposed to predict fine-grained attributes of the items. This forces the model to focus on the salient attributes from the text modality. Additionally, a novel attribute-promoted image reconstruction task is proposed, which further enhances the fine-grained ability of the model by leveraging the representative attributes from the image modality. Extensive experiments show that FashionFAE significantly outperforms State-Of-The-Art (SOTA) methods, achieving 2.9% and 5.2% improvements in retrieval on sub-test and full test sets, respectively, and a 1.6% average improvement in recognition tasks.

cs.CV↗

Passive Non-Line-of-Sight Imaging with Light Transport Modulation

Passive non-line-of-sight (NLOS) imaging has witnessed rapid development in recent years, due to its ability to image objects that are out of sight. The light transport condition plays an important role in this task since changing the conditions will lead to different imaging models. Existing learning-based NLOS methods usually train independent models for different light transport conditions, which is computationally inefficient and impairs the practicality of the models. In this work, we propose NLOS-LTM, a novel passive NLOS imaging method that effectively handles multiple light transport conditions with a single network. We achieve this by inferring a latent light transport representation from the projection image and using this representation to modulate the network that reconstructs the hidden image from the projection image. We train a light transport encoder together with a vector quantizer to obtain the light transport representation. To further regulate this representation, we jointly learn both the reconstruction network and the reprojection network during training. A set of light transport modulation blocks is used to modulate the two jointly trained networks in a multi-scale way. Extensive experiments on a large-scale passive NLOS dataset demonstrate the superiority of the proposed method. The code is available at https://github.com/JerryOctopus/NLOS-LTM.

cs.CV↗

Shifting Spotlight for Co-supervision: A Simple yet Efficient Single-branch Network to See Through Camouflage

Camouflaged object detection (COD) remains a challenging task in computer vision. Existing methods often resort to additional branches for edge supervision, incurring substantial computational costs. To address this, we propose the Co-Supervised Spotlight Shifting Network (CS$^3$Net), a compact single-branch framework inspired by how shifting light source exposes camouflage. Our spotlight shifting strategy replaces multi-branch designs by generating supervisory signals that highlight boundary cues. Within CS$^3$Net, a Projection Aware Attention (PAA) module is devised to strengthen feature extraction, while the Extended Neighbor Connection Decoder (ENCD) enhances final predictions. Extensive experiments on public datasets demonstrate that CS$^3$Net not only achieves superior performance, but also reduces Multiply-Accumulate operations (MACs) by 32.13% compared to state-of-the-art COD methods, striking an optimal balance between efficiency and effectiveness.

cs.CV↗

Tackling the Dynamicity in a Production LLM Serving System with SOTA Optimizations via Hybrid Prefill/Decode/Verify Scheduling on Efficient Meta-kernels

Meeting growing demands for low latency and cost efficiency in production-grade large language model (LLM) serving systems requires integrating advanced optimization techniques. However, dynamic and unpredictable input-output lengths of LLM, compounded by these optimizations, exacerbate the issues of workload variability, making it difficult to maintain high efficiency on AI accelerators, especially DSAs with tile-based programming models. To address this challenge, we introduce XY-Serve, a versatile, Ascend native, end-to-end production LLM-serving system. The core idea is an abstraction mechanism that smooths out the workload variability by decomposing computations into unified, hardware-friendly, fine-grained meta primitives. For attention, we propose a meta-kernel that computes the basic pattern of matmul-softmax-matmul with architectural-aware tile sizes. For GEMM, we introduce a virtual padding scheme that adapts to dynamic shape changes while using highly efficient GEMM primitives with assorted fixed tile sizes. XY-Serve sits harmoniously with vLLM. Experimental results show up to 89% end-to-end throughput improvement compared with current publicly available baselines on Ascend NPUs. Additionally, our approach outperforms existing GEMM (average 14.6% faster) and attention (average 21.5% faster) kernels relative to existing libraries. While the work is Ascend native, we believe the approach can be readily applicable to SIMT architectures as well.

cs.AI↗

Catch-Up Distillation: You Only Need to Train Once for Accelerating Sampling

Diffusion Probability Models (DPMs) have made impressive advancements in various machine learning domains. However, achieving high-quality synthetic samples typically involves performing a large number of sampling steps, which impedes the possibility of real-time sample synthesis. Traditional accelerated sampling algorithms via knowledge distillation rely on pre-trained model weights and discrete time step scenarios, necessitating additional training sessions to achieve their goals. To address these issues, we propose the Catch-Up Distillation (CUD), which encourages the current moment output of the velocity estimation model ``catch up'' with its previous moment output. Specifically, CUD adjusts the original Ordinary Differential Equation (ODE) training objective to align the current moment output with both the ground truth label and the previous moment output, utilizing Runge-Kutta-based multi-step alignment distillation for precise ODE estimation while preventing asynchronous updates. Furthermore, we investigate the design space for CUDs under continuous time-step scenarios and analyze how to determine the suitable strategies. To demonstrate CUD's effectiveness, we conduct thorough ablation and comparison experiments on CIFAR-10, MNIST, and ImageNet-64. On CIFAR-10, we obtain a FID of 2.80 by sampling in 15 steps under one-session training and the new state-of-the-art FID of 3.37 by sampling in one step with additional training. This latter result necessitated only 620k iterations with a batch size of 128, in contrast to Consistency Distillation, which demanded 2100k iterations with a larger batch size of 256. Our code is released at https://anonymous.4open.science/r/Catch-Up-Distillation-E31F.

cs.LG↗

A Survey of Wireless Sensing Security from a Role-Based View: Victim, Weapon, and Shield

Wireless sensing technology has become prevalent in healthcare, smart homes, and autonomous driving due to its non-contact operation, penetration capabilities, and cost-effectiveness. As its applications expand, the technology faces mounting security challenges: sensing systems can be attack targets, signals can be weaponized, or signals can function as security shields. Despite these security concerns significantly impacting the technology's development, a systematic review remains lacking. This paper presents the first comprehensive survey of wireless sensing security through a role-based perspective. Analyzing over 200 publications from 2020-2024, we propose a novel classification framework that systematically categorizes existing research into three main classes: (1) wireless systems as victims of attacks, (2) wireless signals as weapons for attacks, and (3) wireless signals as shields for security applications. This role-based classification method is not only intuitive and easy to understand, but also reflects the essential connection between wireless signals and security issues. Through systematic literature review and quantitative analysis, this paper outlines a panoramic view of wireless sensing security, revealing key technological trends and innovation opportunities, thereby helping to promote the development of this field. Project page: \url{https://github.com/Intelligent-Perception-Lab/Awesome-WS-Security}.

cs.HC↗

Unsupervised Domain Adaptation for RF-based Gesture Recognition

Human gesture recognition with Radio Frequency (RF) signals has attained acclaim due to the omnipresence, privacy protection, and broad coverage nature of RF signals. These gesture recognition systems rely on neural networks trained with a large number of labeled data. However, the recognition model trained with data under certain conditions would suffer from significant performance degradation when applied in practical deployment, which limits the application of gesture recognition systems. In this paper, we propose an unsupervised domain adaptation framework for RF-based gesture recognition aiming to enhance the performance of the recognition model in new conditions by making effective use of the unlabeled data from new conditions. We first propose pseudo-labeling and consistency regularization to utilize unlabeled data for model training and eliminate the feature discrepancies in different domains. Then we propose a confidence constraint loss to enhance the effectiveness of pseudo-labeling, and design two corresponding data augmentation methods based on the characteristic of the RF signals to strengthen the performance of the consistency regularization, which can make the framework more effective and robust. Furthermore, we propose a cross-match loss to integrate the pseudo-labeling and consistency regularization, which makes the whole framework simple yet effective. Extensive experiments demonstrate that the proposed framework could achieve 4.35% and 2.25% accuracy improvement comparing with the state-of-the-art methods on public WiFi dataset and millimeter wave (mmWave) radar dataset, respectively.

cs.CV↗

Constrain Spatial Curvature and Dark Energy with Strong Lenses and Complementary Probes: a Forecast for Next-Generation Surveys

Inferring spatial curvature of the Universe with high-fidelity is a longstanding interest in cosmology. However, the strong degeneracy between dark energy equation-of-state parameter $w$ and curvature density parameter $Ω_{\rm K}$ has always been a hurdle for precision measurements of curvature from late-universe probes. With the imminent commissioning of Vera C. Rubin Observatory's Legacy Survey of Space and Time (LSST), we demonstrate for the first time, using simulations of stage-IV surveys, the crucial role of time-delay distances from strong gravitational lenses in breaking this degeneracy. Our findings suggest that in non-flat $ow$CDM model, while strong lensing data alone only yield a $Ω_{\rm K}$ constraint at $\sim O(10^{-1})$ level, the integration with SNe Ia and BAO data breaks the $w$-$Ω_{\rm K}$ degeneracy and refines the $Ω_{\rm K}$ constraint to $\sim O(10^{-2})$. This surpasses the constraints typically derived from SNe Ia Hubble diagrams and BAO data and is comparable to the constraints obtained from \textit{Planck} Primary CMB data. Additionally, we present a non-parametric approach using Gaussian Process to avoid parameter-dependency of the expansion history $H(z)$ and achieve similar $O(10^{-2})$ level constraint on $Ω_{\rm K}$. This study demonstrates the significant potential of strong gravitational lenses and Stage-IV surveys like LSST to achieve high-fidelity, independent constraints on $Ω_{\rm K}$, contributing to our understanding of the Universe's geometry and the dynamics of dark energy.

astro-ph.CO↗