arXiv subjects

Jin Lee

Publications and source records attributed to Jin Lee.

7 recordsLinked to original sources

arXiv2026

Hierarchical Generative Agents for Simulating Sequential Human Behavior

Complex cognitive, emotional, and social processes shape human evacuations during natural disasters. Accurate modeling and understanding of human behavior in disasters or emergencies can greatly impact the evacuation process by informing more effective planning and resource allocation. However, collecting human data in these situations is very difficult, and existing computational evacuation models assume rational, homogeneous behavior, leading to unrealistic, overly optimistic predictions. To address this gap, we present a simulation framework of sequential human decision-making during an evacuation scenario, introducing cognitively grounded, persona-driven agents. Our framework models evacuation behavior in a grid-based urban environment that evolves over time, capturing fire and other hazards. Human agents are modeled as personas that make sequential decisions in response to environmental stimuli with cognition structured in three levels: high-level evacuation goals, mid-level route reasoning, and low-level navigation. Decision-making is driven by large language models (LLMs) coupled with a cognitive module and calibrated with empirical human evacuation data. We propose a dynamic, stimulus-driven disaster simulation framework that models human evacuation decision-making using persona-conditioned LLM agents and a cognitive hierarchy.

cs.MA↗

arXiv2026

SPARe: Stacked Parallelism with Adaptive Reordering for Fault-Tolerant LLM Pretraining Systems with 100k+ GPUs

In large-scale LLM pre-training systems with 100k+ GPUs, failures become the norm rather than the exception, and restart costs can dominate wall-clock training time. However, existing fault-tolerance mechanisms are largely unprepared for this restart-dominant regime. To address this challenge, we propose SPARe - Stacked Parallelism with Adaptive Reordering - a fault-tolerance framework that masks node failures during gradient synchronization by stacking redundant data shards across parallelism groups and adaptively reordering execution. SPARe achieves availability comparable to traditional replication while maintaining near-constant computation overhead of only 2~3x, even under high redundancy where traditional replication would require linearly inflating overhead. We derive closed-form expressions for endurable failure count and computation overhead, validate them via SimGrid-based discrete-event simulation, and jointly optimize redundancy and checkpointing to minimize time-to-train. At extreme scale with up to 600k GPUs, SPARe reduces time-to-train by 40~50% compared to traditional replication.

cs.DC↗

arXiv2025

KANO: Kolmogorov-Arnold Neural Operator

We introduce Kolmogorov--Arnold Neural Operator (KANO), a dual-domain neural operator jointly parameterized by both spectral and spatial bases with intrinsic symbolic interpretability. We theoretically demonstrate that KANO overcomes the pure-spectral bottleneck of Fourier Neural Operator (FNO): KANO remains expressive over generic position-dependent dynamics (variable coefficient PDEs) for any physical input, whereas FNO stays practical only for spectrally sparse operators and strictly imposes a fast-decaying input Fourier tail. We verify our claims empirically on position-dependent differential operators, for which KANO robustly generalizes but FNO fails to. In the quantum Hamiltonian learning benchmark, KANO reconstructs ground-truth Hamiltonians in closed-form symbolic representations accurate to the fourth decimal place in coefficients and attains $\approx 6\times10^{-6}$ state infidelity from projective measurement data, substantially outperforming that of the FNO trained with ideal full wave function data, $\approx 1.5\times10^{-2}$, by orders of magnitude.

cs.LG↗

arXiv2025

HU-based Foreground Masking for 3D Medical Masked Image Modeling

While Masked Image Modeling (MIM) has revolutionized fields of computer vision, its adoption in 3D medical image computing has been limited by the use of random masking, which overlooks the density of anatomical objects. To address this limitation, we enhance the pretext task with a simple yet effective masking strategy. Leveraging Hounsfield Unit (HU) measurements, we implement an HU-based Foreground Masking, which focuses on the intensity distribution of visceral organs and excludes non-tissue regions, such as air and fluid, that lack diagnostically meaningful features. Extensive experiments on five public 3D medical imaging datasets demonstrate that our masking consistently improves performance, both in quality of segmentation and Dice score (BTCV:~84.64\%, Flare22:~92.43\%, MM-WHS:~90.67\%, Amos22:~88.64\%, BraTS:~78.55\%). These results underscore the importance of domain-centric MIM and suggest a promising direction for representation learning in medical image segmentation. Implementation is available at github.com/AISeedHub/SubFore/.

cs.CV↗

arXiv2024

High-energy transient gas pinholes via saturated absorption

This letter presents a spatial filter based on saturated absorption in gas as a replacement for the solid pinhole in a lens-pinhole-lens filtering system. We show that an ultraviolet laser pulse focused through ozone will have its spatial profile cleaned if its peak fluence rises above the ozone saturation fluence. Specifically, we demonstrate that a 5 ns 266 nm beam with 4.2 mJ of initial energy can be effectively cleaned by focusing through a 1.4% ozone-oxygen mixture, with about 76% of the main beam energy transmitted and 89% of the side lobe energy absorbed. This process can be adapted to other gases and laser wavelengths, providing alignment-insensitive and damage-resistant pinholes for high-repetition-rate high-energy lasers.

physics.optics↗

arXiv2024

Photochemically-induced acousto-optics in gases

Acousto-optics consists of launching acoustic waves in a medium (usually a crystal) in order to modulate its refractive index and create a tunable optical grating. In this article, we present the theoretical basis of a new scheme to generate acousto-optics in a gas, where the acoustic waves are initiated by the localized absorption (and thus gas heating) of spatially-modulated UV light, as was demonstrated in Y. Michine and H. Yoneda, Commun. Phys. 3, 24 (2020). We identify the chemical reactions initiated by the absorption of UV light via the photodissociation of ozone molecules present in the gas, and calculate the resulting temperature increase in the gas as a function of space and time. Solving the Euler fluid equations shows that the modulated, isochoric heating initiates a mixed acoustic/entropy wave in the gas, whose high-amplitude density (and thus refractive index) modulation can be used to manipulate a high-power laser. We calculate that diffraction efficiencies near 100% can be obtained using only a few millimeters of gas containing a few percent ozone fraction at room temperature, with UV fluences of less than 100 mJ/cm2, consistent with the experimental measurements. Our analysis suggests possible ways to optimize the diffraction efficiency by changing the buffer gas composition. Gases have optics damage thresholds two to three orders of magnitude beyond those of solids; these optical elements should therefore be able to manipulate kJ-class lasers.

physics.optics↗

arXiv2024

Coded Computing Meets Quantum Circuit Simulation: Coded Parallel Tensor Network Contraction Algorithm

Parallel tensor network contraction algorithms have emerged as the pivotal benchmarks for assessing the classical limits of computation, exemplified by Google's demonstration of quantum supremacy through random circuit sampling. However, the massive parallelization of the algorithm makes it vulnerable to computer node failures. In this work, we apply coded computing to a practical parallel tensor network contraction algorithm. To the best of our knowledge, this is the first attempt to code tensor network contractions. Inspired by matrix multiplication codes, we provide two coding schemes: 2-node code for practicality in quantum simulation and hyperedge code for generality. Our 2-node code successfully achieves significant gain for $f$-resilient number compared to naive replication, proportional to both the number of node failures and the dimension product of sliced indices. Our hyperedge code can cover tensor networks out of the scope of quantum, with degraded gain in the exchange of its generality.

cs.IT↗