arXiv subjects

Xiao Li

Publications and source records attributed to Xiao Li.

At least 199 records · Page 11Linked to original sources

arXiv2025

Dual Acceleration for Minimax Optimization: Linear Convergence Under Relaxed Assumptions

This paper addresses the bilinearly coupled minimax optimization problem: $\min_{x \in \mathbb{R}^{d_x}}\max_{y \in \mathbb{R}^{d_y}} \ f_1(x) + f_2(x) + y^{\top} Bx - g_1(y) - g_2(y)$, where $f_1$ and $g_1$ are smooth convex functions, $f_2$ and $g_2$ are potentially nonsmooth convex functions, and $B$ is a coupling matrix. Existing algorithms for solving this problem achieve linear convergence only under stronger conditions, which may not be met in many scenarios. We first introduce the Primal-Dual Proximal Gradient (PDPG) method and demonstrate that it converges linearly under an assumption where existing algorithms fail to achieve linear convergence. Building on insights gained from analyzing the convergence conditions of existing algorithms and PDPG, we further propose the inexact Dual Accelerated Proximal Gradient (iDAPG) method. This method achieves linear convergence under weaker conditions than those required by existing approaches. Moreover, even in cases where existing methods guarantee linear convergence, iDAPG can still provide superior theoretical performance in certain scenarios.

math.OC↗

arXiv2025

Benchmarking Chest X-ray Diagnosis Models Across Multinational Datasets

Foundation models leveraging vision-language pretraining have shown promise in chest X-ray (CXR) interpretation, yet their real-world performance across diverse populations and diagnostic tasks remains insufficiently evaluated. This study benchmarks the diagnostic performance and generalizability of foundation models versus traditional convolutional neural networks (CNNs) on multinational CXR datasets. We evaluated eight CXR diagnostic models - five vision-language foundation models and three CNN-based architectures - across 37 standardized classification tasks using six public datasets from the USA, Spain, India, and Vietnam, and three private datasets from hospitals in China. Performance was assessed using AUROC, AUPRC, and other metrics across both shared and dataset-specific tasks. Foundation models outperformed CNNs in both accuracy and task coverage. MAVL, a model incorporating knowledge-enhanced prompts and structured supervision, achieved the highest performance on public (mean AUROC: 0.82; AUPRC: 0.32) and private (mean AUROC: 0.95; AUPRC: 0.89) datasets, ranking first in 14 of 37 public and 3 of 4 private tasks. All models showed reduced performance on pediatric cases, with average AUROC dropping from 0.88 +/- 0.18 in adults to 0.57 +/- 0.29 in children (p = 0.0202). These findings highlight the value of structured supervision and prompt design in radiologic AI and suggest future directions including geographic expansion and ensemble modeling for clinical deployment. Code for all evaluated models is available at https://drive.google.com/drive/folders/1B99yMQm7bB4h1sVMIBja0RfUu8gLktCE

eess.IV↗

arXiv2025

A Comprehensive Framework for Analyzing the Convergence of Adam: Bridging the Gap with SGD

Adaptive Moment Estimation (Adam) is a cornerstone optimization algorithm in deep learning, widely recognized for its flexibility with adaptive learning rates and efficiency in handling large-scale data. However, despite its practical success, the theoretical understanding of Adam's convergence has been constrained by stringent assumptions, such as almost surely bounded stochastic gradients or uniformly bounded gradients, which are more restrictive than those typically required for analyzing stochastic gradient descent (SGD). In this paper, we introduce a novel and comprehensive framework for analyzing the convergence properties of Adam. This framework offers a versatile approach to establishing Adam's convergence. Specifically, we prove that Adam achieves asymptotic (last iterate sense) convergence in both the almost sure sense and the $L_1$ sense under the relaxed assumptions typically used for SGD, namely $L$-smoothness and the ABC inequality. Meanwhile, under the same assumptions, we show that Adam attains non-asymptotic sample complexity bounds similar to those of SGD.

cs.LG↗

arXiv2025

Power Allocation for Delay Optimization in Device-to-Device Networks: A Graph Reinforcement Learning Approach

The pursuit of rate maximization in wireless communication frequently encounters substantial challenges associated with user fairness. This paper addresses these challenges by exploring a novel power allocation approach for delay optimization, utilizing graph neural networks (GNNs)-based reinforcement learning (RL) in device-to-device (D2D) communication. The proposed approach incorporates not only channel state information but also factors such as packet delay, the number of backlogged packets, and the number of transmitted packets into the components of the state information. We adopt a centralized RL method, where a central controller collects and processes the state information. The central controller functions as an agent trained using the proximal policy optimization (PPO) algorithm. To better utilize topology information in the communication network and enhance the generalization of the proposed method, we embed GNN layers into both the actor and critic networks of the PPO algorithm. This integration allows for efficient parameter updates of GNNs and enables the state information to be parameterized as a low-dimensional embedding, which is leveraged by the agent to optimize power allocation strategies. Simulation results demonstrate that the proposed method effectively reduces average delay while ensuring user fairness, outperforms baseline methods, and exhibits scalability and generalization capability.

eess.SY↗

arXiv2025

Control Invariant Sets for Neural Network Dynamical Systems and Recursive Feasibility in Model Predictive Control

Neural networks are powerful tools for data-driven modeling of complex dynamical systems, enhancing predictive capability for control applications. However, their inherent nonlinearity and black-box nature challenge control designs that prioritize rigorous safety and recursive feasibility guarantees. This paper presents algorithmic methods for synthesizing control invariant sets specifically tailored to neural network based dynamical models. These algorithms employ set recursion, ensuring termination after a finite number of iterations and generating subsets in which closed-loop dynamics are forward invariant, thus guaranteeing perpetual operational safety. Additionally, we propose model predictive control designs that integrate these control invariant sets into mixed-integer optimization, with guaranteed adherence to safety constraints and recursive feasibility at the computational level. We also present a comprehensive theoretical analysis examining the properties and guarantees of the proposed methods. Numerical simulations in an autonomous driving scenario demonstrate the methods' effectiveness in synthesizing control-invariant sets offline and implementing model predictive control online, ensuring safety and recursive feasibility.

eess.SY↗

arXiv2025

Spectral analysis of the magneto-optical response in valley polarized Pb$_{1-x}$Sn$_x$Se

Since the last century, considerable efforts have been devoted to the study of valley-degenerate narrow gap semiconductors, such as the Pb$_{1-x}$Sn$_x$Se alloy. This material possesses band edges at the $L$-points of their Brillouin zone, yielding a valley degeneracy of four. However, in (111)-oriented films, it is still not fully understood how differences between the longitudinal valley, oriented along the growth axis, and the oblique valleys, oriented at an angle with respect to that axis, appear in infrared magneto-optical spectroscopy. In this work, we report a magneto-optical study on this family of alloys, focusing on an anomaly in the interband transition of the absorption strength ratio between longitudinal and oblique valleys under a magnetic field applied along the [111] direction. Based on the Mitchell-Wallis model, we provide a theoretical fit for the experimental transmission data, which quantitatively explains the spectral shape of the data at magnetic fields as high as 35T. In particular, we attribute this anomalous absorption strength variation to the carrier density difference between the two types of valleys as well as the field-dependent multiple-beam interference or the Fabry-Pérot interference. Our analysis also allows for the extraction of the real and imaginary parts of the dielectric function.

cond-mat.mes-hall↗

arXiv2025

Unsupervised machine learning for detecting mutual independence among eigenstate regimes in interacting quasiperiodic chains

Many-body eigenstates that are neither thermal nor many-body-localized (MBL) were numerically found in certain interacting chains with moderate quasiperiodic potentials. The energy regime consisting of these non-ergodic but extended (NEE) eigenstates has been extensively studied for being a possible many-body mobility edge between the energy-resolved MBL and thermal phases. Recently, the NEE regime was further proposed to be a prethermal phenomenon that generally occurs when different operators spread at sizably different timescales. Here, we numerically examine the mutual independence among the NEE, MBL, and thermal regimes in the lens of eigenstate entanglement spectra (ES). Given the complexity and rich information embedded in ES, we develop an unsupervised learning approach that is designed to quantify the mutual independence among general phases. Our method is first demonstrated on an illustrative toy example that uses RGB color data to represent phases, then applied to the ES of an interacting generalized Aubry Andre model from weak to strong potential strength. We find that while the MBL and thermal regimes are mutually independent, the NEE regime is dependent on the former two and smoothly appears as the potential strength decreases. We attribute our numerically finding to the fact that the ES data in the NEE regime exhibits both an MBL-like fast decay and a thermal-like long tail.

cond-mat.dis-nn↗

arXiv2025

Cooperative ISAC Network for Off-Grid Imaging-based Low-Altitude Surveillance

The low-altitude economy has emerged as a critical focus for future economic development, emphasizing the urgent need for flight activity surveillance utilizing the existing sensing capabilities of mobile cellular networks. Traditional monostatic or localization-based sensing methods, however, encounter challenges in fusing sensing results and matching channel parameters. To address these challenges, we propose an innovative approach that directly draws the radio images of the low-altitude space, leveraging its inherent sparsity with compressed sensing (CS)-based algorithms and the cooperation of multiple base stations. Furthermore, recognizing that unmanned aerial vehicles (UAVs) are randomly distributed in space, we introduce a physics-embedded learning method to overcome off-grid issues inherent in CS-based models. Additionally, an online hard example mining method is incorporated into the design of the loss function, enabling the network to adaptively concentrate on the samples bearing significant discrepancy with the ground truth, thereby enhancing its ability to detect the rare UAVs within the expansive low-altitude space. Simulation results demonstrate the effectiveness of the imaging-based low-altitude surveillance approach, with the proposed physics-embedded learning algorithm significantly outperforming traditional CS-based methods under off-grid conditions.

cs.IT↗

arXiv2025

Learned Intelligent Recognizer with Adaptively Customized RIS Phases in Communication Systems

This study presents an advanced wireless system that embeds target recognition within reconfigurable intelligent surface (RIS)-aided communication systems, powered by cuttingedge deep learning innovations. Such a system faces the challenge of fine-tuning both the RIS phase shifts and neural network (NN) parameters, since they intricately interdepend on each other to accomplish the recognition task. To address these challenges, we propose an intelligent recognizer that strategically harnesses every piece of prior action responses, thereby ingeniously multiplexing downlink signals to facilitate environment sensing. Specifically, we design a novel NN based on the long short-term memory (LSTM) architecture and the physical channel model. The NN iteratively captures and fuses information from previous measurements and adaptively customizes RIS configurations to acquire the most relevant information for the recognition task in subsequent moments. Tailored dynamically, these configurations adapt to the scene, task, and target specifics. Simulation results reveal that our proposed method significantly outperforms the state-of-the-art method, while resulting in minimal impacts on communication performance, even as sensing is performed simultaneously.

cs.IT↗

arXiv2025

On-chip Non-Hermitian Cavity Quantum Electrodynamics

Exceptional points (EPs) promise revolutionary control over quantum light-matter interactions. Here, we experimentally demonstrate flexible and reversible engineering of quantum vacuum fluctuation in an integrated microcavity supporting chiral Eps. We develop a hybrid lithium niobate (LN)-GaAs quantum photonic platform, seamlessly combining high-quality quantum emitters, a low-loss photonic circuit, efficient electro-optic (EO) effect, and local strain actuator in a single device. Chiral EPs are implemented by dynamically tuning the coupling between the modes associated with a micro-ring resonator, resulting in anomalous spontaneous emission dynamic with a 7-fold modulation of the lifetime (120 ps to 850 ps). Meanwhile, we reshape single-photon spectra via cavity local density of states (LDOS) engineering and generate non-Lorentzian spectral profiles: squared-Lorentzian, Fano-like, and EP-induced transparency (EPIT), a suppression of emission at zero detuning. This work unveils exotic cavity quantum electrodynamics (cQED) effects unique to EPs and establishes a universal paradigm for non-Hermitian quantum photonics.

physics.optics↗

arXiv2025

Seed1.5-Thinking: Advancing Superb Reasoning Models with Reinforcement Learning

We introduce Seed1.5-Thinking, capable of reasoning through thinking before responding, resulting in improved performance on a wide range of benchmarks. Seed1.5-Thinking achieves 86.7 on AIME 2024, 55.0 on Codeforces and 77.3 on GPQA, demonstrating excellent reasoning abilities in STEM and coding. Beyond reasoning tasks, the method demonstrates notable generalization across diverse domains. For instance, it surpasses DeepSeek R1 by 8% in win rate on non-reasoning tasks, indicating its broader applicability. Compared to other state-of-the-art reasoning models, Seed1.5-Thinking is a Mixture-of-Experts (MoE) model with a relatively small size, featuring 20B activated and 200B total parameters. As part of our effort to assess generalized reasoning, we develop two internal benchmarks, BeyondAIME and Codeforces, both of which will be publicly released to support future research. Model trial link: https://www.volcengine.com/experience/ark.

cs.CL↗

arXiv2025

If LLMs Would Just Look: Simple Line-by-line Checking Improves Vulnerability Localization

The rapid expansion of software systems and the growing number of reported vulnerabilities have emphasized the importance of accurately identifying vulnerable code segments. Traditional methods for vulnerability localization, such as manual code audits or rule-based tools, are often time-consuming and limited in scope, typically focusing on specific programming languages or types of vulnerabilities. In recent years, the introduction of large language models (LLMs) such as GPT and LLaMA has opened new possibilities for automating vulnerability detection. However, while LLMs show promise in this area, they face challenges, particularly in maintaining accuracy over longer code contexts. This paper introduces LOVA, a novel framework leveraging the self-attention mechanisms inherent in LLMs to enhance vulnerability localization. Our key insight is that self-attention mechanisms assign varying importance to different parts of the input, making it possible to track how much attention the model focuses on specific lines of code. In the context of vulnerability localization, the hypothesis is that vulnerable lines of code will naturally attract higher attention weights because they have a greater influence on the model's output. By systematically tracking changes in attention weights and focusing on specific lines of code, LOVA improves the precision of identifying vulnerable lines across various programming languages. Through rigorous experimentation and evaluation, we demonstrate that LOVA significantly outperforms existing LLM-based approaches, achieving up to a 5.3x improvement in F1-scores. LOVA also demonstrated strong scalability, with up to a 14.6x improvement in smart contract vulnerability localization across languages like C, Python, Java, and Solidity. Its robustness was proven through consistent performance across different LLM architectures.

cs.CR↗

arXiv2025

Everything You Wanted to Know About LLM-based Vulnerability Detection But Were Afraid to Ask

Large Language Models are a promising tool for automated vulnerability detection, thanks to their success in code generation and repair. However, despite widespread adoption, a critical question remains: Are LLMs truly effective at detecting real-world vulnerabilities? Current evaluations, which often assess models on isolated functions or files, ignore the broader execution and data-flow context essential for understanding vulnerabilities. This oversight leads to two types of misleading outcomes: incorrect conclusions and flawed rationales, collectively undermining the reliability of prior assessments. Therefore, in this paper, we challenge three widely held community beliefs: that LLMs are (i) unreliable, (ii) insensitive to code patches, and (iii) performance-plateaued across model scales. We argue that these beliefs are artifacts of context-deprived evaluations. To address this, we propose CORRECT (Context-Rich Reasoning Evaluation of Code with Trust), a new evaluation framework that systematically incorporates contextual information into LLM-based vulnerability detection. We construct a context-rich dataset of 2,000 vulnerable-patched program pairs spanning 99 CWEs and evaluate 13 LLMs across four model families. Our framework elicits both binary predictions and natural-language rationales, which are further validated using LLM-as-a-judge techniques. Our findings overturn existing misconceptions. When provided with sufficient context, SOTA LLMs achieve significantly improved performance (e.g., 0.7 F1-score on key CWEs), with 0.8 precision. We show that most false positives stem from reasoning errors rather than misclassification, and that while model and test-time scaling improve performance, they introduce diminishing returns and trade-offs in recall. Finally, we uncover new flaws in current LLM-based detection systems, such as limited generalization and overthinking biases.

cs.CR↗

arXiv2025

Maximum Shortest Path Interdiction Problem by Upgrading Nodes on Trees under Unit Cost

Network interdiction problems by deleting critical nodes have wide applications. However, node deletion is not always feasible in certain practical scenarios. We consider the maximum shortest path interdiction problem by upgrading nodes on trees under unit cost (MSPIT-UN$_u$). It aims to upgrade a subset of nodes to maximize the length of the shortest root-leaf distance such that the total upgrade cost under unit cost is upper bounded by a given value. We develop a dynamic programming algorithm with a time complexity of $O(n^3)$ to solve this problem. Furthermore, we consider the related minimum cost problem of (MSPIT-UN$_u$) and propose an $O(n^3\log n)$ binary search algorithm, where a dynamic programming algorithm is exceeded in each iteration to solve its corresponding problem (MSPIT-UN$_u$). Finally, we design numerical experiments to show the effectiveness of the algorithms.

math.OC↗

arXiv2025

In-situ three-dimensional strain engineering of solid-state quantum emitters in photonic structures towards scalable quantum networks

Solid-state quantum emitters are pivotal for modern photonic quantum technology, yet their inherent spectral inhomogeneity imposes a critical challenge in pursuing scalable quantum network. Here, we develop a cryogenic-compatible strain-engineering platform based on a polydimethylsiloxane (PDMS) stamp that is not obviously working properly at cryogenic temperature. In-situ three-dimensional (3D) strain control is achieved for quantum dots (QDs) embedded in photonic nanostructures. The compliant PDMS enables independent tuning of emission energy and elimination of fine structure splitting (FSS) of single QDs, as demonstrated by a 7 meV spectral shift with a near-vanishing FSS in circular Bragg resonators and an unprecedented 15 meV tuning range in the micropillar. The PDMS-based 3D strain-engineering platform, compatible with diverse photonic structures at cryogenic temperature, provides a powerful and versatile tool for exploring fundamental strain-related physics and advancing integrated photonic quantum technology.

physics.optics↗

arXiv2025

A method for reversing the laser modulation in a Storage ring

The pursuit of coherent radiation generation remains a key direction in the advancement of storage ring light sources. Despite the potential of laser modulation in achieving this goal, it leads to a significant decline in the quality of the electron beam. Efforts to mitigate this decline have resulted in the proposal of demodulation schemes. However, implementing modulation and demodulation within the storage ring presents significant challenges due to dynamical and spatial constraints within straight sections. In this study, we propose a straightforward and easily implementable method for achieving reversible laser modulation in a storage ring. Notably, our approach circumvents the need for special storage ring requirements, such as lengthy straight sections or bypass section. Simulation results demonstrate a substantial restoration of beam quality following demodulation. This innovative scheme holds great promise for the realization of high repetition rate coherent storage ring light sources.

physics.acc-ph↗

arXiv2025

StreamGS: Online Generalizable Gaussian Splatting Reconstruction for Unposed Image Streams

The advent of 3D Gaussian Splatting (3DGS) has advanced 3D scene reconstruction and novel view synthesis. With the growing interest of interactive applications that need immediate feedback, online 3DGS reconstruction in real-time is in high demand. However, none of existing methods yet meet the demand due to three main challenges: the absence of predetermined camera parameters, the need for generalizable 3DGS optimization, and the necessity of reducing redundancy. We propose StreamGS, an online generalizable 3DGS reconstruction method for unposed image streams, which progressively transform image streams to 3D Gaussian streams by predicting and aggregating per-frame Gaussians. Our method overcomes the limitation of the initial point reconstruction \cite{dust3r} in tackling out-of-domain (OOD) issues by introducing a content adaptive refinement. The refinement enhances cross-frame consistency by establishing reliable pixel correspondences between adjacent frames. Such correspondences further aid in merging redundant Gaussians through cross-frame feature aggregation. The density of Gaussians is thereby reduced, empowering online reconstruction by significantly lowering computational and memory costs. Extensive experiments on diverse datasets have demonstrated that StreamGS achieves quality on par with optimization-based approaches but does so 150 times faster, and exhibits superior generalizability in handling OOD scenes.

cs.CV↗

arXiv2025

ADBM: Adversarial diffusion bridge model for reliable adversarial purification

Recently Diffusion-based Purification (DiffPure) has been recognized as an effective defense method against adversarial examples. However, we find DiffPure which directly employs the original pre-trained diffusion models for adversarial purification, to be suboptimal. This is due to an inherent trade-off between noise purification performance and data recovery quality. Additionally, the reliability of existing evaluations for DiffPure is questionable, as they rely on weak adaptive attacks. In this work, we propose a novel Adversarial Diffusion Bridge Model, termed ADBM. ADBM directly constructs a reverse bridge from the diffused adversarial data back to its original clean examples, enhancing the purification capabilities of the original diffusion models. Through theoretical analysis and experimental validation across various scenarios, ADBM has proven to be a superior and robust defense mechanism, offering significant promise for practical applications.

cs.LG↗