arXiv subjects

Tao Zhang

Publications and source records attributed to Tao Zhang.

At least 163 records · Page 9Linked to original sources

arXiv2026

PACE: Prefix-Protected and Difficulty-Aware Compression for Efficient Reasoning

Language Reasoning Models (LRMs) achieve strong performance by scaling test-time computation but often suffer from ``overthinking'', producing excessively long reasoning traces that increase latency and memory usage. Existing LRMs typically enforce conciseness with uniform length penalties, which over-compress crucial early deduction steps at the sequence level and indiscriminately penalize all queries at the group level. To solve these limitations, we propose \textbf{\model}, a dual-level framework for prefix-protected and difficulty-aware compression under hierarchical supervision. At the sequence level, prefix-protected optimization employs decaying mixed rollouts to maintain valid reasoning paths while promoting conciseness. At the group level, difficulty-aware penalty dynamically scales length constraints based on query complexity, maintaining exploration for harder questions while curbing redundancy on easier ones. Extensive experiments on DeepSeek-R1-Distill-Qwen (1.5B/7B) demonstrate that \model achieves a substantial reduction in token usage (up to \textbf{55.7\%}) while simultaneously improving accuracy (up to \textbf{4.1\%}) on math benchmarks, with generalization ability to code, science, and general domains.

cs.CL↗

arXiv2026

Statistical-Geometric Degeneracy in UAV Search: A Physics-Aware Asymmetric Filtering Approach

Post-disaster survivor localization using Unmanned Aerial Vehicles (UAVs) faces a fundamental physical challenge: the prevalence of Non-Line-of-Sight (NLOS) propagation in collapsed structures. Unlike standard Gaussian noise, signal reflection from debris introduces strictly non-negative ranging biases. Existing robust estimators, typically designed with symmetric loss functions (e.g., Huber or Tukey), implicitly rely on the assumption of error symmetry. Consequently, they experience a theoretical mismatch in this regime, leading to a phenomenon we formally identify as Statistical-Geometric Degeneracy (SGD)-a state where the estimator stagnates due to the coupling of persistent asymmetric bias and limited observation geometry. While emerging data-driven approaches offer alternatives, they often struggle with the scarcity of training data and the sim-to-real gap inherent in unstructured disaster zones. In this work, we propose a physically-grounded solution, the AsymmetricHuberEKF, which explicitly incorporates the non-negative physical prior of NLOS biases via a derived asymmetric loss function. Theoretically, we show that standard symmetric filters correspond to a degenerate case of our framework where the physical constraint is relaxed. Furthermore, we demonstrate that resolving SGD requires not just a robust filter, but specific bilateral information, which we achieve through a co-designed active sensing strategy. Validated in a 2D nadir-view scanning scenario, our approach significantly accelerates convergence compared to symmetric baselines, offering a resilient building block for search operations where data is scarce and geometry is constrained.

cs.RO↗

arXiv2026

Cell strain-stiffening drives cell breakout from embedded spheroids

Understanding how cells escape from embedded spheroids requires a mechanical framework linking stress generation within cells, across cells, and between cells and the surrounding extracellular matrix (ECM). We develop such a framework by coupling a 3D vertex model of a spheroid to a fibrous ECM network and deriving a 3D Cauchy stress tensor for deformable polyhedral cells, enabling direct cell-level stress quantification in three dimensions. We analyze maximum shear stress in solid-like and fluid-like spheroids: solid-like spheroids exhibit broader stress distributions and radial stress gradients, while fluid-like spheroids show lower stresses with weak spatial organization. Cell shape anisotropy is not generically aligned with principal stress directions, indicating that morphology alone is an unreliable proxy for mechanical state. We further demonstrate strain stiffening at the single-cell level, where elongation produces nonlinear increases in maximum shear stress, allowing boundary cells in otherwise low-stress, fluid-like spheroids to transiently generate forces sufficient to remodel the matrix. To connect strain-induced stress amplification to invasion modes, we introduce an extended 3D vertex model with explicit, tunable cell-cell adhesion springs. In this minimal mechanical framework, single-cell breakout results from strain stiffening combined with reduced adhesion, whereas multi-cell streaming additionally requires anisotropic adhesion strengthened along the elongation axis and weakened orthogonally. Together, these results identify distinct mechanical pathways coupling cell strain, stress amplification, and adhesion organization to spheroid invasion.

physics.bio-ph↗

arXiv2026

VFScale: Intrinsic Reasoning through Verifier-Free Test-time Scalable Diffusion Model

Inspired by human SYSTEM 2 thinking, LLMs excel at complex reasoning tasks via extended Chain-of-Thought. However, similar test-time scaling for diffusion models to tackle complex reasoning remains largely unexplored. From existing work, two primary challenges emerge in this setting: (i) the dependence on an external verifier indicating a notable gap from intrinsic reasoning of human intelligence without any external feedback, and (ii) the lack of an efficient search algorithm. In this paper, we introduce the Verifier-free Test-time Scalable Diffusion Model (VFScale) to achieve scalable intrinsic reasoning, which equips number-of-sample test-time scaling with the intrinsic energy function of diffusion models as the verifier. Concretely, VFScale comprises two key innovations to address the aforementioned challenges. On the training side, VFScale consists of a novel MRNCL loss and a KL regularization to improve the energy landscape, ensuring that the learned energy function itself serves as a reliable verifier. On the inference side, VFScale integrates the denoising process with a novel hybrid Monte Carlo Tree Search (hMCTS) to improve search efficiency. On challenging reasoning tasks of Maze and Sudoku, we demonstrate the effectiveness of VFScale's training objective and scalable inference method. In particular, trained with Maze sizes of up to $6\times6$, our VFScale solves 88% of Maze problems with much larger sizes of $15\times15$, while standard diffusion models completely fail. The code can be found at https://github.com/AI4Science-WestlakeU/VFScale.

cs.LG↗

arXiv2026

Sliced Rényi Pufferfish Privacy: Directional Additive Noise Mechanism and Private Learning with Gradient Clipping

We study the design of a privatization mechanism and privacy accounting in the Pufferfish Privacy (PP) family. Specifically, motivated by the curse of dimensionality and lack of practical composition tools for iterative learning in the recent Renyi Pufferfish Privacy (RPP) framework, we propose Sliced Renyi Pufferfish Privacy (SRPP). SRPP preserves PP/RPP semantics (customizable secrets with probability-aware secret-dataset relationships) while replacing high-dimensional Renyi divergence with projection-based quantification via two sliced measures, Average SRPP and Joint SRPP. We develop sliced Wasserstein mechanisms, yielding sound SRPP certificates and closed-form Gaussian noise calibration. For iterative learning systems, we introduce an SRPP-SGD scheme with gradient clipping and new accountants based on History-Uniform Caps (HUC) and a subsampling-aware variant (sa-HUC), enabling decompose-then-compose privatization and additive composition under a common slicing geometry. Experiments on static and iterative privatization show that the proposed framework exhibits favorable privacy-utility trade-offs, as well as practical scalability.

cs.CR↗

arXiv2026

SWE-World: Building Software Engineering Agents in Docker-Free Environments

Recent advances in large language models (LLMs) have enabled software engineering agents to tackle complex code modification tasks. Most existing approaches rely on execution feedback from containerized environments, which require dependency-complete setup and physical execution of programs and tests. While effective, this paradigm is resource-intensive and difficult to maintain, substantially complicating agent training and limiting scalability. We propose SWE-World, a Docker-free framework that replaces physical execution environments with a learned surrogate for training and evaluating software engineering agents. SWE-World leverages LLM-based models trained on real agent-environment interaction data to predict intermediate execution outcomes and final test feedback, enabling agents to learn without interacting with physical containerized environments. This design preserves the standard agent-environment interaction loop while eliminating the need for costly environment construction and maintenance during agent optimization and evaluation. Furthermore, because SWE-World can simulate the final evaluation outcomes of candidate trajectories without real submission, it enables selecting the best solution among multiple test-time attempts, thereby facilitating effective test-time scaling (TTS) in software engineering tasks. Experiments on SWE-bench Verified demonstrate that SWE-World raises Qwen2.5-Coder-32B from 6.2\% to 52.0\% via Docker-free SFT, 55.0\% with Docker-free RL, and 68.2\% with further TTS. The code is available at https://github.com/RUCAIBox/SWE-World

cs.SE↗

arXiv2026

An Extended VIIRS-like Artificial Nighttime Light Data Reconstruction (1986-2024)

Artificial Night-Time Light (NTL) remote sensing is a vital proxy for quantifying the intensity and spatial distribution of human activities. Although the NPP-VIIRS sensor provides high-quality NTL observations, its temporal coverage, which begins in 2012, restricts long-term time-series studies that extend to earlier periods. Current extended VIIRS-like NTL data products suffer from two significant shortcomings: the underestimation of light intensity and the omission of structural details. To overcome these limitations, we present the Extended VIIRS-like Artificial Nighttime Light (EVAL) dataset, a new annual NTL dataset for China spanning from 1986 to 2024. This dataset was generated using a novel two-stage deep learning model designed to address the aforementioned shortcomings. The model first constructs an initial estimate and subsequently refines fine-grained structural details using high-resolution impervious surface data as guidance. Quantitative evaluations demonstrate that EVAL significantly outperforms state-of-the-art products, exhibiting superior temporal consistency and a stronger correlation with socioeconomic indicators.

cs.CV↗

arXiv2026

Reflecting with Two Voices: A Co-Adaptive Dual-Strategy Framework for LLM-Based Agent Decision Making

Large language model (LLM) agents often rely on external demonstrations or retrieval-augmented planning, leading to brittleness, poor generalization, and high computational overhead. Inspired by human problem-solving, we propose DuSAR (Dual-Strategy Agent with Reflecting) -- a demonstration-free framework that enables a single frozen LLM to perform co-adaptive reasoning via two complementary strategies: a high-level holistic plan and a context-grounded local policy. These strategies interact through a lightweight reflection mechanism, where the agent continuously assesses progress via a Strategy Fitness Score and dynamically revises its global plan when stuck or refines it upon meaningful advancement, mimicking human metacognitive behavior. On both simulated household (ALFWorld) and real-world web (Mind2Web) environments, DuSAR achieves state-of-the-art performance using only open-source LLMs, substantially outperforming all prior methods without any demonstrations or fine-tuning. Remarkably, it also reduces per-step token consumption by a large margin while maintaining strong task success. Ablation studies confirm the necessity of dual-strategy coordination. Moreover, optional integration of expert demonstrations further boosts performance, highlighting DuSAR's flexibility and compatibility with external knowledge.

cs.AI↗

arXiv2026

GenCP: Towards Generative Modeling Paradigm of Coupled Physics

Real-world physical systems are inherently complex, often involving the coupling of multiple physics, making their simulation both highly valuable and challenging. Many mainstream approaches face challenges when dealing with decoupled data. Besides, they also suffer from low efficiency and fidelity in strongly coupled spatio-temporal physical systems. Here we propose GenCP, a novel and elegant generative paradigm for coupled multiphysics simulation. By formulating coupled-physics modeling as a probability modeling problem, our key innovation is to integrate probability density evolution in generative modeling with iterative multiphysics coupling, thereby enabling training on data from decoupled simulation and inferring coupled physics during sampling. We also utilize operator-splitting theory in the space of probability evolution to establish error controllability guarantees for this "conditional-to-joint" sampling scheme. We evaluate our paradigm on a synthetic setting and three challenging multi-physics scenarios to demonstrate both principled insight and superior application performance of GenCP. Code is available at this repo: github.com/AI4Science-WestlakeU/GenCP.

cs.LG↗

arXiv2026

Toughness and Aα-spectral radius in graphs

Let $α\in[0,1)$, and let $G$ be a connected graph of order $n$ with $n\geq f(α)$, where $f(α)=6$ for $α\in[0,\frac{2}{3}]$ and $f(α)=\frac{4}{1-α}$ for $α\in(\frac{2}{3},1)$. A graph $G$ is said to be $t$-tough if $|S|\geq tc(G-S)$ for each subset $S$ of $V(G)$ with $c(G-S)\geq2$, where $c(G-S)$ is the number of connected components in $G-S$. The $A_α$-spectral radius of $G$ is denoted by $ρ_α(G)$. In this paper, it is verified that $G$ is a 1-tough graph unless $G=K_1\vee(K_{n-2}\cup K_1)$ if $ρ_α(G)\geqρ_α(K_1\vee(K_{n-2}\cup K_1))$, where $ρ_α(K_1\vee(K_{n-2}\cup K_1))$ equals the largest root of $x^{3}-((α+1)n+α-3)x^{2}+(αn^{2}+(α^{2}-α-1)n-2α+1)x-α^{2}n^{2}+(3α^{2}-α+1)n-4α^{2}+5α-3=0$. Further, we present an $A_α$-spectral radius condition for a graph to be a $t$-tough graph.

math.CO↗

arXiv2026

Integrated Sensing, Communication and Control enabled Agile UAV Swarm

Uncrewed aerial vehicle (UAV) swarms are pivotal in the applications such as disaster relief, aerial base station (BS) and logistics transportation. These scenarios require the capabilities in accurate sensing, efficient communication and flexible control for real-time and reliable task execution. However, sensing, communication and control are studied independently in traditional research, which limits the overall performance of UAV swarms. To overcome this disadvantage, we propose a deeply coupled scheme of integrated sensing, communication and control (ISCC) for UAV swarms, which is a systemic paradigm that transcends traditional isolated designs of sensing, communication and control by establishing a tightly-coupled closed-loop through the co-optimization of sensing, communication and control. In this article, we firstly analyze the requirements of scenarios and key performance metrics. Subsequently, the enabling technologies are proposed, including communication-and-control-enhanced sensing, sensing-and-control-enhanced communication, and sensing-and-communication-enhanced control. Simulation results validate the performance of the proposed ISCC framework, demonstrating its application potential in the future.

eess.SP↗

arXiv2026

Learning to Dock: Geometric Deep Learning for Predicting Supramolecular Host-Guest Complexes

Predicting non-covalent host-guest recognition remains challenging due to the complex interplay of electrostatics, dispersion, and steric effects, and the limited transferability of existing docking approaches to synthetic supramolecular systems. Here we present DeepHostGuest, a geometric deep-learning framework that learns generalizable recognition principles directly from experimentally resolved host-guest structures. Hosts are encoded as electrostatic surfaces and guests as molecular graphs, enabling transferable learning across diverse supramolecular systems. DeepHostGuest achieves high-accuracy predictions (RMSD $\leq 2$ Angstrom for 80.8% of test cases), substantially outperforming classical docking without case-specific tuning. Notably, the method generalizes beyond its training domain to crystalline sponge systems, accurately capturing the binding of large amphiphilic molecules within metal-organic cages. Beyond predicting binding conformations, the structures generated by DeepHostGuest serve as a reliable basis for accurate binding free-energy calculations. Density Functional Theory (DFT)-calculated affinities correlate well with experiment, enabling structure-property relationships across 876 host-guest complexes spanning 34 host families. Interpretable feature analysis reveals that binding strength arises from a cooperative interplay of host polarity, guest hydrophobicity, and geometric complementarity, with distinct design regimes across supramolecular classes. Together, these results establish data-driven molecular recognition as a practical route to predictive supramolecular design, enabling high-throughput virtual screening and rational optimization of functional host-guest systems.

physics.chem-ph↗

arXiv2026

Differentially Private Subspace Fine-Tuning for Large Language Models

Fine-tuning large language models on downstream tasks is crucial for realizing their cross-domain potential but often relies on sensitive data, raising privacy concerns. Differential privacy (DP) offers rigorous privacy guarantees and has been widely adopted in fine-tuning; however, naively injecting noise across the high-dimensional parameter space creates perturbations with large norms, degrading performance and destabilizing training. To address this issue, we propose DP-SFT, a two-stage subspace fine-tuning method that substantially reduces noise magnitude while preserving formal DP guarantees. Our intuition is that, during fine-tuning, significant parameter updates lie within a low-dimensional, task-specific subspace, while other directions change minimally. Hence, we only inject DP noise into this subspace to protect privacy without perturbing irrelevant parameters. In phase one, we identify the subspace by analyzing principal gradient directions to capture task-specific update signals. In phase two, we project full gradients onto this subspace, add DP noise, and map the perturbed gradients back to the original parameter space for model updates, markedly lowering noise impact. Experiments on multiple datasets demonstrate that DP-SFT enhances accuracy and stability under rigorous DP constraints, accelerates convergence, and achieves substantial gains over DP fine-tuning baselines.

cs.LG↗

arXiv2026

GPS-Synchronized Monitoring of Core-collapse Supernova Bursts with PandaX-4T via Coherent Elastic Neutrino Nuclear Scattering

The landmark detection of neutrinos from SN1987A marked the dawn of neutrino astrophysics. The neutrino burst provided essential insights into fundamental properties of neutrinos, and served as key probes of stellar evolution and supernova dynamics. The recent advancement in coherent elastic neutrino-nucleus scattering enables the detection of core-collapse supernova burst neutrinos using tonne-scale liquid xenon detectors originally designed for dark matter direct detection. Leveraging this capability, we developed and deployed an online supernova monitoring system for the PandaX-4T experiment. This system features a GPS module with millisecond-level timing precision, a low false-alarm rate, and high sensitivity to galactic core-collapse supernova explosion events. The methodology is robust, directly scalable, and planned for implementation in the next-generation PandaX-20T experiment.

hep-ex↗

arXiv2026

Residual-PAC Privacy: Automatic Privacy Control Beyond the Gaussian Barrier

The Probably Approximately Correct (PAC) Privacy framework [46] provides a powerful instance-based methodology to preserve privacy in complex data-driven systems. Existing PAC Privacy algorithms (we call them Auto-PAC) rely on a Gaussian mutual information upper bound. However, we show that the upper bound obtained by these algorithms is tight if and only if the perturbed mechanism output is jointly Gaussian with independent Gaussian noise. We propose two approaches for addressing this issue. First, we introduce two tractable post-processing methods for Auto-PAC, based on Donsker-Varadhan representation and sliced Wasserstein distances. However, the result still leaves wasted privacy budget. To address this issue more fundamentally, we introduce Residual-PAC (R-PAC) Privacy, an f-divergence-based measure to quantify privacy that remains after adversarial inference. To implement R-PAC Privacy in practice, we propose a Stackelberg Residual-PAC (SR-PAC) privatization mechanism, a game-theoretic framework that selects optimal noise distributions through convex bilevel optimization. Our approach achieves efficient privacy budget utilization for arbitrary data distributions and naturally composes when multiple mechanisms access the dataset. Our experiments demonstrate that SR-PAC consistently obtains a better privacy-utility tradeoff than both PAC and differential privacy baselines.

cs.CR↗

arXiv2025

TableGPT-R1: Advancing Tabular Reasoning Through Reinforcement Learning

Tabular data serves as the backbone of modern data analysis and scientific research. While Large Language Models (LLMs) fine-tuned via Supervised Fine-Tuning (SFT) have significantly improved natural language interaction with such structured data, they often fall short in handling the complex, multi-step reasoning and robust code execution required for real-world table tasks. Reinforcement Learning (RL) offers a promising avenue to enhance these capabilities, yet its application in the tabular domain faces three critical hurdles: the scarcity of high-quality agentic trajectories with closed-loop code execution and environment feedback on diverse table structures, the extreme heterogeneity of feedback signals ranging from rigid SQL execution to open-ended data interpretation, and the risk of catastrophic forgetting of general knowledge during vertical specialization. To overcome these challenges and unlock advanced reasoning on complex tables, we introduce \textbf{TableGPT-R1}, a specialized tabular model built on a systematic RL framework. Our approach integrates a comprehensive data engineering pipeline that synthesizes difficulty-stratified agentic trajectories for both supervised alignment and RL rollouts, a task-adaptive reward system that combines rule-based verification with a criteria-injected reward model and incorporates process-level step reward shaping with behavioral regularization, and a multi-stage training framework that progressively stabilizes reasoning before specializing in table-specific tasks. Extensive evaluations demonstrate that TableGPT-R1 achieves state-of-the-art performance on authoritative benchmarks, significantly outperforming baseline models while retaining robust general capabilities. Our model is available at https://huggingface.co/tablegpt/TableGPT-R1.

cs.LG↗

arXiv2025

Information-Scrambling-Enhanced Quantum Sensing Beyond the Standard Quantum Limit

Quantum sensing promises measurement precision beyond classical limits, but its practical realization is often hindered by decoherence and the challenges of generating and stabilizing entanglement in large-scale systems. Here, we experimentally demonstrate a scalable, scrambling-enhanced quantum sensing protocol, referred to as butterfly metrology, implemented on a cross-shaped superconducting quantum processor. By harnessing quantum information scrambling, the protocol converts local interactions into delocalized metrologically useful correlations, enabling robust signal amplification through interference of the scrambled and polarized quantum states. We validate the time-reversal ability via Loschmidt echo measurements and quantify the information scrambling through out-of-time-ordered correlators, establishing the essential quantum resources of our protocol. Our measurements reveal that the sensing sensitivity surpasses the standard quantum limit (SQL) with increasing qubit number, reaching 3.78 in a 9-qubit configuration, compared to the SQL of 3.0. The scheme further exhibits inherent robustness to coherent control errors and probed signal noise. This work demonstrates a readily scalable path toward practical quantum sensing advantages with prevalent experimental platforms.

quant-ph↗

arXiv2025

Search for Light Dark Matter with 259-day data in PandaX-4T

We present a search for light dark matter particles through their interactions with atomic electrons and nucleons, utilizing PandaX-4T data with an effective exposure of 1.04 tonne$\cdot$year for ionization-only data and 1.20 tonne$\cdot$year for paired data. Our analysis focuses on the energy range (efficiency$>$0.01) of approximately 0.33 to 3 keV for nuclear recoils, and from 0.04 to 0.39 keV for electronic recoils. We establish the most stringent constraints on spin-independent dark matter-nucleon interactions within a mass range of 2.5 to 5.0 GeV/$c^2$, spin-dependent neutron-only interactions within 2.0 to 5.3 GeV/$c^2$, and spin-dependent proton-only interactions within 2.0 to 3.8 GeV/$c^2$. Their corresponding limits at 3\,GeV/$c^2$ are $1.1 \times 10^{-43}$, $1.6 \times 10^{-38}$, and $5.6 \times 10^{-37}$\,cm$^2$, respectively. Additionally, our results improve the upper limits on the dark matter-electron scattering cross-section by a factor of 1.5 and 9.3 for heavy and light mediator scenarios respectively within 50 MeV/$c^2$ to 10 GeV/$c^2$, compared with previous best results.

hep-ex↗