SearcharxivSearch

arXiv subjects

Xiao Fang

Publications and source records attributed to Xiao Fang.

At least 19 recordsLinked to original sources

Martingale central limit theorems in $p$-Wasserstein distance

We obtain multivariate martingale central limit theorems in $p$-Wasserstein distance with respect to the $\ell_r$ norm in $\mathbb{R}^d$ for $p\geq 1$ and $r\in [1,\infty]$, which generalize the results for $p=1$ and $r=2$ in the literature. As corollaries, we obtain the Yurinskii coupling and Cram\'er-type moderate deviation results. We also provide an illustrative application to the stochastic gradient descent algorithm. To prove our main results, we combine Lindeberg's swapping argument with a new Gaussian convolution inequality controlling the $p$-Wasserstein distance between a Gaussian convolved with a perturbation and the Gaussian with matching mean and covariance matrix. The latter is obtained by developing the recent line of research on $p$-Wasserstein bounds.

math.PR

Design and commissioning of a windowless gas-target system for high-current beams at JUNA

Windowless gas targets avoid the beam-energy loss and straggling introduced by entrance foils and are therefore well suited for direct measurements of low-energy nuclear reactions. A windowless gas-target system designed for operation with milliampere beams has been developed for the Jinping Underground Nuclear Astrophysics facility (JUNA). The system combines three-stage differential pumping, closed-loop gas recovery and purification, a constant-temperature power-compensation calorimeter, and a position-resolved target-thickness monitor based on secondary elastic scattering. Stable operation was achieved over a target-pressure range of 1-3 mbar, with pressure fluctuations below 1% during 8 h of continuous circulation, while the accelerator-side pressure was maintained at approximately \(10^{-4}\) Pa. The closed-loop gas-circulation system maintained stable target conditions, while gas-transport calculations indicated that the axial pressure nonuniformity remained within approximately 1.6% under representative operating conditions. Calorimeter measurements were consistent with the thermal calculations, supporting the sensitivity correction used for beam-power determination. Beam commissioning with \(^{14}\mathrm{N}(p,\gamma)^{15}\mathrm{O}\) and \(^{12}\mathrm{C}(p,\gamma)^{13}\mathrm{N}\) at the 600 kV Cockcroft-Walton accelerator of the China Institute of Atomic Energy (CIAE) demonstrated stable operation of the gas-target and \(\gamma\)-ray detection systems and provided information on the influences of reaction position and beam heating. These results demonstrate the operating stability and diagnostic capability of the system for future high-current, low-energy nuclear-reaction measurements at JUNA.

astro-ph.GA

AI for Computational Design Science: A Responsible Human-AI Framework and Case Study on Short-Form Video Safety Surveillance

Artificial intelligence (AI) is transforming not only what information systems researchers design, but also how design research is conducted. Yet existing literature offers limited guidance for computational design science (CDS) when AI actively participates in problem formulation, resource construction, design search, evaluation, and knowledge abstraction. We develop AI for Computational Design Science (AI4CDS), a five-phase methodological framework in which AI expands problem and design search while researchers retain responsibility for domain grounding, admissibility, verification, and scientific judgment. Collaboration is governed by graduated trust, reversibility, auditability, and differentiated reproducibility. We instantiate AI4CDS through ChildRiskGuard, an interpretable artifact for detecting short-form videos inappropriate for children, while documenting AI interactions, rejected alternatives, corrections, and audit trails. The case translates audience-dependent safety and explanation faithfulness into three technical challenges and develops an artifact that separates generic from child-specific risk, represents distinct developmental-risk mechanisms, and makes concept-level explanations part of the predictive computation. ChildRiskGuard achieves an F1 score of 0.769, substantially outperforming direct application of a general-purpose content-safety model while remaining competitive with strong benchmarks. The primary contribution is AI4CDS as a responsible framework for AI-enabled CDS; ChildRiskGuard provides process and artifact evidence of how AI-expanded, researcher-governed design can generate and evaluate novel computational design knowledge.

cs.AI

Guarding Organizations Against Malware Risk: A Novel Graph-Based Malware Detection Method

Organizational digitalization expands cybersecurity risks, making cybersecurity an increasingly important research area in Information Systems (IS). Among these risks, malware has become a pervasive and destructive threat. Byte-based machine learning (ML) methods are widely used for malware detection but remain vulnerable to evasive behaviors that manipulate raw bytes to evade detection. Graph-based methods are less affected by such manipulations because they represent software as program graphs that capture execution behavior. However, they do not explicitly identify cohesive groups of basic blocks that jointly realize meaningful program behaviors, nor do they learn sufficiently expressive program graph representations for accurate detection. To this end, we propose MalGuard, a graph-based malware detection method for organizational malware risk management. MalGuard introduces two methodological innovations: an operational role identification approach and a program graph representation learning method. The former identifies these cohesive groups of basic blocks as operational roles, enabling the detector to capture program behaviors that may not be visible from isolated basic blocks. The latter learns expressive program graph representations by modeling interactions among operational roles, preserving sparse malicious signals, and capturing hierarchical graph structure. Extensive experiments show that MalGuard improves detection performance and reduces the expected cost of undetected malware.

cs.CR

Privacy-Preserving Credit Risk Prediction with Alternative Data

Credit risk prediction is a critical problem in the consumer credit industry. Traditionally, financial institutions construct credit risk prediction models using borrowers' demographic, financial, and credit history data, collectively referred to as traditional data. Recent studies have demonstrated that alternative data, such as borrowers' mobile phone communication data, enable lenders to acquire fuller and more accurate profiles of borrowers' creditworthiness, thereby improving credit risk prediction performance. Nevertheless, alternative data are held by external entities independent of financial institutions. Directly sharing alternative data with financial institutions infringe on consumer privacy, yet existing credit risk prediction studies largely overlook this issue. To address this gap, we define a new problem, namely privacy-preserving credit risk prediction with alternative data, which simultaneously considers three practical constraints: the privacy-preserving constraint that protects consumer privacy, the model-confidentiality constraint that learns and stores the model centrally at the financial institution, and the lossless constraint that maintains the performance of the learned model. To solve this problem, we develop PrivacyCredit, a novel privacy-preserving machine learning method. We then theoretically demonstrate the privacy-preserving, model-confidential, and lossless properties of PrivacyCredit. Through extensive experiments using a real-world credit dataset linked with alternative data, we demonstrate the predictive value of securely incorporating alternative data into credit risk prediction and show that PrivacyCredit achieves the same predictive performance as the model learned from the insecure plaintext combination of traditional and alternative data. We further evaluate its model-confidentiality property and computational efficiency.

cs.LG

Knowledge Index of Noah's Ark

Knowledge benchmarks for LLMs face three issues: scaling-driven designs that do not operationalize disciplinary representativeness; flat-payment annotation that permits lazy consensus; and unaudited ranking instability under bounded test budgets. We introduce KINA, an 899-item benchmark across 261 fine-grained disciplines, with two formal results. First, we cast representativeness as a coverage-style objective over expert-elicited anchors and operationalize disciplinary representativeness through a proxy, yielding a (1-1/e) greedy approximation (Proposition 1); the guarantee applies to the proxy, not to population representativeness. Second, we prove a bonus-on-bar tournament weakly FOSD-dominates flat payment in released-review quality, with incentive-compatibility threshold B > Delta C / Delta p_min (Theorem 1). Evaluating 42 models from 13 labs, the top model, Gemini-3.1-Pro-Preview, reaches 53.17%, followed by Claude-Opus-4.6 at 49.92% and GPT-5.4 at 48.55%, leaving substantial headroom below saturation. The full leaderboard shows a tiered structure rather than a smooth total order: a small frontier tier lies above 48%, a dense strong-model tier spans roughly 38-45%, and low-performing models remain only modestly above the 10% chance baseline. Tool augmentation adds up to 5.17 points across the five tool-use evaluations, with gains varying substantially across models. We report bootstrap ranking-stability statistics to make bounded-budget variance explicit and to discourage over-interpretation of adjacent ranks.

cs.AI

A cryogenic gas target for high-intensity radioactive ion beam production at HIRFL-RIBLL

A liquid-nitrogen-cooled cryogenic gas target system has been developed and installed for radioactive ion beam (RIB) production at the Radioactive Ion Beam Line in Lanzhou (RIBLL). Light-element gases ($\mathrm{H}_2$, $\mathrm{D}_2$, and $^4\mathrm{He}$) filled in the target cell were cooled to cryogenic temperatures, with the gas-cell outlet temperature typically monitored at 82--86 K during beam irradiation and operating pressures up to 1000 mbar. The system was used to produce $^{7}\mathrm{Be}$, $^{16}\mathrm{N}$, and $^{15}\mathrm{O}$ RIBs via the $^{1}\mathrm{H}(^{7}\mathrm{Li}, ^{7}\mathrm{Be})n$, $^{2}\mathrm{H}(^{15}\mathrm{N}, ^{16}\mathrm{N})p$, and $^{1}\mathrm{H}(^{15}\mathrm{N}, ^{15}\mathrm{O})n$ inverse kinematics reactions, yielding purities of 85\%, 99\%, and 95\%, with intensities of $1.02\times10^{6}$, $2.7\times10^{5}$, and $1.0\times10^{5}$ pps, respectively. A $^{93m}\mathrm{Mo}$ isomer beam was also produced via the $\mathrm{^4He(^{94}Zr,} 5n)^{93m}\mathrm{Mo}$ reaction, achieving an intensity of $5.38\times10^{3}$ pps and a purity of 20\% (which can be further improved to $\sim$50\% with offline time-of-flight gating). By delivering a broader range of high-intensity secondary RIBs, this setup establishes a robust platform at RIBLL for low- and medium-energy nuclear astrophysics and reaction studies.

physics.ins-det

Proton-to-Alpha branching ratio in the $^{12}$C+$^{12}$C fusion reaction at astrophysical energies

The unique resonance features in the $^{12}$C+$^{12}$C fusion reaction lead to significant fluctuations in the branching ratio $R_{p/\alpha}=\sigma_p/\sigma_\alpha$, making it difficult to determine the $R_{p/\alpha}$ at astrophysical energies. By combining Hauser--Feshbach statistical-model calculations with constraints from direct charged-particle and gamma-ray measurements, we investigate the energy dependence of the averaged $R_{p/\alpha}$ and predict its behavior within the Gamow window. Owing to the strong energy dependence of $R_{p/\alpha}$, the corresponding reaction-rate ratios, $\langle \sigma v \rangle_p / \langle \sigma v \rangle_\alpha$, during core and shell carbon burning are determined to be 0.29, 0.45, and 0.52 at $T_9 = 0.5$, 1.0, and 1.2, respectively, significantly lower than the widely adopted CF88 constant value of 0.79. The implications of the revised $\langle \sigma v \rangle_p / \langle \sigma v \rangle_\alpha$ ratio for stellar nucleosynthesis and white-dwarf evolution are also discussed.

nucl-th

Information Extraction of Nested Complex Structure of Quantum Cascade Lasers via Large Language Models

The rapid advancement of Large Language Models has transformed scientific research workflows, including enabling the automated extraction of data directly from published literature. Most existing efforts, however, focus on extracting simple labeled key-value entities, whereas many scientific applications require more complex, hierarchically structured data. A representative example is Quantum Cascade Lasers, whose device architectures are defined by tens of interdependent parameters organized in nested layer sequences. In this work we propose a \emph{JSON-Schema Guided Information Extraction Pipeline} (JSG-IE) that enables reliable extraction of deeply structured device data without model fine-tuning. By transforming extraction into a schema-constrained generation task, our approach significantly improves structural consistency and accuracy. Across 12 state-of-the-art LLMs, a properly designed JSON Schema improves performance by 5.7\% over conventional prompting, with the highest $F_1$ score up to 83.4\%, achieved by the reasoning-enabled Kimi-k2-thinking model. Importantly, this performance enhancement is most significant for mid-tier and open-source models, where $F_1$ gains reach as high as 24.1\%, effectively enabling these widely accessible models to achieve extraction fidelity previously restricted to much larger architectures. This framework provides a scalable path toward automated construction of high-fidelity device databases, accelerating data-driven optoelectronic design.

physics.optics

In-the-Wild Camouflage Attack on Vehicle Detectors through Controllable Image Editing

Deep neural networks (DNNs) have achieved remarkable success in computer vision but remain highly vulnerable to adversarial attacks. Among them, camouflage attacks manipulate an object's visible appearance to deceive detectors while remaining stealthy to humans. In this paper, we propose a new framework that formulates vehicle camouflage attacks as a conditional image-editing problem. Specifically, we explore both image-level and scene-level camouflage generation strategies, and fine-tune a ControlNet to synthesize camouflaged vehicles directly on real images. We design a unified objective that jointly enforces vehicle structural fidelity, style consistency, and adversarial effectiveness. Extensive experiments on the COCO and LINZ datasets show that our method achieves significantly stronger attack effectiveness, leading to more than 38% AP50 decrease, while better preserving vehicle structure and improving human-perceived stealthiness compared to existing approaches. Furthermore, our framework generalizes effectively to unseen black-box detectors and exhibits promising transferability to the physical world. Project page is available at https://humansensinglab.github.io/CtrlCamo

cs.CV

Collaborative Management for Chronic Diseases and Depression: A Double Heterogeneity-based Multi-Task Learning Method

Wearable sensor technologies and deep learning are transforming healthcare management. Yet, most health sensing studies focus narrowly on physical chronic diseases. This overlooks the critical need for joint assessment of comorbid physical chronic diseases and depression, which is essential for collaborative chronic care. We conceptualize multi-disease assessment, including both physical diseases and depression, as a multi-task learning (MTL) problem, where each disease assessment is modeled as a task. This joint formulation leverages inter-disease relationships to improve accuracy, but it also introduces the challenge of double heterogeneity: chronic diseases differ in their manifestation (disease heterogeneity), and patients with the same disease show varied patterns (patient heterogeneity). To address these issues, we first adopt existing techniques and propose a base method. Given the limitations of the base method, we further propose an Advanced Double Heterogeneity-based Multi-Task Learning (ADH-MTL) method that improves the base method through three innovations: (1) group-level modeling to support new patient predictions, (2) a decomposition strategy to reduce model complexity, and (3) a Bayesian network that explicitly captures dependencies while balancing similarities and differences across model components. Empirical evaluations on real-world wearable sensor data demonstrate that ADH-MTL significantly outperforms existing baselines, and each of its innovations is shown to be effective. This study contributes to health information systems by offering a computational solution for integrated physical and mental healthcare and provides design principles for advancing collaborative chronic disease management across the pre-treatment, treatment, and post-treatment phases.

cs.LG

Central limit theorem for high temperature spin models via martingale embedding

We use martingale embeddings to prove a central limit theorem (CLT) for one-dimensional projections of high-dimensional random vectors in $\{-1,1\}^n$ satisfying a Poincar\'e inequality. We obtain a non-asymptotic error bound involving two-point and three-point functions for the CLT in 2-Wasserstein distance. We present three illustrative applications: Ising model with finite-range interactions, ferromagnetic Ising model under the Dobrushin condition, and the Sherrington-Kirkpatrick spin glass model at sufficiently high temperature. In all the examples, we allow heterogeneous external fields.

math.PR

An Event-Driven Spiking Compute-In-Memory Macro based on SOT-MRAM

The application of Magnetic Random-Access Memory (MRAM) in computing-in-memory (CIM) has gained significant attention. However, existing designs often suffer from high energy consumption due to their reliance on complex analog circuits for computation. In this work, we present a Spin-Orbit- Torque MRAM(SOT-MRAM)-based CIM macro that employs an event-driven spiking processing for high energy efficiency. The SOT-MRAM crossbar adopts a hybrid series-parallel cell structure to efficiently support matrix-vector multiplication (MVM). Signal information is (en) decoded as spikes using lightweight circuits, eliminating the need for conventional area- and powerintensive analog circuits. The SOT-MRAM macro is designed and evaluated in 28nm technology, and experimental results show that it achieves a peak energy efficiency of 243.6 TOPS/W, significantly outperforming existing designs.

cs.AR

Secure Confidential Business Information When Sharing Machine Learning Models

Model-sharing offers significant business value by enabling firms with well-established Machine Learning (ML) models to monetize and share their models with others who lack the resources to develop ML models from scratch. However, concerns over data confidentiality remain a significant barrier to model-sharing adoption, as Confidential Property Inference (CPI) attacks can exploit shared ML models to uncover confidential properties of the model provider's private model training data. Existing defenses often assume that CPI attacks are non-adaptive to the specific ML model they are targeting. This assumption overlooks a key characteristic of real-world adversaries: their responsiveness, i.e., adversaries' ability to dynamically adjust their attack models based on the information of the target and its defenses. To overcome this limitation, we propose a novel defense method that explicitly accounts for the responsive nature of real-world adversaries via two methodological innovations: a novel Responsive CPI attack and an attack-defense arms race framework. The former emulates the responsive behaviors of adversaries in the real world, and the latter iteratively enhances both the target and attack models, ultimately producing a secure ML model that is robust against responsive CPI attacks. Furthermore, we propose and integrate a novel approximate strategy into our defense, which addresses a critical computational bottleneck of defense methods and improves defense efficiency. Through extensive empirical evaluations across various realistic model-sharing scenarios, we demonstrate that our method outperforms existing defenses by more effectively defending against CPI attacks, preserving ML model utility, and reducing computational overhead.

cs.CR

Early Stopping Chain-of-thoughts in Large Language Models

Reasoning large language models (LLMs) have demonstrated superior capacities in solving complicated problems by generating long chain-of-thoughts (CoT), but such a lengthy CoT incurs high inference costs. Previous methods on inference-stage efficient reasoning either require white-box models to monitor the reasoning process or are not reliable through direct prompting. In response, we introduce ES-CoT, an inference-time method that shortens CoT generation by detecting answer convergence and stopping early with almost no performance loss. When observing a linguistic marker (such as "wait") in the reasoning process, we prompt the LLM to output its current final answer, denoted as a step answer. We then track the run length of consecutive identical step answers as a measure of answer convergence. We show both empirically and theoretically that step answers steadily converge to the final answer, and large run-length jumps reliably mark this convergence. Experiments on six reasoning datasets across three LLMs show that ES-CoT reduces the number of inference tokens by 16.08% on average while maintaining accuracy comparable to standard CoT.

cs.CL

Measuring Stereotype and Deviation Biases in Large Language Models

Large language models (LLMs) are widely applied across diverse domains, raising concerns about their limitations and potential risks. In this study, we investigate two types of bias that LLMs may display: stereotype bias and deviation bias. Stereotype bias refers to when LLMs consistently associate specific traits with a particular demographic group. Deviation bias reflects the disparity between the demographic distributions extracted from LLM-generated content and real-world demographic distributions. By asking four advanced LLMs to generate profiles of individuals, we examine the associations between each demographic group and attributes such as political affiliation, religion, and sexual orientation. Our experimental results show that all examined LLMs exhibit both significant stereotype bias and deviation bias towards multiple groups. Our findings uncover the biases that occur when LLMs infer user attributes and shed light on the potential harms of LLM-generated outputs.

cs.CL

Adapting Vehicle Detectors for Aerial Imagery to Unseen Domains with Weak Supervision

Detecting vehicles in aerial imagery is a critical task with applications in traffic monitoring, urban planning, and defense intelligence. Deep learning methods have provided state-of-the-art (SOTA) results for this application. However, a significant challenge arises when models trained on data from one geographic region fail to generalize effectively to other areas. Variability in factors such as environmental conditions, urban layouts, road networks, vehicle types, and image acquisition parameters (e.g., resolution, lighting, and angle) leads to domain shifts that degrade model performance. This paper proposes a novel method that uses generative AI to synthesize high-quality aerial images and their labels, improving detector training through data augmentation. Our key contribution is the development of a multi-stage, multi-modal knowledge transfer framework utilizing fine-tuned latent diffusion models (LDMs) to mitigate the distribution gap between the source and target environments. Extensive experiments across diverse aerial imagery domains show consistent performance improvements in AP50 over supervised learning on source domain data, weakly supervised adaptation methods, unsupervised domain adaptation methods, and open-set object detectors by 4-23%, 6-10%, 7-40%, and more than 50%, respectively. Furthermore, we introduce two newly annotated aerial datasets from New Zealand and Utah to support further research in this field. Project page is available at: https://humansensinglab.github.io/AGenDA

cs.CV

Conditional central limit theorems for exponential random graphs

In this paper, we study the Exponential Random Graph Models (ERGMs) conditioning on the number of edges. In subcritical region of model parameters, we prove a conditional Central Limit Theorem (CLT) with explicit mean and variance for the number of two stars. This generalizes the corresponding result in the literature for the Erd\H{o}s--R\'enyi random graph. To prove our main result, we develop a new conditional CLT via exchangeable pairs based on the ideas of Dey and Terlov. Our key technical contributions in the application to ERGMs include establishing a linearity condition for an exchangeable pair involving two star counts, a local CLT for edge counts, as well as new higher-order concentration inequalities. Our approach also works for general subgraph counts, and we give a conjectured form of their conditional CLT.

math.PR