Searcharxiv⌕ Search

arXiv subjects

Rui Guo

Publications and source records attributed to Rui Guo.

At least 19 recordsLinked to original sources

Visual Evidence Under Cross-Examination: Evaluating and Controlling Decision-Level Evidence Use in Vision-Language Models

Vision-language models increasingly reason through crops, regions, and tool-produced observations. Yet an observation can influence the answer without benefiting the candidate it supports. We study candidate-bound visual contribution: valid evidence should help, invalidating its supporting relation should remove its additional effect, and valid rebinding should redirect that effect to the newly supported candidate. We introduce CROSS-Bench, a benchmark of 28,000 decision problems, with matched invalidation and rebinding tests on a dedicated evaluation subset. Our RIVET interface preserves evidence identity and uncertainty, composes a candidate-conditioned response, and separately controls its strength. Shared-evidence experiments show that task accuracy and evidence ownership can diverge. Under matched capacity and training, RIVET increases normalized effect transfer from 0.512 to 0.651 where clean evidence has a positive effect. The advantage persists on common evaluation examples and across repeated decision-layer fits. With evidence predicted from raw inputs, RIVET improves CROSS-Bench accuracy by an average of 5.70 pp across four frozen backbones, relative to the same models without auxiliary evidence. These results separate the utility of visual evidence from the candidate-specific destination of its effect.

cs.CV↗

Learning to Replace MCMC in Split-Gibbs Diffusion Posterior Sampling via Deep Unfolding

Split Gibbs sampling enables diffusion posterior inference for general nonlinear inverse problems by decoupling prior and likelihood computations, allowing a pretrained diffusion prior to be reused across measurement models. However, its likelihood update often relies on iterative MCMC, which can hinder parallelization, require algorithm-specific tuning, and incur substantial computational cost. In this work, we propose a learning-based framework to replace this MCMC step by reformulating both Gibbs updates as Gaussian denoising problems and implementing them through ODE diffusion. The prior step reuses a pretrained denoiser, while the likelihood denoiser exploits known likelihood structure through a lightweight deep-unfolded network. Experiments on nonlinear phase retrieval demonstrate the effectiveness of the proposed method as an alternative to MCMC-based split Gibbs at lower likelihood-update cost.

eess.SP↗

Interactions between rarefaction waves and dispersive shock waves in the Gerdjikov--Ivanov equation with non-convex hydrodynamics

This paper systematically investigates admissible configurations of the interaction between a rarefaction wave (RW) and a dispersive shock wave (DSW) by constructing a two-step piecewise constant initial condition in the Gerdjikov--Ivanov (GI) equation with non-convex hydrodynamics. Owing to the two-valued mapping associated with the Riemann invariants, the GI equation also supports contact DSWs (CDSWs), which are included in the interaction analysis. Using Whitham modulation theory, we elucidate the self-similar descriptions of the incoming waves, derive the boundary matching conditions, and obtain analytical expressions of the full evolution before, during, and after the interaction through generalized hodograph transformation. The results show that the interaction of a RW with either a DSW or a CDSW can exhibit two distinct scenarios: in one case, the two waves exchange spectral parameters after the interaction and fully separate, propagating independently with modified phases; in the other case, the wave structures merge upon interaction and subsequently evolve into either a soliton train or a small-amplitude harmonic wave for a classical DSW, and into an algebraic soliton train for a CDSW. The theoretical results are in good agreement with numerical simulations. This work can provide theoretical support for wave interaction phenomena in non-convex dispersive systems.

math-ph↗

An adaptive weighted extrapolation neural network for dispersive shock waves generated by square-root initial condition of the KdV equation

Simulating dispersive shock waves (DSWs) using physics-informed neural networks (PINNs) presents significant numerical difficulties. In particular, the square-root initial condition exhibits singularity near the origin, making it difficult to fit accurately. This initial fitting error is amplified through nonlinear evolution and gradually accumulates during extrapolation, imposing high demands on the long-term extrapolation capability of numerical methods. Accordingly, this paper proposes an improved physics-guided multistage neural network (IPgMSNN) framework. IPgMSNN is built upon the original PgMSNN framework, with its core innovation focused on the third-stage training strategy. Specifically, online fine-tuning and a weighted target mechanism are introduced, which effectively suppress error accumulation during long-term extrapolation. Numerical experiments systematically evaluate IPgMSNN from three perspectives: forward problem solving, model stability, and parameter inversion. Experimental results demonstrate that IPgMSNN effectively captures high-frequency wavefront details, maintains long-term extrapolation stability, and achieves high-precision parameter inversion, providing an efficient solution for deep learning-based simulation of dispersive nonlinear systems.

math-ph↗

LV-CARE-Diff: A Conditional Anatomy-Aware Diffusion Model for Left Ventricular Shape Reconstruction and Function Quantification from Ultra-Sparse Cine Slices

Left ventricular functional quantification is an essential examination and is routinely performed using cardiovascular magnetic resonance (CMR) cine imaging. However, conventional CMR cine protocols require the acquisition of multiple short-axis (SAX) slices to cover the entire left ventricle (LV) along with two long-axis (LAX) slices, which is time-consuming and places a considerable burden on patients who are unable to sustain repeated breath-holds, limiting its suitability for large-scale early screening. In this study, a Conditional Anatomy-Aware Diffusion Model (LV-CARE-Diff) was developed using a coarse-to-fine strategy to reconstruct the complete LV shape from ultra-sparse cine slices, namely three short-axis and two long-axis slices, with the aim of accelerating CMR cine examination. LV-CARE-Diff employs a 3DUNet to generate a coarse initial shape, which is subsequently refined through a residual diffusion model. A condition-guided input incorporating imaging plane orientation and positional metadata was constructed to enable spatial awareness, and a multi-objective training strategy jointly supervising shape, function, and anatomy was incorporated to guide high-fidelity reconstruction. LV-CARE-Diff was compared against a standalone 3DUNet, a standalone diffusion model, and a 3D UNet with diffusion-based refinement. Testing results indicated that complete LV shape could be robustly reconstructed by all deep learning models, with the highest reconstruction performance achieved by the proposed LV-CARE-Diff. Deep learning models reconstructing LV shape from sparse cine slices preserved 96% of functional quantification accuracy while reducing imaging time by 73%. The LV-CARE-Diff framework established in this study enables ultra-sparse cine acquisition to shorten CMR examination duration without sacrificing quantitative functional accuracy.

physics.med-ph↗

PatchKV: Efficient KV Cache Recovery for Dynamically Edited LLM Contexts

Long-running LLM agent workflows often revise interior context spans while retaining long suffixes. Although suffix tokens remain unchanged, altered causal histories and rotary positions prevent exact reuse of their offloaded key-value (KV) states. Full suffix recomputation wastes prefill work, while indiscriminate reuse propagates stale states and full-precision restoration adds data movement. We present PatchKV, a profile-guided recovery system for suffix-preserving revisions. PatchKV decomposes adjacent context versions into an exact prefix, an updated span, and an aligned suffix. It predicts an edit-local dirty region using an offline length-conditioned drift model, augments this region with sparse nonlocal blocks selected from stored attention, and block-rounds their union into a fixed repair set. The remaining suffix blocks are restored from CPU memory using frozen per-block precision tags and a fused path for dequantization, RoPE correction, and KV-page placement. Across three models and three long-context question-answering workloads, PatchKV achieves a $2.51$-$3.85\times$ speedup in mean resume time-to-first-token over full suffix recomputation and a $1.26$-$2.06\times$ speedup over CacheBlend, while matching or exceeding CacheBlend's F1 score in six of nine settings and remaining within 1.36 points in the others.

cs.DC↗

AsymSpec: Efficient Cloud-Edge Speculative Decoding over Asymmetric Networks

Cloud-edge speculative decoding places a lightweight draft model at an edge gateway and a higher-quality target model in the cloud, but inserts communication into every speculative block. Under a constrained uplink, candidate messages may queue while the verifier is idle. Stop-and-wait scheduling leaves edge compute underutilized; optimistic same-request runahead can waste work when a rejection or an unexpected bonus token invalidates dependent drafts. We present AsymSpec, which addresses uplink-gated verification and invalid dependent work with two corresponding mechanisms. Its asymmetric verification protocol keeps the common-path acceptance upload compact and moves richer, rejection-only correction information to the downlink. A total-variation (TV) certificate for the residual distribution determines whether a small target top-K response suffices; if not, the protocol progressively escalates through proposal-based exact recovery before falling back to the full distribution. Its confirmed-prefix pipeline exposes only independent, valid requests to the edge scheduler and lets the cloud re-batch arrived blocks, hiding verification waits when another confirmed-prefix request is ready without using same-request runahead. Across three draft-target pairs, two workloads, and three asymmetric network profiles, our end-to-end evaluation shows that AsymSpec delivers 2.82-28.03$\times$ the output-token throughput of the strongest baseline.

cs.DC↗

From Convex to Non-convex: Evolution of Rarefaction-dispersive shock interactions and the Influence of Non-convexity

In this paper, we focus on the analytical description of the interaction between a rarefaction and dispersive shock wave across both convex and non-convex cases, with particular attention to the effect of the non-convexity, within the framework of the Gardner equation. For convex structures, internal oscillations degenerate into small amplitude harmonic waves or a modulated soliton train as t tends to infinity, accompanied by either a retained rarefaction part, or a new dispersive shock wave emanating from it. Taking into account the non-convexity, when alpha>0, we find that kinks either remain non-participating in the interaction at all, or only act to switch polarities of convex structures. As for alpha<0, we solve the Gardner-Whitham equations with three varying Riemann invariants, to analyze the rarefaction-contact dispersive shock interaction where the only possible configuration is that the rarefaction wave is on the left. It is demonstrated that the rarefaction wave will be completely drawn into the interaction region, with a changed contact dispersive shock wave escaping from the left. And internal oscillations eventually degenerate into an asymptotic algebraic soliton train as t tends to infinity. In addition, we study the interaction between a rarefaction wave and composite structure consisting of the contact and classical dispersive shock parts under two distinct situations: (i) For the composite structure-rarefaction interaction, the contact part remains inactive in the interaction, and internal oscillations ultimately degenerate into a contact dispersive shock wave. (ii) For the rarefaction-composite structure case, the entire composite structure participates in the interaction, during

math-ph↗

The co-directional overtaking collision problem between a dispersive shock wave and a rarefaction wave for the Hirota equation

In this paper, we mainly investigate the overtaking collision problem between a dispersive shock wave (DSW) and a rarefaction wave (RW) propagating in the same direction in the defocusing Hirota equation framework. Based on the Whitham theory, the zero-phase and single-phase modulation systems corresponding to the defocusing Hirota equation are given, along with explicit expressions of Riemann invariants. For step-type initial conditions with left-side DSW and right-side RW propagating identically, the global initial configuration is constructed.~The modulation solution within the nonlinear collision domain is obtained via the generalized hodograph transformation and solutions of the Euler-Poisson-Darboux equation. Thus, by matching the Riemann invariants at the boundaries of DSW and RW, we can provide a detailed analytical description for the dynamical behaviors of the collision across all evolutionary stages. The accuracy of theoretical predictions is verified by comparison with direct numerical simulations.

math-ph↗

Bayesian Signal Component Decomposition via Diffusion-within-Gibbs Sampling

In signal processing, the data collected from sensing devices is often a noisy linear superposition of multiple components, and the estimation of components of interest constitutes a crucial pre-processing step. In this work, we develop a Bayesian framework for signal component decomposition, which combines Gibbs sampling with plug-and-play (PnP) diffusion priors to draw component samples from the posterior distribution. Unlike many existing methods, our framework supports incorporating component-wise model-driven and data-driven priors into diffusion models in a unified manner. Moreover, the proposed posterior sampler allows component priors to be learned separately and flexibly combined for different decomposition tasks at inference time. Under suitable assumptions, the proposed Diffusion-within-Gibbs (DiG) sampler provably produces samples from the posterior distribution. We also show that DiG can be interpreted as an extension of a class of recently proposed diffusion-based samplers, and that, for suitable classes of sensing operators, DiG better exploits the structure of the measurement model. Numerical experiments demonstrate the superior performance of our method over existing approaches.

eess.SP↗

IP-SAM: Rethinking Prompt-Conditioned Segmentation for Prompt-Absent Deployment

Prompt-conditioned foundation segmenters have emerged as a dominant paradigm for image segmentation, where explicit spatial prompts(e.g., points, boxes, masks) guide mask decoding. However, many real-world deployments require fully automatic segmentation, creating a structural mismatch: the decoder expects prompts that are unavailable at inference. Existing adaptations typically modify intermediate features, inadvertently bypassing the model's native prompt interface and weakening prompt-conditioned decoding. We propose IP-SAM, which revisits adaptation from a prompt-space perspective through prompt-space conditioning. Specifically, a Self-Prompt Generator (SPG) distills image context into complementary intrinsic prompts that serve as coarse regional anchors. These cues are projected through SAM2's frozen prompt encoder, restoring prompt-guided decoding without external intervention. To suppress background-induced false positives, Prompt-Space Gating (PSG) leverages the intrinsic background prompt as an asymmetric suppressive constraint prior to decoding. Under a deterministic no-external-prompt protocol, IP-SAM achieves state-of-the-art performance across four camouflaged object detection benchmarks with only 21.26M trainable parameters. Furthermore, the proposed conditioning strategy generalizes beyond COD to medical polyp segmentation.

cs.CV↗

X-Foresight: A Joint Vision-Action Causal Forecasting Network via Predictive World Modeling

Physical world knowledge resides mainly in videos. Equipping Vision-Language-Action (VLA) models with such knowledge is fundamental for safe and generalizable planning. Predictive world modeling enables VLA to internalize physical dynamics and long-term causality by predicting future video from past observations. However, naive next-frame prediction faces two challenges: 1) unlike semantically distinct text tokens, video tokens are low-entropy and redundant, causing prediction to degenerate into trivial extrapolation. 2) world modeling poses a temporal dilemma: dense prediction captures instantaneous dynamics, but cannot efficiently model long-horizon causality. To learn world knowledge effectively, we introduce X-Foresight, a predictive world model integrated directly into the VLA architecture to jointly learn world modeling and real-time action control. At its core lies a long-horizon chunk-wise auto-regressive strategy that addresses both challenges: by predicting semantically distant chunks rather than adjacent frames, it escapes trivial extrapolation, while preserving dense intra-chunk frames for instantaneous dynamics and sparse inter-chunk transitions for long-term causality. A curriculum learning schedule progressively extends prediction horizons and stabilizes long-horizon training. To capture long-term causality effectively, we present temporal importance sampling, which concentrates supervision on safety-critical chunks identified by ego-motion and behavioral signals. We further delegate photorealistic synthesis to a diffusion-based multi-view renderer, improving photorealistic appearance. Comprehensive experiments demonstrate that X-Foresight significantly outperforms VLA baselines in planning performance while maintaining strong generative fidelity, establishing a robust paradigm for world-knowledge-driven autonomous systems.

cs.CV↗

X-Mind: Efficient Visual Chain-of-Thought via Predictive World Model for End-to-End Driving

Predicting future states is essential for autonomous agents, yet current Vision-Language-Action (VLA) models fundamentally lack this capability, relying instead on reactive perception-action mapping. While integrating Predictive World Models (PWMs) addresses this gap, existing approaches either incur prohibitive cascaded latency or act as shallow terminal tasks that fail to deeply embed forward-looking reasoning. To endow VLA models with this reasoning capability, we propose X-Mind. Rather than treating PWMs as an external auxiliary module, this framework internalizes them as the Visual Chain-of-Thought (Visual CoT). By enforcing a world rollout prior to action, the model is constrained to imagine future evolution first, yielding a driving policy that is robustly grounded in environmental dynamics and aware of the future consequences its actions will unfold. The challenge here is efficiency, and we tackle it on two fronts. First, we introduce a compact representation of visual thinking: an abstract sketch that fuses a Bird's-Eye-View (BEV) layout with abstract driving priors (e.g., navigation intents and traffic rules). Rather than rolling out dense future frames, the model reasons over this sketch as a mental canvas; aided by a Deep Compression Autoencoder (DC-AE), a 12-frame future rollout is reduced to merely 96 tokens, alleviating the long-context computational bottleneck. Second, to accelerate generation further, we propose a recurrent block diffusion scheme that unrolls the denoising steps across the layers of the large drive model, folding iterative refinement into the backbone's one forward pass. Trained and validated on large-scale real-world data, X-Mind achieves competitive end-to-end driving performance, which makes it a highly practical, low-latency solution that successfully deploys large-scale cognitive reasoning directly onto resource-constrained vehicle platforms.

cs.CV↗

TV-Regularized Frequency-Domain Full-Waveform Inversion for Single-Sided Linear Ultrasound Array Data

Quantitative speed-of-sound (SoS) and attenuation of tissues are closely related to pathology; however, conventional B-mode images are limited to qualitative visualization. Existing ultrasound full-waveform inversion (FWI) methods for quantitative SoS reconstruction are primarily developed under double-sided or ring-shaped arrays, which limits their applicability to widely adopted routine clinical acquisitions. In this work, we develop a frequency-domain, total variation (TV)-regularized FWI framework tailored for single-sided linear ultrasound arrays, which enables quantitative reconstruction of SoS maps using standard clinical probes. To address the severe ill-posedness and computational challenges in this setup, efficient forward modeling, fast gradient evaluation, ADMM-based optimization, and multi-GPU parallelization are integrated into the inversion framework. Numerical experiments in a thyroid cyst imaging scenario demonstrate that the proposed method reconstructs the SoS of both simple (fluid-filled) and solid cysts with improved visual and quantitative performance compared to conventional FWI. Additional 2D and 3D simulations across different target and array apertures further elucidate the capabilities and limitations of single-sided ultrasound FWI.

eess.SP↗

The Local Tremaine-Weinberg Method for Galactic Pattern Speed: Theory and its Application to IllustrisTNG

The Tremaine-Weinberg (TW) method and its variations provide the most direct means to measure the pattern speeds of galactic bars. We establish a unifying framework by deriving an integral form of the continuity equation over an arbitrary closed loop. This naturally defines a local pattern speed for any chosen region in a galactic disk (including bars and spirals). We demonstrate that this intuitive formalism recovers all standard variants of the TW method as special cases corresponding to specific choices of the integration loop. In this paper, we validate this framework and demonstrate its diagnostic power. By applying it to a diverse set of test cases from the TNG50 simulation, including face-on prototype barred galaxies and highly constrained Mock Milky Way standard configurations, we show that this formalism accurately recovers both constant global pattern speeds and radially varying profiles. Rather than relying on rigid geometric approximations, our method naturally differentiates coherent solid-body rotators (bars) from spirals. Our results validate that this unified integral framework provides a robust, geometrically flexible, and practically extensible tool for decoding complex dynamics of galactic structures.

astro-ph.GA↗

Why Are Some Optically Red Spirals NUV-r Blue?

To understand the complicated formation processes of disk galaxies, we carry out a comparative study for NUV-r blue and red spiral galaxies drawn from a parent sample of u-r red spirals with $M_{*} > 10^{10.5} M_{\odot}$ at 0.02 < z < 0.07, based on the optical data from the Sloan Digital Sky Survey (SDSS) and the ultraviolet (UV) data from the Galaxy Evolution Explorer (GALEX). The analyses of the images and surface brightness profiles in the NUV and optical bands show that the differences between NUV-r blue and red spirals mainly occur in the outer disks (1-3 $R_{\rm e}$), and the contrast in NUV band is much larger than that in the optical bands. Both the positions on the star formation main sequence diagram and the NUV-r color profiles suggest that NUV-r red spirals have been fully quenched, whereas NUV-r blue spirals host quenched bulges and inner disks, as well as star-forming outer disks. Particularly, the disk mass-size relations indicate that, at a given disk mass, NUV-r blue spirals possess larger optical disks than NUV-r red spirals, by a factor of $\sim 1.20$. The environments and optical morphologies are consistent with the scenario that NUV-r blue spirals obtained fresh fuel for star formation either by interacting or merging with gas-rich galaxies or through accreting surrounding HI gas.

astro-ph.GA↗

Physics Informed Deep Unfolded Full Waveform Inversion for Edema Detection

Edema is a potential indicator of underlying pathological changes. However, its low-contrast signature is often masked in conventional B-mode imaging by strong scatterers, making reliable detection challenging. Ultrasound (US) provides a non-invasive, non-ionizing, and cost-efficient imaging option that is widely used. Conventional techniques, which rely on beamforming, often lack sufficient physical interpretability. Quantitative US (QUS) can estimate physical properties such as the speed of sound (SoS) and density by solving a physics-based inverse problem directly on the measured US wavefields, i.e., the raw per-element channel data (CD), to recover their spatial distribution. However, state-of-the-art physics-based inversion methods, including full waveform inversion (FWI) and model-based quantitative radar and US (MB-QRUS), are computationally intensive and susceptible to local minima, which constrains their clinical utility. We introduce deep unfolded FWI (DUFWI), a physics-faithful unfolded iterative inversion method that exhibits FWI-like refinement behavior while learning the update rule from data, requiring only a small number of iterations for real-time SoS reconstruction. Across both simulated datasets and hardware measurements acquired with a Verasonics US system, the DUFWI significantly outperforms classical FWI and MB-QRUS in reconstruction quality while maintaining high computational efficiency. These results demonstrate real-time edema diagnosis in both simulation and hardware experiments, with phantom-based validation using cylindrical rods, supporting practical deployment under typical US imaging setting.

eess.SP↗

Optical dispersive shock waves of initial pulses in optical fibers with high-order dispersion and quintic nonlinearity effects

This paper probes the dispersive shock waves (DSWs) theory in nonlinear optical systems through Whitham modulation theory for the high-order Chen-Lee-Liu (HOCLL) equation. We systematically derived the one-phase periodic solutions and the corresponding Whitham equations. For all feasible initial discontinuous conditions, we delineate a classification of wave structures during the evolutionary process by virtue of the initial distribution of Riemann invariants, including both convex and non-convex cases. In this classification, we find that the evolved wave structures in non-convex cases incorporate an additional and more complex region-contact DSW region, compared with those in convex cases. So we analyze the propagation behavior of this region. Additionally, we also take into account the problem that the initial wave at the instant of wave breaking approximated by the cubic root function, and elaborately analyze the propagation of photons in optical fibers under the effects of high-order dispersion and quintic nonlinearity.

math-ph↗