Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Minseok Jeong

dblp:323/7285 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 67% Environmental and earth informatics · 33%
Artificial intelligence
1 paper
Optimization for machine learning · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Environmental and earth informatics
adaptive sampling
0.912025
Mitigating Instability in High Residual Adaptive Sampling for PINNs via Langevin Dynamics · NeurIPS 2025
Computational science and engineering › scientific machine learning › physics-informed machine learning › physics-informed neural networks
partial differential equation solving
0.912025
Mitigating Instability in High Residual Adaptive Sampling for PINNs via Langevin Dynamics · NeurIPS 2025
Computational science and engineering › scientific machine learning › physics-informed machine learning
physics-informed neural networks
0.912025
Mitigating Instability in High Residual Adaptive Sampling for PINNs via Langevin Dynamics · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

monte carlo integration · 1.7langevin dynamics · 1.7
YearPublicationVenuePosition
2025 Mitigating Instability in High Residual Adaptive Sampling for PINNs via Langevin Dynamics
abstract
Recently, physics-informed neural networks (PINNs) have gained attention in the scientific community for their potential to solve partial differential equations (PDEs). However, they face challenges related to resource efficiency and slow convergence. Adaptive sampling methods, which prioritize collocation points with high residuals, improve both efficiency and accuracy. However, these methods often neglect points with medium or low residuals, which can affect stability as the complexity of the model increases. In this paper, we investigate this limitation and show that high residual-based approaches require stricter learning rate bounds to ensure stability. To address this, we propose a Langevin dynamics-based Adaptive Sampling (LAS) framework that is robust to various learning rates and model complexities. Our experiments demonstrate that the proposed method outperforms existing approaches in terms of relative $L^{2}$ error, and stability across a range of environments, including high-dimensional PDEs where Monte Carlo integration-based methods typically suffer from instability.
Minseok Jeong, Giup Seo, Euiseok Hwang
NeurIPS1
2022 Age of Information Optimization by Deep Reinforcement Learning for Random Access in Machine Type Communication
abstract
For machine type communication with random access (RA) protocol, finding optimal policy using deep reinforcement learning (DRL) is being actively investigated for various quality of service requirements. In particular, it was shown that throughput-based reward function in DRL can derive policies that outperform conventional exponential backoff (EB)-based algorithms in terms of throughput and fairness. However, age of information (AoI), which is a measure of the freshness of data, was not addressed in the process of training the DRL agent and only used as a measure of fairness. It has been theoretically proven that, even in the simplest queuing system, maximizing throughput does not guarantee minimizing AoI. In this paper, we proposed a novel DRL scheme to directly optimize AoI in a slotted ALOHA RA channel. By taking into account urgency and packet age as extra local information for a reward, AoI could be improved while preserving the throughput. Numerical simulations showed that the proposed DRL approach could achieve an improvement of 22.04% in AoI performance, with a marginal throughput loss of around 3.95%, compared to the existing throughput-based DRL method.
Minseok Jeong, Giup Seo, Euiseok Hwang
IEEE Big Data1