TLTongseok Lim

Tongseok Lim

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Tongseok Lim has a total of 22 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Data Denoising with Self-Consistency, Variance Maximization, and the Kantorovich Dominance

    by Joshua Zoen-Git Hiew, Tongseok Lim, Brendan Pass, Marcelo Cruz de Souza

    We introduce a new framework for data denoising, partially inspired by martingale optimal transport. For a given noisy distribution (the data), our approach involves finding the closest di...

  • Open Access

    Dual Attainment in Multi-Period Multi-Asset Martingale Optimal Transport and Its Computation

    by Charlie Che, Tongseok Lim, Yue Sun

    We establish dual attainment for the multimarginal, multi-asset martingale optimal transport (MOT) problem, a fundamental question in the mathematical theory of model-independent pricing and hedging in quantitative finance. Our main result proves the existence of dual optimizers under mild regularity and irreducibility conditions, extending previous duality and attainment results from the classical and two-marginal settings to arbitrary numbers of assets and time periods. This theoretical advance provides a rigorous foundation for robust pricing and hedging of complex, path-dependent financial derivatives. To support our analysis, we present numerical experiments that demonstrate the practical solvability of large-scale discrete MOT problems using the state-of-the-art primal-dual linear programming (PDLP) algorithm. In particular, we solve multi-dimensional (or vectorial) MOT instances arising from the robust pricing of worst-of autocallable options, confirming the accuracy and feasibility of our theoretical results. Our work advances the mathematical understanding of MOT and highlights its relevance for robust financial engineering in high-dimensional and model-uncertain environments.

  • Open Access

    Node Classification via Simplicial Interaction with Augmented Maximal Clique Selection

    by Eunho Koo, Tongseok Lim

    Considering higher-order interactions allows for a more comprehensive understanding of network structures beyond simple pairwise connections. While leveraging all cliques in a network to handle higher-order interactions is intuitive, it often leads to computational inefficiencies due to overlapping information between higher-order and lower-order cliques. To address this issue, we propose an augmented maximal clique strategy. Although using only maximal cliques can reduce unnecessary overlap and provide a concise representation of the network, certain nodes may still appear in multiple maximal cliques, resulting in imbalanced training data. Therefore, our augmented maximal clique approach selectively includes some non-maximal cliques to mitigate the overrepresentation of specific nodes and promote more balanced learning across the network. Comparative analyses on synthetic networks and real-world citation datasets demonstrate that our method outperforms approaches based on pairwise interactions, all cliques, or only maximal cliques. Finally, by integrating this strategy into GNN-based semi-supervised learning, we establish a link between maximal clique-based methods and GNNs, showing that incorporating higher-order structures improves predictive accuracy. As a result, the augmented maximal clique strategy offers a computationally efficient and effective solution for higher-order network learning.

  • Node Classification in Networks via Simplicial Interactions

    by Eunho Koo, Tongseok Lim

    In the node classification task, it is natural to presume that densely connected nodes tend to exhibit similar attributes. Given this, it is crucial to first define what constitutes a dense connection and to develop a reliable mathematical tool for assessing node cohesiveness. In this article, we propose a probability-based objective function for semi-supervised node classification that takes advantage of higher order networks’ capabilities. The proposed function reflects the philosophy aligned with the intuition behind classifying within higher order networks, as it is designed to reduce the likelihood of nodes interconnected through higher order networks bearing different labels. In addition, we propose the stochastic block tensor model (SBTM) as a graph generation model designed specifically to address a significant limitation of the traditional stochastic block model (SBM), which does not adequately represent the distribution of higher order structures in real networks. We evaluate the objective function using networks generated by the SBTM, which include both balanced and imbalanced scenarios. Furthermore, we present an approach that integrates the objective function with graph neural network (GNN)-based semi-supervised node classification methodologies, aiming for additional performance gains. Our results demonstrate that in challenging classification scenarios—characterized by a low probability of homo-connections, a high probability of hetero-connections, and limited prior node information—models based on the higher order network outperform pairwise interaction-based models. Furthermore, the experimental results suggest that integrating our proposed objective function with existing GNN-based node classification approaches enhances the classification performance by efficiently learning higher order structures distributed in the network.


  • Open Access

    Robust Intervention in Networks

    by Euncheol Shin, Daeyoung Jeong, Tongseok Lim

    We study robust intervention in networks where a decision maker (DM) allocates resources to guide outcomes toward a target, while an adversarial Nature selects the network's dependence structure within a moment-consistent uncertainty set to maximize the DM's loss. We characterize the unique robust intervention and show that Nature's worst-case response exhibits a row-wise rank-1 property: uncertainty concentrates along a single direction aligned with the DM's intervention vector, reducing high-dimensional distributional ambiguity to a sign-pattern-driven fixed point. Applying the framework to four network topologies---pandemic mitigation, financial stabilization, supply chain management, and faculty recruitment---robust intervention trades off mean influence against correlation risk, yielding qualitatively different prescriptions from standard models. We further show that cross-block links generate disproportionately large costs of uncertainty, as they propagate worst-case dependence through multiple network segments simultaneously.

  • Open Access

    Cooperative networks and f-Shapley value

    by Tongseok Lim

    Lloyd Shapley's cooperative value allocation theory stands as a central concept in game theory, extensively utilized across various domains to distribute resources, evaluate individual contributions, and ensure fairness. The Shapley value formula and his four axioms that characterize it form the foundation of the theory. Traditionally, the Shapley value is assigned under the assumption that all players in a cooperative game will ultimately form the grand coalition. In this paper, we reinterpret the Shapley value as an expectation of a certain stochastic path integral, with each path representing a general coalition formation process. As a result, the value allocation is naturally extended to all partial coalition states. In addition, we provide a set of five properties that extend the Shapley axioms and characterize the stochastic path integral. Finally, by integrating Hodge calculus, stochastic processes, and path integration of edge flows on graphs, we expand the cooperative value allocation theory beyond the standard coalition game structure to encompass a broader range of cooperative network configurations.

  • Open Access

    Optimal exercise decision of American options under model uncertainty

    by Tongseok Lim

    Given the marginal distribution information of the underlying asset price at two future times $T_1$ and $T_2$, we consider the problem of determining a model-free upper bound on the price of a class of American options that must be exercised at either $T_1$ or $T_2$. The model uncertainty consistent with the given marginal information is described as the martingale optimal transport problem. We show that any option exercise scheme associated with any market model that jointly maximizes the expected option payoff must be nonrandomized if the American option payoff satisfies a suitable convexity condition and the model-free price upper bound and its relaxed version coincide. The latter condition is desired to be removed under appropriate conditions on the cost and marginals.

  • Open Access

    Node classification in networks via simplicial interactions

    by Eunho Koo, Tongseok Lim

    In the node classification task, it is intuitively understood that densely connected nodes tend to exhibit similar attributes. However, it is crucial to first define what constitutes a dense connection and to develop a reliable mathematical tool for assessing node cohesiveness. In this paper, we propose a probability-based objective function for semi-supervised node classification that takes advantage of higher-order networks' capabilities. The proposed function embodies the philosophy most aligned with the intuition behind classifying within higher-order networks, as it is designed to reduce the likelihood of nodes interconnected through higher-order networks bearing different labels. We evaluate the function using both balanced and imbalanced datasets generated by the Planted Partition Model (PPM), as well as a real-world political book dataset. According to the results, in challenging classification contexts characterized by low homo-connection probability, high hetero-connection probability, and limited prior information of nodes, higher-order networks outperform pairwise interactions in terms of objective function performance. Notably, the objective function exhibits elevated Recall and F1-score relative to Precision in the imbalanced dataset, indicating its potential applicability in many domains where detecting false negatives is critical, even at the expense of some false positives.

  • Maximal Monotonicity and Cyclic Involutivity of Multiconjugate Convex Functions

    by Tongseok Lim

    A cornerstone in convex analysis is the crucial relationship between functions and their convex conjugate via the Fenchel–Young inequality. In this dual variable setting, the maximal monotonicity of the contact set [Formula: see text] is due to the involution [Formula: see text] holding for convex lower-semicontinuous functions defined on any Hilbert space. We investigate the validity of the cyclic version of involution and maximal monotonicity for multiple (more than two) convex functions. As a result, we show that when the underlying space is the real line, cyclical involutivity and maximal monotonicity induced by multiconjugate convex functions continue to hold as for the dual variable case. On the other hand, when the underlying space is multidimensional, we show that the corresponding properties do not hold in general unless a further regularity assumption is imposed. We provide detailed examples that illustrate the significant differences between dual- and multi-conjugate convex functions, as well as between uni- and multi-dimensional underlying spaces.