Searcharxiv⌕ Search

arXiv subjects

Xinyi Wang

Publications and source records attributed to Xinyi Wang.

At least 91 records · Page 5Linked to original sources

Trajectory Design for UAV-Based Low-Altitude Wireless Networks in Unknown Environments: A Digital Twin-Assisted TD3 Approach

Unmanned aerial vehicles (UAVs) are emerging as key enablers for low-altitude wireless network (LAWN), particularly when terrestrial networks are unavailable. In such scenarios, the environmental topology is typically unknown; hence, designing efficient and safe UAV trajectories is essential yet challenging. To address this, we propose a digital twin (DT)-assisted training and deployment framework. In this framework, the UAV transmits integrated sensing and communication signals to provide communication services to ground users, while simultaneously collecting echoes that are uploaded to the DT server to progressively construct virtual environments (VEs). These VEs accelerate model training and are continuously updated with real-time UAV sensing data during deployment, supporting decision-making and enhancing flight safety. Based on this framework, we further develop a trajectory design scheme that integrates simulated annealing for efficient user scheduling with the twin-delayed deep deterministic policy gradient algorithm for continuous trajectory design, aiming to minimize mission completion time while ensuring obstacle avoidance. Simulation results demonstrate that the proposed approach achieves faster convergence, higher flight safety, and shorter mission completion time compared with baseline methods, providing a robust and efficient solution for LAWN deployment in unknown environments.

eess.SP↗

Quantum Artificial Intelligence for Software Engineering: the Road Ahead

In order to handle the increasing complexity of software systems, Artificial Intelligence (AI) has been applied to various areas of software engineering, including requirements engineering, coding, testing, and debugging. This has led to the emergence of AI for Software Engineering as a distinct research area within the field of software engineering. With the development of quantum computing, the field of Quantum AI (QAI) is arising, enhancing the performance of classical AI and holding significant potential for solving classical software engineering problems. Some initial applications of QAI in software engineering have already emerged, such as test case optimization. However, the path ahead remains open, offering ample opportunities to solve complex software engineering problems cost-effectively with QAI. To this end, this paper presents a roadmap towards the application of QAI in software engineering. Specifically, we consider two of the main categories of QAI, i.e., quantum optimization algorithms and quantum machine learning. For each software engineering phase, we discuss how these QAI approaches can address some of the tasks associated with that phase. Moreover, we provide an overview of some of the possible challenges that need to be addressed to make the application of QAI for software engineering successful.

cs.SE↗

A Stitch in Time Saves Nine: Proactive Self-Refinement for Language Models

Recent advances in self-refinement have demonstrated significant potential for improving the outputs of large language models (LLMs) through iterative refinement. However, most existing self-refinement methods rely on a reactive process with a fixed number of iterations, making it difficult to determine the optimal timing and content of refinement based on the evolving generation context. Inspired by the way humans dynamically refine their thoughts during execution, we propose ProActive Self-Refinement (PASR), a novel method that enables LLMs to refine their outputs during the generation process. Unlike methods that regenerate entire responses, PASR proactively decides whether, when, and how to refine based on the model's internal state and evolving context. We conduct extensive experiments on a diverse set of 10 tasks to evaluate the effectiveness of PASR. Experimental results show that PASR significantly enhances problem-solving performance. In particular, on Qwen3-8B, PASR reduces average token consumption by 41.6% compared to standard generation, while also achieving an 8.2% improvement in accuracy. Our code and baselines used in the paper are available on GitHub.

cs.CL↗

Sensing Performance Analysis in Cooperative Air-Ground ISAC Networks for LAE

To support the development of low altitude economy, the air-ground integrated sensing and communication (ISAC) networks need to be constructed to provide reliable and robust communication and sensing services. In this paper, the sensing capabilities in the cooperative air-ground ISAC networks are evaluated in terms of area radar detection coverage probability under a constant false alarm rate, where the distribution of aggregated sensing interferences is analyzed as a key intermediate result. Compared with the analysis based on the strongest interferer approximation, taking the aggregated sensing interference into consideration is better suited for pico-cell scenarios with high base station density. Simulations are conducted to validate the analysis.

cs.IT↗

Towards Secure ISAC Beamforming: How Many Dedicated Sensing Beams Are Required?

In this paper, sensing-assisted secure communication in a multi-user multi-eavesdropper integrated sensing and communication (ISAC) system is investigated. Confidential communication signals and dedicated sensing signals are jointly transmitted by a base station (BS) to simultaneously serve users and sense aerial eavesdroppers (AEs). A sum rate maximization problem is formulated under AEs' Signal-to-Interference-plus-Noise Ratio (SINR) and sensing Signal-to-Clutter-plus-Noise Ratio (SCNR) constraints. A fractional-programming-based alternating optimization algorithm is developed to solve this problem for fully digital arrays, where successive convex approximation (SCA) and semidefinite relaxation (SDR) are leveraged to handle non-convex constraints. Furthermore, the minimum number of dedicated sensing beams is analyzed via a worst-case rank bound, upon which the proposed beamforming design is further extended to the hybrid analog-digital (HAD) array architecture, where the unit-modulus constraint is addressed by manifold optimization. Simulation results demonstrate that only a small number of sensing beams are sufficient for both sensing and jamming AEs, and the proposed designs consistently outperform strong baselines while also revealing the communication-sensing trade-off.

eess.SP↗

AI Foundation Model for Time Series with Innovations Representation

This paper introduces an Artificial Intelligence (AI) foundation model for time series in engineering applications, where causal operations are required for real-time monitoring and control. Since engineering time series are governed by physical, rather than linguistic, laws, large-language-model-based AI foundation models may be ineffective or inefficient. Building on the classical innovations representation theory of Wiener, Kallianpur, and Rosenblatt, we propose Time Series GPT (TS-GPT) -- an innovations-representation-based Generative Pre-trained Transformer for engineering monitoring and control. As an example of foundation model adaptation, we consider Probabilistic Generative Forecasting, which produces future time series samples from conditional probability distributions given past realizations. We demonstrate the effectiveness of TS-GPT in forecasting real-time locational marginal prices using historical data from U.S. independent system operators.

stat.ML↗

Prompt-Driven Agentic Video Editing System: Autonomous Comprehension of Long-Form, Story-Driven Media

Creators struggle to edit long-form, narrative-rich videos not because of UI complexity, but due to the cognitive demands of searching, storyboarding, and sequencing hours of footage. Existing transcript- or embedding-based methods fall short for creative workflows, as models struggle to track characters, infer motivations, and connect dispersed events. We present a prompt-driven, modular editing system that helps creators restructure multi-hour content through free-form prompts rather than timelines. At its core is a semantic indexing pipeline that builds a global narrative via temporal segmentation, guided memory compression, and cross-granularity fusion, producing interpretable traces of plot, dialogue, emotion, and context. Users receive cinematic edits while optionally refining transparent intermediate outputs. Evaluated on 400+ videos with expert ratings, QA, and preference studies, our system scales prompt-driven editing, preserves narrative coherence, and balances automation with creator control.

cs.AI↗

Wireless Powered MEC Systems via Discrete Pinching Antennas: TDMA versus NOMA

Pinching antennas (PAs), a new type of reconfigurable and flexible antenna structures, have recently attracted significant research interest due to their ability to create line-of-sight links and mitigate large-scale path loss. Owing to their potential benefits, integrating PAs into wireless powered mobile edge computing (MEC) systems is regarded as a viable solution to enhance both energy transfer and task offloading efficiency. Unlike prior studies that assume ideal continuous PA placement along waveguides, this paper investigates a practical discrete PA-assisted wireless powered MEC framework, where devices first harvest energy from PA-emitted radio-frequency signals and then adopt a partial offloading mode, allocating part of the harvested energy to local computing and the remainder to uplink offloading. The uplink phase considers both the time-division multiple access (TDMA) and non-orthogonal multiple access (NOMA), each examined under three levels of PA activation flexibility. For each configuration, we formulate a joint optimization problem to maximize the total computational bits and conduct a theoretical performance comparison between the TDMA and NOMA schemes. To address the resulting mixed-integer nonlinear problems, we develop a two-layer algorithm that combines closed-form solutions based on Karush-Kuhn-Tucker (KKT) conditions with a cross-entropy-based learning method. Numerical results validate the superiority of the proposed design in terms of the harvested energy and computation performance, revealing that TDMA and NOMA achieve comparable performance under coarser PA activation levels, whereas finer activation granularity enables TDMA to achieve superior computation performance over NOMA.

eess.SP↗

From Promise to Practical Reality: Transforming Diffusion MRI Analysis with Fast Deep Learning Enhancement

Fiber orientation distribution (FOD) is an advanced diffusion MRI modeling technique that represents complex white matter fiber configurations, and a key step for subsequent brain tractography and connectome analysis. Its reliability and accuracy, however, heavily rely on the quality of the MRI acquisition and the subsequent estimation of the FODs at each voxel. Generating reliable FODs from widely available clinical protocols with single-shell and low-angular-resolution acquisitions remains challenging but could potentially be addressed with recent advances in deep learning-based enhancement techniques. Despite advancements, existing methods have predominantly been assessed on healthy subjects, which have proved to be a major hurdle for their clinical adoption. In this work, we validate a newly optimized enhancement framework, FastFOD-Net, across healthy controls and six neurological disorders. This accelerated end-to-end deep learning framework enhancing FODs with superior performance and delivering training/inference efficiency for clinical use ($60\times$ faster comparing to its predecessor). With the most comprehensive clinical evaluation to date, our work demonstrates the potential of FastFOD-Net in accelerating clinical neuroscience research, empowering diffusion MRI analysis for disease differentiation, improving interpretability in connectome applications, and reducing measurement errors to lower sample size requirements. Critically, this work will facilitate the more widespread adoption of, and build clinical trust in, deep learning based methods for diffusion MRI enhancement. Specifically, FastFOD-Net enables robust analysis of real-world, clinical diffusion MRI data, comparable to that achievable with high-quality research acquisitions.

cs.CV↗

PAR-AdvGAN: Improving Adversarial Attack Capability with Progressive Auto-Regression AdvGAN

Deep neural networks have demonstrated remarkable performance across various domains. However, they are vulnerable to adversarial examples, which can lead to erroneous predictions. Generative Adversarial Networks (GANs) can leverage the generators and discriminators model to quickly produce high-quality adversarial examples. Since both modules train in a competitive and simultaneous manner, GAN-based algorithms like AdvGAN can generate adversarial examples with better transferability compared to traditional methods. However, the generation of perturbations is usually limited to a single iteration, preventing these examples from fully exploiting the potential of the methods. To tackle this issue, we introduce a novel approach named Progressive Auto-Regression AdvGAN (PAR-AdvGAN). It incorporates an auto-regressive iteration mechanism within a progressive generation network to craft adversarial examples with enhanced attack capability. We thoroughly evaluate our PAR-AdvGAN method with a large-scale experiment, demonstrating its superior performance over various state-of-the-art black-box adversarial attacks, as well as the original AdvGAN.Moreover, PAR-AdvGAN significantly accelerates the adversarial example generation, i.e., achieving the speeds of up to 335.5 frames per second on Inception-v3 model, outperforming the gradient-based transferable attack algorithms. Our code is available at: https://github.com/LMBTough/PAR

cs.LG↗

A Novel Symbol Level Precoding based AFDM Transmission Framework: Offloading Equalization Burden to Transmitter Side

Affine Frequency Division Multiplexing (AFDM) has attracted considerable attention for its robustness to Doppler effects. However, its high receiver-side computational complexity remains a major barrier to practical deployment. To address this, we propose a novel symbol-level precoding (SLP)-based AFDM transmission framework, which shifts the signal processing burden in downlink communications from user side to the base station (BS), enabling direct symbol detection without requiring channel estimation or equalization at the receiver. Specifically, in the uplink phase, we propose a Sparse Bayesian Learning (SBL) based channel estimation algorithm by exploiting the inherent sparsity of affine frequency (AF) domain channels. In particular, the sparse prior is modeled via a hierarchical Laplace distribution, and parameters are iteratively updated using the Expectation-Maximization (EM) algorithm. We also derive the Bayesian Cramer-Rao Bound (BCRB) to characterize the theoretical performance limit. In the downlink phase, the BS employs the SLP technology to design the transmitted waveform based on the estimated uplink channel state information (CSI) and channel reciprocity. The resulting optimization problem is formulated as a second-order cone programming (SOCP) problem, and its dual problem is investigated by Lagrangian function and Karush-Kuhn-Tucker conditions. Simulation results demonstrate that the proposed SBL estimator outperforms traditional orthogonal matching pursuit (OMP) in accuracy and robustness to off-grid effects, while the SLP-based waveform design scheme achieves performance comparable to conventional AFDM receivers while significantly reducing the computational complexity at receiver, validating the practicality of our approach.

eess.SP↗

Mind the Generation Process: Fine-Grained Confidence Estimation During LLM Generation

While large language models (LLMs) have demonstrated remarkable performance across diverse tasks, they fundamentally lack self-awareness and frequently exhibit overconfidence, assigning high confidence scores to incorrect predictions. Accurate confidence estimation is therefore critical for enhancing the trustworthiness and reliability of LLM-generated outputs. However, existing approaches suffer from coarse-grained scoring mechanisms that fail to provide fine-grained, continuous confidence estimates throughout the generation process. To address these limitations, we introduce FineCE, a novel confidence estimation method that delivers accurate, fine-grained confidence scores during text generation. Specifically, we first develop a comprehensive pipeline for constructing training data that effectively captures the underlying probabilistic distribution of LLM responses, and then train a model to predict confidence scores for arbitrary text sequences in a supervised manner. Furthermore, we propose a Backward Confidence Integration (BCI) strategy that leverages information from the subsequent text to enhance confidence estimation for the current sequence during inference. We also introduce three strategies for identifying optimal positions to perform confidence estimation within the generation process. Extensive experiments on multiple benchmark datasets demonstrate that FineCE consistently outperforms existing classical confidence estimation methods. Our code and all baselines used in the paper are available on GitHub.

cs.CL↗

DIVA-VQA: Detecting Inter-frame Variations in UGC Video Quality

The rapid growth of user-generated (video) content (UGC) has driven increased demand for research on no-reference (NR) perceptual video quality assessment (VQA). NR-VQA is a key component for large-scale video quality monitoring in social media and streaming applications where a pristine reference is not available. This paper proposes a novel NR-VQA model based on spatio-temporal fragmentation driven by inter-frame variations. By leveraging these inter-frame differences, the model progressively analyses quality-sensitive regions at multiple levels: frames, patches, and fragmented frames. It integrates frames, fragmented residuals, and fragmented frames aligned with residuals to effectively capture global and local information. The model extracts both 2D and 3D features in order to characterize these spatio-temporal variations. Experiments conducted on five UGC datasets and against state-of-the-art models ranked our proposed method among the top 2 in terms of average rank correlation (DIVA-VQA-L: 0.898 and DIVA-VQA-B: 0.886). The improved performance is offered at a low runtime complexity, with DIVA-VQA-B ranked top and DIVA-VQA-L third on average compared to the fastest existing NR-VQA method. Code and models are publicly available at: https://github.com/xinyiW915/DIVA-VQA.

eess.IV↗

Quantum Machine Learning-based Test Oracle for Autonomous Mobile Robots

Robots are increasingly becoming part of our daily lives, interacting with both the environment and humans to perform their tasks. The software of such robots often undergoes upgrades, for example, to add new functionalities, fix bugs, or delete obsolete functionalities. As a result, regression testing of robot software becomes necessary. However, determining the expected correct behavior of robots (i.e., a test oracle) is challenging due to the potentially unknown environments in which the robots must operate. To address this challenge, machine learning (ML)-based test oracles present a viable solution. This paper reports on the development of a test oracle to support regression testing of autonomous mobile robots built by PAL Robotics (Spain), using quantum machine learning (QML), which enables faster training and the construction of more precise test oracles. Specifically, we propose a hybrid framework, QuReBot, that combines both quantum reservoir computing (QRC) and a simple neural network, inspired by residual connection, to predict the expected behavior of a robot. Results show that QRC alone fails to converge in our case, yielding high prediction error. In contrast, QuReBot converges and achieves 15% reduction of prediction error compared to the classical neural network baseline. Finally, we further examine QuReBot under different configurations and offer practical guidance on optimal settings to support future robot software testing.

cs.SE↗

Safe Navigation in Uncertain Crowded Environments Using Risk Adaptive CVaR Barrier Functions

Robot navigation in dynamic, crowded environments poses a significant challenge due to the inherent uncertainties in the obstacle model. In this work, we propose a risk-adaptive approach based on the Conditional Value-at-Risk Barrier Function (CVaR-BF), where the risk level is automatically adjusted to accept the minimum necessary risk, achieving a good performance in terms of safety and optimization feasibility under uncertainty. Additionally, we introduce a dynamic zone-based barrier function which characterizes the collision likelihood by evaluating the relative state between the robot and the obstacle. By integrating risk adaptation with this new function, our approach adaptively expands the safety margin, enabling the robot to proactively avoid obstacles in highly dynamic environments. Comparisons and ablation studies demonstrate that our method outperforms existing social navigation approaches, and validate the effectiveness of our proposed framework.

cs.RO↗

BS-1-to-N: Diffusion-Based Environment-Aware Cross-BS Channel Knowledge Map Generation for Cell-Free Networks

Channel knowledge map (CKM) inference across base stations (BSs) is the key to achieving efficient environmentaware communications. This paper proposes an environmentaware cross-BS CKM inference method called BS-1-to-N based on the generative diffusion model. To this end, we first design the BS location embedding (BSLE) method tailored for cross-BS CKM inference to embed BS location information in the feature vector of CKM. Further, we utilize the cross- and self-attention mechanism for the proposed BS-1-to-N model to respectively learn the relationships between source and target BSs, as well as that among target BSs. Therefore, given the locations of the source and target BSs, together with the source CKMs as control conditions, cross-BS CKM inference can be performed for an arbitrary number of source and target BSs. Specifically, in architectures with massive distributed nodes like cell-free networks, traditional methods of sequentially traversing each BS for CKM construction are prohibitively costly. By contrast, the proposed BS-1-to-N model is able to achieve efficient CKM inference for a target BS at any potential location based on the CKMs of source BSs. This is achieved by exploiting the fact that within a given area, different BSs share the same wireless environment that leads to their respective CKMs. Therefore, similar to multi-view synthesis, CKMs of different BSs are representations of the same wireless environment from different BS locations. By mining the implicit correlation between CKM and BS location based on the wireless environment, the proposed BS-1-to-N method achieves efficient CKM inference across BSs. We provide extensive comparisons of CKM inference between the proposed BS-1-to-N generative model versus benchmarking schemes, and provide one use case study to demonstrate its practical application for the optimization of BS deployment.

eess.SP↗

KITTEN: A Knowledge-Intensive Evaluation of Image Generation on Visual Entities

Recent advances in text-to-image generation have improved the quality of synthesized images, but evaluations mainly focus on aesthetics or alignment with text prompts. Thus, it remains unclear whether these models can accurately represent a wide variety of realistic visual entities. To bridge this gap, we propose KITTEN, a benchmark for Knowledge-InTensive image generaTion on real-world ENtities. Using KITTEN, we conduct a systematic study of the latest text-to-image models and retrieval-augmented models, focusing on their ability to generate real-world visual entities, such as landmarks and animals. Analysis using carefully designed human evaluations, automatic metrics, and MLLM evaluations show that even advanced text-to-image models fail to generate accurate visual details of entities. While retrieval-augmented models improve entity fidelity by incorporating reference images, they tend to over-rely on them and struggle to create novel configurations of the entity in creative text prompts.

cs.CV↗

Latency Minimization Oriented Radio and Computation Resource Allocations for 6G V2X Networks with ISCC

Incorporating mobile edge computing (MEC) and integrated sensing and communication (ISAC) has emerged as a promising technology to enable integrated sensing, communication, and computing (ISCC) in the sixth generation (6G) networks. ISCC is particularly attractive for vehicle-to-everything (V2X) applications, where vehicles perform ISAC to sense the environment and simultaneously offload the sensing data to roadside base stations (BSs) for remote processing. In this paper, we investigate a particular ISCC-enabled V2X system consisting of multiple multi-antenna BSs serving a set of single-antenna vehicles, in which the vehicles perform their respective ISAC operations (for simultaneous sensing and offloading to the associated BS) over orthogonal sub-bands. With the focus on fairly minimizing the sensing completion latency for vehicles while ensuring the detection probability constraints, we jointly optimize the allocations of radio resources (i.e., the sub-band allocation, transmit power control at vehicles, and receive beamforming at BSs) as well as computation resources at BS MEC servers. To solve the formulated complex mixed-integer nonlinear programming (MINLP) problem, we propose an alternating optimization algorithm. In this algorithm, we determine the sub-band allocation via the branch-and-bound method, optimize the transmit power control via successive convex approximation (SCA), and derive the receive beamforming and computation resource allocation at BSs in closed form based on generalized Rayleigh entropy and fairness criteria, respectively. Simulation results demonstrate that the proposed joint resource allocation design significantly reduces the maximum task completion latency among all vehicles. Furthermore, we also demonstrate several interesting trade-offs between the system performance and resource utilizations.

eess.SP↗