arXiv subjects

Hyunjoong Kim

Publications and source records attributed to Hyunjoong Kim.

13 recordsLinked to original sources

arXiv2026

Competition drives excessive recruitment in collective search

Groups that search collectively often exploit what they find by recruiting: one member directs others to a site it has found. Recruitment raises the number of members foraging at a known site, but the return per forager may fall as that number grows, so there is an intermediate optimal recruitment rate. In addition, a site may be used by more than one group. Here we analyze a model of two groups that forage from a single site whose return declines with the total number of foragers present. The two groups interact only through this shared return. The long-run outcome is either coexistence at the foraging site or monopoly by one group, and we analyze the boundary between these two outcomes. A group's best response to its rival is not monotone: it increases its own recruitment rate with the rival's recruitment rate in an attempt to preserve a monopoly, and then its recruitment rate drops discontinuously when it is no longer optimal to preserve a monopoly. We analyze how model parameters govern this shift: a group relinquishes monopoly when the site saturates at few foragers and when the rival group is small. When the two groups have comparable size there are multiple Nash equilibria, so either group may end up with the larger share. And when two equally matched groups compete, both recruit above the rate that maximizes their common return, so that each individual ends with less than it would in a single undivided group of the same total size.

q-bio.PE↗

arXiv2026

FUSE: Feature-Wise Unified Specialization with Cross-Column Exchange for Mixed-Type Tabular Flow Matching

Generating mixed-type tabular data requires jointly modeling diverse feature distributions and their complex cross-column dependencies. Variational flow matching handles distinct endpoints via factorized distributions, yet leaves feature-specific processing and cross-column interactions implicit within a shared backbone. We introduce Feature-wise Unified Specialization with cross-column Exchange (FUSE) to explicitly separate these roles. FUSE applies separate adaptive mixture modules to numerical and categorical features, allowing each feature to combine shared specialized subnetworks, while joint attention preserves information exchange across all columns. We also characterize the excess population risk from restricted conditioning contexts and bound the continuous Wasserstein generation error by endpoint-prediction risk. Comprehensive experiments on eight tabular datasets demonstrate that FUSE achieves strong and consistent performance across distributional fidelity and downstream utility metrics.

cs.LG↗

arXiv2026

Zero Knowledge Verification of Transaction Guides for P2P Energy Trading in Distribution Networks

Peer-to-peer (P2P) energy trading requires network-aware coordination because transactions are physically realized through distribution networks. However, sensitivity-based coordination causes a confidentiality-verifiability tradeoff, as network sensitivities may reveal vulnerable components while undisclosed sensitivities prevent participants from verifying utility-provided transaction guides. This paper proposes a zero-knowledge-proof-based method for verifying the computational integrity of network-constrained transaction guides with respect to committed private network data, without exposing network-sensitivity information. The guide defines admissible injection and withdrawal volumes derived from sign-decomposed sensitivity matrices while satisfying balance, voltage, line-flow, and optimality conditions. These conditions are encoded in an arithmetic circuit, represented as R1CS constraints and a quadratic arithmetic program, and verified using a bilinear pairing. Blockchain commitments bind the approved circuit, public inputs, statement identifiers, proof, and verification result for tamper-evident auditability. The proposed proof certifies correct guide computation from committed network data; the authenticity of the committed network data is handled through an explicit registration and attestation assumption. Case studies on a modified IEEE 33-bus system show satisfaction of network constraints after clearing, rejection of public-input and witness-inconsistency attacks, and practical on-chain overhead, with an 806-byte proof.

eess.SY↗

arXiv2026

Daring few, patient many: division of labor in decentralized foraging collectives

How do social animals make effective decisions in the absence of a leader? While coordination can improve accuracy, it also introduces delays as information propagates through the group. In changing environments, these delays can outweigh the benefits of globally coordinated decisions, even when local interactions remain tightly organized. This raises a key question: how can groups implement efficient collective decision-making without central coordination? We address this question using a collective foraging model in which individuals share information and rewards, but each must choose whether to bear the cost of exploring or to remain idle. We show that decentralized collectives can match the performance of centrally controlled groups through a division of labor: a small, heterogeneous subset explores even when expected rewards are negative, acquiring information to enable future foraging, while a coordinated majority forages only when expected rewards are positive. Information redundancy causes the optimal number of explorers to grow sublinearly with group size, so that larger groups need proportionally fewer explorers. The heterogeneity of the group is maximized at intermediate ecological pressures, but optimal groups are homogeneous when costs or fluctuations are extreme. Crucially, these group-level policies do not require central coordination, emerging instead from agents following simple threshold-based decision rules. We thus demonstrate a mechanism through which leaderless collectives can make effective decisions under uncertainty and show how ecological pressures can drive changes in the distribution of strategies employed by the group.

q-bio.PE↗

arXiv2025

Learning Majority-to-Minority Transformations with MMD and Triplet Loss for Imbalanced Classification

Class imbalance in supervised classification often degrades model performance by biasing predictions toward the majority class, particularly in critical applications such as medical diagnosis and fraud detection. Traditional oversampling techniques, including SMOTE and its variants, generate synthetic minority samples via local interpolation but fail to capture global data distributions in high-dimensional spaces. Deep generative models based on GANs offer richer distribution modeling yet suffer from training instability and mode collapse under severe imbalance. To overcome these limitations, we introduce an oversampling framework that learns a parametric transformation to map majority samples into the minority distribution. Our approach minimizes the maximum mean discrepancy (MMD) between transformed and true minority samples for global alignment, and incorporates a triplet loss regularizer to enforce boundary awareness by guiding synthesized samples toward challenging borderline regions. We evaluate our method on 29 synthetic and real-world datasets, demonstrating consistent improvements over classical and generative baselines in AUROC, G-mean, F1-score, and MCC. These results confirm the robustness, computational efficiency, and practical utility of the proposed framework for imbalanced classification tasks.

stat.ML↗

arXiv2025

Mitigating Semantic Leakage in Cross-lingual Embeddings via Orthogonality Constraint

Accurately aligning contextual representations in cross-lingual sentence embeddings is key for effective parallel data mining. A common strategy for achieving this alignment involves disentangling semantics and language in sentence embeddings derived from multilingual pre-trained models. However, we discover that current disentangled representation learning methods suffer from semantic leakage - a term we introduce to describe when a substantial amount of language-specific information is unintentionally leaked into semantic representations. This hinders the effective disentanglement of semantic and language representations, making it difficult to retrieve embeddings that distinctively represent the meaning of the sentence. To address this challenge, we propose a novel training objective, ORthogonAlity Constraint LEarning (ORACLE), tailored to enforce orthogonality between semantic and language embeddings. ORACLE builds upon two components: intra-class clustering and inter-class separation. Through experiments on cross-lingual retrieval and semantic textual similarity tasks, we demonstrate that training with the ORACLE objective effectively reduces semantic leakage and enhances semantic alignment within the embedding space.

cs.CL↗

arXiv2025

Community Energy Management System for Fast Frequency Response: A Hierarchical Control Approach

The increase in renewable energy sources (RES) has reduced power system inertia, making frequency stabilization more challenging and highlighting the need for fast frequency response (FFR) resources. While building energy management systems (BEMS) equipped with distributed energy resources (DERs) can provide FFR, individual BEMS alone cannot fully meet demand. To address this, we propose a community energy management system (CEMS) operational model that minimizes energy costs and generates additional revenue, which is provided FFR through coordinated DERs and building loads under photovoltaic (PV) generation uncertainty. The model incorporates a hierarchical control framework with three levels: Level 1 allocates maximum FFR capacity, Level 2 employs scenario-based stochastic model predictive control (SMPC) to adjust DER operations and ensure FFR provision despite PV uncertainties, and Level 3 performs rapid load adjustments in response to frequency fluctuations detected by a frequency meter. Simulation results on a campus building cluster demonstrate the effectiveness of the proposed model, achieving a 10\% reduction in energy costs and a 24\% increase in FFR capacity, all while maintaining occupant comfort and enhancing frequency stabilization.

eess.SY↗

arXiv2024

Heterogeneous Random Forest

Random forest (RF) stands out as a highly favored machine learning approach for classification problems. The effectiveness of RF hinges on two key factors: the accuracy of individual trees and the diversity among them. In this study, we introduce a novel approach called heterogeneous RF (HRF), designed to enhance tree diversity in a meaningful way. This diversification is achieved by deliberately introducing heterogeneity during the tree construction. Specifically, features used for splitting near the root node of previous trees are assigned lower weights when constructing the feature sub-space of the subsequent trees. As a result, dominant features in the prior trees are less likely to be employed in the next iteration, leading to a more diverse set of splitting features at the nodes. Through simulation studies, it was confirmed that the HRF method effectively mitigates the selection bias of trees within the ensemble, increases the diversity of the ensemble, and demonstrates superior performance on datasets with fewer noise features. To assess the comparative performance of HRF against other widely adopted ensemble methods, we conducted tests on 52 datasets, comprising both real-world and synthetic data. HRF consistently outperformed other ensemble methods in terms of accuracy across the majority of datasets.

cs.LG↗

arXiv2024

Cover times of many diffusive or subdiffusive searchers

Cover times measure the speed of exhaustive searches which require the exploration of an entire spatial region(s). Applications include the immune system hunting pathogens, animals collecting food, robotic demining or cleaning, and computer search algorithms. Mathematically, a cover time is the first time a random searcher(s) comes within a specified "detection radius" of every point in the target region (often the entire spatial domain). Due to their many applications and their fundamental probabilistic importance, cover times have been extensively studied in the physics and probability literatures. This prior work has generally studied cover times of a single searcher with a vanishing detection radius or a large target region. This prior work has further claimed that cover times for multiple searchers can be estimated by a simple rescaling of the cover time of a single searcher. In this paper, we study cover times of many diffusive or subdiffusive searchers and show that prior estimates break down as the number of searchers grows. We prove a rather universal formula for all the moments of such cover times in the many searcher limit that depends only on (i) the searcher's characteristic (sub)diffusivity and (ii) a certain geodesic distance between the searcher starting location(s) and the farthest point in the target. This formula is otherwise independent of the detection radius, space dimension, target size, and domain size. We illustrate our results in several examples and compare them to detailed stochastic simulations.

math.PR↗

arXiv2024

Cover times of many random walkers on a discrete network

The speed of an exhaustive search can be measured by a cover time, which is defined as the time it takes a random searcher to visit every state in some target set. Cover times have been studied in both the physics and probability literatures, with most prior works focusing on a single searcher. In this paper, we prove an explicit formula for all the moments of the cover time for many searchers on an arbitrary discrete network. Our results show that such cover times depend only on properties of the network along the shortest paths to the most distant parts of the target. This mere local dependence contrasts with the well-known result that cover times for single searchers depend on global properties of the network. We illustrate our rigorous results by stochastic simulations.

cond-mat.stat-mech↗

arXiv2023

Finite population effects on optimal communication for social foragers

Foraging is crucial for animals to survive. Many species forage in groups, as individuals communicate to share information about the location of available resources. For example, eusocial foragers, such as honey bees and many ants, recruit members from their central hive or nest to a known foraging site. However, the optimal level of communication and recruitment depends on the overall group size, the distribution of available resources, and the extent of interference between multiple individuals attempting to forage from a site. In this paper, we develop a discrete-time Markov chain model of eusocial foragers, who communicate information with a certain probability. We compare the stochastic model and its corresponding infinite-population limit. We find that foraging efficiency tapers off when recruitment probability is too high -- a phenomenon that does not occur in the infinite-population model, even though it occurs for any finite population size. The marginal inefficiency at high recruitment probability increases as the population increases, similar to a boundary layer. In particular, we prove there is a significant gap between the foraging efficiency of finite and infinite population models in the extreme case of complete communication. We also analyze this phenomenon by approximating the stationary distribution of foragers over sites in terms of mean escape times from multiple quasi-steady states. We conclude that for any finite group of foragers, an individual who has found a resource should only sometimes recruit others to the same resource. We discuss the relationship between our analysis and multi-agent multi-arm bandit problems.

q-bio.PE↗

arXiv2022

Optimality of intercellular signaling: direct transport versus diffusion

Intercellular signaling has an important role in organism development, but not all communication occurs using the same mechanism. Here, we analyze the energy efficiency of intercellular signaling by two canonical mechanisms: diffusion of signaling molecules and direct transport mediated by signaling cellular protrusions. We show that efficient contact formation for direct transport can be established by an optimal rate of projecting protrusions, which depends on the availability of information about the location of the target cell. The optimal projection rate also depends on how signaling molecules are transported along the protrusion, in particular the ratio of the energy cost for contact formation and molecule synthesis. Also, we compare the efficiency of the two signaling mechanisms, under various model parameters. We find that the direct transport is favored over the diffusion when transporting a large amount of signaling molecules. There is a critical number of signaling molecules at which the efficiency of the two mechanisms are the same. The critical number is small when the distance between cells is far, which helps explain why protrusion-based mechanisms are observed in long-range cellular communications.

q-bio.QM↗

arXiv2020

Stochastic Turing pattern formation in a model with active and passive transport

We investigate Turing pattern formation in a stochastic and spatially discretized version of a reaction diffusion advection (RDA) equation, which was previously introduced to model synaptogenesis in \textit{C. elegans}. The model describes the interactions between a passively diffusing molecular species and an advecting species that switches between anterograde and retrograde motor-driven transport (bidirectional transport). Within the context of synaptogenesis, the diffusing molecules can be identified with the protein kinase CaMKII and the advecting molecules as glutamate receptors. The stochastic dynamics evolves according to an RDA master equation, in which advection and diffusion are both modeled as hopping reactions along a one-dimensional array of chemical compartments. Carrying out a linear noise approximation of the RDA master equation leads to an effective Langevin equation, whose power spectrum provides a means of extending the definition of a Turing instability to stochastic systems, namely, in terms of the existence of a peak in the power spectrum at a non-zero spatial frequency. We thus show how noise can significantly extend the range over which spontaneous patterns occur, which is consistent with previous studies of RD systems.

cond-mat.stat-mech↗