SearcharxivSearch

arXiv subjects

Nahyun Lee

Publications and source records attributed to Nahyun Lee.

11 recordsLinked to original sources

A Spectrally Damped Tensor Randomized Kaczmarz Method for Doubly Noisy Tensor Systems

Tensor randomized Kaczmarz (TRK) methods are efficient row-action solvers for tensor linear systems under the t-product framework. We study their behavior under a doubly noisy perturbation model. In this model, both the system tensor and the right-hand side tensor are corrupted. We first analyze standard TRK and derive an expected error recursion with two terms. One term is contractive, and the other is a persistent perturbation term. This explains the noise-limited and semi-convergent behavior that can occur when the observed tensor system is inconsistent. We then introduce a spectrally damped tensor randomized Kaczmarz method (SD-TRK). We prove an expected error recursion for SD-TRK that separates error propagation from noise injection. The bound makes explicit a speed-robustness trade-off. We also give an FFT-based implementation that applies the damped update slice-wise in the Fourier domain. This implementation allows frequency-dependent damping parameters in practice. Numerical experiments on synthetic tensor systems illustrate the stabilization behavior of SD-TRK relative to standard TRK in noisy and ill-conditioned settings. We also include a two-pass image reconstruction comparison under the same noisy reconstruction pipeline.

math.NA

K-BrowseComp: A Web Browsing Agent Benchmark Grounded in Korean Contexts

Frontier model evaluations are shifting from foundational capabilities (e.g., instruction following and reasoning) toward compositional, agentic ones, but Korean agentic benchmarks remain scarce. We introduce K-BrowseComp, a web-browsing agent benchmark grounded in Korean contexts, consisting of 400 problems. The 300-problem K-BrowseComp-Verified subset is manually constructed and validated by native Korean speakers. On this subset, frontier LLMs, including GPT-5.5, DeepSeek-V4-Pro, and GLM-5.1, reach only 30.00--45.67\%, a substantial drop from BrowseComp, while Korean LLMs released through Korea's Proprietary AI Foundation Model program obtain only 0.00--10.33\%. We further construct a 100-problem synthetic split using hard few-shot exemplars and failure-mode-targeted generation to exploit the asymmetry between solving and creating web browsing problems. On the adversarially filtered synthetic diagnostic split, the strongest model reaches only 26.00\%, and we report this split separately as a targeted stress test. We publicly release our data and code.

cs.CL

Soohak: A Mathematician-Curated Benchmark for Evaluating Research-level Math Capabilities of LLMs

Following the recent achievement of gold-medal performance on the IMO by frontier LLMs, the community is searching for the next meaningful and challenging target for measuring LLM reasoning. Whereas olympiad-style problems measure step-by-step reasoning alone, research-level problems use such reasoning to advance the frontier of mathematical knowledge itself, emerging as a compelling alternative. Yet research-level math benchmarks remain scarce because such problems are difficult to source (e.g., Riemann Bench and FrontierMath-Tier 4 contain 25 and 50 problems, respectively). To support reliable evaluation of next-generation frontier models, we introduce Soohak, a 439-problem benchmark newly authored from scratch by 64 mathematicians. Soohak comprises two subsets. On the Challenge subset, frontier models including Gemini-3-Pro, GPT-5, and Claude-Opus-4.5 reach 30.4%, 26.4%, and 10.4% respectively, leaving substantial headroom, while leading open-weight models such as Qwen3-235B, GPT-OSS-120B, and Kimi-2.5 remain below 15%. Notably, beyond standard problem solving, Soohak introduces a refusal subset that probes a capability intrinsic to research mathematics: recognizing ill-posed problems and pausing rather than producing confident but unjustified answers. On this subset, no model exceeds 50%, identifying refusal as a new optimization target that current models do not directly address. To prevent contamination, the dataset will be publicly released in late 2026, with model evaluations available upon request in the interim.

cs.CL

KMMMU: Evaluation of Massive Multi-discipline Multimodal Understanding in Korean Language and Context

We introduce KMMMU, a native Korean benchmark for evaluating multimodal understanding in Korean cultural and institutional settings. KMMMU contains 3,466 questions from exams natively written in Korean, covering nine disciplines and nine visual modality categories, along with a 300-item Korean-specific subset and a hard subset of 627 questions. Unlike translated or English-centric benchmarks, KMMMU targets information-dense problems shaped by local conventions, official standards, and discipline-specific visual formats. Experiments show that the strongest open-source model reaches only 42.05% accuracy on the full set, while the best proprietary model achieves 52.42% on the hard subset. Performance varies across disciplines, with some disciplines emerging as bottlenecks, and Korean-specific questions showing gaps of up to 13.43%. Error analysis suggests that these failures stem less from insufficient reasoning depth than from weak convention-to-label mapping, few-shot symbolic induction, localized knowledge recall, and domain-specific standards understanding. KMMMU provides a testbed for multimodal evaluation beyond English-centric benchmarks and for developing more reliable systems for expert real-world tasks.

cs.CL

Pushing the Boundaries of Multiple Choice Evaluation to One Hundred Options

Multiple choice evaluation is widely used for benchmarking large language models, yet near ceiling accuracy in low option settings can be sustained by shortcut strategies that obscure true competence. Therefore, we propose a massive option evaluation protocol that scales the candidate set to one hundred options and sharply reduces the impact of chance performance. We apply this framework to a Korean orthography error detection task where models must pick the single incorrect sentence from a large candidate set. With fixed targets and repeated resampling and shuffling, we obtain stable estimates while separating content driven failures from positional artifacts. Across experiments, results indicate that strong performance in low option settings can overstate model competence. This apparent advantage often weakens under dense interference at high $N$, revealing gaps that conventional benchmarks tend to obscure. We identify two failure modes, semantic confusion and position bias toward early options under uncertainty. To isolate the effect of context length, we run padding controlled and length matched tests, which suggest that the main bottleneck is candidate ranking rather than context length. Together, these findings support massive option evaluation as a general framework for stress testing model reliability under extreme distractor density, beyond what low option benchmarks can reveal.

cs.CL

BEAT2AASIST model with layer fusion for ESDD 2026 Challenge

Recent advances in audio generation have increased the risk of realistic environmental sound manipulation, motivating the ESDD 2026 Challenge as the first large-scale benchmark for Environmental Sound Deepfake Detection (ESDD). We propose BEAT2AASIST which extends BEATs-AASIST by splitting BEATs-derived representations along frequency or channel dimension and processing them with dual AASIST branches. To enrich feature representations, we incorporate top-k transformer layer fusion using concatenation, CNN-gated, and SE-gated strategies. In addition, vocoder-based data augmentation is applied to improve robustness against unseen spoofing methods. Experimental results on the official test sets demonstrate that the proposed approach achieves competitive performance across the challenge tracks.

cs.SD

KAIO: A Collection of More Challenging Korean Questions

With the advancement of mid/post-training techniques, LLMs are pushing their boundaries at an accelerated pace. Legacy benchmarks saturate quickly (e.g., broad suites like MMLU over the years, newer ones like GPQA-D even faster), which makes frontier progress hard to track. The problem is especially acute in Korean: widely used benchmarks are fewer, often translated or narrow in scope, and updated more slowly, so saturation and contamination arrive sooner. Accordingly, at this moment, there is no Korean benchmark capable of evaluating and ranking frontier models. To bridge this gap, we introduce KAIO, a Korean, math-centric benchmark that stresses long-chain reasoning. Unlike recent Korean suites that are at or near saturation, KAIO remains far from saturated: the best-performing model, GPT-5, attains 62.8, followed by Gemini-2.5-Pro (52.3). Open models such as Qwen3-235B and DeepSeek-R1 cluster falls below 30, demonstrating substantial headroom, enabling robust tracking of frontier progress in Korean. To reduce contamination, KAIO will remain private and be served via a held-out evaluator until the best publicly known model reaches at least 80% accuracy, after which we will release the set and iterate to a harder version.

cs.CL

Controlling Language Confusion in Multilingual LLMs

Large language models often suffer from language confusion, a phenomenon in which responses are partially or entirely generated in unintended languages. This critically degrades the user experience, especially in low-resource settings. We hypothesize that this issue stems from limitations in conventional fine-tuning objectives, such as supervised learning, which optimize the likelihood of correct tokens without explicitly penalizing undesired outputs such as cross-lingual mixing. Analysis of loss trajectories during pretraining further reveals that models fail to distinguish between monolingual and language-mixed texts, highlighting the absence of inherent pressure to avoid such confusion. In this work, we apply ORPO, which adds penalties for unwanted output styles to standard SFT, effectively suppressing language-confused generations. ORPO maintains strong language consistency, even under high decoding temperatures, while preserving general QA performance. Our findings suggest that incorporating appropriate penalty terms can effectively mitigate language confusion in multilingual models, particularly in low-resource scenarios.

cs.CL

Kagome van-der-Waals Pd3P2S8 with flat band

With the advanced investigations into low-dimensional systems, it has become essential to find materials having interesting lattices that can be exfoliated down to monolayer. One particular important structure is a kagome lattice with its potentially diverse and vibrant physics. We report a van-der-Waals kagome lattice material, Pd3P2S8, with several unique properties such as an intriguing flat band. The flat band is shown to arise from a possible compact-localized state of all five 4d orbitals of Pd. The diamagnetic susceptibility is precisely measured to support the calculated susceptibility obtained from the band structure. We further demonstrate that Pd3P2S8 can be exfoliated down to monolayer, which ultimately will allow the possible control of the localized states in this two-dimensional kagome lattice using the electric field gating.

cond-mat.mtrl-sci

Bulk properties of van-der-Waals hard ferromagnet VI3

We present comprehensive measurements of the structural, magnetic and electronic properties of layered van-der-Waals ferromagnet VI$_3$ down to low temperatures. Despite belonging to a well studied family of transition metal trihalides, this material has received very little attention. We outline, from high-resolution powder x-ray diffraction measurements, a corrected room-temperature crystal structure to that previously proposed and uncover a structural transition at 79 K, also seen in the heat capacity. Magnetization measurements confirm VI$_3$ to be a hard ferromagnet (9.1 kOe coercive field at 2 K) with a high degree of anisotropy, and the pressure dependence of the magnetic properties provide evidence for the two-dimensional nature of the magnetic order. Optical and electrical transport measurements show this material to be an insulator with an optical band gap of 0.67 eV - the previous theoretical predictions of d-band metallicity then lead us to believe VI$_3$ to be a correlated Mott insulator. Our latest band structure calculations support this picture and show good agreement with the experimental data. We suggest VI$_3$ to host great potential in the thriving field of low-dimensional magnetism and functional materials, together with opportunities to study and make use of low-dimensional Mott physics.

cond-mat.str-el

Frustrated antiferromagnetic honeycomb-tunnel-like lattice CuRE2Ge2O8 (RE=Pr, Nd, Sm, and Eu)

New frustrated antiferromagnetic compounds CuRE2Ge2O8 (RE=Pr, Nd, Sm, Eu) have been investigated using high-resolution x-ray diffraction, magnetic and heat capacity measurements. These systems show different magnetic lattices depending on rare-earth element. The nonmagnetic Eu compound is a S=1/2 two-dimensional triangular antiferromagnetic lattice oriented in the ac plane with geometrical frustration. On the other hand, the Pr, Nd, and Sm compounds show a three-dimensional honeycomb-tunnel-like lattice made of RE^3+ running along the a axis with the characteristic behavior of frustrated antiferromagnets.

cond-mat.str-el