arXiv subjects

Yan Liu

Publications and source records attributed to Yan Liu.

At least 127 records · Page 7Linked to original sources

arXiv2025

SIG-Chat: Spatial Intent-Guided Conversational Gesture Generation Involving How, When and Where

The accompanying actions and gestures in dialogue are often closely linked to interactions with the environment, such as looking toward the interlocutor or using gestures to point to the described target at appropriate moments. Speech and semantics guide the production of gestures by determining their timing (WHEN) and style (HOW), while the spatial locations of interactive objects dictate their directional execution (WHERE). Existing approaches either rely solely on descriptive language to generate motions or utilize audio to produce non-interactive gestures, thereby lacking the characterization of interactive timing and spatial intent. This significantly limits the applicability of conversational gesture generation, whether in robotics or in the fields of game and animation production. To address this gap, we present a full-stack solution. We first established a unique data collection method to simultaneously capture high-precision human motion and spatial intent. We then developed a generation model driven by audio, language, and spatial data, alongside dedicated metrics for evaluating interaction timing and spatial accuracy. Finally, we deployed the solution on a humanoid robot, enabling rich, context-aware physical interactions.

cs.GR↗

arXiv2025

U2F: Encouraging SWE-Agent to Seize Novelty without Losing Feasibility

Large language models (LLMs) have shown strong capabilities in software engineering tasks, yet most existing LLM-based SWE-Agents mainly tackle well-defined problems using conventional methods, often overlooking alternative or innovative solutions beyond their predefined frameworks. This limitation is evident in open-world software environments, where emerging challenges transcend established paradigms. We propose U2F (Unknown Unknowns to Functional solutions), a cognitive-inspired, uncertainty-embracing multi-agent framework that systematically surfaces "Unknown Unknowns" - novel solution pathways absent from initial formulations but holding innovative potential. U2F consists of two key components: (1) a Discovery-Exploration-Integration agent system for uncovering and synthesizing potential solutions, and (2) cognitive enhancement mechanisms across three dimensions: cross-domain analogical reasoning, reverse thinking, and external validation, which strategically reframe and extend conventional solution boundaries. Applied to 218 real-world software enabler stories curated from authentic engineering tasks, U2F achieved notable improvements: human experts reported a 14 percent increase in overall novelty, 51 percent improvement in semantic novelty, and stable feasibility (4.02/5.0), corroborated by an LLM-based evaluator. These results highlight the potential of embracing uncertainty as a catalyst for innovation in software engineering.

cs.SE↗

arXiv2025

Higher-Order Causal Structure Learning with Additive Models

Causal structure learning has long been the central task of inferring causal insights from data. Despite the abundance of real-world processes exhibiting higher-order mechanisms, however, an explicit treatment of interactions in causal discovery has received little attention. In this work, we focus on extending the causal additive model (CAM) to additive models with higher-order interactions. This second level of modularity we introduce to the structure learning problem is most easily represented by a directed acyclic hypergraph which extends the DAG. We introduce the necessary definitions and theoretical tools to handle the novel structure we introduce and then provide identifiability results for the hyper DAG, extending the typical Markov equivalence classes. We next provide insights into why learning the more complex hypergraph structure may actually lead to better empirical results. In particular, more restrictive assumptions like CAM correspond to easier-to-learn hyper DAGs and better finite sample complexity. We finally develop an extension of the greedy CAM algorithm which can handle the more complex hyper DAG search space and demonstrate its empirical usefulness in synthetic experiments.

cs.LG↗

arXiv2025

Temporal filtered quantum sensing with the nitrogen-vacancy center in diamond

Nitrogen vacancy centers in diamond are among the leading solid state quantum platforms, offering exceptional spatial resolution and sensitivity for applications such as magnetic field sensing, thermometry, and bioimaging. However, in high background environments,such as those encountered in in vitro diagnostics, the performance of NV based sensors can be compromised by strong background fluorescence, particularly from substrates such as nitrocellulose. In this work, we analytically and experimentally investigate the use of pulsed laser excitation combined with time gating techniques to suppress background fluorescence and enhance the signal to noise ratio in NV based quantum sensing, with an emphasis on spin enhanced biosensing. Through experimental studies using mixed ensembles of silicon vacancy and NV centers in bulk diamond, as well as fluorescent nanodiamonds on NC substrates, we demonstrate significant improvements in NV spin resonance visibility, demonstrated by an increase of the SNR by up to 4x, and a resulting measurement time reduction by 16x. The presented technique and results here can help significantly increase the readout efficiency and speed in future applications of NV centers in high background environments, such as in IVD, where the NV centers are used as a fluorescent label for biomolecules.

quant-ph↗

arXiv2025

Revisiting PSF models: unifying framework and high-performance implementation

Localization microscopy often relies on detailed models of point spread functions. For applications such as deconvolution or PSF engineering, accurate models for light propagation in imaging systems with high numerical aperture are required. Different models have been proposed based on 2D Fourier transforms or 1D Bessel integrals. The most precise ones combine a vectorial description of the electric field and precise aberration models. However, it may be unclear which model to choose, as there is no comprehensive comparison between the Fourier and Bessel approaches yet. Moreover, many existing libraries are written in Java (e.g. our previous PSF generator software) or MATLAB, which hinders the integration into deep learning algorithms. In this work, we start from the original Richards-Wolf integral and revisit both approaches in a systematic way. We present a unifying framework in which we prove the equivalence between the Fourier and Bessel strategies and detail a variety of correction factors applicable to both of them. Then, we provide a high-performance implementation of our theoretical framework in the form of an open-source library that is built on top of PyTorch, a popular library for deep learning. It enables us to benchmark the accuracy and computational speed of different models, thus allowing for an in-depth comparison of the existing models for the first time. We show that the Bessel strategy is optimal for axisymmetric beams while the Fourier approach can be applied to more general scenarios. Our work enables efficient PSF computation on CPU or GPU, which can then be included in simulation and optimization pipelines.

physics.optics↗

arXiv2025

A global inverse-problem approach to quantitative photo-switching optoacoustic mesoscopy

In this paper, we propose a global framework that includes a detailed model of the photo-switching and acoustic processes for photo-switching optoacoustic mesoscopy, based on the underlying physics. We efficiently implement two forward models as matrix-free linear operators and join them as one forward operator. Then, we reconstruct the concentration maps directly from the temporal series of acoustic signals through the resolution of one combined inverse problem. For robustness against noise and clean unmixing results, we adopt a hybrid regularization technique composed of the $l_1$ and total-variation regularizers applied to two different spaces. We use a proximal-gradient algorithm to solve the minimization problem. Our numerical results show that our regularized one-step approach is the most robust in terms of noise and experimental setup. It consistently achieves higher-quality images, as compared to two-step or unregularized methods.

physics.optics↗

arXiv2025

Quantum Corrected Geodesic Motion in Polymer Kerr-like Spacetime

Rotating black holes are prevalent in astrophysical observations, and a Kerr-like solution that incorporates quantum gravity effects is essential for constructing realistic models. In this work, we analyze the geodesic motion of massive particles in a Kerr-like polymer spacetime, incorporating quantum corrections via a parameter $A_λ$. We demonstrate that increasing $A_λ$ allows for additional orbital evolution in extreme mass ratio inspiral (EMRI) systems before merging. Our results show that the radii, energy, and angular momentum of both the innermost stable circular orbit (ISCO) and marginal circular orbit (MCO) decrease as $A_λ$ increases. Furthermore, when the primary object becomes a wormhole, both prograde ISCO and MCO can intersect the transition surface at the wormhole throat and vanish as $A_λ$ grows. Additionally, we find that the eccentricity of periodic geodesic motion decreases monotonically with increasing $A_λ$. Finally, we explore the variation of the rational number that characterizes periodic motion and highlight the influence of the quantum parameter on different types of periodic orbits, classified by a set of integers associated with the rational number. This work contributes to the understanding of quantum gravity effects and offers potential observational signatures, particularly in the study of EMRIs.

gr-qc↗

arXiv2025

Energy transport in holographic junctions

We study energy transport in a conformal junction connecting three 2D conformal field theories using the AdS/CFT correspondence. The holographic dual consists of three AdS$_3$ spacetimes joined along the worldsheet of a tensile string anchored at the junction. Within a specific range of string tension, where the bulk solution is uniquely determined, we find that all energy reflection and transmission coefficients vary monotonically with the string tension. Notably, the total energy transmission, which quantifies the energy flux from one CFT through the junction, is bounded above by the effective central charge associated with both the CFTs and the junction. Results for energy transport in conformal interfaces are recovered in a special limit. Furthermore, we extend our analysis to junctions connecting $N$ 2D CFTs.

hep-th↗

arXiv2025

Semantic Surgery: Zero-Shot Concept Erasure in Diffusion Models

Concept erasure in text-to-image diffusion models is crucial for mitigating harmful content, yet existing methods often compromise generative quality. We introduce Semantic Surgery, a novel training-free, zero-shot framework for concept erasure that operates directly on text embeddings before the diffusion process. It dynamically estimates the presence of target concepts in a prompt and performs a calibrated vector subtraction to neutralize their influence at the source, enhancing both erasure completeness and locality. The framework includes a Co-Occurrence Encoding module for robust multi-concept erasure and a visual feedback loop to address latent concept persistence. As a training-free method, Semantic Surgery adapts dynamically to each prompt, ensuring precise interventions. Extensive experiments on object, explicit content, artistic style, and multi-celebrity erasure tasks show our method significantly outperforms state-of-the-art approaches. We achieve superior completeness and robustness while preserving locality and image quality (e.g., 93.58 H-score in object erasure, reducing explicit content to just 1 instance, and 8.09 H_a in style erasure with no quality degradation). This robustness also allows our framework to function as a built-in threat detection system, offering a practical solution for safer text-to-image generation.

cs.CV↗

arXiv2025

EvaLearn: Quantifying the Learning Capability and Efficiency of LLMs via Sequential Problem Solving

We introduce EvaLearn, a pioneering benchmark designed to evaluate large language models (LLMs) on their learning capability and efficiency in challenging tasks, a critical, yet underexplored aspect of model potential. EvaLearn contains 648 challenging problems across six task types, grouped into 182 sequences, each sequence dedicated to one task type. Diverging from most existing benchmarks that evaluate models in parallel, EvaLearn requires models to solve problems sequentially, allowing them to leverage the experience gained from previous solutions. EvaLearn provides five comprehensive automated metrics to evaluate models and quantify their learning capability and efficiency. We extensively benchmark nine frontier models and observe varied performance profiles: some models, such as Claude-3.7-sonnet, start with moderate initial performance but exhibit strong learning ability, while some models struggle to benefit from experience and may even show negative transfer. Moreover, we investigate model performance under two learning settings and find that instance-level rubrics and teacher-model feedback further facilitate model learning. Importantly, we observe that current LLMs with stronger static abilities do not show a clear advantage in learning capability across all tasks, highlighting that EvaLearn evaluates a new dimension of model performance. We hope EvaLearn provides a novel evaluation perspective for assessing LLM potential and understanding the gap between models and human capabilities, promoting the development of deeper and more dynamic evaluation approaches. All datasets, the automatic evaluation framework, and the results studied in this paper are available at the GitHub repository.

cs.CL↗

arXiv2025

Efficient small-cell sampling for machine-learning potentials of multi-principal element alloys

Multi-principal element alloys (MPEAs) exhibit exceptional properties but face significant challenges in developing accurate machine-learning potentials (MLPs) due to their vast compositional and configurational complexity. Here, we introduce an efficient small-cell sampling (SCS) method, which allows for generating diverse and representative training datasets for MPEAs using only small-cell structures with just one and two elements, thereby bypassing the computational overhead of iterative active learning cycles and large-cell density functional theory calculations. The efficacy of the method is carefully validated through principal component analysis, extrapolation grades evaluation, and root-mean-square errors and physical properties assessment on the TiZrHfCuNi system. Further demonstrations on TiZrVMo, CoCrFeMnNi, and AlTiZrNbHfTa systems accurately reproduce complex phenomena including phase transitions, chemical orderings, and thermodynamic properties. This work establishes an efficient one-shot protocol for constructing high-quality training datasets across multiple elements, laying a solid foundation for developing universal MLPs for MPEAs.

cond-mat.mtrl-sci↗

arXiv2025

TraceAegis: Securing LLM-Based Agents via Hierarchical and Behavioral Anomaly Detection

LLM-based agents have demonstrated promising adaptability in real-world applications. However, these agents remain vulnerable to a wide range of attacks, such as tool poisoning and malicious instructions, that compromise their execution flow and can lead to serious consequences like data breaches and financial loss. Existing studies typically attempt to mitigate such anomalies by predefining specific rules and enforcing them at runtime to enhance safety. Yet, designing comprehensive rules is difficult, requiring extensive manual effort and still leaving gaps that result in false negatives. As agent systems evolve into complex software systems, we take inspiration from software system security and propose TraceAegis, a provenance-based analysis framework that leverages agent execution traces to detect potential anomalies. In particular, TraceAegis constructs a hierarchical structure to abstract stable execution units that characterize normal agent behaviors. These units are then summarized into constrained behavioral rules that specify the conditions necessary to complete a task. By validating execution traces against both hierarchical and behavioral constraints, TraceAegis is able to effectively detect abnormal behaviors. To evaluate the effectiveness of TraceAegis, we introduce TraceAegis-Bench, a dataset covering two representative scenarios: healthcare and corporate procurement. Each scenario includes 1,300 benign behaviors and 300 abnormal behaviors, where the anomalies either violate the agent's execution order or break the semantic consistency of its execution sequence. Experimental results demonstrate that TraceAegis achieves strong performance on TraceAegis-Bench, successfully identifying the majority of abnormal behaviors.

cs.CR↗

arXiv2025

From Generic to Specialized: A Subspecialty Diagnostic System Powered by Self-Supervised Learning for Cervical Histopathology

Cervical cancer remains a major malignancy, necessitating extensive and complex histopathological assessments and comprehensive support tools. Although deep learning shows promise, these models still lack accuracy and generalizability. General foundation models offer a broader reach but remain limited in capturing subspecialty-specific features and task adaptability. We introduce the Cervical Subspecialty Pathology (CerS-Path) diagnostic system, developed through two synergistic pretraining stages: self-supervised learning on approximately 190 million tissue patches from 140,000 slides to build a cervical-specific feature extractor, and multimodal enhancement with 2.5 million image-text pairs, followed by integration with multiple downstream diagnostic functions. Supporting eight diagnostic functions, including rare cancer classification and multimodal Q&A, CerS-Path surpasses prior foundation models in scope and clinical applicability. Comprehensive evaluations demonstrate a significant advance in cervical pathology, with prospective testing on 3,173 cases across five centers maintaining 99.38% screening sensitivity and excellent generalizability, highlighting its potential for subspecialty diagnostic translation and cervical cancer screening.

cs.CV↗

arXiv2025

CoCoA: Collaborative Chain-of-Agents for Parametric-Retrieved Knowledge Synergy

Retrieval-Augmented Generation (RAG) enhances Large Language Models (LLMs), especially for knowledge-intensive tasks. Despite its advantages, current RAG methods often struggle to fully exploit knowledge during generation. In particular, the synergy between the model's internal parametric knowledge and external retrieved knowledge remains limited. Retrieved contents may sometimes mislead generation, while certain generated content can guide the model toward more accurate outputs. In this work, we propose Collaborative Chain-of-Agents, a framework designed to enhance explicitly synergy over both parametric and retrieved knowledge. Specifically, we first introduce CoCoA-zero, a multi-agent RAG framework that first performs conditional knowledge induction and then reasons answers. Building on this, we develop CoCoA, a long-chain training strategy that synthesizes extended multi-agent reasoning trajectories from CoCoA-zero to fine-tune the LLM. This strategy enhances the model's capability to explicitly integrate and jointly leverage parametric and retrieved knowledge. Experimental results demonstrate the superiority of CoCoA in open-domain QA and multi-hop QA.

cs.CL↗

arXiv2025

Evolving and Executing Research Plans via Double-Loop Multi-Agent Collaboration

Automating the end-to-end scientific research process poses a fundamental challenge: it requires both evolving high-level plans that are novel and sound, and executing these plans correctly amidst dynamic and uncertain conditions. To address this bilevel challenge, we propose a novel Double-Loop Multi-Agent (DLMA) framework to solve the given research problem automatically. The leader loop, composed of professor agents, is responsible for evolving research plans. It employs an evolutionary algorithm through involvement, improvement, and integration meetings to iteratively generate and refine a pool of research proposals, exploring the solution space effectively. The follower loop, composed of doctoral student agents, is responsible for executing the best-evolved plan. It dynamically adjusts the plan during implementation via pre-hoc and post-hoc meetings, ensuring each step (e.g., drafting, coding) is well-supported by contextual and external observations. Extensive experiments on benchmarks like ACLAward and Laboratory show that DLMA generates research papers that achieve state-of-the-art scores in automated evaluation, significantly outperforming strong baselines. Ablation studies confirm the critical roles of both loops, with evolution driving novelty and execution ensuring soundness.

cs.AI↗

arXiv2025

Relief of EGFR/FOS-downregulated miR-103a by loganin alleviates NF-kappaB-triggered inflammation and gut barrier disruption in colitis

Due to the ever-rising global incidence rate of inflammatory bowel disease (IBD) and the lack of effective clinical treatment drugs, elucidating the detailed pathogenesis, seeking novel targets, and developing promising drugs are the top priority for IBD treatment. Here, we demonstrate that the levels of microRNA (miR)-103a were significantly downregulated in the inflamed mucosa of ulcerative colitis (UC) patients, along with elevated inflammatory cytokines (IL-1beta/TNF-alpha) and reduced tight junction protein (Occludin/ZO-1) levels, as compared with healthy control objects. Consistently, miR-103a deficient intestinal epithelial cells Caco-2 showed serious inflammatory responses and increased permeability, and DSS induced more severe colitis in miR-103a-/- mice than wild-type ones. Mechanistic studies unraveled that c-FOS suppressed miR-103a transcription via binding to its promoter, then miR-103a-targeted NF-kappaB activation contributes to inflammatory responses and barrier disruption by targeting TAB2 and TAK1. Notably, the traditional Chinese medicine Cornus officinalis (CO) and its core active ingredient loganin potently mitigated inflammation and barrier disruption in UC by specifically blocking the EGFR/RAS/ERK/c-FOS signaling axis, these effects mainly attributed to modulated miR-103a levels as the therapeutic activities of them were almost completely shielded in miR-103a KO mice. Taken together, this work reveals that loganin relieves EGFR/c-FOS axis-suppressed epithelial miR-103a expression, thereby inhibiting NF-kappaB pathway activation, suppressing inflammatory responses, and preserving tight junction integrity in UC. Thus, our data enrich mechanistic insights and promising targets for UC treatment.

q-bio.BM↗

arXiv2025

Multiplayer General Lotto game

In this paper, we investigate the multiplayer General Lotto game across multiple battlefields, a significant variant of the Colonel Blotto game. In this version, each player employs a probability distribution for resource allocation, ensuring that their expected expenditure does not exceed their budget. We first establish the existence of the Nash equilibrium in a general setting, where players' budgets are asymmetric and the values of the battlefields are heterogeneous and asymmetric among players. Next, we provide a detailed characterization of the Nash equilibrium for multiple players on a single battlefield. In this characterization, we observe that the upper endpoints of the supports of players' equilibrium strategies coincide, and that the minimum value of a player's support above zero inversely correlates with his budget. We demonstrate the uniqueness of Nash equilibrium over a single battlefield in some scenarios. In the multi-battlefield setting, we prove that there is an upper bound on the average number of battlefields each player participates in. Additionally, we provide an example demonstrating the non-uniqueness of the Nash equilibrium in the context of multiple battlefields with multiple players. Finally, we present a solution for the Nash equilibrium in a symmetric case.

cs.GT↗

arXiv2025

When Does Multimodality Lead to Better Time Series Forecasting?

Recently, there has been growing interest in incorporating textual information into foundation models for time series forecasting. However, it remains unclear whether and under what conditions such multimodal integration consistently yields gains. We systematically investigate these questions across a diverse benchmark of 16 forecasting tasks spanning 7 domains, including health, environment, and economics. We evaluate two popular multimodal forecasting paradigms: aligning-based methods, which align time series and text representations; and prompting-based methods, which directly prompt large language models for forecasting. Our findings reveal that the benefits of multimodality are highly condition-dependent. While we confirm reported gains in some settings, these improvements are not universal across datasets or models. To move beyond empirical observations, we disentangle the effects of model architectural properties and data characteristics, drawing data-agnostic insights that generalize across domains. Our findings highlight that on the modeling side, incorporating text information is most helpful given (1) high-capacity text models, (2) comparatively weaker time series models, and (3) appropriate aligning strategies. On the data side, performance gains are more likely when (4) sufficient training data is available and (5) the text offers complementary predictive signal beyond what is already captured from the time series alone. Our study offers a rigorous, quantitative foundation for understanding when multimodality can be expected to aid forecasting tasks, and reveals that its benefits are neither universal nor always aligned with intuition.

cs.CL↗