SearcharxivSearch

arXiv subjects

Yuhao Yao

Publications and source records attributed to Yuhao Yao.

5 recordsLinked to original sources

Towards Efficient and Evidence-grounded Mobility Prediction with LLM-Driven Agent

Individual-level mobility prediction is central to urban simulation, transportation planning, and policy analysis. Supervised sequence models achieve strong accuracy but require task-specific training and offer limited decision-level transparency. Recent LLM-based methods improve interpretability, yet mostly rely on static prompts and single-pass inference, limiting their ability to seek additional evidence when mobility signals are weak or conflicting. We propose \method{}, a training-free LLM-driven agent framework that formulates next-location prediction as adaptive evidence-controlled decision making. \method{} resolves routine cases through a fast path based on historical regularity, while ambiguous cases trigger iterative tool use over recent trajectories, historical behavior, stay-move likelihood, and geographical evidence. Across three mobility datasets, AgentMob achieves the strongest overall performance among training-free LLM-based methods, with GPT-5.4 reaching 71.42\% Acc@1 on BW, 33.14\% on YJMob100K, and 33.50\% on Shanghai ISP. On BW non-fast-path cases, the LLM controller improves Acc@1 from 30.65\% to 48.62\% over a same-tool statistical baseline, showing that its main benefit lies in resolving ambiguous predictions through adaptive evidence gathering. Our code is available at https://github.com/Unknown-zoo/AgentMob.

cs.LG

Neural Dysfunction Underlying Working Memory Processing at Different Stages of the Illness Course in Schizophrenia:A Comparative Meta-analysis

Schizophrenia (SCZ), as a chronic and persistent disorder, exhibits working memory deficits across various stages of the disorder, yet the neural mechanisms underlying these deficits remain elusive with inconsistent neuroimaging findings. We aimed to compare the brain functional changes of working memory in patients at different stages: clinical high risk (CHR), first-episode psychosis (FEP), and long-term SCZ, using meta-analyses of functional magnetic resonance imaging (fMRI) studies. Following a systematic literature search, fifty-six whole-brain task-based fMRI studies (15 for CHR, 16 for FEP, 25 for long-term SCZ) were included. The separate and pooled neurofunctional mechanisms among CHR, FEP and long-term SCZ were generated by Seed-based d Mapping toolbox. The CHR and FEP groups exhibited overlapping hypoactivation in the right inferior parietal lobule, right middle frontal gyrus, and left superior parietal lobule, indicating key lesion sites in the early phase of SCZ. Individuals with FEP showed lower activation in left inferior parietal lobule than those with long-term SCZ, reflecting a possible recovery process or more neural inefficiency. We concluded that SCZ represent as a continuum in the early stage of illness progression, while the neural bases are inversely changed with the development of illness course to long-term course.

q-bio.NC

Mobsimilarity: Vector Graph Optimization for Mobility Tableau Comparison

Human mobility similarity comparison plays a critical role in mobility estimation/prediction model evaluation, mobility clustering and mobility matching, which exerts an enormous impact on improving urban mobility, accessibility, and reliability. By expanding origin-destination matrix, we propose a concept named mobility tableau, which is an aggregated tableau representation to the population flow distributed between different location pairs of a study site and can be represented by a vector graph. Compared with traditional OD matrix-based mobility comparison, mobility tableau comparison provides high-dimensional similarity information, including volume similarity, spatial similarity, mass inclusiveness and structure similarity. A novel mobility tableaus similarity measurement method is proposed by optimizing the least spatial cost of transforming the vector graph for one mobility tableau into the other and is optimized to be efficient. The robustness of the measure is supported through several sensitive analysis on GPS based mobility tableau. The better performance of the approach compared with traditional mobility comparison methods in two case studies demonstrate the practicality and superiority, while one study is estimated mobility tableaus validation and the other is different cities' mobility tableaus comparison.

cs.CY

Effective Metagraph-based Life Pattern Clustering with Big Human Mobility Data

Life pattern clustering is essential for abstracting the groups' characteristics of daily mobility patterns and activity regularity. Based on millions of GPS records, this paper proposed a framework on the life pattern clustering which can efficiently identify the groups have similar life pattern. The proposed method can retain original features of individual life pattern data without aggregation. Metagraph-based data structure is proposed for presenting the diverse life pattern. Spatial-temporal similarity includes significant places semantics, time sequential properties and frequency are integrated into this data structure, which captures the uncertainty of an individual and the diversities between individuals. Non-negative-factorization-based method was utilized for reducing the dimension. The results show that our proposed method can effectively identify the groups have similar life pattern and takes advantages in computation efficiency and robustness comparing with the traditional method. We revealed the representative life pattern groups and analyzed the group characteristics of human life patterns during different periods and different regions. We believe our work will help in future infrastructure planning, services improvement and policies making related to urban and transportation, thus promoting a humanized and sustainable city.

cs.CY

Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio

In this paper, we study the two-facility location game on a line with optional preference where the acceptable set of facilities for each agent could be different and an agent's cost is his distance to the closest facility within his acceptable set. The objective is to minimize the total cost of all agents while achieving strategyproofness. We design a deterministic strategyproof mechanism for the problem with approximation ratio of 2.75, improving upon the earlier best ratio of n/2+1.

cs.DS