Searcharxiv⌕ Search

arXiv subjects

Xudong Li

Publications and source records attributed to Xudong Li.

At least 37 records · Page 2Linked to original sources

PruneTIR: Inference-Time Tool Call Pruning for Effective yet Efficient Tool-Integrated Reasoning

Tool-integrated reasoning (TIR) enables large language models (LLMs) to enhance their capabilities by interacting with external tools, such as code interpreters (CI). Most recent studies focus on exploring various methods to equip LLMs with the ability to use tools. However, how to further boost the reasoning ability of already tool-capable LLMs at inference time remains underexplored. Improving reasoning at inference time requires no additional training and can help LLMs better leverage tools to solve problems. We observe that, during tool-capable LLM inference, both the number and the proportion of erroneous tool calls are negatively correlated with answer correctness. Moreover, erroneous tool calls are typically resolved successfully within a few subsequent turns. If not, LLMs often struggle to resolve such errors even with many additional turns. Building on the above observations, we propose PruneTIR, a rather effective yet efficient framework that enhances the tool-integrated reasoning at inference time. During LLM inference, PruneTIR prunes trajectories, resamples tool calls, and suspends tool usage through three components: Success-Triggered Pruning, Stuck-Triggered Pruning and Resampling, and Retry-Triggered Tool Suspension. These three components enable PruneTIR to mitigate the negative impact of erroneous tool calls and prevent LLMs from getting stuck in repeated failed resolution attempts, thereby improving overall LLM performance. Extensive experimental results demonstrate the effectiveness of PruneTIR, which significantly improves Pass@1 and efficiency while reducing the working context length for tool-capable LLMs.

cs.CL↗

Scalable Kernel Quantile Regression: A Preconditioned Augmented Lagrangian Method

Kernel quantile regression (KQR) extends classical quantile regression to nonlinear settings using kernel methods, offering a powerful tool for modeling conditional distributions. However, its application to large-scale datasets remains challenging due to two intrinsic difficulties: the nonsmoothness of the quantile check loss and the computational burden imposed by the large, dense kernel matrix. Existing state-of-the-art solvers often struggle to handle both challenges simultaneously, leading to limited scalability and high computational cost. In this paper, we propose PALM-KQR, a highly efficient two-phase preconditioned augmented Lagrangian method for large-scale KQR. In the first phase, an inexact alternating direction method of multipliers (ADMM) is employed to compute a warm-start solution efficiently. The second phase refines this solution using an efficient semismooth Newton augmented Lagrangian method (ALM). Our key innovations include a dual semismooth Newton approach for handling the nonsmooth quantile check loss, and a specialized preconditioning strategy based on low-rank approximations of the kernel matrix, which exploits its structure and mitigates ill-conditioning in the linear systems arising in ALM, thereby significantly accelerating the iterative solvers. Extensive numerical experiments demonstrate that PALM-KQR substantially outperforms existing commercial and specialized KQR solvers in both efficiency and scalability.

math.OC↗

Q-DeepSight: Incentivizing Thinking with Images for Image Quality Assessment and Refinement

Image Quality Assessment (IQA) models are increasingly deployed as perceptual critics to guide generative models and image restoration. This role demands not only accurate scores but also actionable, localized feedback. However, current MLLM-based methods adopt a single-look, language-only paradigm, which departs from human evidence-seeking judgment and yields weakly grounded rationales, limiting their reliability for in-the-loop refinement. We propose Q-DeepSight, a think-with-image framework that emulates this human-like process. It performs interleaved Multimodal Chain-of-Thought (iMCoT) with tool-augmented evidence acquisition (e.g., crop-and-zoom) to explicitly determine where quality degrades and why. To train these long iMCoT trajectories via reinforcement learning, we introduce two techniques: Perceptual Curriculum Reward (PCR) to mitigate reward sparsity and Evidence Gradient Filtering (EGF) to improve credit assignment for visually-grounded reasoning. Q-DeepSight achieves state-of-the-art performance across diverse benchmarks, including natural, restored, and AI-generated content. Furthermore, we demonstrate its practical value with Perceptual-in-Generation (PiG), a training-free framework where Q-DeepSight's diagnoses guide iterative image enhancement, effectively closing the loop between assessment and refinement.

cs.CV↗

PLANING: A Loosely Coupled Triangle-Gaussian Framework for Streaming 3D Reconstruction

Streaming reconstruction from monocular image sequences remains challenging, as existing methods typically favor either high-quality rendering or accurate geometry, but rarely both. We present PLANING, an efficient on-the-fly reconstruction framework built on a hybrid representation that loosely couples explicit geometric primitives with neural Gaussians, enabling geometry and appearance to be modeled in a decoupled manner. This decoupling supports an online initialization and optimization strategy that separates geometry and appearance updates, yielding stable streaming reconstruction with substantially reduced structural redundancy. PLANING improves dense mesh Chamfer-L2 by 18.52% over PGSR, surpasses ARTDECO by 1.31 dB PSNR, and reconstructs ScanNetV2 scenes in under 100 seconds, over 5x faster than 2D Gaussian Splatting, while matching the quality of offline per-scene optimization. Beyond reconstruction quality, the structural clarity and computational efficiency of PLANING make it well suited for a broad range of downstream applications, such as enabling large-scale scene modeling and simulation-ready environments for embodied AI. Project page: https://city-super.github.io/PLANING/ .

cs.CV↗

Secure and Green RSMA-Assisted Heterogeneous ISAC

This paper investigates sensing, communication, security, and energy efficiency of the heterogeneous integrated sensing and communication networks under challenging operational conditions. We focus on scenarios in which communication performance, security, and sensing accuracy are degraded by interference, eavesdropping, and imperfect channel state information. To this end, we analyze communication and sensing signals within ISAC framework as well as the communication signals of a multicast network based on \emph{rate-splitting multiple access} (RSMA). Then, sensing signal-to-cluster-plus-noise ratio, communication rate, security rate, and \emph{security energy efficiency} (SEE) are evaluated. To simultaneously enhance these system performances, we propose a targeted optimization framework aimed at maximizing SEE. This framework characterizes the sensing-security trade-off by jointly optimizing the transmit \emph{beamforming} (BF) vectors and the echo BF vector to construct green interference using the echo signal, as well as common and private streams generated by RSMA. Particularly, the joint design improves the security rate and reduces power consumption, thereby enabling a higher SEE. Given the non-convex nature of the optimization problem, we present an alternative approach that leverages Taylor series expansion, majorization-minimization, semi-definite programming, and successive convex approximation techniques. Specifically, we decompose the original non-convex and intractable optimization problem into three simplified sub-optimization problems, which are iteratively solved using an alternating optimization strategy. Simulations provide comparisons with state-of-the-art schemes, highlighting the superior efficiency, robustness, and scalability of the proposed joint multi-BF optimization scheme based on RSMA and green interference in improving system performances.

cs.IT↗

Scale Contrastive Learning with Selective Attentions for Blind Image Quality Assessment

Human visual perception naturally evaluates image quality across multiple scales, a hierarchical process that existing blind image quality assessment (BIQA) algorithms struggle to replicate effectively. This limitation stems from a fundamental misunderstanding: current multi-scale approaches fail to recognize that quality perception varies dramatically between scales -- what appears degraded when viewed closely may look acceptable from a distance. This inconsistency not only creates misleading ``visual illusions'' during feature fusion but also introduces substantial redundant information that dilutes quality-critical features and leads to imprecise assessments. Our CSFIQA framework advances multi-scale BIQA via two key innovations: (1) a selective focus attention mechanism that mimics human visual attention by filtering out redundant cross-scale information that would otherwise mask subtle quality indicators, and (2) a scale contrastive learning strategy that explicitly learns to distinguish quality variations both across and within scales. By incorporating an adaptive noise sample matching mechanism, CSFIQA effectively identifies perceptual quality discrepancies in the same content viewed at different scales. Experiments demonstrate substantial improvements over state-of-the-art methods across seven datasets, achieving up to 8.8% SRCC improvement on challenging real-world distortions, confirming CSFIQA's superior alignment with human quality perception.

cs.CV↗

Acceleration via Perturbations on Low-resolution Ordinary Differential Equations

Recently, the high-resolution ordinary differential equation (ODE) framework, which retains higher-order terms, has been proposed to analyze gradient-based optimization algorithms. Through this framework, the term $\nabla^2 f(X_t)\dot{X_t}$, known as the gradient-correction term, was found to be essential for reducing oscillations and accelerating the convergence rate of function values. Despite the importance of this term, simply adding it to the low-resolution ODE may sometimes lead to a slower convergence rate. To fully understand this phenomenon, we propose a generalized perturbed ODE and analyze the role of the gradient and gradient-correction perturbation terms under both continuous-time and discrete-time settings. We demonstrate that while the gradient-correction perturbation is essential for obtaining accelerations, it can hinder the convergence rate of function values in certain cases. However, this adverse effect can be mitigated by involving an additional gradient perturbation term. Moreover, by conducting a comprehensive analysis, we derive proper choices of perturbation parameters. Numerical experiments are also provided to validate our theoretical findings.

math.OC↗

ActiShade: Activating Overshadowed Knowledge to Guide Multi-Hop Reasoning in Large Language Models

In multi-hop reasoning, multi-round retrieval-augmented generation (RAG) methods typically rely on LLM-generated content as the retrieval query. However, these approaches are inherently vulnerable to knowledge overshadowing - a phenomenon where critical information is overshadowed during generation. As a result, the LLM-generated content may be incomplete or inaccurate, leading to irrelevant retrieval and causing error accumulation during the iteration process. To address this challenge, we propose ActiShade, which detects and activates overshadowed knowledge to guide large language models (LLMs) in multi-hop reasoning. Specifically, ActiShade iteratively detects the overshadowed keyphrase in the given query, retrieves documents relevant to both the query and the overshadowed keyphrase, and generates a new query based on the retrieved documents to guide the next-round iteration. By supplementing the overshadowed knowledge during the formulation of next-round queries while minimizing the introduction of irrelevant noise, ActiShade reduces the error accumulation caused by knowledge overshadowing. Extensive experiments show that ActiShade outperforms existing methods across multiple datasets and LLMs.

cs.CL↗

Continuous Gaussian Process Pre-Optimization for Asynchronous Event-Inertial Odometry

Event cameras, as bio-inspired sensors, are asynchronously triggered with high-temporal resolution compared to intensity cameras. Recent work has focused on fusing the event measurements with inertial measurements to enable ego-motion estimation in high-speed and HDR environments. However, existing methods predominantly rely on IMU preintegration designed mainly for synchronous sensors and discrete-time frameworks. In this paper, we propose a continuous-time preintegration method based on the Temporal Gaussian Process (TGP) called GPO. Concretely, we model the preintegration as a time-indexed motion trajectory and leverage an efficient two-step optimization to initialize the precision preintegration pseudo-measurements. Our method realizes a linear and constant time cost for initialization and query, respectively. To further validate the proposal, we leverage the GPO to design an asynchronous event-inertial odometry and compare with other asynchronous fusion schemes within the same odometry system. Experiments conducted on both public and own-collected datasets demonstrate that the proposed GPO offers significant advantages in terms of precision and efficiency, outperforming existing approaches in handling asynchronous sensor fusion.

cs.RO↗

AsynEIO: Asynchronous Monocular Event-Inertial Odometry Using Gaussian Process Regression

Event cameras, when combined with inertial sensors, show significant potential for motion estimation in challenging scenarios, such as high-speed maneuvers and low-light environments. There are many methods for producing such estimations, but most boil down to a synchronous discrete-time fusion problem. However, the asynchronous nature of event cameras and their unique fusion mechanism with inertial sensors remain underexplored. In this paper, we introduce a monocular event-inertial odometry method called AsynEIO, designed to fuse asynchronous event and inertial data within a unified Gaussian Process (GP) regression framework. Our approach incorporates an event-driven frontend that tracks feature trajectories directly from raw event streams at a high temporal resolution. These tracked feature trajectories, along with various inertial factors, are integrated into the same GP regression framework to enable asynchronous fusion. With deriving analytical residual Jacobians and noise models, our method constructs a factor graph that is iteratively optimized and pruned using a sliding-window optimizer. Comparative assessments highlight the performance of different inertial fusion strategies, suggesting optimal choices for varying conditions. Experimental results on both public datasets and our own event-inertial sequences indicate that AsynEIO outperforms existing methods, especially in high-speed and low-illumination scenarios.

cs.RO↗

On the B-subdifferential of proximal operators of affine-constrained $\ell_1$ regularizer

In this work, we study the affine-constrained $\ell_1$ regularizers, which frequently arise in statistical and machine learning problems across a variety of applications, including microbiome compositional data analysis and sparse subspace clustering. With the aim of developing scalable second-order methods for solving optimization problems involving such regularizers, we analyze the associated proximal mapping and characterize its generalized differentiability, with a focus on its B-subdifferential. The revealed structured sparsity in the B-subdifferential enables us to design efficient algorithms within the proximal point framework. Extensive numerical experiments on real applications, including comparisons with state-of-the-art solvers, further demonstrate the superior performance of our approach. Our findings provide new insights into the sensitivity and stability properties of affine-constrained nonsmooth regularizers, and contribute to the development of fast second-order methods for a class of structured, constrained sparse learning problems.

math.OC↗

Spectral-temporal processing using integrated recursive electro-optic circuit

Advances in integrated photonics have enabled unprecedented level of control of light, powering a wide range of photonic technologies from communications and computing to precision metrology and quantum information. However, the conventional on-chip optical signal processing approaches based on optical waveguides and cavities suffer from their large physical footprint and narrow operating bandwidth, respectively. To address this, we propose and experimentally demonstrate, using the thin film lithium niobate (TFLN) photonics, a modular, recursive optical signal processing framework. In our approach, fast electro-optic (EO) switch is used to either keep an optical packet inside the loop, with the processing element embedded within, or to release it from the loop and direct it towards the output waveguide. By configuring the switch on a timescale shorter than a time the photon spends traversing the loop, this architecture can achieve different optical pathlengths in a compact footprint without sacrificing optical bandwidth. As an example, we embed a phase-modulator (PM) inside the loop and demonstrate a frequency shift of optical packets up to 420 GHz, using only a 3 GHz sinusoidal microwave signal. By replacing the PM with chirped Bragg gratings (CBG), we demonstrate recursive delay line featuring large group delays of 28 ps/nm over a 30 nm optical bandwidth. Finally, by introducing asymmetric Mach-Zehnder interferometer (AMZI) inside the loop, we demonstrate a reconfigurable differentiation of the optical packet in time, up to an unprecedented fifth-order. Our results establish a powerful and scalable platform for multifunctional photonic processing, setting the stage for next-generation integrated systems with ultrahigh reconfigurability and spectral-temporal versatility.

physics.optics↗

Few-Shot Image Quality Assessment via Adaptation of Vision-Language Models

Image Quality Assessment (IQA) remains an unresolved challenge in computer vision due to complex distortions, diverse image content, and limited data availability. Existing Blind IQA (BIQA) methods largely rely on extensive human annotations, which are labor-intensive and costly due to the demanding nature of creating IQA datasets. To reduce this dependency, we propose the Gradient-Regulated Meta-Prompt IQA Framework (GRMP-IQA), designed to efficiently adapt the visual-language pre-trained model, CLIP, to IQA tasks, achieving high accuracy even with limited data. GRMP-IQA consists of two core modules: (i) Meta-Prompt Pre-training Module and (ii) Quality-Aware Gradient Regularization. The Meta Prompt Pre-training Module leverages a meta-learning paradigm to pre-train soft prompts with shared meta-knowledge across different distortions, enabling rapid adaptation to various IQA tasks. On the other hand, the Quality-Aware Gradient Regularization is designed to adjust the update gradients during fine-tuning, focusing the model's attention on quality-relevant features and preventing overfitting to semantic information. Extensive experiments on standard BIQA datasets demonstrate the superior performance to the state-of-the-art BIQA methods under limited data setting. Notably, utilizing just 20% of the training data, GRMP-IQA is competitive with most existing fully supervised BIQA approaches.

cs.CV↗

Universal dynamics and microwave control of programmable cavity electro-optic frequency combs

Electro-optic (EO) frequency combs are foundational for metrology and spectroscopy. Specifically, microresonator-based cavity EO combs are distinguished by efficient sideband generation, precisely controlled by microwave signals, enabling high-performance integrated frequency references and pulse sources. However, the apparent simplicity of these devices, often described by the EO modulation-induced coupling of nearest-neighbor cavity modes, has limited investigations of their fundamental physics, thereby restricting their full potential. Here, we uncover the universal dynamics and complete frequency lattice connectivity underpinning cavity EO microcombs, as well as characterize the full space of nonlinear optical states, controlled by modulation depth and optical detuning, using the thin-film lithium niobate photonic platform. Leveraging this understanding, we design complex long-range couplings between cavity modes to realize programmable spectro-temporal shaping of the generated combs and pulses. We achieve three technological advances, including repetition-rate flexibility, substantial comb bandwidth extension beyond traditional scaling laws, and resonantly-enhanced flat-top spectrum. Our results provide physical insights for synchronously driven cavity-based EO systems, broadly defined, paving the way for electrically controlled and electrically enhanced comb generators for next-generation photonic applications.

physics.optics↗

Adaptive Feature Selection for No-Reference Image Quality Assessment by Mitigating Semantic Noise Sensitivity

The current state-of-the-art No-Reference Image Quality Assessment (NR-IQA) methods typically rely on feature extraction from upstream semantic backbone networks, assuming that all extracted features are relevant. However, we make a key observation that not all features are beneficial, and some may even be harmful, necessitating careful selection. Empirically, we find that many image pairs with small feature spatial distances can have vastly different quality scores, indicating that the extracted features may contain a significant amount of quality-irrelevant noise. To address this issue, we propose a Quality-Aware Feature Matching IQA Metric (QFM-IQM) that employs an adversarial perspective to remove harmful semantic noise features from the upstream task. Specifically, QFM-IQM enhances the semantic noise distinguish capabilities by matching image pairs with similar quality scores but varying semantic features as adversarial semantic noise and adaptively adjusting the upstream task's features by reducing sensitivity to adversarial noise perturbation. Furthermore, we utilize a distillation framework to expand the dataset and improve the model's generalization ability. Our approach achieves superior performance to the state-of-the-art NR-IQA methods on eight standard IQA datasets.

cs.CV↗

Zooming from Context to Cue: Hierarchical Preference Optimization for Multi-Image MLLMs

Multi-modal Large Language Models (MLLMs) excel at single-image tasks but struggle with multi-image understanding due to cross-modal misalignment, leading to hallucinations (context omission, conflation, and misinterpretation). Existing methods using Direct Preference Optimization (DPO) constrain optimization to a solitary image reference within the input sequence, neglecting holistic context modeling. We propose Context-to-Cue Direct Preference Optimization (CcDPO), a multi-level preference optimization framework that enhances per-image perception in multi-image settings by zooming into visual clues -- from sequential context to local details. It features: (i) Context-Level Optimization : Re-evaluates cognitive biases underlying MLLMs' multi-image context comprehension and integrates a spectrum of low-cost global sequence preferences for bias mitigation. (ii) Needle-Level Optimization : Directs attention to fine-grained visual details through region-targeted visual prompts and multimodal preference supervision. To support scalable optimization, we also construct MultiScope-42k, an automatically generated dataset with high-quality multi-level preference pairs. Experiments show that CcDPO significantly reduces hallucinations and yields consistent performance gains across general single- and multi-image tasks.

cs.CV↗

Channel Fingerprint Construction for Massive MIMO: A Deep Conditional Generative Approach

Accurate channel state information (CSI) acquisition for massive multiple-input multiple-output (MIMO) systems is essential for future mobile communication networks. Channel fingerprint (CF), also referred to as channel knowledge map, is a key enabler for intelligent environment-aware communication and can facilitate CSI acquisition. However, due to the cost limitations of practical sensing nodes and test vehicles, the resulting CF is typically coarse-grained, making it insufficient for wireless transceiver design. In this work, we introduce the concept of CF twins and design a conditional generative diffusion model (CGDM) with strong implicit prior learning capabilities as the computational core of the CF twin to establish the connection between coarse- and fine-grained CFs. Specifically, we employ a variational inference technique to derive the evidence lower bound (ELBO) for the log-marginal distribution of the observed fine-grained CF conditioned on the coarse-grained CF, enabling the CGDM to learn the complicated distribution of the target data. During the denoising neural network optimization, the coarse-grained CF is introduced as side information to accurately guide the conditioned generation of the CGDM. To make the proposed CGDM lightweight, we further leverage the additivity of network layers and introduce a one-shot pruning approach along with a multi-objective knowledge distillation technique. Experimental results show that the proposed approach exhibits significant improvement in reconstruction performance compared to the baselines. Additionally, zero-shot testing on reconstruction tasks with different magnification factors further demonstrates the scalability and generalization ability of the proposed approach.

cs.NI↗

A sub-volt near-IR lithium tantalate electro-optic modulator

We demonstrate a low-loss integrated electro-optic Mach-Zehnder modulator in thin-film lithium tantalate at 737 nm, featuring a low half-wave voltage-length product of 0.65 V$\cdot$cm, an extinction ratio of 30 dB, low optical loss of 5.3 dB, and a detector-limited bandwidth of 20 GHz. A small $<2$ dB DC bias drift relative to quadrature bias is measured over 16 minutes using 4.3 dBm of on-chip power in ambient conditions, which outperforms the 8 dB measured using a counterpart thin-film lithium niobate modulator. Finally, an optical loss coefficient of 0.5 dB/cm for a thin-film lithium tantalate waveguide is estimated at 638 nm using a fabricated ring resonator.

physics.optics↗