Searcharxiv⌕ Search

arXiv subjects

Rui Xu

Publications and source records attributed to Rui Xu.

At least 55 records · Page 3Linked to original sources
arXiv2026

Strips as Tokens: Artist Mesh Generation with Native UV Segmentation

Recent advancements in autoregressive transformers have demonstrated remarkable potential for generating artist-quality meshes. However, the token ordering strategies employed by existing methods typically fail to meet professional artist standards, where coordinate-based sorting yields inefficiently long sequences, and patch-based heuristics disrupt the continuous edge flow and structural regularity essential for high-quality modeling. To address these limitations, we propose Strips as Tokens (SATO), a novel framework with a token ordering strategy inspired by triangle strips. By constructing the sequence as a connected chain of faces that explicitly encodes UV boundaries, our method naturally preserves the organized edge flow and semantic layout characteristic of artist-created meshes. A key advantage of this formulation is its unified representation, enabling the same token sequence to be decoded into either a triangle or quadrilateral mesh. This flexibility facilitates joint training on both data types: large-scale triangle data provides fundamental structural priors, while high-quality quad data enhances the geometric regularity of the outputs. Extensive experiments demonstrate that SATO consistently outperforms prior methods in terms of geometric quality, structural coherence, and UV segmentation. Project page: https://ruixu.me/html/SATO/index.html

cs.CV↗
arXiv2026

Geometry-Calibrated Conformal Abstention for Language Models

When language models lack relevant knowledge for a given query, they frequently generate plausible responses that can be hallucinations, rather than admitting being agnostic about the answer. Retraining models to reward admitting ignorance can lead to overly conservative behaviors and poor generalization due to scarce evaluation benchmarks. We propose a post hoc framework, Conformal Abstention (CA), adapted from conformal prediction (CP) to determine whether to abstain from answering a query. CA provides finite-sample guarantees on both the probability of participation (i.e., not abstaining) and the probability that the generated response is correct. Importantly, the abstention decision relies on prediction confidence rather than the non-conformity scores used in CP, which are intractable for open-ended generation. To better align prediction confidence with the model's ignorance, we introduce a calibration strategy using representation geometry within the model to measure knowledge involvement in shaping the response. Experiments demonstrate that we improve selective answering significantly with 75 percent conditional correctness.

cs.CL↗
arXiv2026

ComboStoc: Combinatorial Stochasticity for Diffusion Generative Models

In this paper, we study an under-explored but important factor of diffusion generative models, i.e., the combinatorial complexity. Data samples are generally high-dimensional, and for various structured generation tasks, additional attributes are combined to associate with data samples. We show that the space spanned by the combination of dimensions and attributes can be insufficiently covered by existing training schemes of diffusion generative models, potentially limiting test time performance. We present a simple fix to this problem by constructing stochastic processes that fully exploit the combinatorial structures, hence the name ComboStoc. Using this simple strategy, we show that network training is significantly accelerated across diverse data modalities, including images and 3D structured shapes. Moreover, ComboStoc enables a new way of test time generation which uses asynchronous time steps for different dimensions and attributes, thus allowing for varying degrees of control over them. Our code is available at: https://github.com/Xrvitd/ComboStoc

cs.LG↗
arXiv2026

HER: Human-like Reasoning and Reinforcement Learning for LLM Role-playing

LLM role-playing, i.e., using LLMs to simulate specific personas, has emerged as a key capability in various applications, such as companionship, content creation and digital games. While current models effectively capture character tones and knowledge, simulating the inner thoughts behind their behaviors remains a challenge. Towards cognitive simulation in LLM role-play, previous efforts mainly suffer from two deficiencies: lacking data with high-quality reasoning traces, and lacking reliable reward signals aligned with human preferences. In this paper, we propose HER, a unified framework for cognitive-level persona simulation. HER introduces dual-layer thinking, which distinguishes characters' first-person thinking from LLMs' third-person thinking. To bridge these gaps, we curate reasoning-augmented role-playing data via reverse engineering, and construct human-aligned principles and reward models. Leveraging these resources, we train HER models based on Qwen3-32B via supervised and reinforcement learning. Extensive experiments validate the effectiveness of our approach. Notably, our models significantly outperform the Qwen3-32B baseline, achieving a 30.26 improvement on the CoSER benchmark and a 14.97% gain on the Minimax Role-Play Bench. Our datasets, principles, and models are released to facilitate future research.

cs.LG↗
arXiv2026

Chip-Scale Aligned Chiral Carbon Nanotubes Exhibiting Giant Second Harmonic Generation

Chiral carbon nanotubes (CNTs) are direct-gap semiconductors with optical properties governed by one-dimensional excitons with enormous oscillator strengths. Each species of chiral CNTs has an enantiomeric pair of left- and right-handed CNTs with nearly identical properties, but enantiomer-dependent phenomena can emerge, especially in nonlinear optical processes. Theoretical studies have predicted strong second-order nonlinearities in chiral CNTs, but no experimental quantitative verification has been reported due to the lack of macroscopically ordered assemblies of single-enantiomer chiral CNTs. Here, we report the synthesis of centimeter-scale, densely packed, aligned single-enantiomer chiral CNT films that are microfabrication-compatible. We observe giant second harmonic generation (SHG) emission from the chiral CNT film, which originates from the intrinsic chirality and inversion symmetry breaking of the atomic structure of chiral CNTs. The observed nonlinear susceptibility of the as-fabricated film reaches $4.9\times 10^2$\,pm/V at a pump wavelength of 1030\,nm, corresponding to the lowest-energy excitonic resonance, indicating $χ_{xyz} = 1.6\times 10^3$\,pm/V for a perfectly aligned CNT crystal. Our calculations based on many-body theory correctly estimate the spectrum and magnitude of such excitonically enhanced optical nonlinearity. These results are promising for the development of scalable chiral-CNT electronics and nonlinear photonics.

physics.app-ph↗
arXiv2026

CLASP: Training-Free LLM-Assisted Source Code Watermarking via Semantic-Preserving Transformations

The proliferation of open-source code and large language models (LLMs) for code generation has amplified the risks of unauthorized reuse and intellectual property infringement. Source code watermarking offers a potential solution, yet existing methods typically encode watermarks through identifiers, local code patterns, or limited handcrafted edits, leaving them vulnerable to renaming, refactoring, and adaptive watermark removal. These limitations hinder the joint achievement of robustness, capacity, generalization, and deployment efficiency. We propose CLASP, a Code LLM-Assisted Semantic-Preserving watermarking framework that enables training-free, plug-and-play watermarking for source code. CLASP embeds watermark bits within a fixed space of semantics-preserving transformations, enabling automated watermark insertion with higher capacity while remaining reusable across programming languages and less dependent on brittle lexical features. To recover the watermark, CLASP uses reference-code retrieval and differential comparison to identify transformation traces, avoiding task-specific model training while improving robustness to structural edits and adaptive attacks. Experiments across multiple programming languages show that CLASP consistently outperforms existing baselines in watermark extraction accuracy and robustness, while maintaining code quality under both random removal and adaptive de-watermarking attacks.

cs.CR↗
arXiv2026

Uncertainty Quantification on Graph Learning: A Survey

Graphical models have demonstrated their exceptional capabilities across numerous applications. However, their performance, confidence, and trustworthiness are often limited by the inherent randomness in data generation and the lack of knowledge to accurately model real-world complexities. There has been increased interest in developing uncertainty quantification (UQ) techniques tailored to graphical models. In this survey, we systematically examine existing works on UQ for graphical models. This survey distinguishes itself from most existing UQ surveys by specifically concentrating on graphical models, including graph neural networks and graph foundation models. We organize the literature along two complementary dimensions: uncertainty representation and uncertainty handling. By synthesizing both established methodologies and emerging trends, we aim to bridge gaps in understanding key challenges and opportunities in UQ for graphical models, inspiring researchers on graphical models or uncertainty quantification to make further advancements at the cross of the two fields.

cs.LG↗
arXiv2026

Risk Control of Traffic Flow Through Chance Constraints and Large Deviation Approximation

Existing macroscopic traffic control methods often struggle to strictly regulate rare, safety-critical extreme events under stochastic disturbances. In this paper, we develop a rare chance-constrained optimal control framework for autonomous traffic management. To efficiently enforce these probabilistic safety specifications, we exploit a large deviation theory (LDT) based approximation method, which converts the original highly non-convex, sampling-heavy optimization problem into a tractable deterministic nonlinear programming problem. In addition, the proposed LDT-based reformulation exhibits superior computational scalability, as it maintains a constant computational burden regardless of the target violation probability level, effectively bypassing the extreme scaling bottlenecks of traditional sampling-based methods. The effectiveness of the proposed framework in achieving precise near-target probability control and superior computational efficiency over risk-averse baselines is illustrated through extensive numerical simulations across diverse traffic risk measures.

math.OC↗
arXiv2026

The stealth Kerr solution in the bumblebee gravity

In this paper, we find Kerr solution accompanied with a nontrivial vector field as a solution to one of the simplest vector-tensor theories of gravity, namely the bumblebee model with an intriguing coupling constant between the Ricci curvature tensor and the vector field. We also demonstrate that the accompanied vector field can be generated via the Newman-Janis algorithm from a simple spherical vector field, which together with the Schwarzschild metric constitutes a solution to the same bumblebee model. It is probably the simplest example of a theory and its black-hole solutions for the Newman-Janis algorithm to hold except for general relativity.

gr-qc↗
arXiv2026

InterveneBench: Benchmarking LLMs for Intervention Reasoning and Causal Study Design in Real Social Systems

Causal inference in social science relies on end-to-end, intervention-centered research-design reasoning grounded in real-world policy interventions, but current benchmarks fail to evaluate this capability of large language models (LLMs). We present InterveneBench, a benchmark designed to assess such reasoning in realistic social settings. Each instance in InterveneBench is derived from an empirical social science study and requires models to reason about policy interventions and identification assumptions without access to predefined causal graphs or structural equations. InterveneBench comprises 744 peer-reviewed studies across diverse policy domains. Experimental results show that state-of-the-art LLMs struggle under this setting. To address this limitation, we further propose a multi-agent framework, STRIDES. It achieves significant performance improvements over state-of-the-art reasoning models. Our code and data are available at https://github.com/Sii-yuning/STRIDES.

cs.CY↗
arXiv2026

Rethinking Visual Token Reduction in LVLMs Under Cross-Modal Misalignment

Large Vision-Language Models (LVLMs) encode visual inputs as dense sequences of patch-level tokens to capture fine-grained semantics. These visual tokens often outnumber their textual counterparts by a large margin, leading to substantial computational overhead and limiting the scalability of LVLMs in practice. Previous efforts have explored visual token reduction either prior to or within the large language models (LLMs). However, most in-LLM reduction approaches rely on text-conditioned interactions, implicitly assuming that textual tokens can reliably capture the importance of visual tokens. In this work, we revisit this assumption and reveal causal, semantic, and spatial forms of cross-modal misalignment. These misalignments undermine the effectiveness of text-guided visual token reduction. To address this, we introduce VisionDrop, a training-free, visual-only pruning framework that selects informative visual tokens based on intra-modal (visual-to-visual) attention, without relying on textual signals. To further suppress redundancy throughout the model hierarchy, we treat the visual encoder and the LLM as a unified system and design a progressive pruning pipeline. Our method performs dominant token selection and lightweight contextual merging at multiple stages, enabling fine-grained visual information to be retained even under aggressive token budgets. Extensive experiments across diverse benchmarks show that VisionDrop achieves consistent improvements over existing approaches, despite requiring no additional training or complex modifications. Notably, when integrated with LLaVA-NeXT-7B, VisionDrop achieves a 2.7x reduction in inference latency and 6x in FLOPs, while retaining 95.71% of the original performance.

cs.CV↗
arXiv2026

PartSAM: A Scalable Promptable Part Segmentation Model Trained on Native 3D Data

Segmenting 3D objects into parts is a long-standing challenge in computer vision. To overcome taxonomy constraints and generalize to unseen 3D objects, recent works turn to open-world part segmentation. These approaches typically transfer supervision from 2D foundation models, such as SAM, by lifting multi-view masks into 3D. However, this indirect paradigm fails to capture intrinsic geometry, leading to surface-only understanding, uncontrolled decomposition, and limited generalization. We present PartSAM, the first promptable part segmentation model trained natively on large-scale 3D data. Following the design philosophy of SAM, PartSAM employs an encoder-decoder architecture in which a triplane-based dual-branch encoder produces spatially structured tokens for scalable part-aware representation learning. To enable large-scale supervision, we further introduce a model-in-the-loop annotation pipeline that curates over five million 3D shape-part pairs from online assets, providing diverse and fine-grained labels. This combination of scalable architecture and diverse 3D data yields emergent open-world capabilities: with a single prompt, PartSAM achieves highly accurate part identification, and in a Segment-Every-Part mode, it automatically decomposes shapes into both surface and internal structures. Extensive experiments show that PartSAM outperforms state-of-the-art methods by large margins across multiple benchmarks, marking a decisive step toward foundation models for 3D part understanding.

cs.CV↗
arXiv2026

EvoFSM: Controllable Self-Evolution for Deep Research with Finite State Machines

While LLM-based agents have shown promise for deep research, most existing approaches rely on fixed workflows that struggle to adapt to real-world, open-ended queries. Recent work therefore explores self-evolution by allowing agents to rewrite their own code or prompts to improve problem-solving ability, but unconstrained optimization often triggers instability, hallucinations, and instruction drift. We propose EvoFSM, a structured self-evolving framework that achieves both adaptability and control by evolving an explicit Finite State Machine (FSM) instead of relying on free-form rewriting. EvoFSM decouples the optimization space into macroscopic Flow (state-transition logic) and microscopic Skill (state-specific behaviors), enabling targeted improvements under clear behavioral boundaries. Guided by a critic mechanism, EvoFSM refines the FSM through a small set of constrained operations, and further incorporates a self-evolving memory that distills successful trajectories as reusable priors and failure patterns as constraints for future queries. Extensive evaluations on five multi-hop QA benchmarks demonstrate the effectiveness of EvoFSM. In particular, EvoFSM reaches 58.0% accuracy on the DeepSearch benchmark. Additional results on interactive decision-making tasks further validate its generalization.

cs.AI↗
arXiv2026

CLIP-Guided Unsupervised Semantic-Aware Exposure Correction

Improper exposure often leads to severe loss of details, color distortion, and reduced contrast. Exposure correction still faces two critical challenges: (1) the ignorance of object-wise regional semantic information causes the color shift artifacts; (2) real-world exposure images generally have no ground-truth labels, and its labeling entails massive manual editing. To tackle the challenges, we propose a new unsupervised semantic-aware exposure correction network. It contains an adaptive semantic-aware fusion module, which effectively fuses the semantic information extracted from a pre-trained Fast Segment Anything Model into a shared image feature space. Then the fused features are used by our multi-scale residual spatial mamba group to restore the details and adjust the exposure. To avoid manual editing, we propose a pseudo-ground truth generator guided by CLIP, which is fine-tuned to automatically identify exposure situations and instruct the tailored corrections. Also, we leverage the rich priors from the FastSAM and CLIP to develop a semantic-prompt consistency loss to enforce semantic consistency and image-prompt alignment for unsupervised training. Comprehensive experimental results illustrate the effectiveness of our method in correcting real-world exposure images and outperforms state-of-the-art unsupervised methods both numerically and visually.

cs.CV↗
arXiv2026

Bumblebee cosmology: Tests using distance- and time-redshift probes

In modern cosmology, the discovery of the universe's accelerated expansion has significantly transformed our understanding of cosmic evolution and expansion history. The unknown properties of dark energy, the driver of this acceleration, have not only prompted extensive studies on its nature but also spurred interest in modified gravity theories that might serve as alternatives. In this paper, we adopt a bumblebee vector-tensor modified gravity theory to model the cosmic expansion history and derive predictions for the Hubble parameter. We constrain the bumblebee model parameters using observational data from established probes, including the Pantheon+ Type Ia Supernovae calibrated via the SH0ES (Supernova $H_0$ for the Equation of State) Cepheid distance ladder analysis and Baryon Acoustic Oscillations (BAO) measurements from Dark Energy Spectroscopic Instrument (DESI) Data Release 2 (DR2), as well as recently included cosmic chronometers (CC) and gamma-ray bursts (GRBs). The Markov Chain Monte Carlo (MCMC) sampling of the Bayesian posterior distribution enables us to rigorously constrain the bumblebee models and compare them with the standard $Λ$CDM cosmology. We find that the bumblebee theory on its own can provide sufficiently good fits to the current observational data of distance- and time-redshift relations, suggesting its potential to explain the cosmic background dynamics. However, when compared to $Λ$CDM, the latter still outperforms the former according to the information criteria. We propose that further constraints from cosmological perturbation tests could impose more stringent constraints on bumblebee cosmology.

astro-ph.CO↗
arXiv2026

Bumblebee cosmology: The FLRW solution and the CMB temperature anisotropy

We put into test the idea of replacing dark energy by a vector field against the cosmic microwave background (CMB) observation using the simplest vector-tensor theory, where a massive vector field couples to the Ricci scalar and the Ricci tensor quadratically. First, a remarkable Friedmann-Lemaître-Robertson-Walker (FLRW) metric solution that is completely independent of the matter-energy compositions of the universe is found. Second, based on the FLRW solution as well as the perturbation equations, a numerical code calculating the CMB temperature power spectrum is built. We find that though the FLRW solution can mimic the evolution of the universe in the standard $Λ$CDM model, the calculated CMB temperature power spectrum shows unavoidable discrepancies from the CMB power spectrum measurements.

gr-qc↗
arXiv2026

MemGovern: Enhancing Code Agents through Learning from Governed Human Experiences

While autonomous software engineering (SWE) agents are reshaping programming paradigms, they currently suffer from a "closed-world" limitation: they attempt to fix bugs from scratch or solely using local context, ignoring the immense historical human experience available on platforms like GitHub. Accessing this open-world experience is hindered by the unstructured and fragmented nature of real-world issue-tracking data. In this paper, we introduce MemGovern, a framework designed to govern and transform raw GitHub data into actionable experiential memory for agents. MemGovern employs experience governance to convert human experience into agent-friendly experience cards and introduces an agentic experience search strategy that enables logic-driven retrieval of human expertise. By producing 135K governed experience cards, MemGovern achieves a significant performance boost, improving resolution rates on the SWE-bench Verified by 4.65%. As a plug-in approach, MemGovern provides a solution for agent-friendly memory infrastructure.

cs.SE↗
arXiv2026

Intertwined atomic-nanoscale-microscale structures via intralayer anisotropic Fe-chains in the layered ferromagnet FePd2Te2

Controlling mesoscale and nanoscale material structures and properties through self-organized atomic behavior is essential for atomic-scale manufacturing. However, direct and visual studies on the cross-scale effects of such atomic self-organization on mesoscopic structures remain scarce. Here, we report the intertwined atomic-nanoscale-mesoscale structures via the intralayer Fe-chains in the sandwich-like layered FePd2Te2 crystal by scanning tunneling microscopy (STM) and atomic force microscopy (AFM). The hierarchical orthogonal corrugated morphologies are directly revealed and attributed to its chain-orientation-determined twinning-domain effect. Both Fe-chains of middle-sublayer and two kinds of Te atoms of top-sublayer are further atomically resolved at the sub-Å level, indicating the critical effects of Pd-atoms/voids on the intra-layer anisotropic Fe-chains and the interlayer structural alignment. The thermal-induced and strain-related structural transitions of surface layer are further investigated and discussed based on the proposed filling model of Pd-voids by the intralayer Pd-atoms. Our work not only provides deep understanding of this exotic layered magnetic material, and will inspire more perspectives for tailoring its anisotropic atomic-to-mesoscale structures and properties.

cond-mat.mtrl-sci↗