Search arXiv⌕ Search

arXiv subjects

Jie Guo

Publications and source records attributed to Jie Guo.

At least 19 recordsLinked to original sources
arXiv2026

Efficient Hybrid Distillation: Synergizing Score and Adversarial Objectives for One-Step Diffusion

Numerous distillation methods have been developed to accelerate diffusion models. Recent research indicates that hybrid strategies---blending different paradigms---yield superior results compared to single-method approaches. However, current works predominantly rely on a simple combination of objectives, leaving the question of how to effectively synergize them largely underexplored. In this paper, we specifically investigate the synergy between Score Distillation and Adversarial Distillation. We reveal that their operating zones are distinct and complementary: Score Distillation is effective in high-noise regimes for capturing the global distribution yet lacks fine-grained supervision in low-noise regions. Conversely, Adversarial Distillation is effective in low-noise regions but is prone to instability and suffers from discriminator failure when applied to high-noise intervals. Leveraging this insight, we propose Efficient Adversarial Score Distillation (EASD), a framework that synergizes these objectives via a regime-adaptive sampling strategy, directing each objective to focus on its effective interval. We further apply this paradigm to DiT-based Flow Matching models. Empirically, our method achieves a promising one-step FID of 1.39 on ImageNet 256$\times$256 using the SiT-XL/2+REPA model. This work provides a concrete guideline for maximizing the potential of hybrid distillation. Our code and model are available at https://github.com/pf0607/EASD .

cs.CV↗
arXiv2026

A $k$-entanglement measure complying with the many-body resource theory and its evaluation

$k$-entanglement provides a hierarchical characterization of multipartite correlations according to their entanglement structure, ranging from multipartite entanglement ($k=n$) to genuine multipartite entanglement ($k=2$). Its quantitative treatment for mixed states faces three related obstacles: the standard axioms for such quantifications does not incorporate the requirements from many-body resource theory, as it does not regulate how to quantify the entanglement assigned to part systems of the same multipartite state and how to describe the rule that the entanglement possessed by a part system never exceeds the entanglement possed by whole system; no explicit measures are known that satisfy the above requirements from many-body resource theory; and the extreme difficulty in numerical evaluation at mixed states of known quantifications. In this work, we first formulate an axiomatic framework for \emph{true} $k$-entanglement measures that obeys the many-body resource theory, by supplementing usual faithfulness and LOCC monotonicity with two new ones: unification condition and hierarchy condition. Then, for every $2\leq k\leq n$, we construct a witness-based true $k$-entanglement measure $E_w^{(k,n)}$ without the convex-roof extension, which is valid for both finite- and infinite-dimensional $n$-partite systems. Finally, we derive a method of constructing finite-dimensional $k$-entanglement witnesses from positive operator and $k$-separable-state optimizations, design an evaluation scheme of $E_w^{(k,n)}$ based on pre-established database of $k$-entanglement witnesses sampled by positive operators. To check the feasibility of this computing scheme, we develop a software tool, which implements the computation of the approximation of $E_w^{(k,n)}$ for systems up to four qubits. Numerical tests show that the software is sufficiently accurate and reliable.

quant-ph↗
arXiv2026

Using LLMs to Detect LLM-Generated Texts: A Cross-Generation Analysis

Automated detection of LLM-generated texts (LGTs) is critical, yet dedicated detectors often struggle to generalize across domains and models. While general-purpose LLMs offer flexible zero-shot authorship classification with explanatory rationale, their detection behavior, especially regarding self-detection versus cross-detection across model generations, remains poorly understood. We systematically evaluate 15 LLMs spanning three model generations as both generators and detectors. Using a benchmark of 1,000 human-written texts and 15,000 LGTs (1,000 per model), we collected over 233,000 binary classifications alongside natural-language explanations. Our results reveal that detection efficacy is primarily driven by detector capability rather than generator provenance, although outputs from newer generators remain notably harder to detect. Crucially, statistical comparisons show no systematic advantage or disadvantage for self-detection across models. Error analysis further exposes generational bias shifts: first-generation detectors under-detect LGTs (high false-negative rates), second-generation detectors over-flag human texts (high false-positive rates), and the latest models achieve balanced trade-offs. Finally, we highlight significant inconsistencies in how different LLMs apply textual cues to justify their decisions. Code: https://github.com/hyyuan/detect-llm-generated-texts.

cs.CL↗
arXiv2026

SignGPT: Toward LLM-Mediated Sign Language Interaction through Gloss-Free Translation and Generation

Large language models (LLMs) provide limited support for sign language interaction. Unifying sign language translation (SLT) and generation (SLG) to enable sign language as both input and output can reduce switching between separate models during sign-text interaction. We present SignGPT, a unified, pose-based framework for gloss-free SLT and SLG. SignGPT integrates part-aware hierarchical representations of body, hand, and facial motion into a shared language model and employs asymmetric multi-token prediction and progressive training for bidirectional modeling. We evaluate SignGPT on How2Sign (ASL) and Phoenix-2014T (DGS) through benchmark comparisons, qualitative analyses, and component ablations. An exploratory study with 12 Deaf ASL signers assesses an LLM-mediated sign-to-sign response pipeline, highlighting the potential of unified modeling to support sign language conversation (SLC).

cs.CV↗
arXiv2026

FARM: Reading Failure Signals from the Internal Predictive States of a Frozen Robotic World Model

Reliable robot deployment requires online failure monitoring, yet existing monitors mainly derive risk from proxy signals or train dedicated monitoring components. We ask whether the internal predictive states of a frozen pretrained robotic world model already contain directly decodable failure information. Failure-Aware Readout from World Models (FARM) trains only a 33,985-parameter supervised readout over frozen VLA-JEPA predictive states, producing step-wise failure scores and causal trajectory risk. Five-fold out-of-fold evaluation across seven source tasks reaches 85.68/88.59 pooled AUROC/AUPRC, and FARM gives the best Seen performance among 15 matched baselines on the 10-task benchmark. Across four real-robot populations on PIPER X, SO-101, and Franka, fixed-readout transfer and readout-only adaptation test deployment shifts without updating the predictive backbone. FARM also discriminates failures from partial causal histories and adds 0.2256 ms mean CUDA latency once the frozen state is available. These results support frozen predictive world-model states as reusable features for causal, transferable, and low-overhead execution monitoring.

cs.RO↗
arXiv2026

HaptiNet: Networked Haptic Robots Enable Physical Co-presence in Geographically-Unconstrained Rehabilitation

Cooperative rehabilitation enhances engagement, task performance, and social-motor interaction, yet it demands physical co-presence: users must transmit forces, coordinate movements, and infer intent through haptic contact. Telerehabilitation promises to expand access for patients constrained by distance, mobility, or clinical disparities, yet current techniques remain predominantly audiovisual while leaving users haptically and physically isolated. Here, we introduce HaptiNet, a networked haptic robotic system enabling physical co-presence for geographically distributed users via force-mediated interaction. Each robotic terminal features a low-inertia, long-stroke design with high force-feedback capacity, tailored for haptic rendering in upper-limb training. Building on these terminals, HaptiNet creates a distributed haptic network with an imitation-learning-based delay compensator, enabling users to physically perceive and coordinate with one another over distance. We validated HaptiNet in 284 healthy participants and 111 patients with neurological impairments across progressively realistic settings, including laboratory tests, cross-city deployments, and clinical applications. HaptiNet preserved task-level force rendering consistency across single-user and multi-user scenarios. Compared with solo and visual cooperative training, haptic cooperation improved task performance by 24% and 22%, respectively, while also boosting engagement and interpersonal motor synchrony. Across three intercity links totaling approximately 4,000 km, HaptiNet maintained stable haptic interaction among patients with neurological impairments, producing a 3.87-fold greater baseline-to-training score improvement and a 106% higher patient-applied effort over the solo condition.

cs.RO↗
arXiv2026

scKDGM: KAN-guided Dynamic Graph Masked Learning for Single-Cell RNA-seq Clustering

Single-cell RNA sequencing (scRNA-seq) clustering is essential for identifying cell types, but high dimensionality, sparsity, dropout, and technical noise hinder robust expression representation and cell graph construction. Existing masked autoencoders mainly use expression recovery for feature reconstruction, while graph clustering methods usually depend on fixed KNN graphs and do not feed recovered expression back into graph optimization. We propose scKDGM, a KAN-guided dynamic graph masked learning framework for scRNA-seq clustering. scKDGM uses graph-aware distribution preserving gene masking (GDP-Mask) to perturb cell identity, a KAN-based TAKGCN encoder to learn masked-view representations, mask-guided expression recovery to construct a dynamic graph, and cross-view contrastive learning to transfer recovery signals into topology updates. A ZINB loss models overdispersion and zero inflation. Experiments on 12 real scRNA-seq datasets show that scKDGM outperforms 10 baselines in average NMI and ARI.

cs.LG↗
arXiv2026

Beyond Single-Source Cognitive Taskonomy:Multi-Source Task Relations through fMRI Transfer Learning

Cognitive tasks are organized by shared and specialized neural processes. Masked fMRI reconstruction provides a common self-supervised objective for quantifying transfer relations among task states, but existing reconstruction-based taskonomies mainly study one-to-one transfer from a single source task to a target. Here, we extend an fMRI cognitive taskonomy from single-source to multi-source transfer across 23 Human Connectome Project task states and use Boolean Integer Programming (BIP) to analyze budget-constrained task allocation. We train 1,127 task-specific and transfer models. Single-source transfer is directional and paradigm structured: motor states transfer well within the motor paradigm but provide limited support to most non-motor targets, consistent with a shared sensorimotor execution system and effector-specific representations. Multi-source transfer depends on the composition of the source set, suggesting that many-to-one task relations are not fully captured by pairwise taskonomy alone. Across supervision budgets, BIP repeatedly allocates direct supervision to several 0-back and 2-back working-memory states, although these states are not consistently the strongest individual sources. This pattern may reflect the integration of perceptual, attentional, and executive processes in working-memory tasks. Together, these findings reveal a cross-paradigm-limited motor cluster and working-memory states with high priority under the specified global allocation objective. Our study extends reconstruction-based fMRI taskonomy from one-to-one transfer to many-to-one task relations and budget-constrained task dependencies.

cs.CV↗
arXiv2026

Proposal Refinement for Few-Shot Object Detection

Few-shot object detection has gained widely attention in recent years. Some excellent algorithms have been proposed to handle this task. However, most of these algorithms rely on the performance of few-shot classification. Unlike previous attempts, our work focuses on the problem of unbalanced distribution of region proposals between the novel classes and the base classes. In order to alleviate this unbalanced distribution, we propose the proposal refinement approach for different training phases. Specifically, refinement loss is designed for the base training phase to enhance sensitivity of the model to novel classes, and refinement branch is introduced as an auxiliary branch for RPN (Region Proposal Networks) to generate more novel proposals in the fine-tuning phase. By rebalancing the proposal distribution, the proposed approach outperforms the baselines methods by roughly 1\%$\sim$6\% on current benchmarks without increasing any inference time. Through extensive experiments, we prove that we establish a new state-of-the-art method for the few-shot object detection task.

cs.CV↗
arXiv2026

MaTe: Images Are All You Need for Material Transfer via Diffusion Transformer

Recent diffusion-based methods for material transfer rely on image fine-tuning or complex architectures with assistive networks, but face challenges including text dependency, extra computational costs, and feature misalignment. To address these limitations, we propose MaTe, a streamlined diffusion framework that eliminates textual guidance and reference networks. MaTe integrates input images at the token level, enabling unified processing via multi-modal attention in a shared latent space. This design removes the need for additional adapters, ControlNet, inversion sampling, or model fine-tuning. Extensive experiments demonstrate that MaTe achieves high-quality material generation under a zero-shot, training-free paradigm. It outperforms state-of-the-art methods in both visual quality and efficiency while preserving precise detail alignment, significantly simplifying inference prerequisites.

cs.CV↗
arXiv2026

DealMaTe: Multi-Dimensional Material Transfer via Diffusion Transformer

Recently, diffusion-based material transfer methods rely on image fine-tuning or complex architectures with auxiliary networks but face challenges such as text dependency, additional computational costs, and feature misalignment. To address these limitations, we propose \textbf{DealMaTe}, using \underline{\textbf{de}}pth, norm\underline{\textbf{a}}l, and \underline{\textbf{l}}ighting images for \underline{\textbf{ma}}terial \underline{\textbf{t}}ransf\underline{\textbf{e}}r. DealMaTe is a simplified diffusion framework that eliminates text guidance and reference networks. We design a lightweight 3D information injection method, Multi-Dim 3D Shader LoRA, which, without modifying the base model weights, enables compatible control conditions and achieves harmonious and stable results. Additionally, we optimize the attention mechanism with Shader Causal Mutual Attention and key-value (KV) caching to reduce inference latency caused by multiple conditions, improve computational efficiency, and achieve high-quality material transfer results with low architectural complexity. Extensive experiments covering a wide variety of objects and lighting conditions consistently demonstrate that DealMaTe achieves remarkable high-fidelity material transfer under arbitrary input materials. The code is available at https://github.com/haha-lisa/DealMaTe.

cs.GR↗
arXiv2026

Holographic $SO(2,d)$ anomaly

In the $SO(2,d)$ gauge theory formalism of AdS gravity established in arXiv:1811.05286, the dynamics of bulk gravity emerges from the vanishing of the boundary covariant anomaly for the $SO(2,d)$ conservation law. In parallel with the known results on chiral anomalies, we establish the descendent structure of the holographic $SO(2,d)$ anomaly. The corresponding anomaly characteristic class, bulk Chern-Simons like action as well as the boundary effective action are constructed systematically. The anomalous conservation law is presented both in the covariant and consistent formalisms. Due to the existence of the ruler field, not only the Bardeen-Zumino polynomial, but also the covariant and consistent currents are explicitly constructed.

hep-th↗
arXiv2026

UMo: Unified Sparse Motion Modeling for Real-Time Co-Speech Avatars

Speech-driven gestures and facial animations are fundamental to expressive digital avatars in games, virtual production, and interactive media. However, existing methods are either limited to a single modality for audio motion alignment, failing to fully utilize the potential of massive human motion data, or are constrained by the representation ability and throughput of multimodal models, which makes it difficult to achieve high-quality motion generation or real-time performance. We present UMo, a unified sparse motion modeling architecture for real-time co-speech avatars, which processes text, audio, and motion tokens within a unified formulation. Leveraging a spatially sparse Mixture-of-Experts framework and a temporally sparse, keyframe-centric design, UMo efficiently performs real-time dense reconstruction, enabling temporally coherent and high-fidelity animation generation for both facial expressions and gestures. Furthermore, we implement a multi-stage training strategy with targeted audio augmentation to enhance acoustic diversity and semantic consistency. Consequently, UMo preserves fine-grained speech-motion alignment even under strict latency constraints. Extensive quantitative and qualitative evaluations show that UMo achieves better output quality under low latency and real-time performance constraints, offering a practical solution for high-fidelity real-time co-speech avatars.

cs.GR↗
arXiv2026

BrepGaussian: CAD reconstruction from Multi-View Images with Gaussian Splatting

The boundary representation (B-Rep) models a 3D solid as its explicit boundaries: trimmed corners, edges, and faces. Recovering B-Rep representation from unstructured data is a challenging and valuable task of computer vision and graphics. Recent advances in deep learning have greatly improved the recovery of 3D shape geometry, but still depend on dense and clean point clouds and struggle to generalize to novel shapes. We propose B-Rep Gaussian Splatting (BrepGaussian), a novel framework that learns 3D parametric representations from 2D images. We employ a Gaussian Splatting renderer with learnable features, followed by a specific fitting strategy. To disentangle geometry reconstruction and feature learning, we introduce a two-stage learning framework that first captures geometry and edges and then refines patch features to achieve clean geometry and coherent instance representations. Extensive experiments demonstrate the superior performance of our approach to state-of-the-art methods.

cs.CV↗
arXiv2026

InfiniteDance: Scalable 3D Dance Generation Towards in-the-wild Generalization

Although existing 3D dance generation methods perform well in controlled scenarios, they often struggle to generalize in the wild. When conditioned on unseen music, existing methods often produce unstructured or physically implausible dance, largely due to limited music-to-dance data and restricted model capacity. This work aims to push the frontier of generalizable 3D dance generation by scaling up both data and model design. (1) On the data side, we develop a fully automated pipeline that reconstructs high-fidelity 3D dance motions from monocular videos. To eliminate the physical artifacts prevalent in existing reconstruction methods, we introduce a Foot Restoration Diffusion Model (FRDM) guided by foot-contact and geometric constraints that enforce physical plausibility while preserving kinematic smoothness and expressiveness, resulting in a diverse, high-quality multimodal 3D dance dataset totaling 100.69 hours. (2) On model design, we propose Choreographic LLaMA (ChoreoLLaMA), a scalable LLaMA-based architecture. To enhance robustness under unfamiliar music conditions, we integrate a retrieval-augmented generation (RAG) module that injects reference dance as a prompt. Additionally, we design a slow/fast-cadence Mixture-of-Experts (MoE) module that enables ChoreoLLaMA to smoothly adapt motion rhythms across varying music tempos. Extensive experiments across diverse dance genres show that our approach surpasses existing methods in both qualitative and quantitative evaluations, marking a step toward scalable, real-world 3D dance generation. Code, models, and data will be released.

cs.CV↗
arXiv2026

Combinatorial Bandit Bayesian Optimization for Tensor Outputs

Bayesian optimization (BO) has been widely used to optimize expensive and black-box functions across various domains. However, existing BO methods have not addressed tensor-output functions. To fill this gap, we propose a novel tensor-output BO framework. Specifically, we first introduce a tensor-output Gaussian process (TOGP) with two classes of tensor-output kernels as a surrogate model of the tensor-output function, which can effectively capture the structural dependencies within the tensor. Based on it, we develop an upper confidence bound (UCB) acquisition function to select query points. Furthermore, we introduce a more practical and challenging problem setting, termed combinatorial bandit Bayesian optimization (CBBO), where only a subset of the tensor outputs can be selected to contribute to the objective. To tackle this, we propose a tensor-output CBBO method, which extends TOGP to handle partially observed tensor outputs, and accordingly design a novel combinatorial multi-arm bandit-UCB2 (CMAB-UCB2) criterion to sequentially select both the query points and the output subset. We establish theoretical regret bounds for both methods, guaranteeing sublinear regret. Extensive experiments on synthetic and real-world datasets demonstrate the superiority of our methods.

cs.LG↗
arXiv2026

A novel perspective on crystal electromagnetic calorimeter design for the CEPC

Crystal electromagnetic calorimeters (ECALs) are essential for high-precision measurements of electrons and photons in particle physics experiments. However, the conventional design, in which long crystal bars point radially toward the interaction region and lack longitudinal segmentation, is incompatible with the three-dimensional shower imaging required by Particle Flow Approach (PFA). We propose a novel perspective on crystal ECAL design to address this limitation. The key innovation is a geometric reconfiguration in which crystal bars are oriented to face the interaction region and arranged orthogonally in adjacent longitudinal layers. This layout achieves fine spatial segmentation of energy deposits by correlating measurements of orthogonal crystal bars. An interleaved structure of regular and inverted trapezoidal modules is incorporated to maximize structural uniformity and detector hermeticity. This design is engineered to preserve the excellent intrinsic energy resolution of crystal ECALs while simultaneously providing the detailed three-dimensional shower imaging essential for PFA. Simulation results confirm the feasibility of achieving excellent energy resolution of $1.14\%/\sqrt{E} \oplus 0.44\%$. Consequently, the proposed design repositions crystal ECAL as a foundational component for PFA-oriented detector systems at facilities such as the Circular Electron Positron Collider (CEPC), offering a new technical pathway to advance the physics goals of future colliders.

physics.ins-det↗
arXiv2026

Stability and instability of a one-dimensional MHD model

We consider a one-dimensional magnetohydrodynamics model introduced by Dai \textit{et al.}~(2023), in a parameter regime where, in the absence of a magnetic field, the system reduces to the De Gregorio model for the Euler equations. We analyze stability and instability near the first excited state on the torus, thus generalizing the recent results obtained by Guo and Jiu~(2025) for the De Gregorio model. Specifically, we establish global well-posedness of the linearized system, local well-posedness for the nonlinear system, and demonstrate both linear and nonlinear instability for a broad class of initial data in the weighted Sobolev space introduced by Lai \textit{et al.}~(2020). We identify the principal linearized operator, which is structurally equivalent to that of the De Gregorio model, as the primary mechanism of instability. Moreover, we prove global well-posedness and stability of both linear and nonlinear systems for initial data in a particular subspace of the aforementioned weighted Sobolev space.

math.AP↗