arXiv subjects

Kyuri Park

Publications and source records attributed to Kyuri Park.

3 recordsLinked to original sources

arXiv2026

Slow Context, Fast Symptoms: Multiscale Temporal Dynamics and Context-Induced Coupling in Psychological Systems

Psychological dynamics unfold across multiple timescales: symptoms and other psychological states can change rapidly, whereas social, environmental, biological, and developmental conditions often evolve more slowly. We formulate this structure as a stochastic slow-fast system in which binary symptom states form a fast interacting network embedded within a slow contextual field. Pairwise symptom coupling governs interactions within the fast layer, while the contextual field shifts symptom-specific activation tendencies and can itself receive feedback from sustained symptom activation. Simulations show that changes in the slow field can shift the macroscopic activation state of the symptom system even when the underlying interaction matrix remains fixed. Perturbations to the field generate transient increases in symptom activation followed by recovery, while feedback between the fast and slow layers delays recovery and, when sufficiently strong, produces dependence on initial conditions. We further show that when between-person variation in the contextual field is omitted from network estimation, the inferred system exhibits stronger total coupling and nonzero couplings between symptom pairs that are uncoupled in the data-generating model. Thus, slowly varying context can alter both the dynamics and the apparent interaction structure of a fast psychological system. The framework connects psychological network models with slow-fast dynamical systems and provides a formal basis for distinguishing changes in activation from changes in coupling.

physics.soc-ph↗

arXiv2025

Emergence of psychopathological computations in large language models

Can large language models (LLMs) instantiate computations of psychopathology? An effective approach to the question hinges on addressing two factors. First, for conceptual validity, we require a general and computational account of psychopathology that is applicable to computational entities without biological embodiment or subjective experience. Second, psychopathological computations, derived from the adapted theory, need to be empirically identified within the LLM's internal processing. Thus, we establish a computational-theoretical framework to provide an account of psychopathology applicable to LLMs. Based on the framework, we conduct experiments demonstrating two key claims: first, that the computational structure of psychopathology exists in LLMs; and second, that executing this computational structure results in psychopathological functions. We further observe that as LLM size increases, the computational structure of psychopathology becomes denser and that the functions become more effective. Taken together, the empirical results corroborate our hypothesis that network-theoretic computations of psychopathology have already emerged in LLMs. This suggests that certain LLM behaviors mirroring psychopathology may not be a superficial mimicry but a feature of their internal processing. Our work shows the promise of developing a new powerful in silico model of psychopathology and also alludes to the possibility of safety threat from the AI systems with psychopathological behaviors in the near future.

q-bio.NC↗

arXiv2025

CALL: Context-Aware Low-Latency Retrieval in Disk-Based Vector Databases

Embedding models capture both semantic and syntactic structures of queries, often mapping different queries to similar regions in vector space. This results in non-uniform cluster access patterns in modern disk-based vector databases. While existing approaches optimize individual queries, they overlook the impact of cluster access patterns, failing to account for the locality effects of queries that access similar clusters. This oversight increases cache miss penalty. To minimize the cache miss penalty, we propose CALL, a context-aware query grouping mechanism that organizes queries based on shared cluster access patterns. Additionally, CALL incorporates a group-aware prefetching method to minimize cache misses during transitions between query groups and latency-aware cluster loading. Experimental results show that CALL reduces the 99th percentile tail latency by up to 33% while consistently maintaining a higher cache hit ratio, substantially reducing search latency.

cs.DB↗