arXiv subjects

Yang Zhou

Publications and source records attributed to Yang Zhou.

At least 19 recordsLinked to original sources

arXiv2026

Singular Extremal Solutions on Thin Ellipsoids with Varying Nonlinearities

Let $N=m+1$ and consider the thin ellipsoid \[ \Omega_\varepsilon=\{(y,x_N)\in\mathbb R^m\times\mathbb R:\ |y|^2+\varepsilon^{-2}x_N^2<1\}. \] We prove that in every sufficiently large dimension, for every sufficiently small $\varepsilon>0$, there exists a smooth positive, strictly increasing, strictly convex, superlinear nonlinearity $f_\varepsilon$ for which the extremal solution in $\Omega_\varepsilon$ is an unbounded $H^1_0$ solution. Combining this result with Dancer's thin-domain regularity theorem for the Gelfand nonlinearity $f(t)=e^t$, we obtain on the same sufficiently thin ellipsoids a bounded Gelfand extremal solution and an unbounded extremal solution for another nonlinearity. Thus, in this two-part sense, Br\'ezis' Open Problem~6.1 is resolved in every sufficiently large dimension.

math.AP↗

arXiv2026

Weather-Conditioned Depth Anything

Monocular depth estimation foundation models, such as the Depth Anything series, have achieved remarkable performance across diverse domains. However, they still suffer from critical failures under adverse weather conditions, such as fog, rain, snow, or at night. To address this, we present Weather-Conditioned Depth Anything (DA-W), a framework that explicitly disentangles style from content for weather-robust depth estimation. Specifically, we introduce a Style Filter trained on a curated mix of real and synthetic degradation datasets to extract content-independent, degradation-aware weather embeddings. This style embedding is then injected into the Depth Anything backbone using a parameter-efficient, zero-initialized adapter. Such a lightweight modulation allows a single unified model to robustly adapt to diverse conditions, including fog, rain, snow, and low-light, while avoiding catastrophic forgetting of its core generalization abilities in normal conditions. We train the adapter using a pseudo-label distillation and alignment strategy. Our comprehensive experiments demonstrate that our proposed DA-W achieves state-of-the-art robust depth estimation, improving AbsRel by an average of 3.7% on our curated weather benchmarks, while matching or slightly outperforming performance on standard clean benchmarks. Our project page is available at https://zhaoming-tamu.github.io/WCDA/.

cs.CV↗

arXiv2026

Act More, Decide Less: Skill-Guided Adaptive Action Chunking for Long-Horizon LLM Agents

Large language model (LLM) agents for long-horizon interactive tasks typically follow a ReAct-style protocol, issuing one primitive action per LLM round. While this enables frequent replanning, it is inefficient for long-horizon tasks where many rounds are spent on routine action sequences. A natural alternative is to let the agent emit variable-length action chunks. However, naively training such policies with standard reinforcement learning fails: the agent either collapses to single-action behavior or over-commits to excessively long sequences. Both failures share a common root cause: the inability to learn chunk boundaries. We propose SPACE, which addresses this challenge by distilling chunk-boundary supervision from trajectory-induced programmatic skills. We induce two-level programmatic skills from successful trajectories, where subskill boundaries serve as direct chunk-boundary supervision. This temporal structure is then distilled into a primitive-chunk policy via hybrid on-/off-policy optimization with chunk-aware credit assignment. Experiments on ALFWorld and ScienceWorld show that SPACE improves success rates by 7.0%-31.3% over the strongest baseline in each setting while reducing average LLM decision rounds by up to 78.9%.

cs.LG↗

arXiv2026

Wall-crossing formula and genus-one Virasoro conjecture for Fano complete intersections

The Virasoro conjecture predicts a set of universal relations among all genera Gromov--Witten invariants of any smooth projective variety. The conjecture is well understood for semisimple theories, but remains largely open in the non-semisimple setting. We prove the genus-one Virasoro conjecture on the ambient state space of smooth Fano complete intersections in projective space. For most of these complete intersections, the big quantum cohomology is nowhere semisimple. We also generalize the wall-crossing formula for quasimap invariants with weighted markings to the equivariant twisted setting, allowing descendant insertions at light markings. Together with genus-one quantum Lefschetz for quasimaps with light markings, this wall-crossing formula provides the key bridge from the Gromov--Witten theory of the complete intersection to the semisimple equivariant twisted theory of the projective space.

math.AG↗

arXiv2026

Uniqueness for the Degenerate Monge-Amp\`ere Equation on Arbitrary Bounded Convex Domains

Let $n\ge2$ and let $\Omega\subset\mathbb R^n$ be an arbitrary bounded open convex set. The author prove that, for $p>n$, the Dirichlet problem \[ \det D^2u=(-u)^p\quad\text{in }\Omega, \qquad u=0\quad\text{on }\partial\Omega, \qquad u>0\quad\text{in }\Omega \] has at most one convex Alexandrov solution. The proof is based on the affine behavior of the Monge--Amp\`ere energy and on a power-concavity property of the $L^{p+1}$ mass along the Legendre path connecting two solutions. At the homogeneous exponent $p=n$, the same argument shows that any two nonzero solutions with the same coefficient are positive multiples of one another.

math.AP↗

arXiv2026

ES-VP : Energy-Shaped Dynamic Visual Prompting for Efficient Model Adaptation

Visual prompting (VP) has emerged as a parameter-efficient method for adapting pre-trained models to downstream tasks. However, existing approaches encounter a trade-off between flexibility and efficiency. Some methods apply a fixed prompt to all images, ignoring individual image characteristics, while others introduce auxiliary networks to generate diverse prompts. Although the latter can improve performance, it also significantly increases parameter usage and the potential for overfitting to specific datasets. Furthermore, the auxiliary networks, combined with inherent biases in pre-trained models, limit scalability and generalization. In this paper, we propose Energy-Shaped Visual Prompting (ES-VP), a novel approach that generates image-specific prompts using low-rank initialization and energy-guided dynamic adaptation, achieving superior performance with fewer parameters compared to single-prompt methods. ES-VP directly utilizes the pre-trained model for adaptive prompt generation, ensuring both parameter efficiency and improved generalization. Extensive experiments conducted on five architectures across fifteen datasets demonstrate that ES-VP consistently outperforms current state-of-the-art (SOTA) single and diverse VP methods. For instance, using the CLIP architecture across four datasets, ES-VP outperforms the SOTA method DAM-VP by an average of 2.6\% in accuracy while utilizing 590$\times$ fewer VP parameters, thereby establishing a new benchmark for efficient and generalizable model adaptation.

cs.CV↗

arXiv2026

When Vision Becomes Text: Visual Token Pruning via Cross-Modal Residual Guidance in VLMs

Abundant visual information strengthens vision-language model (VLM) perception, yet massive visual tokens raise inference costs. Existing visual token pruning methods rely on similarity-based guidance, which exploits pairwise text-vision and vision-vision token correlations for compression. However, such methods only capture local layer-level signals and overlook the whole inference process in VLM. In this paper, we revisit VLM inference and present a new efficient guidance scheme that complements similarity-based guidance. In particular, we identify a key observation: as LLM layers deepen, text tokens continuously aggregate visual information via self-attention and progressively absorb partial visual content into textual representations. To quantify this phenomenon, we propose Cross Modal Absorption (CMA) from a geometric representation perspective to measure how much visual information is absorbed by text, revealing that more visual tokens in deeper layers can be approximately explained by the text subspace. We accordingly propose Cross Modal Residual (CMR). It projects visual tokens onto the text subspace via Tikhonov regularized least squares and exploits reconstruction residuals to quantify visual information that cannot be explained by text. Finally, based on CMR, we present SIEVE, a training-free visual token compression method that combines CMR, text-attention relevance, and residual-space diversity to retain task-relevant and complementary tokens. Experiments on diverse VLM architectures verify the effectiveness of SIEVE. For instance, on LLaVA-NeXT-7B, SIEVE keeps only $11.1\%$ of visual tokens while preserving $97.5\%$ of the original average performance, achieving $3.62\times$ prefill speedup, $2.49\times$ end-to-end speedup, and a $6.02\times$ KV-cache reduction.

cs.CV↗

arXiv2026

Auditable AI-Assisted Research Writing: An Engineering Discipline with Pre-Registered Process Observation

Language models now draft, classify and criticise inside research production, yet the artifacts they help produce carry little accountable history. Rather than detecting machine involvement afterwards, we specify an auditability discipline built at production time: git sealing with an anchor lineage, hash-bound provenance, red-line gates that refuse non-compliant artifacts and log every refusal, cross-model role separation, and programmatic assembly from registered sources. Adherence is instrumented by metric cards, each carrying a pre-registered blind spot and evidential standing, frozen before the prospective case it observes. In that case the observed project's pre-registered confirmatory test was executed under seal and returned No-Go, and that project's frozen stopping rule halted the work, against its own operators. A lower-graded retrospective case covers families whose machinery predates the protocol. Current observations are provisional; we release a package from which a third party can recompute every primary metric.

cs.DL↗

arXiv2026

REVEAL: A Rubric-Guided Agent for Explicit Evidence Sufficiency Verificationin Long-Video Question Answering

Recently, retrieval-augmented and memory-augmented methods have emerged as two promising paradigms for long-video question answering. However, existing methods typically rely on rigid, fixed-length temporal chunking (e.g., 10s) and static offline memory banks, which not only fragment coherent continuous events but also fail to adapt during real-time reasoning. Moreover, whether using multi-scale summaries or multimodal knowledge graphs, current approaches prioritize retrieval relevance while overlooking evidence sufficiency, often stopping to answer once only semantically relevant clues are retrieved, even when key temporal, causal, or fine-grained action evidence is still missing. To tackle these challenges, we propose REVEAL, a rubric-guided agent framework. As a foundation, we introduce an adaptive visual-similarity-based preprocessing pipeline that groups visually coherent adjacent frames into natural event units to construct an offline-online video memory---capturing global video context offline while dynamically maintaining question-conditioned memory online. Built upon this structured memory, REVEAL uses an automatically constructed rubric library to explicitly verify whether retrieved evidence satisfies sufficiency criteria, pinpoints missing clues upon verification failure, and directs targeted re-retrieval for complementary information. Without any extra training, REVEAL consistently outperforms both closed-source and open-source state-of-the-art methods across extensive experiments. These results show that explicitly verifying evidence sufficiency, rather than stopping at semantic relevance, retrieves the decisive clues that prior methods miss and yields more reliable long-video reasoning.

cs.CV↗

arXiv2026

LoRCA: LoRA Cycle Adaptation for Histology to HiP-CT Translation with DINOv3

Hierarchical Phase-Contrast Tomography (HiP-CT) is a synchrotron based X-ray imaging technique that enables non-destructive, volumetric imaging of intact organs with multi-resolutions bridging 20 $\mu m$/voxel for whole organs to near-cellular resolution ($\sim$0.8 $\mu m$/voxel) in local regions. This offers the opportunity to bring volumetric whole-organ context to histology. However, nonlinear registration between H\&E histology and HiP-CT volumes is challenging due to the differences in feature representations of different colour spaces. Synthesis-before-registration methods have shown strong results in histology-to-MRI and histology-to-CT alignment. However, existing approaches either rely on manual anatomical contours or are trained from scratch without semantic constraints, limiting their generalisability to soft tissue organs and novel modalities. We propose LoRCA (LoRA Cycle Adaptation), a cycle consistent style translation framework built on a shared frozen DINOv3 with modality-specific LoRA adapters, learning modality-specific representations that are decoded and adversarially trained. LoRCA enables structure-preserving translation without requiring paired training data. The frozen backbone is intended to be a structural anchor that prevents content drift by preserving pretrained semantic-extraction capability. We evaluate translation quality using Fr\'echet Inception Distance (FID) and structural fidelity via mutual information and Canny edge preservation. LoRCA outperforms CycleGAN in both translation quality and structural consistency. As a preliminary indicator of downstream registration utility, we find that style-translated images yield increased feature correspondences under MatchAnything on manually aligned HiP-CT and histology test pairs, suggesting that LoRCA-style translation is a promising step towards 2D histological sections to 3D HiP-CT volumes registration.

eess.IV↗

arXiv2026

CommBench: Can LLMs Write Correct and Efficient GPU Communication Code?

Training and serving large language models (LLMs) rely heavily on high-performance GPU communication, yet implementing efficient GPU communication primitives requires deep expertise in GPU architectures, networking hardware, and distributed communication patterns, making them particularly challenging for code generation models. We present CommBench, a comprehensive benchmark for GPU communication programming, consisting of over 100 expert-curated tasks spanning point-to-point communication, collective operations, expert-parallel communication, compute--communication fusion, and communication utility functions, with reference implementations either written by GPU communication experts or distilled from production codebases. We further introduce a cheat-resistant evaluation framework that automatically compiles, executes, and validates generated code on multi-GPU systems, and a unified metric that jointly measures functional correctness and communication performance. Evaluating leading frontier and open-source code generation models on both intra-node NVLink and inter-node RDMA platforms reveals that even the strongest model, GPT-5.5, correctly implements and achieves competitive performance on only 30.7\% of the benchmark tasks. Our results expose a substantial gap between current LLMs and expert-written GPU communication code, establishing CommBench as a challenging benchmark for advancing AI-assisted systems programming.

cs.DC↗

arXiv2026

Deferred Exposure of Future Trajectories for Verifiable Reasoning in Autonomous Driving VLMs

Recent Vision-Language-Action (VLA) models for autonomous driving (AD) increasingly utilize chain-of-thought (CoT) supervision to enhance the reasoning capabilities of their Vision-Language Model (VLM) components, yet existing annotation pipelines commonly expose the teacher model to the logged ground-truth (GT) future trajectory. We empirically show that this induces trajectory anchoring bias: teacher models rationalize the revealed outcome rather than infer a decision from scene evidence, producing less causally faithful CoTs and substantially more severe hallucinations, especially in causally challenging scenes. Removing the GT trajectory eliminates this shortcut, but open-ended trajectory generation entangles high-level decision-making with precise geometric synthesis and low-level dynamics. To make trajectory-level driving decisions verifiable without requiring open-ended trajectory synthesis, we introduce Autonomous-Driving Multiple-Choice Question (AD-MCQ), which casts planning as selection among explicit trajectory candidates. Taking this a step further, we propose Deferred Exposure of Future Trajectories for RLVR (DEFT-RLVR) to transform future trajectories from pre-decision anchors into post-decision verification targets. Experimental results show that DEFT-RLVR improves AD reasoning while preserving or even enhancing general visual capabilities. With VLM-only inference and controllable difficulty through candidate construction, AD-MCQ provides a flexible, scalable, and extensible foundation for future research on verifiable AD reasoning.

cs.AI↗

arXiv2026

SpatialCLI: Learning to Reason With Spatial Tools, Then Without Them

Vision-language models (VLMs) are increasingly used in embodied agents to interpret visual inputs, reason about spatial relationships, and make task-level decisions based on that reasoning. However, a fundamental capability mismatch remains: general VLMs can reason about the overall task but often miss the visual details that determine success, while specialist vision models can capture those details but cannot translate them into task-level decisions. In this work, we propose SpatialCLI, a framework that teaches VLMs to reason with spatial tools and progressively internalize the specialist perceptual capabilities they provide. SpatialCLI proceeds in three stages: (1) Call exposes specialist vision models as spatial tools to augment the VLM's perception; (2) Learn uses Cold-Start SFT and agentic RL to improve tool use; and (3) Internalize verbalizes successful tool-use trajectories to internalize specialist perceptual capabilities. We further introduce SpatialCLI-Bench, a 516-example benchmark for compositional perception across localization, segmentation, depth, and pose. On MindCube, SpatialCLI raises Qwen3-VL-8B-Instruct from 29.3% to 84.6% with tools, surpassing GPT-5.6 Sol with tools (72.1%), while retaining 73.8% without tools after internalization.

cs.AI↗

arXiv2026

Qwen-Audio-3.0-TTS: Freely Controllable and Highly Robust Speech Synthesis with Multi-Stage Training Paradigm

In this report, we present Qwen-Audio-3.0-TTS, a production-oriented speech synthesis system that jointly advances content consistency, speaker similarity, prosodic naturalness, audio quality, controllability, multilingual coverage, efficiency, and robustness. It combines a 12.5~Hz low-frame-rate speech tokenizer for reduced inference latency with a five-stage progressive training paradigm for coordinated language model (LM) and flow-matching model (FM) optimization. The model provides production-level control through free-style natural-language instructions and fine-grained inline tags, while supporting 16 languages, 20 Chinese dialect regions, one-pass long-form synthesis up to 3 minutes, and robust generation from noisy, reverberant, or unclear reference speech. Across SEED-TTS-Eval, CV3-Eval, instruction-following, long-form, and acoustic-robustness evaluations, Qwen-Audio-3.0-TTS achieves state-of-the-art performance on many reported dimensions or the strongest aggregate results. It also ranks first on the independent Artificial Analysis Text-to-Speech Leaderboard. These results establish Qwen-Audio-3.0-TTS as a strong foundation for production-level speech synthesis.

eess.AS↗

arXiv2026

Sharp One-bubble Critical-Point Stability and Global Compactness for the Sobolev Trace Inequality

Let $n\ge3$ and $1<p<n$. We first prove the local trace analogue of the sharp one-bubble critical-point stability theorem of Liu and Zhang~\cite{LiuZhang2025}: near a positive trace-bubble, the Euler--Lagrange residual controls the gradient distance to the normalized trace-bubble manifold with the sharp power $\max\{1,p-1\}$. Then, we establish a Struwe-type compactness theorem for the critical trace functional, which gives the trace counterpart of the Mercuri--Willem decomposition~\cite{MercuriWillem2010}. Combining Struwe-type compactness with the local stability estimate yields a sharp quantitative one-bubble critical-point stability theorem.

math.AP↗

arXiv2026

Fast Wave-optics Rendering of Multiplane Images for 3D Holographic Displays

Recent advances in neural rendering have unlocked unprecedented capabilities in 3D reconstruction and novel view synthesis, giving rise to applications such as virtual fly-throughs of a 3D scene reconstructed from a set of sparse, casually captured images. However, these renderings are viewed on a computer screen or conventional VR headsets as 2D images, greatly limiting the perceptual realism and immersiveness of such experiences. The rapid development in novel 3D scene representations calls for dedicated rendering algorithms that convert these readily-available 3D contents into formats that are compatible with emerging 3D display technologies, such as holographic displays. In this paper, we propose a wave-optics rendering pipeline that works with multiplane images (MPIs) for efficient and high-quality hologram synthesis. Our MPI-based computer-generated holography algorithm greatly outperforms state-of-the-art primitive-based CGH algorithms in terms of runtime, achieving speedups up to 250,000x while achieving comparable image quality, and significantly outperforms conventional layer-based CGH algorithms in terms of image quality. We validate our method extensively on a wide variety of 3D scene datasets both in simulation and through experimentally captured results, showing exceptional 3D focal stack and 4D light field reconstruction performance without sacrificing efficiency.

cs.GR↗

arXiv2026

Sharp Gradient Stability for the Sobolev Trace Inequality

Let $n\ge3$ and $1<p<n$. We prove a quantitative stability estimate for the critical Sobolev trace inequality on the upper half-space. More precisely, the Sobolev trace deficit controls the $\max\{2,p\}$-th power of the gradient distance to the manifold of trace bubbles. A central part of the proof is the spectral nondegeneracy of the trace bubbles: the first two eigenspaces of the linearized weighted Steklov problem are exactly the amplitude, dilation, and tangential translation modes.

math.AP↗

arXiv2026

Newton-Based Mixed Precision Iterative Refinement for Large-Scale Sparse Continuous-Time Algebraic Riccati Equations

We propose a Newton-based mixed precision iterative refinement framework for solving large-scale sparse continuous-time algebraic Riccati equations (CAREs). The framework computes the initial approximation and the inner Lyapunov correction equations in lower precision, while evaluating residuals and updating the solution in higher precision. To handle indefinite residuals and Newton correction terms in low-rank form, we introduce factor decomposition procedures with truncation strategies that preserve positive semidefiniteness and control rank growth. A first-order rounding error analysis derives a residual recurrence for the refinement process and relates stable mixed precision refinement to a Lyapunov operator conditioning threshold governed by the unit roundoff of the lower precision inner solves. We then present a concrete ADI-based realization, using NLR-ADI for the initial CARE approximation and LR-ADI for the inner Lyapunov correction equations. Compared with dense Lyapunov correction implementations, this realization reduces the main computations to shifted linear solves and low-rank factor operations, and we provide a solver-dependent complexity analysis. Numerical experiments on dense CARE over a range of condition numbers illustrate the conditioning effect described by the error analysis, and experiments on large-scale sparse CAREs show that the mixed precision framework is faster than the full double precision implementation while maintaining the same level of accuracy.

math.NA↗