Searcharxiv⌕ Search

arXiv subjects

Xin Sun

Publications and source records attributed to Xin Sun.

At least 37 records · Page 2Linked to original sources

Bridging the Gap between Labeled and Unlabeled Data via Unified Flow with Feature Memory Bank

Although semi-supervised semantic segmentation ($\text{S}^4$) utilizes abundant unlabeled data to reduce manual labeling burdens, independent training of labeled and unlabeled data causes the former to dominate, which severely degrades pseudo-label quality. To address this challenges, we propose a novel remote sensing (RS) $\text{S}^4$ method via unified flow with feature memory bank (UFFM). Specifically, UFFM comprises two key innovations: unified flow (UF) and feature memory bank (FMB). The UF is a new training flow that generates less biased pseudo-labels by combining an external visual foundation model (VFM) with an RS domain teacher, and jointly optimizes labeled and pseudo-labeled data under a unified training objective. The FMB is a novel memory module for $\text{S}^4$ that dynamically updates class-specific features during training and reduces the feature discrepancy between labeled and unlabeled data through class-feature alignment. To verify the effectiveness of our model, we conduct extensive experiments on RS datasets. The experimental results show the superiority of our method over SOTA $\text{S}^4$ methods. Moreover, the results demonstrate the effectiveness of our contributions in bridging the optimization and feature representation gap between labeled and unlabeled data. Our code is released at \href{https://github.com/wangshanwen001/RS-UFFM}{https://github.com/wangshanwen001/RS-UFFM}.

cs.CV↗

DAC-Pose: Dual-Agent Collaborative Framework for Pose-Guided Human Generation

AI agents have emerged as a powerful new paradigm in generative image synthesis, enabling systems to perform complex semantic reasoning rather than passive pixel-level mapping. In pose-guided human generation, conventional methods inevitably produce severe visual artifacts under drastic viewpoint shifts, fundamentally because they lack the cognitive capacity to logically deduce unseen regions and model complex spatial deformations. To bridge this gap, we propose DAC-Pose, a novel agent-driven multimodal framework that reformulates single-view human generation as a collaborative dual-agent system. DAC-Pose integrates two complementary components, namely, the Prior Semantic Reasoning (PSR) agent and the Discrepancy-Aware Visual Encoding (DAVE) agent. Functioning as a cognitive engine, PSR utilizes collaborative reasoning to deduce the fine-grained attributes of unseen regions. Concurrently, acting as a specialized visual perception agent, DAVE quantifies and encodes viewpoint-induced spatial misalignments, continuously feeding robust spatial constraints back into the generative process. This autonomous feedback loop between semantic deduction and visual perception ensures high-fidelity detail synthesis. Extensive experiments on the DeepFashion and Market-1501 benchmarks validate the superiority of our agent-driven paradigm. Notably, DAC-Pose excels in preserving texture alignment and identity consistency under drastic viewpoint changes. The code is available at https://github.com/AIVRC/DAC-Pose.

cs.CV↗

Global Attention-Fused Image Cropping with Attention-Guided and Global-Aligned Crop Evaluator

Image cropping aims to improve image aesthetics by preserving important content within an appropriately composed region. However, most existing methods focus primarily on salient regions and therefore have limited sensitivity to the global relationships among the main image components. To address this limitation, we propose Global Attention-Fused Image Cropping (GAFIC), which consists of an Attention-Guided Feature Fusion (AGFF) and a Global-Aligned Crop Evaluator (GACE). AGFF aggregates the importance of local regions to construct a global representation that captures both image structure and local details. GACE aligns candidate crop features with this global representation, enabling crop evaluation to remain sensitive to boundary changes. We further combine three ranking losses across multiple scales to obtain accurate and stable crop scores. Extensive experiments on the GAIC and CPC datasets demonstrate that GAFIC outperforms existing image-cropping methods, particularly in terms of accuracy and stability. Unlike pixel-level retargeting methods such as seam carving, inpainting, and diffusion-based synthesis, GAFIC does not synthesize or modify the retained pixels; instead, it selects an aesthetically preferred crop from the source image, making it suitable for scenarios where pixel integrity and efficient batch processing are important. The source code is available at https://github.com/AIVRC/GAFIC.git.

cs.CV↗

HopRefusalBench: Diagnosing Refusal Failures in Search-Augmented Agents for Multi-Hop Reasoning

Search-augmented large language model agents are increasingly capable of solving knowledge-intensive tasks, but their behavior when a multi-hop question is fundamentally unanswerable remains poorly understood. Existing abstention benchmarks largely expose defects at the surface of single-hop queries and therefore cannot reveal failures that emerge only after valid intermediate reasoning and retrieval. We introduce HopRefusalBench, the first controlled benchmark of refusal within multi-hop search, comprising 889 unanswerable questions constructed from KILT-grounded entity paths. It crosses three causes of unanswerability (answer unknown, false premise, and underspecified context) with root, middle, and terminal topologies, making premise verification, intermediate-bridge validation, and terminal stopping separately observable. We further propose a final-outcome taxonomy spanning target-aware refusal, pseudo-refusal, hallucinated completion, and search-budget exhaustion, together with source-aware trajectory metrics for post-trigger continuation and token waste. Across ten frontier proprietary and open-weight models in search-augmented mode, the best model achieves a target-aware correct halting rate (TCHR) of only 42.9%. Root and middle items are consistently harder than terminal items, and all models attain their highest TCHR on false premises and their lowest on underspecified questions. Yet when pooled across categories, 84.7--98.4% of each model's explicit refusal-like responses identify the correct rationale, localizing the main bottleneck to committing to an appropriate non-answer; failed trajectories instead diverge into hallucination or search-budget exhaustion. These results establish refusal in multi-hop search as a consequential evaluation problem and provide a foundation for diagnosing and improving the reliability of search-augmented agents.

cs.CL↗

EviSD: Evidence-Conditioned Self-Distillation for Search-Augmented Agents

Outcome-based reinforcement learning enables search-augmented language agents to learn from verifiable final answers, but its trajectory-level credit cannot distinguish the contributions of individual actions in a multi-turn search process. We propose EviSD, an evidence-conditioned self-distillation framework that uses instance-level supporting evidence as privileged information for search actions and golden answers as complementary privilege for answer actions. During training, the student samples actions from the original context, while the same model re-scores them as a privileged teacher under an action-aligned context. EviSD converts the detached teacher--student gap into a bounded correction to the outcome-derived GRPO advantage and applies it only to generated action spans. This design localizes privileged guidance while preserving the update direction determined by the outcome reward, without an auxiliary distillation objective or any change at inference time. Across seven question-answering benchmarks and three backbones spanning model scales and generations, EviSD achieves the highest macro-average Exact Match in all evaluated settings, outperforming the strongest compared methods by 1.3--2.3 points while modulating only 6.7%--15.1% of response tokens. Code is available at https://github.com/JiananXie/EviSD.

cs.CL↗

Hermes - Towards an Optimal High-Performance Algorithm for Cosmic Statistics of Large Data Sets

We present Hermes, an in situ multiresolution framework for efficient and flexible measurements of cosmic large-scale-structure statistics from discrete catalogues. Hermes reconstructs a catalogue as a continuous density field in a compact scaling-function basis and replaces explicit counting of particle tuples with algebraic operations among window-filtered fields. Standard binning schemes for counts-in-cells, two-point and higher-order correlation functions are thereby expressed through choices of window functions, while new statistics can be constructed by modifying the kernels without redesigning the estimator. We introduce PyHermes, an open-source Python implementation combining multiresolution reconstruction, FFT-based convolution, MPI/thread parallelism, and GPU acceleration. It supports isotropic and anisotropic two-point statistics, marked correlations, standard and multipole three-point functions, filtered statistics, and differential operators for derived physical fields. Tests with cosmological N-body halo catalogues demonstrate a range of clustering measurements and quantify the computational efficiency and scalability of the approach. By separating field representation from statistical windows, a single reconstructed field can be reused for many standard and customised measurements, making Hermes well suited to large data sets from current and future galaxy surveys.

astro-ph.CO↗

LEGO Co-builder: Exploring Fine-Grained Vision-Language Modeling for Multimodal LEGO Assembly Assistants

Vision-language models (VLMs) are facing the challenges of understanding and following multimodal assembly instructions, particularly when fine-grained spatial reasoning and precise object state detection are required. In this work, we explore LEGO Co-builder, a hybrid benchmark combining real-world LEGO assembly logic with programmatically generated multimodal scenes. The dataset captures stepwise visual states and procedural instructions, allowing controlled evaluation of instruction-following, object detection, and state detection. We introduce a unified framework and assess leading VLMs such as GPT-4o, Gemini, and Qwen-VL, under zero-shot and fine-tuned settings. We also evaluated the framework using a reasoning-focused model, GLM-4.1-thinking. Our results show that while object detection achieved high performance (98.16% with fine-tuned InstructBLIP), fine-grained scene understanding and assembly state detection remain challenging: Fine-tuned MiniGPT-v2 reached only 37.52% F1 for identifying theme entities, and even advanced models such as GPT-4o achieved just 40.54% F1 on state detection. This highlights gaps in fine-grained visual understanding among existing models. We release the benchmark, codebase, and generation pipeline to support future research on multimodal assembly assistants grounded in real-world workflows.

cs.AI↗

Uplink Positioning for PASS in Multipath Environments

Pinching-antenna systems (PASS) enhance wireless propagation by activating or placing pinching antennas (PAs) near users. Therefore, accurate uplink positioning is essential for efficient communication. In this paper, an uplink multi-carrier positioning framework is established for PASS in multipath environments. Matrix pencil (MP)-based and low-complexity Rank-1 ranging algorithms are proposed to estimate the distances between the PAs and the user. For the MP-based ranging algorithm, the line-of-sight (LoS) component is separated from non-line-of-sight components by exploiting the shift-invariance property of the Hankel matrix, thereby enabling accurate distance estimation. For the Rank-1 ranging algorithm, the dominant LoS delay is directly isolated through truncated singular value decomposition, thereby avoiding matrix inversions. Subsequently, a two-stage weighted nonlinear least-squares (WNLS) positioning algorithm is designed to estimate the three-dimensional user position. To gain further insights, a comprehensive theoretical performance analysis of the proposed ranging and positioning algorithms is conducted. The closed-form ranging variances and position error bound (PEB) are derived to reveal the error propagation mechanism. Numerical results demonstrate that: i) The MP-based algorithm achieves higher accuracy and robustness than the Rank-1-based algorithm, while the Rank-1-based algorithm has lower computational complexity. ii) The positioning error of the MP-based algorithm follows the same trend as the derived PEB, whereas the Rank-1 algorithm exhibits an error floor due to multipath bias. iii) The positioning accuracy of the MP algorithm improves as the number of subcarriers increases.

eess.SP↗

The bulk one-arm exponent for the CLE$_{κ'}$ percolations

The conformal loop ensemble (CLE) is a conformally invariant random collection of loops. In the non-simple regime $κ'\in (4,8)$, it describes the scaling limit of the critical Fortuin-Kasteleyn (FK) percolations. CLE percolations were introduced by Miller-Sheffield-Werner (2017). The CLE$_{κ'}$ percolations describe the scaling limit of a natural variant of the FK percolation called the fuzzy Potts model, which has an additional percolation parameter $r$. Based on CLE percolations and assuming that the convergence of the FK percolation to CLE, K{ö}hler-Schindler and Lehmkuehler (2022) derived all the arm exponents for the fuzzy Potts model except the bulk one-arm exponent. In this paper, we exactly solve this exponent, which prescribes the dimension of the clusters in CLE$_{κ'}$ percolations. As a special case, the bichromatic one-arm exponent for the critical 3-state Potts model should be $4/135$. To the best of our knowledge, this natural exponent was not predicted in physics. Our derivation relies on the iterative construction of CLE percolations from the boundary conformal loop ensemble (BCLE), and the coupling between Liouville quantum gravity and SLE curves. The source of the exact solvability comes from the structure constants of boundary Liouville conformal field theory. A key technical step is to prove a conformal welding result for the target-invariant radial SLE curves. As intermediate steps in our derivation, we obtain several exact results for BCLE in both the simple and non-simple regimes, which extend results of Ang-Sun-Yu-Zhuang (2024) on the touching probability of non-simple CLE. This also provides an alternative derivation of the relation between the BCLE parameter $ρ$ and the additional percolation parameter $r$ in CLE percolations, which was originally due to Miller-Sheffield-Werner (2021, 2022).

math.PR↗

On the Blockage Effect in Pinching-Antenna Systems (PASS)

Pinching-antenna systems (PASS) offer considerable potential for wireless communications due to their unique ability to dynamically reconfigure radiation positions along a waveguide. However, the performance of PASS remains a critical challenge in the presence of random line-of-sight (LoS) blockage, leading to significant attenuation and even communication outages. In this paper, the performance of PASS in the presence of LoS blockage is investigated from the perspective of stochastic geometry. Obstacles are modeled through a homogeneous Poisson point process (PPP), where the geometric dimensions, numbers, and positions are treated as random variables. To conduct a concrete characterization of LoS blockage, the random-height-and-random-radius (RHRR) blockage model and the deterministic-height-and-deterministic-radius (DHDR) blockage model are proposed. In particular, closed-form analytical and asymptotic expressions for the outage probability are obtained, along with analytical and approximate expressions for the ergodic rate. Our simulation results reveal that denser obstacle environments or statistically larger obstacles substantially increase the probability of LoS blockage and degrade the system performance. Moreover, owing to its ability to dynamically reposition PAs, PASS can consistently outperform conventional antenna systems in the presence of LoS blockage.

eess.SP↗

Predict the Retrieval! Test time adaptation for Retrieval Augmented Generation

Retrieval-Augmented Generation (RAG) has emerged as a powerful approach for enhancing large language models' question-answering capabilities through the integration of external knowledge. However, when adapting RAG systems to specialized domains, challenges arise from distribution shifts, resulting in suboptimal generalization performance. In this work, we propose TTARAG, a test-time adaptation method that dynamically updates the language model's parameters during inference to improve RAG system performance in specialized domains. Our method introduces a simple yet effective approach where the model learns to predict retrieved content, enabling automatic parameter adjustment to the target domain. Through extensive experiments across six specialized domains, we demonstrate that TTARAG achieves substantial performance improvements over baseline RAG systems. Code available at https://github.com/sunxin000/TTARAG.

cs.CL↗

Diagnosing Corruption-Induced Reliability Failures in Vision-Language Models

Visual corruptions can change vision--language model (VLM) behavior in ways that top-1 accuracy does not capture. A model may keep the same answer while losing distributional support, or improve accuracy through unstable wrong-to-correct changes. We introduce Bench-C, a controlled multiple-choice testbed for studying these effects. It selects semantically diverse samples whose predictions respond to corruption, and evaluates them under 19 corruption types and five severity levels. To measure how corruption changes the option distribution, we introduce the Robustness Alignment Score (RAS), which combines confidence-correctness alignment with uncertainty direction. We further separate originally correct samples from originally wrong samples, and track whether changes are temporary or persistent across severity. Experiments across 13 VLMs reveal a counterintuitive pattern: mild corruptions can improve top-1 accuracy while degrading prediction structure. These failures include silent degradation, erroneous overconfidence, and severity-dependent persistence. Bench-C therefore supports robustness evaluation that goes beyond final answers and attributes where reliability changes occur. Code and data are available at https://github.com/xiangjieSui/Bench-C.

cs.CV↗

Eyes Can't Always Tell: Fusing Eye Tracking and User Priors for User Modeling under AI Advice Conditions

Modeling users' cognitive states (e.g., cognitive load and decision confidence) is essential for building adaptive AI in high-stakes decision-making. While eye tracking provides non-invasive behavioral signals correlated with cognitive effort, prior work has not systematically examined how AI assistance contexts, specifically varying advice reliability and user heterogeneity, can alter the mapping between gaze signals and cognitive states. We conducted a within-subject lab eye-tracking study (N=54) on factual verification tasks under three conditions: No-AI, Correct-AI advice, and Incorrect-AI advice. We analyze condition-dependent changes in self-reports and eye-tracking patterns and evaluate the robustness of eye-tracking-based user modeling. Results show that AI advice increases decision confidence compared to No-AI, while Correct-AI is associated with lower perceived cognitive load and more efficient gaze behavior. Crucially, predictive modeling is context-sensitive: the relationship between eye-tracking signals and cognitive states shifts across AI conditions. Finally, fusing eye-tracking features with user priors (demographics, AI literacy/experience, and propensity to trust technology) improves cross-participant generalization. These findings support condition-aware and personalized user modeling for cognitively aligned adaptive AI systems.

cs.HC↗

RSGPNet: Geometric Prompting for Remote Sensing Open-Vocabulary Semantic Segmentation

Open-vocabulary semantic segmentation (OVSS) enables text-guided segmentation of unseen objects, breaking fixed-class limitations to achieve open-world understanding. However, existing OVSS methods primarily focus on modifying the CLIP attention mechanism, which still suffers from unstable local segmentation for remote sensing (RS) domain. To address these limitations, we propose RSGPNet, a training-free geometric prompting framework for RS OVSS that refines segmentation by leveraging object geometric areas and consistency constraints. Specifically, RSGPNet comprises three core modules: a Text-guided Coarse Mask module (TCM), a Geometric Re-prompting Module (GRP), and a Coarse-to-fine Consistency Verification Mechanism (CVM). TCM utilizes text prompts and the input image to construct initial coarse segmentation masks. GRP then converts these coarse masks into geometric box prompts, feeding them back into the segmentation model to generate refined masks. Finally, CVM employs consistency computation to prevent prompting from reinforcing erroneous regions. They allow the model to improve segmentation accuracy in complex areas, such as category boundaries. Extensive experiments on RS datasets demonstrate that RSGPNet significantly outperforms state-of-the-art methods across both quantitative and qualitative metrics while exhibiting excellent interpretability. The code is released at \href{https://github.com/wangshanwen001/RSGPNet}{https://github.com/wangshanwen001/RSGPNet}.

cs.CV↗

Seeing the Reasoning: How LLM Rationales Influence User Trust and Decision-Making in Factual Verification Tasks

Large Language Models (LLMs) increasingly show reasoning rationales alongside their answers, turning "reasoning" into a user-interface element. While step-by-step rationales are typically associated with model performance, how they influence users' trust and decision-making in factual verification tasks remains unclear. We ran an online study (N=68) manipulating three properties of LLM reasoning rationales: presentation format (instant vs. delayed vs. on-demand), correctness (correct vs. incorrect), and certainty framing (none vs. certain vs. uncertain). We found that correct rationales and certainty cues increased trust, decision confidence, and AI advice adoption, whereas uncertainty cues reduced them. Presentation format did not have a significant effect, suggesting users were less sensitive to how reasoning was revealed than to its reliability. Participants indicated they use rationales to primarily audit outputs and calibrate trust, where they expected rationales in stepwise, adaptive forms with certainty indicators. Our work shows that user-facing rationales, if poorly designed, can both support decision-making yet miscalibrate trust.

cs.HC↗

When LLM Rationales Become User-Facing: Effects on Trust Perception, Decision-Making, and Gaze Behaviors

Large language models (LLMs) increasingly show step-by-step reasoning rationales alongside their answers, turning reasoning from an internal model capability into a user-facing interface feature. Yet it is unclear whether such rationales help users judge when trust is warranted or merely persuade through fluent reasoning. We address this gap through the lens of auditable trust calibration: user-facing rationales should help people inspect whether an answer is warranted by evidence. We test this framing in factual verification through two linked studies. Study 1, an online experiment (N=68), manipulated rationale presentation format (instant, delayed, on demand), rationale correctness (correct, incorrect), and certainty framing (none, certain, uncertain). Study 2, a controlled eye-tracking study (N=54), examined how no-, correct-, and incorrect-rationale conditions were associated with users' trust, decision-making, and eye-movement patterns. Study 1 showed no reliable presentation-format effects; instead, rationale correctness and certainty framing influenced the trust in the information, trust in the LLM system, and decision confidence. In Study 2, incorrect rationales drew more attention to the supporting evidence and larger pupil diameter while the rationale was viewed, consistent with greater cognitive effort. Incorrect rationales also lowered trust in LLM system relative to showing no rationale, whereas the no-rationale difference was weaker for trust in information. A post-hoc predictive modeling analysis of gaze data from Study 2 further showed that gaze features carried predictive signal for trust- and decision-related user states. This work challenges the assumption that more reasoning is always better and supports rationale designs that are selective, linked to evidence, calibrated in how they express certainty, and easier to verify.

cs.HC↗

KBQA-R1: Reinforcing Large Language Models for Knowledge Base Question Answering

Knowledge Base Question Answering (KBQA) challenges models to bridge the gap between natural language and strict knowledge graph schemas by generating executable logical forms. While Large Language Models (LLMs) have advanced this field, current approaches often struggle with a dichotomy of failure: they either generate hallucinated queries without verifying schema existence or exhibit rigid, template-based reasoning that mimics synthesized traces without true comprehension of the environment. To address these limitations, we present \textbf{KBQA-R1}, a framework that shifts the paradigm from text imitation to interaction optimization via Reinforcement Learning. Treating KBQA as a multi-turn decision process, our model learns to navigate the knowledge base using a list of actions, leveraging Group Relative Policy Optimization (GRPO) to refine its strategies based on concrete execution feedback rather than static supervision. Furthermore, we introduce \textbf{Referenced Rejection Sampling (RRS)}, a data synthesis method that resolves cold-start challenges by strictly aligning reasoning traces with ground-truth action sequences. Extensive experiments on WebQSP, GrailQA, and GraphQuestions demonstrate that KBQA-R1 achieves state-of-the-art performance, effectively grounding LLM reasoning in verifiable execution.

cs.CL↗

Uniqueness of bound states to the logarithmic Schrödinger equation

This paper studies the uniqueness of bound states for the problem Δu + u\log u ^2=0, \quad u\in H^1(\RN), \quad n\geq 2, which arises from the logarithmic Schrödinger equation. We prove that for every integer $k\geq 1$, there exists a unique radial solution $u(r)=u(|x|)$ that has exactly $k$ simple zeros for $r>0$. This resolves an open problem posed by Troy [{Arch. Ration. Mech. Anal.} 222 (2016), 1581--1600] and confirms the Berestycki-Lions conjecture for the logarithmic nonlinearity. The proof combines the shooting method with suitable auxiliary functions introduced by Tang [{Invent. math.} 243 (2026), 245--291]. A major difficulty arises from the singular behavior of the nonlinearity $f(u)=u \log u^2$ at origin. We overcome it by establishing asymptotic convergence and sharp decay rates at infinity for any ground state or bound state. More precisely, every such solution satisfies \lim_{r\to\infty}\frac{ u'(r)}{u(r) \sqrt{\abs{ \log u^2(r)}}}=\lim_{r\to\infty}\frac{u'(r)}{ru(r)} = -1, \quad \limsup_{r\to\infty}|u(r)|e^{(\frac12-ε)r^2}<\infty, ~~\forall ε\in ( 0,\frac{1}{2}). These asymptotic behaviors are of independent interest and may be useful for other problems involving logarithmic nonlinearities.

math.AP↗