Searcharxiv⌕ Search

arXiv subjects

Li Wang

Publications and source records attributed to Li Wang.

At least 163 records · Page 9Linked to original sources

Tactical Decision for Multi-UGV Confrontation with a Vision-Language Model-Based Commander

In multiple unmanned ground vehicle confrontations, autonomously evolving multi-agent tactical decisions from situational awareness remain a significant challenge. Traditional handcraft rule-based methods become vulnerable in the complicated and transient battlefield environment, and current reinforcement learning methods mainly focus on action manipulation instead of strategic decisions due to lack of interpretability. Here, we propose a vision-language model-based commander to address the issue of intelligent perception-to-decision reasoning in autonomous confrontations. Our method integrates a vision language model for scene understanding and a lightweight large language model for strategic reasoning, achieving unified perception and decision within a shared semantic space, with strong adaptability and interpretability. Unlike rule-based search and reinforcement learning methods, the combination of the two modules establishes a full-chain process, reflecting the cognitive process of human commanders. Simulation and ablation experiments validate that the proposed approach achieves a win rate of over 80% compared with baseline models.

cs.AI↗

Rapid MRI-Based Synthetic CT Simulations for Precise tFUS Targeting

Accurate targeting is critical for the effectiveness of transcranial focused ultrasound (tFUS) neuromodulation. While CT provides accurate skull acoustic properties, its ionizing radiation and poor soft tissue contrast limit clinical applicability. In contrast, MRI offers superior neuroanatomical visualization without radiation exposure but lacks skull property mapping. This study proposes a novel, fully CT free simulation framework that integrates MRI-derived synthetic CT (sCT) with efficient modeling techniques for rapid and precise tFUS targeting. We trained a deep-learning model to generate sCT from T1-weighted MRI and integrated it with both full-wave (k-Wave) and accelerated simulation methods, hybrid angular spectrum (kWASM) and Rayleigh-Sommerfeld ASM (RSASM). Across five skull models, both full-wave and hybrid pipelines using sCT demonstrated sub-millimeter targeting deviation, focal shape consistency (FWHM ~3.3-3.8 mm), and <0.2 normalized pressure error compared to CT-based gold standard. Notably, the kW-ASM and RS-ASM pipelines reduced simulation time from ~3320 s to 187 s and 34 s respectively, achieving ~94% and ~90% time savings. These results confirm that MRI-derived sCT combined with innovative rapid simulation techniques enables fast, accurate, and radiation-free tFUS planning, supporting its feasibility for scalable clinical applications.

physics.med-ph↗

MARS: Radio Map Super-resolution and Reconstruction Method under Sparse Channel Measurements

Radio maps reflect the spatial distribution of signal strength and are essential for applications like smart cities, IoT, and wireless network planning. However, reconstructing accurate radio maps from sparse measurements remains challenging. Traditional interpolation and inpainting methods lack environmental awareness, while many deep learning approaches depend on detailed scene data, limiting generalization. To address this, we propose MARS, a Multi-scale Aware Radiomap Super-resolution method that combines CNNs and Transformers with multi-scale feature fusion and residual connections. MARS focuses on both global and local feature extraction, enhancing feature representation across different receptive fields and improving reconstruction accuracy. Experiments across different scenes and antenna locations show that MARS outperforms baseline models in both MSE and SSIM, while maintaining low computational cost, demonstrating strong practical potential.

cs.CV↗

Non-perturbative Quantum Dynamics on Embedded Submanifolds: From Geometric Mass to Higgs Potentials

We establish a quantum dynamics framework for curved submanifolds embedded in higher-dimensional spaces. Through rigorous dimensional reduction, we derive the first complete Schrödinger and Klein-Gordon equations incorporating non-perturbative geometric interactions-resolving ambiguities in constrained quantization. Crucially, extrinsic curvature of the ambient manifold governs emergent low-dimensional quantum phenomena. Remarkably, this mechanism generates scalar field masses matching Kaluza-Klein spectra while eliminating periodic compactification requirements. Geometric induction concurrently produces Higgs mechanism potentials. Particle masses emerge solely from submanifold embedding geometry, with matter-field couplings encoded in curvature invariants. This enables experimental access to higher-dimensional physics at all energy scales through geometric induction. We also discuss the Higgs vacuum near small-mass black holes.

gr-qc↗

Measurements and Modeling of Air-Ground Integrated Channel in Forest Environment Based on OFDM Signals

Forests are frequently impacted by climate conditions, vegetation density, and intricate terrain and geology, which contribute to natural disasters. Personnel engaged in or supporting rescue operations in such environments rely on robust communication systems to ensure their safety, highlighting the criticality of channel measurements in forest environments. However, according to current research, there is limited research on channel detection and modeling in forest areas in the existing literature. This paper describes the channel measurements campaign of air and ground in the Arxan National Forest Park of Inner Mongolia. It presents measurement results and propagation models for ground-to-ground (G2G) and air-to-ground (A2G) scenarios. The measurement campaign uses orthogonal frequency division multiplexing signals centered at 1.4 GHz for channel sounding. In the G2G measurement, in addition to using omnidirectional antennas to record data, we also use directional antennas to record the arrival angle information of the signal at the receiver. In the A2G measurement, we pre-plan the flight trajectory of the unmanned aerial vehicle so that it can fly at a fixed angle relative to the ground. We present path loss models suitable for G2G and A2G in forest environments based on the analysis of measurement results. The results indicate that the proposed model reduces error margins compared with other path loss models. Furthermore, we derive the multipath model expression specific to forest environments and conduct statistical analysis on key channel parameters e.g., shadow fading factor, root mean square delay spread, and Rician K factor. Our findings reveal that signal propagation obstruction due to tree crowns in A2G communication is more pronounced than tree trunk obstructions in G2G communication. Adjusting the elevation angle between air and ground can enhance communication quality.

cs.IT↗

Fronthaul-Aware User-Centric Generalized Cell-Free Massive MIMO Systems

We consider fronthaul-limited generalized zeroforcing-based cell-free massive multiple-input multiple-output (CF-mMIMO) systems with multiple-antenna users and multipleantenna access points (APs) relying on both cooperative beamforming (CB) and user-centric (UC) clustering. The proposed framework is very general and can be degenerated into different special cases, such as pure CB/pure UC clustering, or fully centralized CB/fully distributed beamforming. We comprehensively analyze the spectral efficiency (SE) performance of the system wherein the users use the minimum mean-squared errorbased successive interference cancellation (MMSE-SIC) scheme to detect the desired signals. Specifically, we formulate an optimization problem for the user association and power control for maximizing the sum SE. The formulated problem is under per-AP transmit power and fronthaul constraints, and is based on only long-term channel state information (CSI). The challenging formulated problem is transformed into tractable form and a novel algorithm is proposed to solve it using minorization maximization (MM) technique. We analyze the trade-offs provided by the CF-mMIMO system with different number of CB clusters, hence highlighting the importance of the appropriate choice of CB design for different system setups. Numerical results show that for the centralized CB, the proposed power optimization provides nearly 59% improvement in the average sum SE over the heuristic approach, and 312% improvement, when the distributed beamforming is employed.

cs.IT↗

DAVID-XR1: Detecting AI-Generated Videos with Explainable Reasoning

As AI-generated video becomes increasingly pervasive across media platforms, the ability to reliably distinguish synthetic content from authentic footage has become both urgent and essential. Existing approaches have primarily treated this challenge as a binary classification task, offering limited insight into where or why a model identifies a video as AI-generated. However, the core challenge extends beyond simply detecting subtle artifacts; it requires providing fine-grained, persuasive evidence that can convince auditors and end-users alike. To address this critical gap, we introduce DAVID-X, the first dataset to pair AI-generated videos with detailed defect-level, temporal-spatial annotations and written rationales. Leveraging these rich annotations, we present DAVID-XR1, a video-language model designed to deliver an interpretable chain of visual reasoning-including defect categorization, temporal-spatial localization, and natural language explanations. This approach fundamentally transforms AI-generated video detection from an opaque black-box decision into a transparent and verifiable diagnostic process. We demonstrate that a general-purpose backbone, fine-tuned on our compact dataset and enhanced with chain-of-thought distillation, achieves strong generalization across a variety of generators and generation modes. Our results highlight the promise of explainable detection methods for trustworthy identification of AI-generated video content.

cs.CV↗

Privacy-Aware Spectrum Pricing and Power Control Optimization for LEO Satellite Internet-of-Things

Low earth orbit (LEO) satellite systems play an important role in next generation communication networks due to their ability to provide extensive global coverage with guaranteed communications in remote areas and isolated areas where base stations cannot be cost-efficiently deployed. With the pervasive adoption of LEO satellite systems, especially in the LEO Internet-of-Things (IoT) scenarios, their spectrum resource management requirements have become more complex as a result of massive service requests and high bandwidth demand from terrestrial terminals. For instance, when leasing the spectrum to terrestrial users and controlling the uplink transmit power, satellites collect user data for machine learning purposes, which usually are sensitive information such as location, budget and quality of service (QoS) requirement. To facilitate model training in LEO IoT while preserving the privacy of data, blockchain-driven federated learning (FL) is widely used by leveraging on a fully decentralized architecture. In this paper, we propose a hybrid spectrum pricing and power control framework for LEO IoT by combining blockchain technology and FL. We first design a local deep reinforcement learning algorithm for LEO satellite systems to learn a revenue-maximizing pricing and power control scheme. Then the agents collaborate to form a FL system. We also propose a reputation-based blockchain which is used in the global model aggregation phase of FL. Based on the reputation mechanism, a node is selected for each global training round to perform model aggregation and block generation, which can further enhance the decentralization of the network and guarantee the trust. Simulation tests are conducted to evaluate the performances of the proposed scheme. Our results show the efficiency of finding the maximum revenue scheme for LEO satellite systems while preserving the privacy of each agent.

cs.NI↗

BAQ: Efficient Bit Allocation Quantization for Large Language Models

Post-training model quantization is a widely adopted technique for reducing the memory and computational costs of large language models (LLMs). However, most existing methods rely on uniform or heuristic bitwidth assignments, failing to account for the nonuniform sensitivity of weights to quantization noise. In this paper, we propose a novel framework for allocating quantization bitwidths based on sensitivity metrics derived from a Hessian proxy. We make key assumptions, which allow the layer/component-wise loss function to be expressed as an explicit function of the bitwidths. This enables a neat formulation of the bit allocation problem as a convex optimization task, whose closed-form solution adapts precision across weights to minimize the layer-wise quantization loss. Inspecting the solution provides several insights (such as the equal-loss structure), which are then exploited to design the proposed \textbf{BAQ} (Bit Allocation Quantization) algorithm. The proposed algorithm achieves a good trade-off between loss minimization and complexity and allows BAQ to be integrated into standard quantization pipelines with minimal overhead. Experimental results show that BAQ consistently outperforms GPTQ, achieving up to 56$\times$ lower perplexity at the same bitwidth on large language models ranging from 125M to 30B parameters. Leveraging our analytical results derived from solving the optimal bit allocation problem, we also provide a theoretical explanation for the observed gains. All codes of this paper are available at https://github.com/CSU-ModelCompression/BAQ.

cs.LG↗

Identification of the high-pressure phases of alpha-SnWO4 combining x-ray diffraction and crystal structure prediction

We have characterized the high-pressure behavior of alpha-SnWO4. The compound has been studied up to 30 GPa using a diamond-anvil cell and synchrotron powder X-ray diffraction. We report evidence of two structural phase transitions in the pressure range covered in our study, and we propose a crystal structure for the two high-pressure phases. The first one, observed around 12.9 GPa, has been obtained combining indexation using DICVOL and density-functional theory calculations. The second high-pressure phase, observed around 17.5 GPa, has been determined by using the CALYPSO code, the prediction of which was supported by a Le Bail fit to the experimental X-ray diffraction patterns. The proposed structural sequence involves two successive collapses of the unit-cell volume and an increase in the coordination number of Sn and W atoms. The room-temperature equations of state, the principal axes of compression and their compressibility, the elastic constants, and the elastic moduli are reported for α-SnWO4 and for the two high-pressure phases.

cond-mat.mtrl-sci↗

S2R-Bench: A Sim-to-Real Evaluation Benchmark for Autonomous Driving

Safety is a long-standing and the final pursuit in the development of autonomous driving systems, with a significant portion of safety challenge arising from perception. How to effectively evaluate the safety as well as the reliability of perception algorithms is becoming an emerging issue. Despite its critical importance, existing perception methods exhibit a limitation in their robustness, primarily due to the use of benchmarks are entierly simulated, which fail to align predicted results with actual outcomes, particularly under extreme weather conditions and sensor anomalies that are prevalent in real-world scenarios. To fill this gap, in this study, we propose a Sim-to-Real Evaluation Benchmark for Autonomous Driving (S2R-Bench). We collect diverse sensor anomaly data under various road conditions to evaluate the robustness of autonomous driving perception methods in a comprehensive and realistic manner. This is the first corruption robustness benchmark based on real-world scenarios, encompassing various road conditions, weather conditions, lighting intensities, and time periods. By comparing real-world data with simulated data, we demonstrate the reliability and practical significance of the collected data for real-world applications. We hope that this dataset will advance future research and contribute to the development of more robust perception models for autonomous driving. This dataset is released on https://github.com/adept-thu/S2R-Bench.

cs.RO↗

Embedded Mean Field Reinforcement Learning for Perimeter-defense Game

With the rapid advancement of unmanned aerial vehicles (UAVs) and missile technologies, perimeter-defense game between attackers and defenders for the protection of critical regions have become increasingly complex and strategically significant across a wide range of domains. However, existing studies predominantly focus on small-scale, simplified two-dimensional scenarios, often overlooking realistic environmental perturbations, motion dynamics, and inherent heterogeneity--factors that pose substantial challenges to real-world applicability. To bridge this gap, we investigate large-scale heterogeneous perimeter-defense game in a three-dimensional setting, incorporating realistic elements such as motion dynamics and wind fields. We derive the Nash equilibrium strategies for both attackers and defenders, characterize the victory regions, and validate our theoretical findings through extensive simulations. To tackle large-scale heterogeneous control challenges in defense strategies, we propose an Embedded Mean-Field Actor-Critic (EMFAC) framework. EMFAC leverages representation learning to enable high-level action aggregation in a mean-field manner, supporting scalable coordination among defenders. Furthermore, we introduce a lightweight agent-level attention mechanism based on reward representation, which selectively filters observations and mean-field information to enhance decision-making efficiency and accelerate convergence in large-scale tasks. Extensive simulations across varying scales demonstrate the effectiveness and adaptability of EMFAC, which outperforms established baselines in both convergence speed and overall performance. To further validate practicality, we test EMFAC in small-scale real-world experiments and conduct detailed analyses, offering deeper insights into the framework's effectiveness in complex scenarios.

cs.AI↗

FedPCL-CDR: A Federated Prototype-based Contrastive Learning Framework for Privacy-Preserving Cross-domain Recommendation

Cross-domain recommendation (CDR) aims to improve recommendation accuracy in sparse domains by transferring knowledge from data-rich domains. However, existing CDR approaches often assume that user-item interaction data across domains is publicly available, neglecting user privacy concerns. Additionally, they experience performance degradation with sparse overlapping users due to their reliance on a large number of fully shared users for knowledge transfer. To address these challenges, we propose a Federated Prototype-based Contrastive Learning (CL) framework for Privacy Preserving CDR, called FedPCL-CDR. This approach utilizes non-overlapping user information and differential prototypes to improve model performance within a federated learning framework. FedPCL-CDR comprises two key modules: local domain (client) learning and global server aggregation. In the local domain, FedPCL-CDR first clusters all user data and utilizes local differential privacy (LDP) to learn differential prototypes, effectively utilizing non-overlapping user information and protecting user privacy. It then conducts knowledge transfer by employing both local and global prototypes returned from the server in a CL manner. Meanwhile, the global server aggregates differential prototypes sent from local domains to learn both local and global prototypes. Extensive experiments on four CDR tasks across Amazon and Douban datasets demonstrate that FedPCL-CDR surpasses SOTA baselines. We release our code at https://github.com/Lili1013/FedPCL CDR

cs.IR↗

Cape: Context-Aware Prompt Perturbation Mechanism with Differential Privacy

Large Language Models (LLMs) have gained significant popularity due to their remarkable capabilities in text understanding and generation. However, despite their widespread deployment in inference services such as ChatGPT, concerns about the potential leakage of sensitive user data have arisen. Existing solutions primarily rely on privacy-enhancing technologies to mitigate such risks, facing the trade-off among efficiency, privacy, and utility. To narrow this gap, we propose Cape, a context-aware prompt perturbation mechanism based on differential privacy, to enable efficient inference with an improved privacy-utility trade-off. Concretely, we introduce a hybrid utility function that better captures the token similarity. Additionally, we propose a bucketized sampling mechanism to handle large sampling space, which might lead to long-tail phenomenons. Extensive experiments across multiple datasets, along with ablation studies, demonstrate that Cape achieves a better privacy-utility trade-off compared to prior state-of-the-art works.

cs.CR↗

Extriangulated length categories: torsion classes and $τ$-tilting theory

This paper introduces the notion of extriangulated length categories, whose prototypical examples include abelian length categories and bounded derived categories of finite dimensional algebras with finite global dimension. We prove that an extriangulated category $\mathcal{A}$ is a length category if and only if $\mathcal{A}$ admits a simple-minded system. Subsequently, we study the partially ordered set ${\rm tor}_Θ(\mathcal{A})$ of torsion classes in an extriangulated length category $(\mathcal{A},Θ)$ from the perspective of lattice theory. It is shown that ${\rm tor}_Θ(\mathcal{A})$ forms a complete lattice, which is further proved to be completely semidistributive and algebraic. Moreover, we describe the arrows in the Hasse quiver of ${\rm tor}_Θ(\mathcal{A})$ using brick labeling. Finally, we introduce the concepts of support torsion classes and support $τ$-tilting subcategories in extriangulated length categories and establish a bijection between these two notions, thereby generalizing the Adachi-Iyama-Reiten bijection for functorially finite torsion classes.

math.RT↗

Exact multiple complex mobility edges and quantum state engineering in coupled 1D quasicystals

The key concept of mobility edge, which marks the critical transition between extended and localized states in energy domain, has attracted significant interest in the cutting-edge frontiers of modern physics due to its profound implications for understanding localization and transport properties in disordered systems. However, a generic way to construct multiple mobility edges (MME) is still ambiguous and lacking. In this work, we propose a brief scheme to engineer both real and complex exact multiple mobility edges exploiting a few coupled one-dimensional quasiperiodic chains. We study the extended-localized transitions of coupled one-dimensional quasiperiodic chains along the chain direction. The model combines both the well-established quasiperiodicity and a kind of freshly introduced staggered non-reciprocity, which are aligned in two mutually perpendicular directions, within a unified framework. Based on analytical analysis, we predict that when the couplings between quasiperiodic chains are weak, the system will be in a mixed phase in which the localized states and extended states coexist and intertwine, thus lacking explicit energy separations. However, as the inter-chain couplings increase to certain strength, exact multiple mobility edges emerge. This prediction is clearly verified by concrete numerical calculations of the Fractal Dimension and the scaling index $β$. Moreover, we show that the combination of quasiperiodicity and the staggered non-reciprocity can be utilized to design and realize quantum states of various configurations. Our results reveal a brief and general scheme to implement exact multiple mobility edges for synthetic materials engineering.

cond-mat.dis-nn↗

Array Partitioning Based Near-Field Attitude and Location Estimation

This paper studies a passive source localization system, where a single base station (BS) is employed to estimate the positions and attitudes of multiple mobile stations (MSs). The BS and the MSs are equipped with uniform rectangular arrays, and the MSs are located in the near-field region of the BS array. To avoid the difficulty of tackling the problem directly based on the near-field signal model, we establish a subarray-wise far-field received signal model. In this model, the entire BS array is divided into multiple subarrays to ensure that each MS is in the far-field region of each BS subarray. By exploiting the angles of arrival (AoAs) of an MS antenna at different BS subarrays, we formulate the attitude and location estimation problem under the Bayesian inference framework. Based on the factor graph representation of the probabilistic problem model, a message passing algorithm named array partitioning based pose and location estimation (APPLE) is developed to solve this problem. An estimation-error lower bound is obtained as a performance benchmark of the proposed algorithm. Numerical results demonstrate that the proposed APPLE algorithm outperforms other baseline methods in the accuracy of position and attitude estimation.

eess.SP↗

A score-based particle method for homogeneous Landau equation

We propose a novel score-based particle method for solving the Landau equation in plasmas, that seamlessly integrates learning with structure-preserving particle methods [arXiv:1910.03080]. Building upon the Lagrangian viewpoint of the Landau equation, a central challenge stems from the nonlinear dependence of the velocity field on the density. Our primary innovation lies in recognizing that this nonlinearity is in the form of the score function, which can be approximated dynamically via techniques from score-matching. The resulting method inherits the conservation properties of the deterministic particle method while sidestepping the necessity for kernel density estimation in [arXiv:1910.03080]. This streamlines computation and enhances scalability with dimensionality. Furthermore, we provide a theoretical estimate by demonstrating that the KL divergence between our approximation and the true solution can be effectively controlled by the score-matching loss. Additionally, by adopting the flow map viewpoint, we derive an update formula for exact density computation. Extensive examples have been provided to show the efficiency of the method, including a physically relevant case of Coulomb interaction.

math.NA↗