arXiv subjects

Yifan Gao

Publications and source records attributed to Yifan Gao.

At least 37 records · Page 2Linked to original sources

arXiv2026

Large Language Models in Mental Health: A Systematic Review of Applications, Innovations, and Ethical Challenges

We present a review on the applications of large language models (LLMs) in health, e.g., social media analysis, clinical conversational agents, therapy support tools, prompt engineering, multimodal learning, and ethical considerations. We integrate findings from interdisciplinary studies utilizing diverse data sources such as social media posts, electronic medical records, and multimodal inputs to enable early detection of depression, suicide risk assessment, personalized therapy support, and psychoeducational content generation. Our review highlights advancements in LLM models and annotation strategies that enhance interpretability and clinical relevance, while we also emphasize the critical role of prompt engineering for domain adaptation. We also discuss emerging multimodal fusion techniques integrating text, speech, and sensor data for improved mental health diagnosis and monitoring. Finally, we address ongoing ethical, sociotechnical, and regulatory challenges, and advocate frameworks to ensure safe, equitable, and accountable deployment of LLMs in real-world mental health care.

cs.AI↗

arXiv2026

Odd spin symmetry and anisotropy switching in p-wave magnet CeNiAsO

Odd-parity magnets, complementary to altermagnets, exhibit unique properties such as high efficiency in charge-spin conversion and compatibility with conventional superconductivity, of critical importance in the pursuit of energy-efficient spintronics and topological superconductors for quantum computation. For even-parity d-wave and g-wave altermagnets, the magnetic structure, spin-split band structure and physical properties are currently under intensive study. On the contrary, while hundreds of odd-parity magnets and the promising properties have been predicted in theory, experimental studies are scarce. Specifically, the magnetic structure and transport properties of candidates NiI2 and Ga3Ru4Al12 have been reported, yet the characteristic band structure and particularly the odd-parity spin symmetry remain elusive. Here we demonstrate experimentally the deterministic p-wave spin symmetry and resistance anisotropy switching for the prototype odd-parity magnet, CeNiAsO. Angle-resolved photoemission spectroscopy (ARPES) reveals two cleaved terminations with distinct surface band structure. By compensating the polar surface, we achieve intrinsic bulk band structure, for which the spin splitting can be well described by the p-wave magnetic structure through first-principles calculation. The bulk spin polarization measured by spin-resolved ARPES exhibits symmetry with only one degenerate plane, fingerprint of p-wave magnetism. We further demonstrate giant resistance anisotropy and switching between high-resistance and low-resistance states through modest field-induced domain selection, highlighting its potential for antiferromagnetic spin memory devices. The structural similarity between CeNiAsO and 1111-type Fe-based superconductors stimulates further exploration on the interplay between p-wave magnetism, superconductivity and band topology.

cond-mat.str-el↗

arXiv2026

Percolation of discrete GFF in dimension two II. Connectivity properties of two-sided level sets

We study percolation of two-sided level sets for the discrete Gaussian free field (DGFF) in 2D. For a DGFF $φ$ defined in a box $B_N$ with side length $N$, for $C$ large enough, there exist low crossings in the set of vertices $z$ where $|φ(z)|\le C \sqrt{\log \log N}$, with probability tending to $1$ as $N \to \infty$, while the average and the maximum of $φ$ are of order $\sqrt{\log N}$ and $\log N$, respectively. As a consequence, we also obtain connectivity properties of the set of thick points of a random walk. We rely on an isomorphism between the DGFF and the random walk loop soup (RWLS) with critical intensity $α=1/2$, and further extend our study to the occupation field of the RWLS for all subcritical intensities $α\in(0,1/2)$. For the RWLS in $B_N$, we show that for $λ$ large enough, there exist low crossings of $B_N$, remaining below $λ$, even though the average occupation time is of order $\log N$. Our results thus uncover a non-trivial phase-transition for this highly-dependent percolation model. For both the DGFF and the occupation field of the RWLS, we further show that such low crossings can be found in the "carpet" of the RWLS - the set of vertices which are not in the interior of any cluster of loops. This work is the second part of a series of two papers. It relies heavily on tools and techniques developed for the RWLS in the first part, especially surgery arguments on loops, which were made possible by a separation result in the RWLS. This allowed us, in that companion paper, to derive several useful properties such as quasi-multiplicativity, and obtain a precise upper bound for the probability that two large connected components of loops "almost touch", which is instrumental here.

math.PR↗

arXiv2026

PersonaAgent: Bridging Memory and Action for Personalized LLM Agents

Large Language Model (LLM) empowered agents have recently emerged as advanced paradigms that exhibit impressive capabilities in a wide range of domains and tasks. Despite their potential, current LLM agents often adopt a one-size-fits-all approach, lacking the flexibility to respond to users' varying needs and preferences. This limitation motivates us to develop PersonaAgent, the first personalized LLM agent framework designed to address versatile personalization tasks. Specifically, PersonaAgent integrates two complementary components - a personalized memory module that includes episodic and semantic memory mechanisms; a personalized action module that enables the agent to perform tool actions tailored to the user. At the core, the persona (defined as unique system prompt for each user) functions as an intermediary: it leverages insights from personalized memory to control agent actions, while the outcomes of these actions in turn refine the memory. Based on the framework, we propose a test-time user-preference alignment strategy that simulate the latest n interactions to optimize the persona prompt, ensuring real-time user preference alignment through textual loss feedback between simulated and ground-truth responses. Experimental evaluations demonstrate that PersonaAgent significantly outperforms other baseline methods by not only personalizing the action space effectively but also scaling during test-time real-world applications. These results underscore the feasibility and potential of our approach in delivering tailored, dynamic user experiences.

cs.AI↗

arXiv2026

BCER Agent: Reliable Long-Horizon MRI Workflow Execution via Compilation, Artifact Binding, and Bounded Local Recovery

Many recent medical VLM and agent studies are benchmarked on 2D images or comparatively short tool-calling exchanges, whereas real MRI analysis typically demands long, interdependent pipelines that operate on 3D/4D volumetric data. Under these conditions, reactive tool-calling agents are prone to cascading breakdowns triggered by faulty intermediate references, mismatched tool arguments, and limited control over cross-step dependencies. To address this, we introduce BCER (Brain-Cerebellum-Extremity-Reflector), a controller architecture aimed at dependable long-horizon MRI workflow execution. BCER decouples high-level planning from execution and provides bounded local recovery. We assess BCER on a multi-organ MRI benchmark covering brain, prostate, and cardiac tasks with both short- and long-chain workflows, using matched task contracts across controller variants and several backbone models. Relative to reactive baselines, BCER yields consistent improvements in end-to-end execution, with the most pronounced gains observed on long-chain workflows. BCER additionally enables auditability by maintaining explicit links between final outputs and intermediate artifacts and measurements. Code and benchmark are released at https://github.com/Albertlongzi/BCER.

eess.IV↗

arXiv2026

END: Early Noise Dropping for Efficient and Effective Context Denoising

Large Language Models (LLMs) have demonstrated remarkable performance across a wide range of natural language processing tasks. However, they are often distracted by irrelevant or noisy context in input sequences that degrades output quality. This problem affects both long- and short-context scenarios, such as retrieval-augmented generation, table question-answering, and in-context learning. We reveal that LLMs can implicitly identify whether input sequences contain useful information at early layers, prior to token generation. Leveraging this insight, we introduce Early Noise Dropping (\textsc{END}), a novel approach to mitigate this issue without requiring fine-tuning the LLMs. \textsc{END} segments input sequences into chunks and employs a linear prober on the early layers of LLMs to differentiate between informative and noisy chunks. By discarding noisy chunks early in the process, \textsc{END} preserves critical information, reduces distraction, and lowers computational overhead. Extensive experiments demonstrate that \textsc{END} significantly improves both performance and efficiency across different LLMs on multiple evaluation datasets. Furthermore, by investigating LLMs' implicit understanding to the input with the prober, this work also deepens understanding of how LLMs do reasoning with contexts internally.

cs.CL↗

arXiv2026

Generalized intersection exponents and local cut points for three-dimensional Brownian loop soup

We study generalized non-intersection probabilities for the three-dimensional Brownian loop soup at subcritical intensities. We establish the existence of generalized intersection exponents (GIE) and prove an up-to-constants estimate for these probabilities by means of a separation lemma tailored to this setting. We also relate the Hausdorff dimension of the set of local cut points of the three-dimensional Brownian loop soup to the GIE, and show that the GIE is continuous at intensity zero, where it reduces to the classical Brownian intersection exponent. In particular, this implies that, for sufficiently small intensity parameters, the set of local cut points has Hausdorff dimension strictly larger than $1$.

math.PR↗

arXiv2026

DecomPose: Disentangling Cross-Category Optimization Contention for Category-Level 6D Object Pose Estimation

Category-level 6D object pose estimation is typically formulated as a multi-category joint learning problem with fully shared model parameters. However, pronounced geometric heterogeneity across categories entangles incompatible optimization signals in shared modules, resulting in gradient conflicts and negative transfer during training. To address this challenge, we first introduce gradient-based diagnostics to quantify module-level cross-category contention. Building on results of diagnostics, we propose DecomPose, a difficulty-aware decomposition framework that mitigates optimization contention via: (1) difficulty-aware gradient decoupling, which groups categories using a data-driven difficulty proxy and routes each instance to a group-specific correspondence branch to isolate incompatible updates; and (2) stability-driven asymmetric branching, which assigns higher-capacity branches to structurally simple categories as stable optimization anchors while constraining complex categories with lightweight branches to suppress noisy updates and alleviate negative transfer. Extensive experiments on REAL275, CAMERA25, and HouseCat6D demonstrate that DecomPose effectively reduces cross-category optimization contention and delivers superior pose estimation performance across multiple benchmarks.

cs.CV↗

arXiv2026

Dino U-Net: Exploiting High-Fidelity Dense Features from Foundation Models for Medical Image Segmentation

Foundation models pre-trained on large-scale natural image datasets offer a powerful paradigm for medical image segmentation. However, effectively transferring their learned representations for precise clinical applications remains a challenge. In this work, we propose Dino U-Net, a novel encoder-decoder architecture designed to exploit the high-fidelity dense features of the DINOv3 vision foundation model. Our architecture introduces an encoder built upon a frozen DINOv3 backbone, which employs a specialized adapter to fuse the model's rich semantic features with low-level spatial details. To preserve the quality of these representations during dimensionality reduction, we design a new fidelity-aware projection module (FAPM) that effectively refines and projects the features for the decoder. We conducted extensive experiments on seven diverse public medical image segmentation datasets. Our results show that Dino U-Net achieves state-of-the-art performance, consistently outperforming previous methods across various imaging modalities. Our framework proves to be highly scalable, with segmentation accuracy consistently improving as the backbone model size increases up to the 7-billion-parameter variant. The findings demonstrate that leveraging the superior, dense-pretrained features from a general-purpose foundation model provides a highly effective and parameter-efficient approach to advance the accuracy of medical image segmentation. The code is available at https://github.com/yifangao112/DinoUNet.

cs.CV↗

arXiv2026

Non-existence of several random fractals in Brownian motion and Brownian loop soup

We develop a unified approach to establish the non-existence of three types of random fractals: (1) the pioneer triple points of the planar Brownian motion, answering an open question in [7], (2) the pioneer double cut points of the planar and three-dimensional Brownian motions, and (3) the double points on the boundaries of the clusters of the planar Brownian loop soup at the critical intensity, answering an open question in [39]. These fractals have the common feature that they are associated with an intersection or disconnection exponent which yields a Hausdorff dimension ``exactly zero''.

math.PR↗

arXiv2026

Agentic Conversational Search with Contextualized Reasoning via Reinforcement Learning

Large Language Models (LLMs) have become a popular interface for human-AI interaction, supporting information seeking and task assistance through natural, multi-turn dialogue. To respond to users within multi-turn dialogues, the context-dependent user intent evolves across interactions, requiring contextual interpretation, query reformulation, and dynamic coordination between retrieval and generation. Existing studies usually follow static rewrite, retrieve, and generate pipelines, which optimize different procedures separately and overlook the mixed-initiative action optimization simultaneously. Although the recent developments in deep search agents demonstrate the effectiveness in jointly optimizing retrieval and generation via reasoning, these approaches focus on single-turn scenarios, which might lack the ability to handle multi-turn interactions. We introduce a conversational agent that interleaves search and reasoning across turns, enabling exploratory and adaptive behaviors learned through reinforcement learning (RL) training with tailored rewards towards evolving user goals. The experimental results across four widely used conversational benchmarks demonstrate the effectiveness of our methods by surpassing several existing strong baselines.

cs.CL↗

arXiv2026

Camyla: Scaling Autonomous Research in Medical Image Segmentation

We present Camyla, a system for fully autonomous research within the scientific domain of medical image segmentation. Camyla transforms raw datasets into literature-grounded research proposals, executable experiments, and complete manuscripts without human intervention. Autonomous experimentation over long horizons poses three interrelated challenges: search effort drifts toward unpromising directions, knowledge from earlier trials degrades as context accumulates, and recovery from failures collapses into repetitive incremental fixes. To address these challenges, the system combines three coupled mechanisms: Quality-Weighted Branch Exploration for allocating effort across competing proposals, Layered Reflective Memory for retaining and compressing cross-trial knowledge at multiple granularities, and Divergent Diagnostic Feedback for diversifying recovery after underperforming trials. The system is evaluated on CamylaBench, a contamination-free benchmark of 31 datasets constructed exclusively from 2025 publications, under a strict zero-intervention protocol across two independent runs within a total of 28 days on an 8-GPU cluster. Across the two runs, Camyla generates more than 2,700 novel model implementations and 40 complete manuscripts, and surpasses the strongest per-dataset baseline selected from 14 established architectures, including nnU-Net, on 22 and 18 of 31 datasets under identical training budgets, respectively (union: 24/31). Senior human reviewers score the generated manuscripts at the T1/T2 boundary of contemporary medical imaging journals. Relative to automated baselines, Camyla outperforms AutoML and NAS systems on aggregate segmentation performance and exceeds six open-ended research agents on both task completion and baseline-surpassing frequency. These results suggest that domain-scale autonomous research is achievable in medical image segmentation.

cs.AI↗

arXiv2026

SessionIntentBench: A Multi-task Inter-session Intention-shift Modeling Benchmark for E-commerce Customer Behavior Understanding

Session history is a common way of recording user interacting behaviors throughout a browsing activity with multiple products. For example, if an user clicks a product webpage and then leaves, it might because there are certain features that don't satisfy the user, which serve as an important indicator of on-the-spot user preferences. However, all prior works fail to capture and model customer intention effectively because insufficient information exploitation and only apparent information like descriptions and titles are used. There is also a lack of data and corresponding benchmark for explicitly modeling intention in E-commerce product purchase sessions. To address these issues, we introduce the concept of an intention tree and propose a dataset curation pipeline. Together, we construct a sibling multimodal benchmark, SessionIntentBench, that evaluates L(V)LMs' capability on understanding inter-session intention shift with four subtasks. With 1,952,177 intention entries, 1,132,145 session intention trajectories, and 13,003,664 available tasks mined using 10,905 sessions, we provide a scalable way to exploit the existing session data for customer intention understanding. We conduct human annotations to collect ground-truth label for a subset of collected data to form an evaluation gold set. Extensive experiments on the annotated data further confirm that current L(V)LMs fail to capture and utilize the intention across the complex session setting. Further analysis show injecting intention enhances LLMs' performances.

cs.CL↗

arXiv2026

MINED: Probing and Updating with Multimodal Time-Sensitive Knowledge for Large Multimodal Models

Large Multimodal Models (LMMs) encode rich factual knowledge via cross-modal pre-training, yet their static representations struggle to maintain an accurate understanding of time-sensitive factual knowledge. Existing benchmarks remain constrained by static designs, inadequately evaluating LMMs' ability to understand time-sensitive knowledge. To address this gap, we propose MINED, a comprehensive benchmark that evaluates temporal awareness along 6 key dimensions and 11 challenging tasks: cognition, awareness, trustworthiness, understanding, reasoning, and robustness. MINED is constructed from Wikipedia by two professional annotators, containing 2,104 time-sensitive knowledge samples spanning six knowledge types. Evaluating 15 widely used LMMs on MINED shows that Gemini-2.5-Pro achieves the highest average CEM score of 63.07, while most open-source LMMs still lack time understanding ability. Meanwhile, LMMs perform best on organization knowledge, whereas their performance is weakest on sport. To address these challenges, we investigate the feasibility of updating time-sensitive knowledge in LMMs through knowledge editing methods and observe that LMMs can effectively update knowledge via knowledge editing methods in single editing scenarios.

cs.CL↗

arXiv2026

Uniqueness of generalized conformal restriction measures and Malliavin-Kontsevich-Suhov measures for $c \in (0,1]$

In this paper, we present a unified approach to establish the uniqueness of generalized conformal restriction measures with central charge $c \in (0, 1]$ in both chordal and radial cases, by relating these measures to the Brownian loop soup. Our method also applies to the uniqueness of the Malliavin-Kontsevich-Suhov loop measures for $c \in (0,1]$, which was recently obtained in [Baverez-Jego, arXiv:2407.09080] for all $c \leq 1$ from a CFT framework of SLE loop measures. In contrast, though only valid for $c \in (0,1]$, our approach provides additional probabilistic insights, as it directly links natural quantities of MKS measures to loop-soup observables.

math.PR↗

arXiv2026

Enhancing Medical Visual Grounding via Knowledge-guided Spatial Prompts

Medical Visual Grounding (MVG) aims to identify diagnostically relevant phrases from free-text radiology reports and localize their corresponding regions in medical images, providing interpretable visual evidence to support clinical decision-making. Although recent Vision-Language Models (VLMs) exhibit promising multimodal reasoning ability, their grounding remains insufficient spatial precision, largely due to a lack of explicit localization priors when relying solely on latent embeddings. In this work, we analyze this limitation from an attention perspective and propose KnowMVG, a Knowledge-prior and global-local attention enhancement framework for MVG in VLMs that explicitly strengthens spatial awareness during decoding. Specifically, we present a knowledge-enhanced prompting strategy that encodes phrase related medical knowledge into compact embeddings, together with a global-local attention that jointly leverages coarse global information and refined local cues to guide precise region localization. localization. This design bridges high-level semantic understanding and fine-grained visual perception without introducing extra textual reasoning overhead. Extensive experiments on four MVG benchmarks demonstrate that our KnowMVG consistently outperforms existing approaches, achieving gains of 3.0% in AP50 and 2.6% in mIoU over prior state-of-the-art methods. Qualitative and ablation studies further validate the effectiveness of each component.

cs.CV↗

arXiv2026

One-arm probabilities for the two-dimensional metric-graph and discrete Gaussian free field

We study the one-arm probability in the level-set percolation of the discrete and metric-graph Gaussian free field (GFF) defined on a box with Dirichlet boundary conditions. For the metric-graph case, we establish asymptotic estimates on two one-arm probabilities of interest. For the discrete case, we show up-to-constants bounds on the point-to-bulk probability and demonstrate its difference from the metric-graph case.

math.PR↗

arXiv2026

Bivariate partial mapping for detecting causality in complex non-autonomous system

Identifying causality is fundamental for human understanding of the world, where complex non-autonomous systems such as species population changes, brain activities, etc. are extensively existed. Since the phase spaces of such systems are not manifolds, the existing method based on convergent cross mapping is not applicable. This paper proposes a novel bivariate partial mapping method for detecting causality in complex non-autonomous systems. It transforms a non-autonomous system to an autonomous skew product system, and then, by considering the causality changes due to the transformation, detects causality of the original non-autonomous system from the transformed skew product system. The effectiveness of the proposed method is verified by mathematical cases and a real brain activity case, showing that the proposed method successfully detects the causality in complex non-autonomous systems.

math.DS↗