arXiv subjects

Jae-Hun Jung

Publications and source records attributed to Jae-Hun Jung.

At least 19 recordsLinked to original sources

arXiv2026

Persistent Cross Entropy

Persistent entropy is the Shannon entropy of a persistence-based probability measure defined on a persistence diagram. However, its cross-entropy version is not naturally defined because two persistence diagrams generally have different event spaces. To bridge these event spaces, we combine a similarity function with persistence weighting to define an induced probability. The induced probability reflects information from one diagram on the event space of the other diagram and assigns unexplained probability mass to the unexplained event. Using the induced probability, we extend cross entropy to persistence diagrams, called persistent cross entropy (PCE). We establish the main properties of both the induced probability and PCE and prove stability theorems for both. Through three numerical studies, we show that PCE distinguishes diagrams with the same persistent entropy, separates causal directions in dynamical systems without constructing a joint persistent diagram, and can be used as a directional topology loss for knowledge distillation.

cs.LG↗

arXiv2026

Topology-Aware Representation Alignment for Semi-Supervised Vision-Language Learning

Vision-language models have shown strong performance, but they often generalize poorly to specialized domains. While semi-supervised vision-language learning mitigates this limitation by leveraging a small set of labeled image-text pairs together with abundant unlabeled images, existing methods remain fundamentally pairwise and fail to model the global structure of multimodal representation manifolds. Existing topology-based alignment methods rely on persistence diagram matching, which neither guarantees geometric alignment nor utilizes the image-text pairing information central to vision-language learning. We propose Topology-Aware Multimodal Representation Alignment (ToMA), a framework that uses persistent homology to identify topologically salient edges and aligns them across modalities through available cross-modal correspondences. ToMA leverages both H_0-death edges and lightweight H_1-birth edges, allowing it to capture both connectivity and cycle structure without constructing 2-simplices. Experiments show that ToMA yields stable gains, with clear improvements on remote sensing and modest but consistent benefits on fashion retrieval. Additional analysis shows that ToMA is more stable than alternative topology-based objectives and that lightweight H_1-birth edges provide useful higher-order structural signals.

cs.CV↗

arXiv2026

Causality as a Minimum Energy Principle

Classical causal models, such as Granger causality and structural equation modeling, are largely restricted to acyclic interactions and struggle to represent cyclic and higher-order dynamics in complex networks. We introduce a causal framework grounded in a variational principle, interpreting causality as directional energy flow from high- to low-energy states along network connections. Using Hodge theory, network flows are decomposed into dissipative components and a persistent harmonic component that captures stable cyclic interactions. Applied to resting-state fMRI connectivity, our variational framework reveals robust cyclic causal patterns that are not detected by conventional causal models, highlighting the value of variational principles for causality.

q-bio.NC↗

arXiv2026

A Family of Even-Order Central-Upwind WENO Schemes with Averaged Downwind and Novel Global Smoothness Indicators

We propose a simple yet effective local smoothness indicator for the downwind stencil in central-upwind weighted essentially non-oscillatory (WENO) schemes of even order for hyperbolic conservation laws. Starting from an odd-order upwind WENO scheme, we construct an even-number-of-points stencil by incorporating a downwind substencil whose smoothness indicator is the arithmetic mean of all local smoothness indicators. This straightforward averaging approach incorporates regularity information from the entire stencil without requiring additional tuning parameters or complex formulations. Combined with affine-invariant Z-type nonlinear weights and a carefully designed global smoothness indicator, the resulting scheme, termed WENO-ZA6 for the sixth-order case, achieves optimal convergence rates at critical points up to second order, exhibits favorable dispersion and dissipation properties as confirmed by approximate dispersion relation analysis, and provides sharp, essentially non-oscillatory resolution of discontinuities. Numerical experiments on scalar problems and the one- and two-dimensional Euler equations demonstrate that WENO-ZA6 achieves accuracy comparable to or better than existing sixth-order central-upwind schemes (WENO-CU6, WENO-S6) and the seventh-order WENO-Z7, while requiring approximately 15\%--21\% less computational time. The framework extends naturally to fourth-, eighth-, and tenth-order schemes.

math.NA↗

arXiv2026

A scaled TW-PINN: A physics-informed neural network for traveling wave solutions of reaction-diffusion equations with general coefficients

We propose an efficient and generalizable physics-informed neural network (PINN) framework for computing traveling wave solutions of $n$-dimensional reaction-diffusion equations with various reaction and diffusion coefficients. By applying a scaling transformation with the traveling wave form, the original problem is reduced to a one-dimensional scaled reaction-diffusion equation with unit reaction and diffusion coefficients. This reduction leads to the proposed framework, termed scaled TW-PINN, in which a single PINN solver trained on the scaled equation is reused for different coefficient choices and spatial dimensions. We also prove a universal approximation property of the proposed PINN solver for traveling wave solutions. Numerical experiments in one and two dimensions, together with a comparison to the existing wave-PINN method, demonstrate the accuracy, flexibility, and superior performance of scaled TW-PINN. Finally, we explore an extension of the framework to the Fisher's equation with general initial conditions.

math.NA↗

arXiv2026

Zipf-Mandelbrot Scaling in Korean Court Music: Universal Patterns in Music

Zipf's law, originally discovered in natural language and later generalized to the Zipf-Mandelbrot law, describes a power-law relationship between the frequency of a Zipfian element and its rank. Due to the semantic characteristics of this law, it has also been observed in musical data. However, most such studies have focused on Western music, and its applicability to non-Western music remains not well investigated. We analyzed 43 Korean court music pieces called Jeong-ak, spanning several centuries and written in the traditional Korean musical notation Jeongganbo. These pieces were transcribed into Western staff notation, and musical data such as pitch and duration were extracted. Using pitch, duration, and their paired combinations as Zipfian units, we found that Korean music also fits the Zipf-Mandelbrot law to a high degree, particularly for the paired pitch-duration unit. Korean music has evolved collectively over long periods, smoothing idiosyncratic variations and producing forms that are widely understandable among people. This collective evolution appears to have played a significant role in shaping the characteristics that lead to the satisfaction of Zipf-Mandelbrot law. Our findings provide additional evidence that Zipf-Mandelbrot scaling in musical data is universal across cultures. We further show that the joint distribution of two independent Zipfian data sets follows the Zipf-Mandelbrot law; in this sense, our result does not merely extend Zipf's law but deepens our understanding of how scaling laws behave under composition and interaction, offering a more unified perspective on rank-based statistical regularities.

stat.AP↗

arXiv2025

Investigating the Effects of Point Source Injection Strategies on KMTNet Real/Bogus Classification

Recently, machine learning-based real/bogus (RB) classifiers have demonstrated effectiveness in filtering out artifacts and identifying genuine transients in real-time astronomical surveys. However, the rarity of transient events and the extensive human labeling required for a large number of samples pose significant challenges in constructing training datasets for RB classification. Given these challenges, point source injection techniques, which inject simulated point sources into optical images, provide a promising solution. This paper presents the first detailed comparison of different point source injection strategies and their effects on classification performance within a simulation-to-reality framework. To this end, we first construct various training datasets based on Random Injection (RI), Near Galaxy Injection (NGI), and a combined approach by using the Korea Microlensing Telescope Network datasets. Subsequently, we train convolutional neural networks on simulated cutout samples and evaluate them on real, imbalanced datasets from gravitational wave follow-up observations for GW190814 and S230518h. Extensive experimental results show that RI excels at asteroid detection and bogus filtering but underperforms on transients occurring near galaxies (e.g., supernovae). In contrast, NGI is effective for detecting transients near galaxies but tends to misclassify variable stars as transients, resulting in a high false positive rate. The combined approach effectively handles these trade-offs, thereby balancing between detection rate and false positive rate. Our results emphasize the importance of point source injection strategy in developing robust RB classifiers for transient (or multi-messenger) follow-up campaigns.

astro-ph.IM↗

arXiv2025

Topological Alignment of Shared Vision-Language Embedding Space

Contrastive Vision-Language Models (VLMs) have demonstrated strong zero-shot capabilities. However, their cross-modal alignment remains biased toward English due to limited multilingual multimodal data. Recent multilingual extensions have alleviated this gap but enforce instance-level alignment while neglecting the global geometry of the shared embedding space. We address this problem by introducing ToMCLIP (Topological Alignment for Multilingual CLIP), a topology-aware framework aligning embedding spaces with topology-preserving constraints. The proposed method applies persistent homology to define a topological alignment loss and approximates persistence diagram with theoretical error bounds using graph sparsification strategy. This work validates the proposed approach, showing enhanced structural coherence of multilingual representations, higher zero-shot accuracy on the CIFAR-100, and stronger multilingual retrieval performance on the xFlickr&CO. Beyond VLMs, the proposed approach provides a general method for incorporating topological alignment into representation learning. Code is available at https://github.com/junwon0/ToMCLIP.git.

cs.CV↗

arXiv2025

Conservative approximation-based feedforward neural network for WENO schemes

In this work, we present the feedforward neural network based on the conservative approximation to the derivative from point values, for the weighted essentially non-oscillatory (WENO) schemes in solving hyperbolic conservation laws. The feedforward neural network, whose inputs are point values from the three-point stencil and outputs are two nonlinear weights, takes the place of the classical WENO weighting procedure. For the training phase, we employ the supervised learning and create a new labeled dataset for one-dimensional conservative approximation, where we construct a numerical flux function from the given point values such that the flux difference approximates the derivative to high-order accuracy. The symmetric-balancing term is introduced for the loss function so that it propels the neural network to match the conservative approximation to the derivative and satisfy the symmetric property that WENO3-JS and WENO3-Z have in common. The consequent WENO schemes, WENO3-CADNNs, demonstrate robust generalization across various benchmark scenarios and resolutions, where they outperform WENO3-Z and achieve accuracy comparable to WENO5-JS.

math.NA↗

arXiv2025

Persistent Homology of Music Network with Three Different Distances

Persistent homology has been widely used to discover hidden topological structures in data across various applications, including music data. To apply persistent homology, a distance or metric must be defined between points in a point cloud or between nodes in a graph network. These definitions are not unique and depend on the specific objectives of a given problem. In other words, selecting different metric definitions allows for multiple topological inferences. In this work, we focus on applying persistent homology to music graph with predefined weights. We examine three distinct distance definitions based on edge-wise pathways and demonstrate how these definitions affect persistent barcodes, persistence diagrams, and birth/death edges. We found that there exist inclusion relations in one-dimensional persistent homology reflected on persistence barcode and diagram among these three distance definitions. We verified these findings using real music data.

cs.SD↗

arXiv2025

JS-type and Z-type weights for fourth-order central-upwind weighted essentially non-oscillatory schemes

The central-upwind weighted essentially non-oscillatory (WENO) scheme introduces the downwind substencil to reconstruct the numerical flux, where the smoothness indicator for the downwind substencil is of critical importance in maintaining high order in smooth regions and preserving the essentially nonoscillatory behavior in shock capturing. In this study, we design the smoothness indicator for the downwind substencil by simply summing up all local smoothness indicators and taking the average, which includes the regularity information of the whole stencil. Accordingly the JS-type and Z-type nonlinear weights, based on simple local smoothness indicators, are developed for the fourth-order central-upwind WENO scheme. The accuracy, robustness, and high-resolution properties of our proposed schemes are demonstrated in a variety of one- and two-dimensional problems.

math.NA↗

arXiv2025

Schwartz duality for singularly perturbed nonlinear differential equations with Chebyshev spectral method

Singularly perturbed differential equations with a Dirac delta function yield discontinuous solutions. Therefore, careful consideration is required when using numerical methods to solve these equations because of the Gibbs phenomenon. A remedy based on the Schwartz duality has been proposed, yielding superior results without oscillations. However, this approach has been limited to linear problems and still suffers from the Gibbs phenomenon for nonlinear problems. In this note, we propose a consistent yet simple approach based on Schwartz duality that can handle nonlinear problems. Our proposed approach utilizes a modified direct projection method with a discrete derivative of the Heaviside function, which directly approximates the Dirac delta function. This proposed method effectively eliminates Gibbs oscillations without the need for traditional regularization and demonstrates uniform error reduction.

math.NA↗

arXiv2025

GECKO Follow-up Observation of the Binary Neutron Star-Black Hole Merger Candidate S230518h

The gravitational wave (GW) event S230518h is a potential binary neutron star-black hole merger (NSBH) event that was detected during engineering run 15 (ER15), which served as the commissioning period before the LIGO-Virgo-KAGRA (LVK) O4a observing run. Despite its low probability of producing detectable electromagnetic emissions, we performed extensive follow-up observations of this event using the GECKO telescopes in the southern hemisphere. Our observation covered 61.7\% of the 90\% credible region, a $\rm 284\:deg^2$ area accessible from the southern hemisphere, reaching a median limiting magnitude of $R=21.6$ mag. In these images, we conducted a systematic search for an optical counterpart of this event by combining a CNN-based classifier and human verification. We identified 128 transient candidates, but no significant optical counterpart was found that could have caused the GW signal. Furthermore, we provide feasible KN properties that are consistent with the upper limits of observation. Although no optical counterpart was found, our result demonstrates both GECKO's efficient wide-field follow-up capabilities and usefulness for constraining properties of kilonovae from NSBH mergers at distances of $\sim 200$ Mpc.

astro-ph.HE↗

arXiv2025

Persistent Homology with Path-Representable Distances on Graph Data

Persistent homology (PH) has been widely applied to graph data to extract topological features. However, little attention has been paid to how different distance functions on a graph affect the resulting persistence barcodes and their interpretations. In this paper, we define a class of distances on graphs, called path-representable distances, and investigate structural relationships between their induced persistent homologies. In particular, we identify a nontrivial injection between the 1-dimensional barcodes induced by two commonly used graph distances: the unweighted and weighted shortest-path distances. We formally establish sufficient conditions under which such embeddings arise, focusing on a subclass we call cost-dominated distances. The injection property is shown to hold in 0- and 1-dimensions, while we provide counterexamples for higher-dimensional cases. To make these relationships measurable, we introduce the total persistence difference (TPD), a new topological measure that quantifies changes between filtrations induced by cost-dominated distances on a fixed graph. We prove a stability result for TPD when the distance functions admit a partial order and apply the method to the SNAP EU Research Institution E-Mail dataset. TPD captures both periodic patterns and global trends in the data, and shows stronger alignment with classical graph statistics compared to an existing PH-based measure applied to the same dataset.

math.AT↗

arXiv2024

Neural network Approximations for Reaction-Diffusion Equations -- Homogeneous Neumann Boundary Conditions and Long-time Integrations

Reaction-Diffusion systems arise in diverse areas of science and engineering. Due to the peculiar characteristics of such equations, analytic solutions are usually not available and numerical methods are the main tools for approximating the solutions. In the last decade, artificial neural networks have become an active area of development for solving partial differential equations. However, several challenges remain unresolved with these methods when applied to reaction-diffusion equations. In this work, we focus on two main problems. The implementation of homogeneous Neumann boundary conditions and long-time integrations. For the homogeneous Neumann boundary conditions, we explore four different neural network methods based on the PINN approach. For the long time integration in Reaction-Diffusion systems, we propose a domain splitting method in time and provide detailed comparisons between different implementations of no-flux boundary conditions. We show that the domain splitting method is crucial in the neural network approach, for long time integration in Reaction-Diffusion systems. We demonstrate numerically that domain splitting is essential for avoiding local minima, and the use of different boundary conditions further enhances the splitting technique by improving numerical approximations. To validate the proposed methods, we provide numerical examples for the Diffusion, the Bistable and the Barkley equations and provide a detailed discussion and comparisons of the proposed methods.

math.NA↗

arXiv2024

A Numerical Study of WENO Approximations to Sharp Propagating Fronts for Reaction-Diffusion Systems

Many reaction-diffusion systems in various applications exhibit traveling wave solutions that evolve on multiple spatio-temporal scales. These traveling wave solutions are crucial for understanding the underlying dynamics of the system. In this work, we present sixth-order weighted essentially non-oscillatory (WENO) methods within the finite difference framework to solve reaction-diffusion systems. The WENO method allows us to use fewer grid points and larger time steps compared to classical finite difference methods. Our focus is on solving the reaction-diffusion system for the traveling wave solution with the sharp front. Although the WENO method is popular for hyperbolic conservation laws, especially for problems with discontinuity, it can be adapted for the equations of parabolic type, such as reaction-diffusion systems, to effectively handle sharp wave fronts. Thus, we employed the WENO methods specifically developed for equations of parabolic type. We considered various reaction-diffusion equations, including Fisher's, Zeldovich, Newell-Whitehead-Segel, bistable equations, and the Lotka-Volterra competition-diffusion system, all of which yield traveling wave solutions with sharp wave fronts. Numerical examples in this work demonstrate that the central WENO method is highly more accurate and efficient than the commonly used finite difference method. We also provide an analysis related to the numerical speed of the sharp propagating front in the Newell-Whitehead-Segel equation. The overall results confirm that the central WENO method is highly efficient and is recommended for solving reaction-diffusion equations with sharp wave fronts.

math.NA↗

arXiv2024

A third-order finite difference weighted essentially non-oscillatory scheme with shallow neural network

In this paper, we introduce the finite difference weighted essentially non-oscillatory (WENO) scheme based on the neural network for hyperbolic conservation laws. We employ the supervised learning and design two loss functions, one with the mean squared error and the other with the mean squared logarithmic error, where the WENO3-JS weights are computed as the labels. Each loss function consists of two components where the first component compares the difference between the weights from the neural network and WENO3-JS weights, while the second component matches the output weights of the neural network and the linear weights. The former of the loss function enforces the neural network to follow the WENO properties, implying that there is no need for the post-processing layer. Additionally the latter leads to better performance around discontinuities. As a neural network structure, we choose the shallow neural network (SNN) for computational efficiency with the Delta layer consisting of the normalized undivided differences. These constructed WENO3-SNN schemes show the outperformed results in one-dimensional examples and improved behavior in two-dimensional examples, compared with the simulations from WENO3-JS and WENO3-Z.

cs.LG↗

arXiv2024

Filtration learning in exact multi-parameter persistent homology and classification of time-series data

To analyze the topological properties of the given discrete data, one needs to consider a continuous transform called filtration. Persistent homology serves as a tool to track changes of homology in the filtration. The outcome of the topological analysis of data varies depending on the choice of filtration, making the selection of filtration crucial. Filtration learning is an attempt to find an optimal filtration that minimizes the loss function. Exact Multi-parameter Persistent Homology (EMPH) has been recently proposed, particularly for topological time-series analysis, that utilizes the exact formula of rank invariant instead of calculating it. In this paper, we propose a framework for filtration learning of EMPH. We formulate an optimization problem and propose an algorithm for solving the problem. We then apply the proposed algorithm to several classification problems. Particularly, we derive the exact formula of the gradient of the loss function with respect to the filtration parameters, which makes it possible to directly update the filtration without using automatic differentiation, significantly enhancing the learning process.

math.OC↗