SearcharxivSearch

arXiv subjects

Tongtong Jin

Publications and source records attributed to Tongtong Jin.

3 recordsLinked to original sources

Computing Rare Probabilities of Voltage Collapse

This paper introduces a framework based on Large Deviation Theory (LDT) to accurately and efficiently compute the rare probabilities of voltage collapse. We formulate the problem as finding the most probable failure point (the instanton) on the stability boundary and derive both first-order and second-order approximations for the collapse probability. The second-order method incorporates the local curvature of the stability boundary, yielding higher accuracy. This LDT framework generalizes methods based on Mahalanobis distance and is extensible to non-Gaussian uncertainties. We validate our approach on test systems, demonstrating that the LDT estimates converge to Monte Carlo results in the rare-event regime where direct sampling becomes computationally prohibitive.

math.OC

Beyond identifiability: Learning causal representations with few environments and finite samples

We provide explicit, finite-sample guarantees for learning causal representations from data with a sublinear number of environments. Causal representation learning seeks to provide a rigourous foundation for the general representation learning problem by bridging causal models with latent factor models in order to learn interpretable representations with causal semantics. Despite a blossoming theory of identifiability in causal representation learning, estimation and finite-sample bounds are less well understood. We show that causal representations can be learned with only a logarithmic number of unknown, multi-node interventions, and that the intervention targets need not be carefully designed in advance. Through a careful perturbation analysis, we provide a new analysis of this problem that guarantees consistent recovery of (a) the latent causal graph, (b) the mixing matrix and representations, and (c) \emph{unknown} intervention targets.

stat.ML

GR-Gaussian: Graph-Based Radiative Gaussian Splatting for Sparse-View CT Reconstruction

3D Gaussian Splatting (3DGS) has emerged as a promising approach for CT reconstruction. However, existing methods rely on the average gradient magnitude of points within the view, often leading to severe needle-like artifacts under sparse-view conditions. To address this challenge, we propose GR-Gaussian, a graph-based 3D Gaussian Splatting framework that suppresses needle-like artifacts and improves reconstruction accuracy under sparse-view conditions. Our framework introduces two key innovations: (1) a Denoised Point Cloud Initialization Strategy that reduces initialization errors and accelerates convergence; and (2) a Pixel-Graph-Aware Gradient Strategy that refines gradient computation using graph-based density differences, improving splitting accuracy and density representation. Experiments on X-3D and real-world datasets validate the effectiveness of GR-Gaussian, achieving PSNR improvements of 0.67 dB and 0.92 dB, and SSIM gains of 0.011 and 0.021. These results highlight the applicability of GR-Gaussian for accurate CT reconstruction under challenging sparse-view conditions.

eess.IV