SearcharxivSearch

arXiv subjects

Hari Dahal

Publications and source records attributed to Hari Dahal.

5 recordsLinked to original sources

A Conditional-Distribution Framework for Validating Synthetic Multivariate Data

Statistical validation of synthetic multivariate data requires assessing whether a generator preserves the joint dependence structure of the target population without merely reproducing observed records. We develop a model-agnostic framework based on full conditional distributions. For each coordinate, we normalize the conditional probability assigned to the observed value by the largest conditional probability available in the same record context; averaging this quantity yields a one-sided MAP-alignment statistic that can be estimated using a conditional model fitted on held-out real data. The mathematical contribution is twofold: under strict positivity and compatibility, the complete normalized conditional profile identifies the joint distribution, and its integrated L1 difference defines a metric on finite-state generative processes; we also establish consistency and finite-sample concentration for the corresponding empirical estimators. Because high conditional alignment alone can arise from copying or concentration on conditional modes, we pair it with nearest-real similarity as a separate record-level novelty diagnostic. We evaluate the framework on NSHAP health and aging data, influenza B genomic surveillance, and 34 General Social Survey waves. In GSS, the Large Science Model matched the original-data control in mean conditional alignment while retaining substantial novelty, indicating preservation of conditional structure without row reuse. In influenza B, a Chow-Liu generator matched the control alignment but had almost no novelty, revealing near-reproduction of observed records. The framework therefore distinguishes three statistically different failure modes: loss of dependence, record reuse, and mode concentration, and provides a principled basis for validating synthetic health, surveillance, and population data.

stat.ME

Scalable Dynamic Optimal Transport via Distributed Linearized ADMM

In this paper, we address two fundamental challenges in the numerical solution of dynamic opti- mal transport (OT) problems. The first challenge arises when the initial and/or terminal densities approach zero and no positive lower bound is available. In this regime, conventional methods may become unstable or computationally inefficient, since the Lipschitz constant of the objective can scale like the reciprocal of the cube of the density. As a result, near-zero regions may lead to slow convergence or even divergence. The second challenge concerns the substantial memory cost of the dynamic formulation, whose discretization over fine spatial and temporal grids requires storing vari- ables across the entire space-time domain. This storage burden quickly becomes prohibitive as the grid is refined or the spatial dimension increases. To overcome the first difficulty, we reformulate the classical discretized dynamic OT problem so that the resulting objective admits an exact proximal mapping. When combined with a linearized alternating direction method of multipliers (LADMM), this reformulation yields an efficient and robust algorithm that remains stable even in challenging settings where the density may vanish. To reduce the memory burden, we further introduce a dis- tributed formulation in which the optimization variables are partitioned across multiple agents. This design substantially lowers the storage requirement for each agent and can also lead to computational acceleration. We validate the proposed framework through numerical experiments in one- and two- dimensional spatial settings under varying levels of difficulty. The results demonstrate the stability, robustness, and scalability of the proposed method in comparison with conventional approaches.

math.OC

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints

We give a damped proximal augmented Lagrangian method (DPALM) for solving problems with a weakly-convex objective and convex linear/nonlinear constraints. Instead of taking a full stepsize, DPALM adopts a damped dual stepsize to ensure the boundedness of dual iterates. We show that DPALM can produce a (near) $\vareps$-KKT point within $O(\vareps^{-2})$ outer iterations if each DPALM subproblem is solved to a proper accuracy. In addition, we establish overall iteration complexity of DPALM when the objective is either a regularized smooth function or in a regularized compositional form. For the former case, DPALM achieves the complexity of $\widetilde{\mathcal{O}}\left(\varepsilon^{-2.5} \right)$ to produce an $\varepsilon$-KKT point by applying an accelerated proximal gradient (APG) method to each DPALM subproblem. For the latter case, the complexity of DPALM is $\widetilde{\mathcal{O}}\left(\varepsilon^{-3} \right)$ to produce a near $\varepsilon$-KKT point by using an APG to solve a Moreau-envelope smoothed version of each subproblem. Our outer iteration complexity and the overall complexity either generalize existing best ones from unconstrained or linear-constrained problems to convex-constrained ones, or improve over the best-known results on solving the same-structured problems. Furthermore, numerical experiments on linearly/quadratically constrained non-convex quadratic programs and linear-constrained robust nonlinear least squares are conducted to demonstrate the empirical efficiency of the proposed DPALM over several state-of-the art methods.

math.OC

An Interactive 3D Visualization Tool for Large Scale Data Sets for Quantitative Atom Probe Tomography

Several visualization schemes have been developed for imaging materials at the atomic level through atom probe tomography. The main shortcoming of these tools is their inability to parallel process data using multi-core computing units to tackle the problem of larger data sets. This critically handicaps the ability to make a quantitative interpretation of spatial correlations in chemical composition, since a significant amount of the data is missed during subsequent analysis. In addition, since these visualization tools are not open-source software there is always a problem with developing a common language for the interpretation of data. In this contribution we present results of our work on using an open-source advanced interactive visualization software tool, which overcomes the difficulty of visualizing larger data sets by supporting parallel rendering on a graphical user interface or script user interface and permits quantitative analysis of atom probe tomography data in real time. This advancement allows materials scientists a codesign approach to making, measuring and modeling new and nanostructured materials by providing a direct feedback to the fabrication and designing of samples in real time.

cond-mat.mtrl-sci

Visualization of nano-plasmons in graphene

We study localized plasmons at the nanoscale (nano-plasmons) in graphene. The collective excitations of induced charge density modulations in graphene are drastically changed in the vicinity of a single impurity compared to graphene's bulk behavior. The dispersion of nano-plasmons depends on the number of electrons and the sign, strength and size of the impurity potential. Due to this rich parameter space the calculated dispersions are intrinsically multidimensional requiring an advanced visualization tool for their efficient analysis, which can be achieved with parallel rendering. To overcome the problem of analyzing thousands of very complex spatial patterns of nano-plasmonic modes, we take a combined visual and quantitative approach to investigate the excitations on the two-dimensional graphene lattice. Our visual and quantitative analysis shows that impurities trigger the formation of localized plasmonic excitations of various symmetries. We visually identify dipolar, quadrupolar and radial modes, and quantify the spatial distributions of induced charges.

cond-mat.mtrl-sci