Source author record

Jimyeong Kim

Jimyeong Kim appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

3works
7topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

3 published item(s)

preprint2026arXiv

TLPO: Token-Level Policy Optimization for Mitigating Language Confusion in Large Language Models

Large language models (LLMs) demonstrate strong multilingual capabilities, yet often fail to consistently generate responses in the intended language, exhibiting a phenomenon known as language confusion. Prior mitigation approaches based on sequence-level fine-tuning, such as DPO, ORPO, and GRPO, operate at the level of entire responses and can lead to unintended degradation of general model capabilities, motivating the need for more fine-grained alternatives. To address this, we introduce Token-Level Policy Optimization (TLPO), a fine-tuning framework designed to mitigate language confusion through localized, token-level updates. TLPO identifies error-prone positions, explores alternative candidate tokens, and updates the policy using a tailored objective to suppress error-inducing outputs at a granular level. This selective intervention enables effective mitigation of language confusion without compromising the model's general abilities. Experiments on multiple multilingual LLMs across diverse languages demonstrate that TLPO significantly outperforms baselines in improving language consistency while preserving downstream task accuracy.

preprint2022arXiv

On the convergence of decentralized gradient descent with diminishing stepsize, revisited

Distributed optimization has received a lot of interest in recent years due to its wide applications in various fields. In this work, we revisit the convergence property of the decentralized gradient descent [A. Nedi{ć}-A.Ozdaglar (2009)] on the whole space given by $$ x_i(t+1) = \sum^m_{j=1}w_{ij}x_j(t) - α(t) \nabla f_i(x_i(t)), $$ where the stepsize is given as $α(t) = \frac{a}{(t+w)^p}$ with $0< p\leq 1$. Under the strongly convexity assumption on the total cost function $f$ with local cost functions $f_i$ not necessarily being convex, we show that the sequence converges to the optimizer with rate $O(t^{-p})$ when the values of $a>0$ and $w>0$ are suitably chosen.

preprint2022arXiv

On the radius of spatial analyticity for the Klein-Gordon-Schrödinger system

In this paper, we study the persistence of spatial analyticity for the solutions to the Klein-Gordon-Schrödinger system, which describes a physical system of a nucleon field interacting with a neutral meson field, with analytic initial data. Unlike the case of a single nonlinear dispersive equation, not much is known about nonlinear dispersive systems as it is harder to show the spatial analyticity of coupled equations simultaneously. The only results known so far are rather recent ones for the Dirac-Klein-Gordon system which governs the physical system when the nucleon is described by Dirac spinor fields in the case of relativistic fields. In contrast, we aim here to study the Klein-Gordon-Schrödinger system that works in the non-relativistic regime. It is shown that the radius of spatial analyticity of the solutions at later times obeys an algebraic lower bound as time goes to infinity.