SearcharxivSearch

arXiv subjects

Tongseok Lim

Publications and source records attributed to Tongseok Lim.

At least 19 recordsLinked to original sources

Statistical Matching via Schr\"odinger Bridge beyond Conditional Independence

Statistical matching combines partially overlapping datasets that share covariates $X$ but observe the target $Y$ and auxiliary variables $Z$ separately. Classical approaches typically invoke the conditional independence assumption (CIA), which makes the problem identifiable but fundamentally implies that the imported auxiliary variable provides no additional predictive power for $Y$ once $X$ is known. To capture this latent $Y$--$Z$ dependence, we propose a novel dependency-aware Schr\"odinger bridge for predictive statistical matching. Our approach couples the two separated databases by tilting the conservative CIA baseline with a transportation-based compatibility cost, recovering an informative joint distribution. The resulting statistical learning framework yields full probabilistic posterior rules for bidirectional imputation. Theoretically, we establish a sufficient condition under which the learned bridge strictly improves over the CIA baseline, alongside an exact joint recovery guarantee in the Gaussian setting under an appropriate cost. Across synthetic benchmarks and real-world datasets (CelebA and Adult), we demonstrate that our dependency-aware completion consistently improves downstream predictive utility, proving especially beneficial in settings like data recoding where the underlying population exhibits strong $Y$--$Z$ dependence.

cs.LG

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

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.

q-fin.MF

Node Classification via Simplicial Interaction with Augmented Maximal Clique Selection

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.

cs.SI

Data denoising with self consistency, variance maximization, and the Kantorovich dominance

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 distribution to it among all distributions which 1) have a particular prescribed structure (expressed by requiring they lie in a particular domain), and 2) are self-consistent with the data. We show that this amounts to maximizing the variance among measures in the domain which are dominated in convex order by the data. For particular choices of the domain, this problem and a relaxed version of it, in which the self-consistency condition is removed, are intimately related to various classical approaches to denoising. We prove that our general problem has certain desirable features: solutions exist under mild assumptions, have certain robustness properties, and, for very simple domains, coincide with solutions to the relaxed problem. We also introduce a novel relationship between distributions, termed Kantorovich dominance, which retains certain aspects of the convex order while being a weaker, more robust, and easier-to-verify condition. Building on this, we propose and analyze a new denoising problem by substituting the convex order in the previously described framework with Kantorovich dominance. We demonstrate that this revised problem shares some characteristics with the full convex order problem but offers enhanced stability, greater computational efficiency, and, in specific domains, more meaningful solutions. Finally, we present simple numerical examples illustrating solutions for both the full convex order problem and the Kantorovich dominance problem.

stat.ME

Monotone Curve Estimation via Convex Duality

A principal curve serves as a powerful tool for uncovering underlying structures of data through 1-dimensional smooth and continuous representations. On the basis of optimal transport theories, this paper introduces a novel principal curve framework constrained by monotonicity with rigorous theoretical justifications. We establish statistical guarantees for our monotone curve estimate, including expected empirical and generalized mean squared errors, while proving the existence of such estimates. These statistical foundations justify adopting the popular early stopping procedure in machine learning to implement our numeric algorithm with neural networks. Comprehensive simulation studies reveal that the proposed monotone curve estimate outperforms competing methods in terms of accuracy when the data exhibits a monotonic structure. Moreover, through two real-world applications on future prices of copper, gold, and silver, and avocado prices and sales volume, we underline the robustness of our curve estimate against variable transformation, further confirming its effective applicability for noisy and complex data sets. We believe that this monotone curve-fitting framework offers significant potential for numerous applications where monotonic relationships are intrinsic or need to be imposed.

stat.ME

Robust Intervention in Networks

In economic settings such as learning, social behavior, and financial contagion, agents interact through interdependent networks. This paper examines how a decision maker (DM) can design an optimal intervention strategy under network uncertainty, modeled as a zero-sum game against an adversarial ``Nature'' that reconfigures the network within an uncertainty set. Using duality, we characterize the DM's unique robust intervention and identify the worst-case network structure, which exhibits a rank-1 property, concentrating risk along the intervention strategy. We analyze the costs of robustness, distinguishing between global and local uncertainty, and examine the role of higher-order uncertainties in shaping intervention outcomes. Our findings highlight key trade-offs between maximizing influence and mitigating uncertainty, offering insights into robust decision-making. This framework has applications in policy design, economic regulation, and strategic interventions in dynamic networks, ensuring their resilience against uncertainty in network structures.

econ.TH

Cooperative networks and Hodge-Shapley value

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.

math.PR

Optimal exercise decision of American options under model uncertainty

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.

math.PR

Node classification in networks via simplicial interactions

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 paper, 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. Additionally, 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, 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, experimental results suggest that integrating our proposed objective function with existing GNN-based node classification approaches enhances classification performance by efficiently learning higher-order structures distributed in the network.

cs.SI

Dimension Reduction in Martingale Optimal Transport: Geometry and Robust Option Pricing

This paper addresses the problem of robust option pricing within the framework of Vectorial Martingale Optimal Transport (VMOT). We investigate the geometry of VMOT solutions for $N$-period market models and demonstrate that, when the number of underlying assets is $d=2$ and the payoff is sub- or supermodular, the extremal model reduces to a single-factor structure in the first period. This structural result allows for a significant dimension reduction, transforming the problem into a more tractable format. We prove that this reduction is specific to the two-asset case and provide counterexamples showing it generally fails for $d \geq 3$. Finally, we exploit this monotonicity to develop a reduced-dimension Sinkhorn algorithm. Numerical experiments demonstrate that this structure-preserving approach reduces computational time by approximately 99\% compared to standard methods while improving accuracy.

q-fin.MF

Replication of financial derivatives under extreme market models given marginals

The Black-Scholes-Merton model is a mathematical model for the dynamics of a financial market that includes derivative investment instruments, and its formula provides a theoretical price estimate of European-style options. The model's fundamental idea is to eliminate risk by hedging the option by purchasing and selling the underlying asset in a specific way, that is, to replicate the payoff of the option with a portfolio (which continuously trades the underlying) whose value at each time can be verified. One of the most crucial, yet restrictive, assumptions for this task is that the market follows a geometric Brownian motion, which has been relaxed and generalized in various ways. The concept of robust finance revolves around developing models that account for uncertainties and variations in financial markets. Martingale Optimal Transport, which is an adaptation of the Optimal Transport theory to the robust financial framework, is one of the most prominent directions. In this paper, we consider market models with arbitrarily many underlying assets whose values are observed over arbitrarily many time periods, and demonstrates the existence of a portfolio sub- or super-hedging a general path-dependent derivative security in terms of trading European options and underlyings, as well as the portfolio replicating the derivative payoff when the market model yields the extremal price of the derivative given marginal distributions of the underlyings. In mathematical terms, this paper resolves the question of dual attainment for the multi-period vectorial martingale optimal transport problem.

q-fin.MF

Maximal monotonicity and cyclic involutivity of multi-conjugate convex functions

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 $ \big\{(x,y) \ \big| \ f(x) + f^*(y) = \langle x,y \rangle \big\}$ is due to the involution $f^{**} = f$ 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 multi-conjugate 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.

math.OC

Geometry of vectorial martingale optimal transportations and duality

The theory of Optimal Transport (OT) and Martingale Optimal Transport (MOT) were inspired by problems in economics and finance and have flourished over the past decades, making significant advances in theory and practice. MOT considers the problem of pricing and hedging of a financial instrument, referred to as an option, assuming its payoff depends on a single asset price. In this paper we introduce Vectorial Martingale Optimal Transport (VMOT) problem, which considers the more general and realistic situation in which the option payoff depends on multiple asset prices. We address this problem of pricing and hedging given market information -- described by vectorial marginal distributions of underlying asset prices -- which is an intimately relevant setup in the robust financial framework. We establish that the VMOT problem, as an infinite-dimensional linear programming, admits an optimizer for its dual program. Such existence result of dual optimizers is significant for several reasons: the dual optimizers describe how a person who is liable for an option payoff can formulate optimal hedging portfolios, and more importantly, they can provide crucial information on the geometry of primal optimizers, i.e. the VMOTs. As an illustration, we show that multiple martingales given marginals must exhibit an extremal conditional correlation structure whenever they jointly optimize the expectation of distance-type cost functions.

math.PR

Classifying minimum energy states for interacting particles: Regular simplices

Densities of particles on $\Rn$ which interact pairwise through an attractive-repulsive power-law potential $W_{\al,\bt}(x) = |x|^\al/\al-|x|^\bt/\bt$ have often been used to explain patterns produced by biological and physical systems. In the mildly repulsive regime $\al> \bt \ge 2$ with $n \ge 2$, we show there exists a decreasing homeomorphism $\al_{Δ^n}$ from $[2,4]$ to itself such that: distributing the particles uniformly over the vertices of a regular unit diameter $n$-simplex minimizes the potential energy if and only if $\al\ge \al_{\De^n}(\bt)$. Moreover this minimum is uniquely attained up to rigid motions when $\al > \al_{\De^n}(\bt)$. We estimate $\al_{\De^n}(\bt)$ above and below, and identify its limit as the dimension grows large. These results are derived from a new northeast comparison principle in the space of exponents. At the endpoint $(\al,\bt)=(4,2)$ of this transition curve, we characterize all minimizers by showing they lie on a sphere and share all first and second moments with the spherical shell. Suitably modified versions of these statements are also established (i) for $W_{α,β}$ and corresponding energies in the case where $n=1$, and (ii) for the attractive-repulsive potentials $D_\al(x) = |x|^\al(\al\log |x|-1)$ that arise in the limit $\bt \nearrow \al$.

math-ph

Classifying minimum energy states for interacting particles: Spherical Shells

Particles interacting through long-range attraction and short-range repulsion given by power-laws have been widely used to model physical and biological systems, and to predict or explain many of the patterns they display. Apart from rare values of the attractive and repulsive exponents $(α,β)$, the energy minimizing configurations of particles are not explicitly known, although simulations and local stability considerations have led to conjectures with strong evidence over a much wider region of parameters. For a segment $β=2<α<4$ on the mildly repulsive frontier we employ strict convexity to conclude that the energy is uniquely minimized (up to translation) by a spherical shell. In a companion work, we show that in the mildly repulsive range $α>β\ge2$, a unimodal threshold $2<α_{Δ^n}(β) \le \max\{β,4\}$ exists such that equidistribution of particles over a unit diameter regular $n$-simplex minimizes the energy if and only if $α\ge α_{Δ^n}(β)$ (and minimizes uniquely up to rigid motions if strict inequality holds). At the point $(α,β)=(2,4)$ separating these regimes, we show the minimizers all lie on a sphere and are precisely characterized by sharing all first and second moments with the spherical shell. Although the minimizers need not be asymptotically stable, our approach establishes $d_α$-Lyapunov nonlinear stability of the associated ($d_2$-gradient) aggregation dynamics near the minimizer in both of these adjacent regimes -- without reference to linearization. The $L^α$-Kantorovich-Rubinstein distance $d_α$ which quantifies stability is chosen to match the attraction exponent.

math.OC

On the cardinality of sets in ${\bf R}^d$ obeying a slightly obtuse angle bound

In this paper we explicitly estimate the number of points in a subset $A \subset \R^{d}$ as a function of the maximum angle $\angle A$ that any three of these points form, provided $\angle A < θ_d := \arccos(-\frac 1 {d}) \in (π/2,π)$. We also show $\angle A < θ_d$ ensures that $A$ coincides with the vertex set of a convex polytope. This study is motivated by a question of Paul Erdős and indirectly by a conjecture of László Fejes Tóth.

math.MG

Hodge theoretic reward allocation for generalized cooperative games on graphs

This paper generalizes L.S. Shapley's celebrated value allocation theory on coalition games by discovering and applying a fundamental connection between stochastic path integration driven by canonical time-reversible Markov chains and Hodge-theoretic discrete Poisson's equations on general weighted graphs. More precisely, we begin by defining cooperative games on general graphs and generalize Shapley's value allocation formula for those games in terms of stochastic path integral driven by the associated canonical Markov chain. We then show the value allocation operator, one for each player defined by the path integral, turns out to be the solution to the Poisson's equation defined via the combinatorial Hodge decomposition on general weighted graphs. Several motivational examples and applications are presented, in particular, a section is devoted to reinterpret and extend Nash's and Kohlberg and Neyman's solution concept for cooperative games. This and other examples, e.g. on revenue management, suggest that our general framework does not have to be restricted to cooperative games setup, but may apply to broader range of problems arising in economics, finance and other social and physical sciences.

math.PR

Maximizing expected powers of the angle between pairs of points in projective space

Among probability measures on $d$-dimensional real projective space, one which maximizes the expected angle $\arccos(\frac{x}{|x|}\cdot \frac{y}{|y|})$ between independently drawn projective points $x$ and $y$ was conjectured to equidistribute its mass over the standard Euclidean basis $\{e_0,e_1,\ldots, e_d\}$ by Fejes Tóth \cite{FT59}. If true, this conjecture evidently implies the same measure maximizes the expectation of $\arccos^α(\frac{x}{|x|}\cdot \frac{y}{|y|})$ for any exponent $α> 1$. The kernel $\arccos^α(\frac{x}{|x|}\cdot \frac{y}{|y|})$ represents the objective of an infinite-dimensional quadratic program. We verify discrete and continuous versions of this {milder} conjecture in a non-empty range $α> α_{Δ^d} \ge 1$, and establish uniqueness of the resulting maximizer $\hat μ$ up to rotation. We show $\hat μ$ no longer maximizes when $α<α_{Δ^d}$. At the endpoint $α=α_{Δ^d}$ of this range, we show another maximizer $μ$ must also exist which is not a rotation of $\hat μ$. For the continuous version of the conjecture, an appendix provided by Bilyk et al in response to an earlier draft of this work combines with the present improvements to yield $α_{Δ^d}<2$. The original conjecture $\ald=1$ remains open (unless $d=1$). However, in the maximum possible range $α>1$, we show $\hat μ$ and its rotations maximize the aforementioned expectation uniquely on a sufficiently small ball in the $L^\infty$-Kantorovich-Rubinstein-Wasserstein metric $d_\infty$ from optimal transportation; the same is true for any measure $μ$ which is mutually absolutely continuous with respect to $\hat μ$, but the size of the ball depends on {$α,d$, and} $\|\frac{d \hat μ}{dμ}\|_{\infty}$.

math.MG