arXiv subjects

Xiao Wei

Publications and source records attributed to Xiao Wei.

18 recordsLinked to original sources

arXiv2026

LLM-Anchored Paralinguistic Enrichment for Alzheimer's Disease Detection

Speech-based automatic detection of Alzheimer's disease (AD) provides a non-invasive and scalable approach to early cognitive screening. AD affects both lexical-semantic organization and speech production, including atypical pauses and word elongations. However, existing methods have yet to fully integrate these paralinguistic cues with linguistic content. We propose LLM-Anchored Paralinguistic Enrichment (LAPE), which enriches LLM-derived linguistic representations with paralinguistic cues through three coordinated innovations. The first is prosodic event textualization, which enables the LLM to model pauses and elongations jointly with lexical content by encoding them as explicit markers with bounded duration-aware repetition. The second is lexico-prosodic unitization and chunking, which preserves event identity and magnitude in both modalities by pooling only consecutive word units. The third is text-anchored paralinguistic fusion, which integrates local and utterance-level speech features by using NormGate to normalize and dynamically scale them relative to text. We evaluate LAPE on ADReSS and ADReSSo using participant-level cross-validation and leave-one-subject-out evaluation. LAPE achieves state-of-the-art performance across all four primary settings. Code will be released upon acceptance.

cs.CL↗

arXiv2026

Market-Informed Valuation of GMMB Riders with Surrender Options under a Heston Stochastic-Local Volatility Model

We develop a market-informed valuation framework for guaranteed minimum maturity benefit (GMMB) riders with rational surrender under the Heston stochastic-local volatility (SLV) model. The guarantee is written on the fee-deducted account value and is considered both in its terminal-only form and in the presence of early surrender rights. The Heston SLV specification combines stochastic volatility with a leverage function calibrated to a prescribed local-volatility surface. The leverage surface is obtained through a forward Markovian-projection equation so that, at the model level, the SLV dynamics are constrained to the same one-dimensional marginals as the corresponding local-volatility (LV) model. The latter is used only as a one-factor benchmark, allowing us to isolate the effect of stochastic volatility on continuation values and surrender decisions while preserving the same option-calibrated local-volatility target. We derive the associated backward pricing equations and propose a hybrid tree/finite-difference algorithm for the SLV model with a calibrated leverage function. Synthetic experiments and a market-informed case study show that SLV and LV valuations are numerically close for terminal-only guarantees, as expected from the common marginal target, whereas materially larger differences can arise once surrender is allowed. These differences are reflected in guarantee values, fair insurance fees and volatility-dependent surrender regions. The results indicate that matching one-date marginals implied by vanilla-option prices does not eliminate model risk for insurance liabilities whose value depends on conditional continuation dynamics and endogenous surrender decisions.

q-fin.CP↗

arXiv2026

Gated Multi-Graph Fusion via Graph Attention Networks for Alzheimer's Disease Detection

Spontaneous speech is a vital non-invasive biomarker for Alzheimer's Disease (AD), yet many systems overlook non-linear structural disruptions and clinical heterogeneity in pathological language. We propose a Multi-View Gated Graph Attention Network that transcribes audio via Automatic Speech Recognition (ASR) to construct semantic, dependency, and co-occurrence graphs, characterizing speech through a "content-structure-flow" framework. Notably, the co-occurrence graph leverages Pointwise Mutual Information (PMI) from a normative corpus to quantify narrative logic and linguistic deviation. To address symptomatic diversity, an adaptive gated fusion mechanism dynamically integrates these views. Evaluated on the ADReSSo dataset, our model achieves 90.00% accuracy. Ablation results confirm that the PMI-based graph and heterogeneity-aware gating are essential for robust classification across diverse clinical populations. Our source code is publicly available at https://github.com/opeacc/AD.

cs.CL↗

arXiv2026

CuraWeb: Joint Optimization of Quality, Redundancy, and Diversity for Web-Scale Pretraining Data

Open-web corpora curated via highly selective filters, such as FineWeb-Edu and DCLM, constitute the core of LLM pretraining data and have significantly advanced LLM performance. However, these pipelines typically rely on singular optimization objectives, which inevitably narrows distributional diversity and marginalizes long-tail knowledge, thereby restricting data coverage and underutilizing the vast potential of the open web. To address this limitation, we propose a novel curation paradigm that shifts from linear pruning to the joint optimization of quality, redundancy, and diversity. This framework synergizes dual-track cleaning (rule-based and model-driven) with hybrid deduplication (n-gram and semantic), while employing a multi-objective sampler to balance informational quality with distributional breadth. Applying this framework to Common Crawl, we construct CuraWeb, a 2T-token English corpus. Unlike existing resources, CuraWeb establishes an industrial-grade standard for data curation by recovering a more holistic data distribution with enhanced diversity and minimal redundancy, achieving broader coverage of long-tail knowledge across diverse domains. Experimental evaluations at the 3B scale demonstrate that CuraWeb significantly outperforms state-of-the-art baselines, yielding an average performance gain of 1.8\% across a wide range of benchmarks, particularly in knowledge-intensive and reasoning tasks.

cs.AI↗

arXiv2026

The annular gap model under a rotating dipole field approximation: simulating gamma-ray light curve

A more realistic description of the magnetosphere is crucial for understanding the radiation emitted by pulsars. In this paper, we revisit the annular gap model by employing a rotating dipole field, which is more realistic than the static dipole field, as an approximation of the magnetic structure of the pulsar magnetosphere. Compared with the static dipole field approximation, the open field-line region, including both the core and annular gaps, is significantly enlarged, and the two regions become asymmetric with respect to the fiducial plane. We apply this model to three young gamma-ray pulsars with distinct light-curve morphologies, PSRs J0631$+$1036 (single peak), J1709$-$4429 (double peaks), and J1048$-$5832 (three peaks). Using viewing geometries constrained by radio polarization measurements, the annular gap model within the rotating dipole field successfully reproduces the main morphological features of their gamma-ray light curves above 0.1 GeV. Our model provides a framework for interpreting pulsar high-energy emission, which can be used to analyze the emission properties of high-energy pulsars.

astro-ph.HE↗

arXiv2026

Breaking Data Efficiency Dilemma: A Federated and Augmented Learning Framework For Alzheimer's Disease Detection via Speech

Early diagnosis of Alzheimer's Disease (AD) is crucial for delaying its progression. While AI-based speech detection is non-invasive and cost-effective, it faces a critical data efficiency dilemma due to medical data scarcity and privacy barriers. Therefore, we propose FAL-AD, a novel framework that synergistically integrates federated learning with data augmentation to systematically optimize data efficiency. Our approach delivers three key breakthroughs: First, absolute efficiency improvement through voice conversion-based augmentation, which generates diverse pathological speech samples via cross-category voice-content recombination. Second, collaborative efficiency breakthrough via an adaptive federated learning paradigm, maximizing cross-institutional benefits under privacy constraints. Finally, representational efficiency optimization by an attentive cross-modal fusion model, which achieves fine-grained word-level alignment and acoustic-textual interaction. Evaluated on ADReSSo, FAL-AD achieves a state-of-the-art multi-modal accuracy of 91.52%, outperforming all centralized baselines and demonstrating a practical solution to the data efficiency dilemma. Our source code is publicly available at https://github.com/smileix/fal-ad.

cs.CL↗

arXiv2025

Large Language Model for Verilog Code Generation: Literature Review and the Road Ahead

Code generation has emerged as a critical research area at the intersection of Software Engineering (SE) and Artificial Intelligence (AI), attracting significant attention from both academia and industry. Within this broader landscape, Verilog, as a representative hardware description language (HDL), plays a fundamental role in digital circuit design and verification, making its automated generation particularly significant for Electronic Design Automation (EDA). Consequently, recent research has increasingly focused on applying Large Language Models (LLMs) to Verilog code generation, particularly at the Register Transfer Level (RTL), exploring how these AI-driven techniques can be effectively integrated into hardware design workflows. Despite substantial research efforts have explored LLM applications in this domain, a comprehensive survey synthesizing these developments remains absent from the literature. This review fill addresses this gap by providing a systematic literature review of LLM-based methods for Verilog code generation, examining their effectiveness, limitations, and potential for advancing automated hardware design. The review encompasses research work from conferences and journals in the fields of SE, AI, and EDA, encompassing 70 papers published on venues, along with 32 high-quality preprint papers, bringing the total to 102 papers. By answering four key research questions, we aim to (1) identify the LLMs used for Verilog generation, (2) examine the datasets and metrics employed in evaluation, (3) categorize the techniques proposed for Verilog generation, and (4) analyze LLM alignment approaches for Verilog generation. Based on our findings, we have identified a series of limitations of existing studies. Finally, we have outlined a roadmap highlighting potential opportunities for future research endeavors in LLM-assisted hardware design.

cs.AR↗

arXiv2025

Integration of Old and New Knowledge for Generalized Intent Discovery: A Consistency-driven Prototype-Prompting Framework

Intent detection aims to identify user intents from natural language inputs, where supervised methods rely heavily on labeled in-domain (IND) data and struggle with out-of-domain (OOD) intents, limiting their practical applicability. Generalized Intent Discovery (GID) addresses this by leveraging unlabeled OOD data to discover new intents without additional annotation. However, existing methods focus solely on clustering unsupervised data while neglecting domain adaptation. Therefore, we propose a consistency-driven prototype-prompting framework for GID from the perspective of integrating old and new knowledge, which includes a prototype-prompting framework for transferring old knowledge from external sources, and a hierarchical consistency constraint for learning new knowledge from target domains. We conducted extensive experiments and the results show that our method significantly outperforms all baseline methods, achieving state-of-the-art results, which strongly demonstrates the effectiveness and generalization of our methods. Our source code is publicly available at https://github.com/smileix/cpp.

cs.CL↗

arXiv2025

Telecom quantum dots on GaAs substrates as integration-ready high performance single-photon sources

The development of deterministic single photon sources emitting in the telecommunication bands is a key challenge for quantum communication and photonic quantum computing. Here, we investigate the optical properties and single-photon emission of molecular beam epitaxy grown semiconductor quantum dots emitting in the telecom O- and C- bands. The quantum dots are embedded in a InGaAs matrix with fixed indium content grown on top of a compositionally graded InGaAs buffer. This structure allows for the future implementation of electrically contacted nanocavities to enable high-quality and bright QD emission. In detailed optical characterizations we observe linewidths as low as $ 50 \mu$eV, close to the spectrometer resolution limit, low fine structure splittings close to $ 10 \mu$eV, and $g^{(2)} (0)$ values as low as $0.08$. These results advance the current performance metrics for MBE-grown quantum dots on GaAs substrates emitting in the telecom bands and showcase the potential of the presented heterostructures for further integration into photonic devices.

cond-mat.mes-hall↗

arXiv2025

The Study of Human Preference Based on Integrated Analysis of N1 and LPP Components

Human preference research is a significant domain in psychology and psychophysiology, with broad applications in psychiatric evaluation and daily life quality enhancement. This study explores the neural mechanisms of human preference judgments through the analysis of event-related potentials (ERPs), specifically focusing on the early N1 component and the late positive potential (LPP). Using a mixed-image dataset covering items such as hats, fruits, snacks, scarves, drinks, and pets, we elicited a range of emotional responses from participants while recording their brain activity via EEG. Our work innovatively combines the N1 and LPP components to reveal distinct patterns across different preference levels. The N1 component, particularly in frontal regions, showed increased amplitude for preferred items, indicating heightened early visual attention. Similarly, the LPP component exhibited larger amplitudes for both preferred and non-preferred items, reflecting deeper emotional engagement and cognitive evaluation. In addition, we introduced a relationship model that integrates these ERP components to assess the intensity and direction of preferences, providing a novel method for interpreting EEG data in the context of emotional responses. These findings offer valuable insights into the cognitive and emotional processes underlying human preferences and present new possibilities for brain-computer interface applications, personalized marketing, and product design.

q-bio.NC↗

arXiv2025

LAPP: Large Language Model Feedback for Preference-Driven Reinforcement Learning

We introduce Large Language Model-Assisted Preference Prediction (LAPP), a novel framework for robot learning that enables efficient, customizable, and expressive behavior acquisition with minimum human effort. Unlike prior approaches that rely heavily on reward engineering, human demonstrations, motion capture, or expensive pairwise preference labels, LAPP leverages large language models (LLMs) to automatically generate preference labels from raw state-action trajectories collected during reinforcement learning (RL). These labels are used to train an online preference predictor, which in turn guides the policy optimization process toward satisfying high-level behavioral specifications provided by humans. Our key technical contribution is the integration of LLMs into the RL feedback loop through trajectory-level preference prediction, enabling robots to acquire complex skills including subtle control over gait patterns and rhythmic timing. We evaluate LAPP on a diverse set of quadruped locomotion and dexterous manipulation tasks and show that it achieves efficient learning, higher final performance, faster adaptation, and precise control of high-level behaviors. Notably, LAPP enables robots to master highly dynamic and expressive tasks such as quadruped backflips, which remain out of reach for standard LLM-generated or handcrafted rewards. Our results highlight LAPP as a promising direction for scalable preference-driven robot learning.

cs.RO↗

arXiv2024

Enhancing Valuation of Variable Annuities in Lévy Models with Stochastic Interest Rate

This paper extends the valuation and optimal surrender framework for variable annuities with guaranteed minimum benefits in a Lévy equity market environment by incorporating a stochastic interest rate described by the Hull-White model. This approach frames a more dynamic and realistic financial setting compared to previous literature. We exploit a robust valuation mechanism employing a hybrid numerical method that merges tree methods for interest rate modeling with finite difference techniques for the underlying asset price. This method is particularly effective for addressing the complexities of variable annuities, where periodic fees and mortality risks are significant factors. Our findings reveal the influence of stochastic interest rates on the strategic decision-making process concerning the surrender of these financial instruments. Through comprehensive numerical experiments, and by comparing our results with those obtained through the Longstaff-Schwartz Monte Carlo method, we illustrate how our refined model can guide insurers in designing contracts that equitably balance the interests of both parties. This is particularly relevant in discouraging premature surrenders while adapting to the realistic fluctuations of financial markets. Lastly, a comparative statics analysis with varying interest rate parameters underscores the impact of interest rates on the cost of the optimal surrender strategy, emphasizing the importance of accurately modeling stochastic interest rates.

q-fin.PR↗

arXiv2022

Cache-Aided Massive MIMO with Linear Precoding in Multi-cell Systems

In this paper, we propose a novel joint caching and massive multiple-input multiple-output (MIMO) transmission scheme, referred to as \emph{cache-aided massive MIMO}, for multi-cell downlink transmission to multiple cache-enabled receivers. With the proposed scheme, users who have cached (a portion of) the files that they request are offloaded and, hence, (partially) inactive during downlink transmission. The other users either benefit from the cache-enabled offloading for mitigating pilot contamination or exploit the cached but unrequested files to cancel interference during uplink channel estimation and downlink file reception. Moreover, by redesigning the transmit precoders based on the cache status of the users and channel state information, we gain additional degrees of freedom for massive MIMO transmission. For a given cache status, we analyze the equivalent content delivery rates (ECDRs), i.e., the average rates of delivering a requested file via both caching and massive MIMO transmission to the requesting user, for cache-aided massive MIMO employing re-designed maximum ratio transmission (MRT), zero-forcing (ZF) precoding, and regularized zero-forcing (RZF) precoding. Based on the derived results, the impact of (random) uncoded caching and coded caching on the performance of the re-designed precoding schemes is investigated. Simulation results validate our derivations and show that caching is beneficial for precoded downlink transmission as it enhances the transmit power allocation, mitigates intra- and inter-cell interference, and reduces the impairment caused by pilot contamination. Compared with conventional massive MIMO without caching and with cache-oblivious precoding, the proposed cache-aided massive MIMO scheme achieves a significantly higher ECDR even when the number of users approaches the number of transmit antennas.

cs.IT↗

arXiv2022

ApolloRL: a Reinforcement Learning Platform for Autonomous Driving

We introduce ApolloRL, an open platform for research in reinforcement learning for autonomous driving. The platform provides a complete closed-loop pipeline with training, simulation, and evaluation components. It comes with 300 hours of real-world data in driving scenarios and popular baselines such as Proximal Policy Optimization (PPO) and Soft Actor-Critic (SAC) agents. We elaborate in this paper on the architecture and the environment defined in the platform. In addition, we discuss the performance of the baseline agents in the ApolloRL environment.

cs.RO↗

arXiv2019

Deep Active Learning for Efficient Training of a LiDAR 3D Object Detector

Training a deep object detector for autonomous driving requires a huge amount of labeled data. While recording data via on-board sensors such as camera or LiDAR is relatively easy, annotating data is very tedious and time-consuming, especially when dealing with 3D LiDAR points or radar data. Active learning has the potential to minimize human annotation efforts while maximizing the object detector's performance. In this work, we propose an active learning method to train a LiDAR 3D object detector with the least amount of labeled training data necessary. The detector leverages 2D region proposals generated from the RGB images to reduce the search space of objects and speed up the learning process. Experiments show that our proposed method works under different uncertainty estimations and query functions, and can save up to 60% of the labeling efforts while reaching the same network performance.

cs.RO↗

arXiv2019

Cache-Aided Massive MIMO: Linear Precoding Design and Performance Analysis

In this paper, we propose a novel joint caching and massive multiple-input multiple-output (MIMO) transmission scheme, referred to as cache-aided massive MIMO, for advanced downlink cellular communications. In addition to reaping the conventional advantages of caching and massive MIMO, the proposed scheme also exploits the side information provided by cached files for interference cancellation at the receivers. This interference cancellation increases the degrees of freedom available for precoding design. In addition, the power freed by the cache-enabled offloading can benefit the transmissions to the users requesting non-cached files. The resulting performance gains are not possible if caching and massive MIMO are designed separately. We analyze the performance of cache-aided massive MIMO for cache-dependent maximum-ratio transmission (MRT), zero-forcing (ZF) precoding, and regularized zero-forcing (RZF) precoding. Lower bounds on the ergodic achievable rates are derived in closed form for MRT and ZF precoding. The ergodic achievable rate of RZF precoding is obtained for the case when the numbers of transmit antennas and users are large but their ratio is fixed. Compared to conventional massive MIMO, the proposed cache-aided massive MIMO scheme achieves a significantly higher ergodic rate especially when the number of users approaches the number of transmit antennas.

eess.SP↗

arXiv2015

To Know Where We Are: Vision-Based Positioning in Outdoor Environments

Augmented reality (AR) displays become more and more popular recently, because of its high intuitiveness for humans and high-quality head-mounted display have rapidly developed. To achieve such displays with augmented information, highly accurate image registration or ego-positioning are required, but little attention have been paid for out-door environments. This paper presents a method for ego-positioning in outdoor environments with low cost monocular cameras. To reduce the computational and memory requirements as well as the communication overheads, we formulate the model compression algorithm as a weighted k-cover problem for better preserving model structures. Specifically for real-world vision-based positioning applications, we consider the issues with large scene change and propose a model update algorithm to tackle these problems. A long- term positioning dataset with more than one month, 106 sessions, and 14,275 images is constructed. Based on both local and up-to-date models constructed in our approach, extensive experimental results show that high positioning accuracy (mean ~ 30.9cm, stdev. ~ 15.4cm) can be achieved, which outperforms existing vision-based algorithms.

cs.CV↗

arXiv2010

Individual focus and knowledge contribution

Before contributing new knowledge, individuals must attain requisite background knowledge or skills through schooling, training, practice, and experience. Given limited time, individuals often choose either to focus on few areas, where they build deep expertise, or to delve less deeply and distribute their attention and efforts across several areas. In this paper we measure the relationship between the narrowness of focus and the quality of contribution across a range of both traditional and recent knowledge sharing media, including scholarly articles, patents, Wikipedia, and online question and answer forums. Across all systems, we observe a small but significant positive correlation between focus and quality.

cs.CY↗