Searcharxiv⌕ Search

arXiv subjects

Liang Guo

Publications and source records attributed to Liang Guo.

At least 19 recordsLinked to original sources
arXiv2026

D\'ej\`a Cue: Localizing States in Object Histories via Vocabulary-Relative Coordinates

Tracking links observations of the same object through visual change, yet cannot by itself determine when the object is empty or filled, intact or cut. We formulate identity-conditioned state-moment retrieval: given a tracked-object history and alternative state descriptions, localize an interval in which each described state holds. Absolute image-text similarity scores descriptions independently; because every visible frame depicts the same target, shared object compatibility can obscure the state evidence needed to identify the target interval. The alternatives provide the missing reference: evidence for one state should be measured against the others. We introduce D\'ej\`a Cue, a training-free framework that turns these alternatives into a vocabulary-relative coordinate system. It subtracts their state-balanced centroid from each description, calibrates frame scores, and scans multiple durations within contiguous visible runs using a frozen encoder. On 78 VOST histories, holding the temporal scan fixed and changing only the query reference nearly doubles R@1 at tIoU 0.5 from 10.3\% to 20.5\% and raises Top-1 tIoU from 16.0\% to 21.5\%. Candidate-rank analyses show that vocabulary-relative queries rank useful intervals higher within the same candidate set. Related state descriptions can therefore serve as an object-specific, query-time coordinate system for reading frozen visual representations.

cs.CV↗
arXiv2026

Uncertainty-Aware Simulation-Based Inference for Operations Research with Large Language Models

Deploying large language models (LLMs) for operations research (OR) tasks remains challenging because correctness depends on a coherent modeling process, not merely a correct final answer. Standard autoregressive generation operates on a myopic policy, which sometimes fails to anticipate whether a partial formulation can be validly extended into a globally consistent optimization model. Consequently, locally plausible steps may propagate into catastrophic downstream formulation or solver code errors. To address this, we propose an uncertainty-aware, training-free inference framework for OR mathematical modeling. Without updating model parameters, our method evaluates intermediate candidate steps using short lookahead simulations to quantify downstream predictive uncertainty or probability concentration. Candidates that demonstrate a higher likelihood of yielding coherent mathematical formulations are then dynamically selected via importance resampling. Empirical evaluations across multiple OR benchmarks (including NL4OPT, MAMO, and IndustryOR) demonstrate that our framework consistently outperforms both standard and low-temperature baselines, establishing an efficient, training-free paradigm for reliable OR formulation generation.

cs.LG↗
arXiv2026

Inverse Source Problems for a Class of Fractional Elliptic Equations with Singular Coefficients

An inverse source problem for a class of fractional elliptic equations with singular coefficients is investigated in this paper. For the corresponding direct problem, a formal solution is derived and the well-posedness of the solution is established. For the inverse problem, a H\"older-type conditional stability estimate is obtained in a Hilbert scale associated with exponential operators. Based on this stability framework, two regularization methods are proposed for reconstructing the unknown source term: the exponential-type Tikhonov regularization method and the exponential quasi-boundary value regularization method. Convergence estimates for the regularized solutions are derived under both a priori and a posteriori choices of the regularization parameter. In addition, finite-dimensional spectral approximation results show that the proposed methods are also applicable to general square-integrable source terms, without requiring the exact source to satisfy an exponential-type source condition. Numerical experiments demonstrate that the proposed methods provide stable and accurate reconstructions for both smooth and piecewise smooth sources even under low signal-to-noise ratio conditions.

math.NA↗
arXiv2026

MemGUI-Agent: An End-to-End Long-Horizon Mobile GUI Agent with Proactive Context Management

MLLM-based mobile GUI agents have made substantial progress on short-horizon tasks, yet remain unreliable on long-horizon tasks that require retaining intermediate facts across many steps and app transitions. We attribute this limitation to ReAct-style prompting, which passively accumulates per-step records, leading to prompt explosion and dilution of critical cross-app facts. To address this, we introduce MemGUI-Agent, an end-to-end long-horizon mobile GUI agent with proactive context management. MemGUI-Agent is built on Context-as-Action (ConAct), which casts context management as first-class actions emitted by the same policy that selects UI actions. Instead of passively appending history, ConAct maintains three structured context fields: folded action history, folded UI state, and recent step record, preserving critical UI facts while keeping context compact. To make proactive context management learnable across model scales, we construct MemGUI-3K, a 2,956-trajectory dataset with full ConAct annotations for supervised training and offline analysis. Training an 8B model on MemGUI-3K produces MemGUI-8B-SFT, an 8B MemGUI-Agent that achieves the best open-data 8B performance on MemGUI-Bench and generalizes to the out-of-distribution MobileWorld benchmark. Code, data, and trained models will be released at https://memgui-agent.github.io/.

cs.HC↗
arXiv2026

MobileForge: Annotation-Free Adaptation for Mobile GUI Agents with Hierarchical Feedback-Guided Policy Optimization

MLLM-based mobile GUI agents have made substantial progress in UI understanding and action execution, but adapting them to real target apps remains costly because mobile apps are numerous, frequently updated, and hard to cover with human-written tasks, demonstrations, or reward labels. Existing annotation-free GUI learning reduces manual supervision, yet lacks a unified substrate connecting target-app exploration, curriculum mining, rollout execution, and feedback, while policy optimization often relies on isolated rollouts and coarse rewards that are hard to convert into reliable improvement signals. We present MobileForge, an annotation-free adaptation system for mobile GUI agents. MobileForge consists of MobileGym, which grounds task generation and rollout evaluation in real mobile app interaction, and Hierarchical Feedback-Guided Policy Optimization (HiFPO), which turns trajectory outcomes, step-level process feedback, and corrective hints into hint-contextualized step-level GRPO updates. Using only automatically generated annotation-free adaptation data, MobileForge adapts Qwen3-VL-8B to 67.2% Pass@3 on AndroidWorld, close to the closed-data GUI-specialized GUI-Owl-1.5-8B base model at 69.0%. The MobileForge-adapted ForgeOwl-8B further reaches 77.6% Pass@3 on AndroidWorld and 41.0% success on the out-of-domain MobileWorld GUI-only split, establishing the strongest open-data mobile GUI agent in our evaluation. Code, data, and trained models will be released at https://mobile-forge.github.io/.

cs.HC↗
arXiv2026

GloResNet: A lightweight 3D CNN with global topological features for preterm brain injury prediction

This study introduces an automated deep learning framework for predicting brain injury (BI) in preterm infants from T2-weighted MRI (dHCP dataset). We propose GloResNet, a lightweight 3D CNN based on ResNet-10, pretrained on MedicalNet to address data scarcity. A global manifold mapping strategy first resamples each 3D volume to 128x128x128 and then applies subject-wise z-score intensity normalization, thereby preserving global topology while standardizing appearance. Training integrates mixup, class weighting, and test-time augmentation for robustness. In 5-fold cross-validation, GloResNet achieved 75.18% average accuracy (peak 81.82%), with specificity 0.81 and sensitivity 0.76. Results demonstrate that a topology-aware lightweight CNN has the capability to effectively predict neonatal BI, offering a non-invasive screening tool. The source code of this paper can be obtained from the GitHub repository: https://github.com/ICL-SUST/GloResNet-Preterm-Brain

cs.CV↗
arXiv2026

PaCo-VLA: Passivity-Shielded Compliance Prior for Contact-Rich Vision-Language-Action Manipulation

Contact-rich manipulation demands both high-level semantic reasoning and the safe regulation of high-frequency contact dynamics. While Vision-Language-Action (VLA) models provide unprecedented semantic generalization, their low-rate outputs lack the reliability required for direct plant authority in force-sensitive tasks. To bridge this semantic-to-control gap, we introduce PaCo-VLA, a passivity-shielded compliance prior that recasts the VLA interface. Rather than trusting VLAs with direct motor commands, PaCo-VLA treats network outputs as task-level compliance proposals: semantic bindings, task stages, and admittance schedules. A high-frequency, proposal-independent passivity shield governs these proposals through energy-tank accounting and boundary checks, preventing invalid, stale, or unverified model predictions from bypassing low-level contact physics. This decoupled architecture also enables causal evaluation, isolating semantic contributions from geometric shortcuts. Extensive simulated and real-world connector-insertion experiments demonstrate that PaCo-VLA achieves superior precision over unshielded VLA baselines, sustaining zero passivity violations even under adversarial compliance shifts. This framework establishes a provably sampled-passive runtime contract at the admittance port and provides a runtime interface for deploying foundation models in contact-rich domains.

cs.RO↗
arXiv2026

A groupoid approach to the equivariant coarse Baum--Connes conjecture

In this paper, we develop a groupoid approach to the equivariant coarse Baum--Connes conjecture. For a bounded geometry metric space $X$ equipped with a proper, free, and isometric action of a countable discrete group $\Gamma$, we introduce the equivariant coarse groupoid $G(X, \Gamma)$. We prove that the groupoid Baum--Connes conjecture for $G(X, \Gamma)$ with coefficients in $\ell^{\infty}(X,\mathcal{K})^\Gamma$ is equivalent to the equivariant coarse Baum--Connes conjecture for $(X, \Gamma)$ using a localization algebra description of equivariant $KK^\mathcal{G}$-theory for \'{e}tale groupoids. As applications of this framework, we prove that if the space $X$ admits a coarse embedding into Hilbert space (which is not required to be $\Gamma$-equivariant), then the equivariant coarse Novikov conjecture holds for $(X, \Gamma)$, i.e., the assembly map $\mu_{X,\Gamma}$ is an injection. We also obtain a new proof of the equivariant coarse Baum--Connes conjecture if $X$ admits an equivariant coarse embedding into Hilbert space.

math.KT↗
arXiv2026

Versioned Late Materialization for Ultra-Long Sequence Training in Recommendation Systems at Scale

Modern Deep Learning Recommendation Models (DLRMs) follow scaling laws with sequence length, driving the frontier toward ultra-long User Interaction History (UIH). However, the industry-standard "Fat Row" paradigm, which pre-materializes these sequences into every training example, creates a storage and I/O wall where data infrastructure usage exceeds GPU training capacity due to data redundancy that is amplified in multi-tenant environments where models with vastly different sequence length requirements share a union dataset. We present a \emph{versioned late materialization} paradigm that eliminates this redundancy by storing UIH once in a normalized, immutable tier and reconstructing sequences just-in-time during training via lightweight versioned pointers. The system ensures Online-to-Offline (O2O) consistency through a bifurcated protocol that prevents future leakage across both streaming and batch training, while a read-optimized immutable storage layer provides multi-dimensional projection pushdown for heterogeneous model tenants. Disaggregated data preprocessing with pipelined I/O prefetching and data-affinity optimizations masks the latency of training-time sequence reconstruction, keeping training throughput compute-bound by GPUs. Deployed on production DLRMs, the system reduces training data infrastructure resource usage while enabling aggressive sequence length scaling that delivers significant model quality gains, serving as the foundational data infrastructure for modern recommendation model architectures, including HSTU and ULTRA-HSTU.

cs.IR↗
arXiv2026

Amorphous Nanoconfinement Enables Self-sustaining Sabatier Reaction at Ambient Conditions

The Sabatier reaction, the catalytic hydrogenation of CO2 into CH4, offers a cornerstone for carbon capture and utilization, and in-situ resource utilization during space exploration; however, it faces a fundamental thermodynamic-kinetic paradox: although highly exothermic, conventional catalysts still require continuous external heating to activate CO2 and maintain stable operation. Here we report an amorphous silica-embedded ruthenium catalyst that enables a long-term self-sustaining autothermal Sabatier reaction dispensing with external energy supply. Operating under ambient conditions, this system achieves a record-high CH4 yield of 0.50 mol gcat-1 h-1 with 100% selectivity, stable operation for over 2,000 hours, and a record-low catalyst bed temperature down to 100 oC. This exceptional self-sustaining behavior stems from the synergistic effect of the catalyst's ultralow effective thermal conductivity (0.27 W m-1 K-1), induced by amorphous nanoconfinement, and its superior intrinsic activity. This synergy generates localized hot spots at Ru sites while suppressing macroscopic heat loss. In situ measurements further reveal CH4 formation even at 54 oC and identify a *CO-mediated pathway for CO2 methanation. The reaction ignites readily with a lighter or focused sunlight and persists even under forced convection from an electric fan, demonstrating strong environmental tolerance. By removing the need for constant energy input, this "ignite-and-forget" system paves the way for decentralized Power-to-Gas systems and autonomous fuel production in resource-constrained environments like Mars.

cond-mat.mtrl-sci↗
arXiv2026

PAS3R: Pose-Adaptive Streaming 3D Reconstruction for Long Video Sequences

Online monocular 3D reconstruction enables dense scene recovery from streaming video but remains fundamentally limited by the stability-adaptation dilemma: the reconstruction model must rapidly incorporate novel viewpoints while preserving previously accumulated scene structure. Existing streaming approaches rely on uniform or attention-based update mechanisms that often fail to account for abrupt viewpoint transitions, leading to trajectory drift and geometric inconsistencies over long sequences. We introduce PAS3R, a pose-adaptive streaming reconstruction framework that dynamically modulates state updates according to camera motion and scene structure. Our key insight is that frames contributing significant geometric novelty should exert stronger influence on the reconstruction state, while frames with minor viewpoint variation should prioritize preserving historical context. PAS3R operationalizes this principle through a motion-aware update mechanism that jointly leverages inter-frame pose variation and image frequency cues to estimate frame importance. To further stabilize long-horizon reconstruction, we introduce trajectory-consistent training objectives that incorporate relative pose constraints and acceleration regularization. A lightweight online stabilization module further suppresses high-frequency trajectory jitter and geometric artifacts without increasing memory consumption. Extensive experiments across multiple benchmarks demonstrate that PAS3R significantly improves trajectory accuracy, depth estimation, and point cloud reconstruction quality in long video sequences while maintaining competitive performance on shorter sequences.

cs.CV↗
arXiv2026

DECADE: A Temporally-Consistent Unsupervised Diffusion Model for Enhanced Rb-82 Dynamic Cardiac PET Image Denoising

Rb-82 dynamic cardiac PET imaging is widely used for the clinical diagnosis of coronary artery disease (CAD), but its short half-life results in high noise levels that degrade dynamic frame quality and parametric imaging. The lack of paired clean-noisy training data, rapid tracer kinetics, and frame-dependent noise variations further limit the effectiveness of existing deep learning denoising methods. We propose DECADE (A Temporally-Consistent Unsupervised Diffusion model for Enhanced Rb-82 CArdiac PET DEnoising), an unsupervised diffusion framework that generalizes across early- to late-phase dynamic frames. DECADE incorporates temporal consistency during both training and iterative sampling, using noisy frames as guidance to preserve quantitative accuracy. The method was trained and evaluated on datasets acquired from Siemens Vision 450 and Siemens Biograph Vision Quadra scanners. On the Vision 450 dataset, DECADE consistently produced high-quality dynamic and parametric images with reduced noise while preserving myocardial blood flow (MBF) and myocardial flow reserve (MFR). On the Quadra dataset, using 15%-count images as input and full-count images as reference, DECADE outperformed UNet-based and other diffusion models in image quality and K1/MBF quantification. The proposed framework enables effective unsupervised denoising of Rb-82 dynamic cardiac PET without paired training data, supporting clearer visualization while maintaining quantitative integrity.

cs.CV↗
arXiv2026

Deep learning-based neurodevelopmental assessment in preterm infants

Preterm infants (born between 28 and 37 weeks of gestation) face elevated risks of neurodevelopmental delays, making early identification crucial for timely intervention. While deep learning-based volumetric segmentation of brain MRI scans offers a promising avenue for assessing neonatal neurodevelopment, achieving accurate segmentation of white matter (WM) and gray matter (GM) in preterm infants remains challenging due to their comparable signal intensities (isointense appearance) on MRI during early brain development. To address this, we propose a novel segmentation neural network, named Hierarchical Dense Attention Network. Our architecture incorporates a 3D spatial-channel attention mechanism combined with an attention-guided dense upsampling strategy to enhance feature discrimination in low-contrast volumetric data. Quantitative experiments demonstrate that our method achieves superior segmentation performance compared to state-of-the-art baselines, effectively tackling the challenge of isointense tissue differentiation. Furthermore, application of our algorithm confirms that WM and GM volumes in preterm infants are significantly lower than those in term infants, providing additional imaging evidence of the neurodevelopmental delays associated with preterm birth. The code is available at: https://github.com/ICL-SUST/HDAN.

cs.CV↗
arXiv2026

First Submillimeter Lights from Dome A: Tracing the Carbon Cycle in the Feedback of Massive Stars

The cycling of carbon between its ionized, atomic, and molecular phases shapes the chemical compositions and physical conditions of the interstellar medium (ISM). However, ground-based studies of the full carbon cycle have been limited by atmospheric absorption. Dome~A, the most promising site for submillimeter astronomy, has long resisted successful submillimeter astronomical observations. Using the 60~cm Antarctic Terahertz Explorer, we present the first successful CO ($4-3$) and [CI] ($^3P_1 - ^3P_0$) mapping observations of two archetypal triggered massive star-formation regions at Dome~A. These data, together with archival [CII], provide the first complete characterization of all three carbon phases in these environments. We find elevated C$^{0}$/CO abundance ratios in high-extinction regions, plausibly driven by deep penetration of intense radiation fields from massive stars into a clumpy ISM. These findings mark a major milestone for submillimeter astronomy at Dome~A and offer valuable insights into the impact of massive star feedback on the surrounding ISM.

astro-ph.GA↗
arXiv2025

$K$-theory of ghostly ideals for $\ell^p$-coarsely embeddable spaces

Ghostly ideals are among the most mysterious objects in coarse index theory. In this paper, we show that if a metric space $X$ with bounded geometry admits a coarse embedding into an $\ell^p$-space ($1 \le p < \infty$), then the canonical inclusion from any geometric ideal to the corresponding ghostly ideal induces an isomorphism in $K$-theory. As consequences, we deduce that such spaces satisfy the relative coarse Baum-Connes conjectures, as well as the operator norm localization property for finite rank projections ($ONL_{\mathcal P_{Fin}}$).

math.KT↗
arXiv2025

Relative higher index theory on quotients of Roe algebras and positive scalar curvature at infinity

In this paper, we employ quotients of Roe algebras as index containers for elliptic differential operators to study the existence problem of Riemannian metrics with positive scalar curvature on non-compact complete Riemannian manifolds. The non-vanishing of such an index locates the precise direction at infinity of the obstructions to positive scalar curvature, and may be viewed as a refinement of the positive scalar curvature problem. To achieve this, we formulate the relative coarse Baum-Connes conjecture and the relative coarse Novikov conjecture, together with their maximal versions, for general metric spaces as a program to compute the $K$-theory of the quotients of the Roe algebras relative to specific ideals. We show that if the metric space admits a relative fibred coarse embedding into Hilbert space or an $\ell^p$-space, certain cases of these conjectures can be verified, which yield obstructions to the existence of uniformly positive scalar curvature metrics in specified directions at infinity. As an application, we prove that the maximal coarse Baum-Connes conjecture holds for finite products of certain expander graphs that fail to admit fibred coarse embeddings into Hilbert space.

math.KT↗
arXiv2025

Joint Classification of Haze and Dust Events Using Factorial Hidden Markov Model Framework

Haze and dust pollution events have significant adverse impacts on human health and ecosystems. Their formation-impact interactions are complex, creating substantial modeling and computational challenges for joint classification. To address the state-space explosion faced by conventional Hidden Markov Models in multivariate dynamic settings, this study develops a classification framework based on the Factorial Hidden Markov Model. The framework assumes statistical independence across multiple latent chains and applies the Walsh-Hadamard transform to reduce computational and memory costs. A Gaussian copula decouples marginal distributions from dependence to capture nonlinear correlations among meteorological and pollution indicators. Algorithmically, mutual information weights the observational variables to increase the sensitivity of Viterbi decoding to salient features, and a single global weight hyperparameter balances emission and transition contributions in the decoding objective. In an empirical application, the model attains a Micro-F1 of 0.9459; for the low-frequency classes Dust prevalence below 1\% and Haze prevalence below 10\%, the F1-scores improve from 0.19 and 0.32 under a baseline FHMM to 0.75 and 0.68. The framework provides a scalable pathway for statistical modeling of complex air-pollution events and supplies quantitative evidence for decision-making in outdoor activity management and fine-grained environmental governance.

stat.AP↗