SearcharxivSearch

arXiv subjects

Xiao Xiao

Publications and source records attributed to Xiao Xiao.

At least 19 recordsLinked to original sources

Enhancing Communication in Speech Therapy: Exploring the Cognitive Synergy Between Gesture and Speech

This paper examines the adaptation of a rhythm-based interface, originally designed for manual dexterity rehabilitation, for use in speech therapy. The interface allows users to control synthesized vocal phrases through finger tapping, leveraging the cognitive link between gesture and speech. Through interviews with four therapists and pilot tests with one speech therapist and eight children with speech impairments (autism, Down syndrome, verbal apraxia, dyslexia), we found that the interface improves motivation and therapeutic outcomes by facilitating more interactions between verbally challenged patients and the therapist. Our findings suggest that rhythmic gestures can enhance verbal communication, offering potential for broader therapeutic and educational applications.

cs.HC

Learning Interpretable Tumor Microenvironment Representations by Fitting Pan-Cancer Cell State-Niche Correlation

In the tumor microenvironment, cell's state is influenced by cell-cell interactions (CCIs) with neighboring cells in its niches. Identifying dysregulated CCIs that are associated with pathogenic process pinpoints targets for drug discovery. Imaging-based spatial transcriptomics and single-cell RNA sequencing provide, respectively, single-cell spatial information and transcriptome-wide measurements needed to study CCIs, but neither modality provides both. Existing spatial transcriptomics foundation models also cannot effectively learn from spatially resolved single-cell data with full-transcriptome coverage, explicitly infer the CCI mechanisms driving cell state-niche associations, or interpretable enough to support direct biological interpretations. Here, we present GITIII-scale, a hierarchical, interpretable pan-cancer spatial transcriptomics foundation model for TME representation learning that investigates cell state-niche associations and their underlying ligand-receptor (LR) signaling pathways. GITIII-scale uses transformers to model interactions between pairs of cells at defined spatial distances, an interpretable single-layer graph transformer without a feed-forward network to decompose how each gene in a receiver cell is influenced by each neighboring sender cell, and a graph transformer to generate cellular-neighborhood embeddings. Trained on our assembled pan-cancer database of specimen-matched scRNA-seq and imaging-based spatial transcriptomics datasets, GITIII-scale generated TME embeddings that recovered niche-associated state changes more accurately than existing spatial transcriptomics foundation models in cancer types unseen during training. A case study of an unseen breast cancer dataset further demonstrated the model's interpretability by identifying potentially drug-targetable LR pathways associated with endothelial overgrowth and tumorigenesis.

q-bio.GN

Musical Mirrors: The LLM as Sounding Board in Songwriting

This paper examines a use of AI in creative practice as an interpretive sounding board for human-generated material, rather than the more familiar pattern of AI generation followed by human curation. Through the lens of resonance as theorized by Hartmut Rosa, I present a first-person case study of songwriting from July 2025 to March 2026, drawing on 16 original pieces in English, French, and other languages along with piano solos. I describe a configuration in which resonance is not located between user and model, but in the author's deepening contact with their own material, mediated through the model. This kind of resonance was supported rather than inhibited by AI when sounding-board behavior was cultivated through sustained calibration by the user. Two failure modes appeared when calibration was absent: sycophantic drift and magical overinterpretation. This account suggests both the potential and the risks of AI as an interpretive partner in creative practice.

cs.HC

ET-Prune: Evidence-Aware Dynamic Budgeting for Visual Token Pruning in Text-Rich MLLMs

Visual token pruning reduces the inference cost of multimodal large language models, but a fixed token ratio is poorly matched to text-rich inputs. In OCR-centric tasks, decisive evidence can be a small number, label, or field whose relevance is specified by the question; indiscriminate pruning can erase that evidence while retaining visually salient but irrelevant regions. We present ET-Prune, a training-free framework that casts pruning as evidence allocation. It derives question-conditioned evidence from a decoder-side partial query-key block, safeguards text-like spatial regions, and converts evidence uncertainty and density into a sample-specific token floor. Three progressive middle-layer events then move the sequence toward this budget, retaining more tokens for diffuse or text-dense evidence and pruning concentrated evidence more aggressively. At the observed point estimates from one deterministic pass per configuration, ET-Prune leads or ties among pruned methods in all six backbone-benchmark comparisons at roughly half tokens. On OCRBench-v2, it leads the strongest pruned baselines by 1.80 and 0.68 percentage points on Qwen3-VL-8B and InternVL3.5-8B, respectively, while retaining about half of the visual tokens; on MMBench v1.1, it reaches 0.8467 circular exact-matching accuracy versus 0.8437 for Vanilla at 54.45% average visual-token retention. These results show a favorable observed quality-cost trade-off for evidence-aware dynamic budgeting in text-rich multimodal inference.

cs.CV

Improving Item Discoverability in e-Commerce Search via Related Intent Generation

Traditional search systems are optimized to retrieve items that strictly match a query, often prioritizing precision over recall. In e-commerce marketplaces and particularly grocery, this paradigm is limiting, as user satisfaction and commercial outcomes depend heavily on the discoverability of substitute, complementary, and thematically related items. In this paper, we present a scalable system for discovery-augmented search that leverages intent-conditioned recall expansion. Our approach generates implicit user intents to expand candidate recall while maintaining relevance. The system addresses the cost-quality tradeoff of generative retrieval through a two-stage hybrid architecture. First, we leverage closed-weight large language models (LLMs) to maximize discoverability for head queries. To extend these benefits to tail queries, we then introduce a finetuned small language model (SLM), trained via LoRA adapters and teacher-student distillation. We evaluate the system using a rigorous dual framework: (a) LLM-as-a-judge metrics validated against human preferences for semantic quality, and (b) end-to-end session-level purchase analysis. Results demonstrate that our approach improves both intent generation quality and downstream retrieval effectiveness, extending discovery coverage from approximately 60% to 80% of query traffic at roughly 30% of the teacher model's inference cost, offering a viable path for deployment in large-scale marketplaces. Beyond relevance gains, discovery-augmented search may serve as a marketplace-balancing mechanism, giving long-tail and emerging supply an opportunity for query-conditioned exposure.

cs.IR

BrainPilot: Automating Brain Discovery with Agentic Research

Understanding the brain increasingly depends on integrating evidence across scales, modalities, and disciplines. Addressing a single research question therefore requires a coordinated sequence of operations, from surveying prior work to executing analyses and interpreting results in light of domain knowledge. AI agents promise to accelerate this process, but current agents lack domain expertise in brain science, may fabricate claims, drift during multi-step reasoning, and offer few defined points for expert intervention. These failures are especially costly in brain science, where conclusions feed into downstream scientific claims and depend on laboratory-specific expertise and careful human judgment. We present \textbf{BrainPilot} a \textbf{fully open-source} multi-agent system that accelerates brain science research with traceable logs and agent-verified results. A principal investigator (PI) agent coordinates specialist agents grounded in curated domain knowledge: a unified brain science knowledge base containing 7{,}233 indexed items and a skill library of 72 reusable methodology units across seven research domains. Every major step is recorded in the Graph of Trace, an auditable record that links subgoals, tool use, evidence, and claims and allows researchers to follow and inspect the workflow. An Auditor agent further integrates fabrication checking into the workflow. For evaluation, we run three brain science tasks from Agents' Last Exam, introduce our own benchmark, \textbf{BrainPilotBench-v0}, and present additional end-to-end case studies. Across these evaluations, BrainPilot with an open-source backbone model attains performance comparable to state-of-the-art agent framework with less costs.

cs.AI

Probing two-spin entanglement at quantum criticality on a quantum processor

Quantum phase transitions in many-body systems give rise to highly entangled states, and understanding their quantum correlations is crucial for characterizing quantum materials. However, traditional entanglement measures such as entanglement entropy are difficult to interpret for noisy or mixed states and require complex circuits to evaluate. Therefore, we explore the Positive Partial Transpose (PPT) criterion, coupled with overlapping state tomography, as an efficient and scalable spin-spin entanglement witness. It detects pairwise entanglement from reduced density matrices, distinguishes quantum from classical correlations, and applies to both pure and mixed states. It is ideal for studying condensed matter systems prepared on noisy quantum devices as well as future extensions to finite temperatures. We demonstrate the approach on quantum hardware, using variational circuits to prepare quantum critical states with up to 20 qubits and completely map their two-spin entanglement across various quantum phase transitions.

quant-ph

Nodal Topological Superconductivity Driven by Crystalline Antiunitary Symmetry in Altermagnets

Topological superconductivity hosts protected quasiparticles and is central to topological quantum computation, yet its realization in intrinsic materials remains challenging and often relies on engineered platforms. Here we uncover a symmetry-constrained mechanism for nodal topological superconductivity in altermagnets. Focusing on fourfold rotational collinear altermagnets, we show that the native crystalline antiunitary symmetry $\mathcal{T}C_{4z}$ generically forbids pure spin-singlet pairing and selects pairing structures that admit Bogoliubov-de Gennes (BdG) Hamiltonians with emergent chiral symmetries. These symmetries further give rise to robust nodal topological phases over broad parameter regimes, including a nodal-point phase hosting Majorana flat bands (MFBs) and two distinct nodal-loop phases with chiral Majorana edge states. Notably, the nodal structure persists even after spontaneous breaking of the antiunitary symmetry, indicating that the topology originates from symmetry-constrained pairing rather than direct symmetry protection. Finally, we propose tunneling signatures that can distinguish these nodal phases and probe symmetry breaking experimentally.

cond-mat.supr-con

Evaluating Developmental Cognition Capabilities of LLMs

Conversational AI is increasingly personalized around users' preferences, histories, goals, and knowledge, but much less around how users interpret and take up model outputs to construct and understand their reality. We draw on Robert Kegan's constructive-developmental theory as a complementary lens on this dimension. Existing methods for assessing developmental stage in the Keganian tradition rely either on expert interviews that do not scale or on sentence-completion instruments that are proprietary, lengthy, or invasive. To make this perspective tractable for LLM evaluation, we introduce the Developmental Sentence Completion Test (DSCT), a 20-item instrument designed to elicit developmental signal in self-administered text. Throughout, we treat the resulting labels as characterizations of stage-like structure in elicited responses, not as validated person-level developmental stage. We then ask how much of that signal can be recovered by LLMs across three elicited response regimes: simulated personas, real human respondents, and default model-generated answers. On simulated personas, top frontier models recover simulator-intended labels with high accuracy. On real human DSCT responses, human-LLM agreement is fair, with much stronger within-neighborhood than exact agreement. Finally, when LLMs answer DSCT prompts without persona-conditioning, their responses exhibit stable stage-like differences across model families, with larger and newer models tending to generate higher-rated text. These results suggest that stage-conditioned signal is cleaner in synthetic responses than in human-written DSCT text, and that the core constraint for stage-aware conversational AI is not classifier accuracy alone, but the availability of developmental signal from elicited text.

cs.AI

Trace estimates and improved pointwise bounds for joint eigenfunctions

For $L^2$-normalized joint eigenfunctions in a quantum integrable system, [GT20] gave polynomial improvements over the standard Hömander bounds for typical points. In this paper, we improve their result by establishing a sharp bound of $h^{\frac{-n+k+1}2}$ for the points satisfying a rank $k$ non-degeneracy condition.

math.AP

Neural parametric representations for thin-shell shape optimisation

Shape optimisation of thin-shell structures requires a flexible, differentiable geometric representation suitable for gradient-based optimisation. We propose a neural parametric geometry representation (NRep) for shells based on a neural network with periodic activation functions. The NRep is defined using a multi-layer perceptron (MLP), which maps the parametric coordinates of mid-surface vertices to their physical coordinates. A structural compliance optimisation problem is posed to optimise the shape of a thin-shell parameterised by the NRep subject to a volume constraint, with the network parameters as design variables. The resulting shape optimisation problem is solved using a gradient-based optimisation algorithm. Benchmark examples with classical solutions and comparisons with the free-form deformation method demonstrate that the proposed NRep is capable of representing shell geometries with local geometric features using a small set of network parameters. The robustness of the approach has been demonstrated with different initial geometries, boundary conditions and neural network hyperparameters. The approach also exhibits potential for complex lattice-skin structures, owing to the compact and expressive geometry representation afforded by the NRep.

math.NA

In-situ benchmarking of fault-tolerant quantum circuits. I. Clifford circuits

Benchmarking physical devices and verifying logical algorithms are important tasks for scalable fault-tolerant quantum computing. Numerous protocols exist for benchmarking devices before running actual algorithms. In this work, we show that both physical and logical errors of fault-tolerant circuits can even be characterized in-situ using syndrome data. To achieve this, we map general fault-tolerant Clifford circuits to subsystem codes using the spacetime code formalism and develop a scheme for estimating Pauli noise in Clifford circuits using syndrome data. We give necessary and sufficient conditions for the learnability of physical and logical noise from given syndrome data, and show that we can accurately predict logical fidelities from the same data. Importantly, our approach requires only a polynomial sample size, even when the logical error rate is exponentially suppressed by the code distance, and thus gives an exponential advantage against methods that use only logical data such as direct fidelity estimation. We demonstrate the practical applicability of our methods in various scenarios using synthetic data as well as the experimental data from a recent demonstration of fault-tolerant circuits by Bluvstein et al. [Nature 626, 7997 (2024)]. Our methods provide an efficient, in-situ way of characterizing a fault-tolerant quantum computer to help gate calibration, improve decoding accuracy, and verify logical circuits.

quant-ph

Topology-Aware Block Coordinate Descent for Qubit Frequency Allocation of Superconducting Quantum Processors

Pre-execution calibration is a major bottleneck for operating superconducting quantum processors, and qubit frequency allocation is especially challenging due to crosstalk-coupled objectives. We establish that the widely-used Snake optimizer is mathematically equivalent to Block Coordinate Descent (BCD), providing a rigorous theoretical foundation for this strategy for qubit frequency allocation. Building on this formalization, we present a topology-aware block ordering obtained by casting order selection as a Sequence-Dependent Traveling Salesman Problem (SD-TSP) and solving it efficiently with a nearest-neighbor heuristic. The SD-TSP cost reflects how a given block choice expands the reduced-circuit footprint required to evaluate the block-local objective, enabling orders that minimize per-epoch evaluation time. Under local crosstalk/bounded-degree assumptions, the method achieves linear complexity in qubit count per epoch, while maintaining comparable optimization performance. We formalize the calibration objective, clarify when reduced experiments are equivalent or approximate to the full objective, and analyze convergence of the resulting inexact BCD with noisy measurements. Simulations based on a physics-motivated error simulator show that the proposed BCD-NNA ordering attains the same optimization accuracy at markedly lower runtime than graph-based heuristics (BFS, DFS) and random orders, while also achieving optimization quality comparable to a genetic-algorithm baseline. This method is robust to noisy objective-function evaluations and tolerant to moderate non-local crosstalk mismatch. These results provide a scalable, implementation-ready workflow for frequency calibration in near-term superconducting processors and, more broadly, for locality-structured calibration tasks in future scalable architectures.

quant-ph

Bayesian buckling load optimisation for structures with geometric uncertainties

Optimised lightweight structures, such as shallow domes and slender towers, are prone to sudden buckling failure because geometric uncertainties/imperfections can lead to a drastic reduction in their buckling loads. We introduce a framework for the robust optimisation of buckling loads, considering geometric nonlinearities and random geometric imperfections. The mean and standard deviation of buckling loads are estimated by Monte Carlo sampling of random imperfections and performing a nonlinear finite element computation for each sample. The extended system method is employed to compute the buckling load directly, avoiding costly path-following procedures. Furthermore, the quasi-Monte Carlo sampling using the Sobol sequence is implemented to generate more uniformly distributed samples, which significantly reduces the number of finite element computations. The objective function consisting of the weighted sum of the mean and standard deviation of the buckling load is optimised using Bayesian optimisation. The accuracy and efficiency of the proposed framework are demonstrated through robust sizing optimisation of several geometrically nonlinear truss examples.

math.NA

Transmon qutrit-based simulation of spin-1 AKLT systems

Qutrit-based quantum circuits could help reduce the overall circuit depths, and hence the effect of noise, when the system of interest has a local dimension of three. Accessing second excited states in superconducting transmons provides a straightforward hardware realization of qutrits useful for such ternary encoding. In this work, we successfully calibrate microwave pulse gates to a low error rate to operate transmon qutrits. We use these qutrits to simulate one-dimensional spin-1 AKLT states (Affleck, Kennedy, Lieb, and Tasaki), which exhibit a multitude of interesting phenomena, such as topologically protected ground states, string order, and the existence of a robust Berry phase. We demonstrate the efficacy of qutrit-based simulation by preparing high-fidelity ground states of the AKLT Hamiltonian with open boundaries for various chain lengths. We then use ground state preparations of the perturbed AKLT Hamiltonian with periodic boundaries to calculate the Berry phase and illustrate non-trivial ground state topology. To establish the advantage of qutrits over qubits in the presence of noise, we present scalable methods for preparing the AKLT state and computing its Berry phase using tensor network simulations. Our work provides a pathway toward more general spin-1 physics simulations using transmon qutrits, with applications in chemistry, magnetism, and topological phases of matter.

quant-ph

Unveil A Peculiar Light Curve Pattern of Magnetar Burst with GECAM observations of SGR J1935+2154

Magnetar X-ray Burst (MXB) is usually composed of a single pulse or multiple pulses with rapid rise and brief duration mostly observed in hard X-ray (soft gamma-ray) band. Previous work studied the temporal behavior of some magnetar bursts and employed the Fast Rise Exponential Decay (FRED) model to fit pulses of MXB. However, whether there is other kind of pulse shape has not been explored. In this study, we systematically examined light curve of MXBs from SGR J1935+2154 detected by GECAM between 2021 and 2022. We find that there are different light curve morphologies. Especially, we discover a peculiar and new pattern, Exponential Rise and Cut-Off Decay (ERCOD), which is significantly different from FRED and could be well described by a mathematical function we proposed. We find that MXBs with ERCOD shape are generally longer in duration, brighter in the peak flux, and harder in spectrum. We note that the ERCOD shape is not unique to SGR J1935+2154 but also present in other magnetars. This new light curve pattern may imply a special burst and radiation mechanism of magnetar.

astro-ph.HE

$L^2$ restriction bounds for analytic continuations of quantum ergodic Laplace eigenfunctions

We prove a quantum ergodic restriction (QER) theorem for real hypersurfaces $Σ\subset X,$ where $X$ is the Grauert tube associated with a real-analytic, compact Riemannian manifold. As an application, we obtain $h$ independent upper and lower bounds for the $L^2$ - restrictions of the FBI transform of Laplace eigenfunctions restricted to $Σ$ satisfying certain generic geometric conditions.

math.AP

Green's Function Methods for Computing Supercurrents in Josephson Junctions

Interest in Josephson junctions (JJs) has increased rapidly in recent years not only because of their use in qubits and other quantum devices but also due to the unique physics supported by the JJs. The advent of various novel quantum materials for both the barrier region and the superconducting leads has led to the possibility of adding new functionalities to the JJs. Thus, there is a growing need for accurate modeling of the JJs and related systems to enable their predictive control and atomistic level understanding. This review presents an in-depth discussion of a Green's function-based formalism for computing supercurrents in JJs. The formulation is tailored for large-scale atomistic simulations and encompasses both dc and ac supercurrents. We hope that this review will provide a timely and comprehensive reference for researchers as well as beginning practitioners interested in Green's-function-based methods to model supercurrents in JJs.

cond-mat.supr-con