AGAlex Arkady Gorodetsky

Alex Arkady Gorodetsky

*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


Alex Arkady Gorodetsky has a total of 59 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Optimal experimental design for calibrating a model for the response of a Hall thruster plume to facility pressure

    by Madison Allen, Joshua Eckels, Alex Gorodetsky, Benjamin Jorns

    An Optimal Experimental Design (OED) algorithm is implemented on a reduced fidelity model for the response of the plume of a Hall effect thruster to background neutral pressure with the goal of increasing the efficiency of calibrating the model against experimental data. The investigated plume model is based on a semi-analytical formulation that accounts for collisional effects. A previously published dataset from the SPT-100 Hall thruster of current density and ion energy as a function of position and background pressure is employed as a test case. Both myopic and myopic with batches OED methods are explored for identifying subsets of measurements from the dataset for rapid model calibration. It is found that both methods are able to achieve the same confidence in model parameter inference as a calibration performed with the full dataset but with approximately 60% of the measurements. This result is discussed in the context of best practices for designing future experimental campaigns to evaluate facility effects in Hall thrusters.

  • Open Access

    Incremental hierarchical Tucker decomposition

    by Doruk Aksoy, Alex Arkady Gorodetsky

  • Open Access

    Diffusion-based probabilistic field inversion in 1-D Hall thruster simulations

    by Thomas A Marks, Alex A Gorodetsky

    A diffusion model is used to probabilistically reconstruct the full one-dimensional state of a Hall thruster from partial, uncertain observations. The model is trained on a dataset of one-dimensional simulations of an SPT-100 thruster and sampled by iterative denoising, guided by sparse measurements. It is evaluated as a forward surrogate, where it correctly predicts the plasma density, electron temperature, and ion velocity with low uncertainty when conditioned on an input anomalous collision frequency profile. The model also matches ground-truth results from Markov chain Monte Carlo (MCMC) when conditioned on observation of the ion velocity. It additionally solves probabilistic inverse problems on real and simulated experimental data, with results that approach or match existing semi-analytic methods in quality, flexibility, and robustness to noise and missing data fields. Ablations are performed with respect to the amount of data required, the size of the model, the form of the loss function, and the number of steps taken during sampling. These highlight the large impact of dataset size on the quality of the model. Comparisons of the cost of diffusion-based inference to that of MCMC demonstrate the method’s potential utility in settings requiring repeated inference, including in digital twins and model predictive control.

  • Optimally Balancing Exploration and Exploitation to Automate Multifidelity Statistical Estimation

    by Thomas Dixon, Alex A. Gorodetsky, John Jakeman, Akil Narayan, Yiming Xu

    Multifidelity methods that use an ensemble of models to compute a Monte Carlo estimator of the expectation of a high-fidelity model can significantly reduce computational costs compared to single-model approaches. These methods use oracle statistics, specifically the covariance between models, to optimally allocate samples to each model in the ensemble. However, in practice, the oracle statistics are estimated using additional model evaluations, whose computational cost and induced error are typically ignored. To address this issue, this paper proposes an adaptive algorithm to optimally balance the resources between oracle statistics estimation and final multifidelity estimator construction, leveraging ideas from multilevel best linear unbiased estimators in Schaden and Ullmann ( SIAM/ASA J. Uncertain. Quantif., 8 (2020), pp. 601–635) and a bandit-learning procedure in Xu et al. ( SIAM J. Sci. Comput., 44 (2022), pp. A150–A175). Under mild assumptions, we demonstrate that the multifidelity estimator produced by the proposed algorithm exhibits mean-squared error commensurate with that of the best linear unbiased estimator under the optimal allocation computed with oracle statistics. Our theoretical findings are supported by detailed numerical experiments, including a parametric elliptic PDE and an ice-sheet mass-change modeling problem.

  • Accelerating Bayesian Inference via Multifidelity Transport Map Coupling

    by Sanjan C. Muchandimath, Joaquim R. R. A. Martins, Alex A. Gorodetsky

    Mathematical models in computational physics involve uncertain parameters that impact prediction accuracy. In turbulence modeling, this challenge is especially significant: Reynolds-averaged Navier–Stokes models, such as the Spalart–Allmaras model, are widely used for their speed and robustness but often suffer from inaccuracies and associated uncertainties due to imperfect model parameters. Reliable quantification of these uncertainties is becoming increasingly important in aircraft certification by analysis, where predictive credibility is critical. Bayesian inference provides a framework to estimate these parameters and quantify output uncertainty, but traditional methods are prohibitively expensive, especially when relying on high-fidelity simulations. We address the challenge of expensive Bayesian parameter estimation by developing a multifidelity framework that combines Markov chain Monte Carlo methods with multilevel Monte Carlo (MLMC) estimators to efficiently solve inverse problems. The MLMC approach requires correlated samples across different fidelity levels, achieved through a novel transport-map-based coupling algorithm. We demonstrate a 50% reduction in inference cost compared to single-fidelity methods on the challenging NACA 0012 airfoil at high angles of attack near stall while delivering realistic uncertainty bounds for model predictions in complex separated flow regimes. These results demonstrate that multifidelity approaches significantly improve turbulence parameter calibration, paving the way for more accurate and efficient aircraft certification by analysis.

  • Open Access

    Multigroup Thermal Radiation Transport with Tensor Trains

    by Aditya S. Deshpande, Patrick D. Mullen, Alex A. Gorodetsky, Joshua C. Dolence, Chad D. Meyer, Jonah M. Miller, Luke F. Roberts

    We investigate the application of tensor-train (TT) algorithms to multigroup thermal radiation transport (i.e., photon radiation transport). The TT framework enables simulations at discretizations that might otherwise be computationally infeasible on conventional hardware. We show that solutions to certain multigroup problems possess an intrinsic low-rank structure, which the TT representation leverages effectively. This enables us to solve problems where the discretized solution size exceeds a trillion parameters on a single node. The solver is evaluated on a range of test problems with varying levels of complexity, consistently achieving compression factors greater than 100× and speedups exceeding 2×. We also investigate alternative TT topologies by analyzing the low-rank structure of the merged spatio-spectral core to assess the potential for greater compression. This analysis suggests that compression gains could increase by factors as large as 7. Our results indicate that the low-rank structure of the merged spatio-spectral core captures the spatio-spectral complexity of the solution, largely driven by the opacity structure of the medium. Beyond identifying opportunities for improved compression, this analysis highlights the types of errors that may arise in angle-integrated quantities when exploiting this low-rank structure.


  • Open Access

    ARCH3D: A foundation model for global genome architecture

    by Nicholas Galioto, Cooper Stansbury, Alex Arkady Gorodetsky, Indika Rajapakse

    Biological foundation models are transforming scientific discovery by creating information-rich representations that enable inference in low-data settings. Progress on these models has mainly been achieved by increasing input contextual information, e.g., base pairs or genes. Most work, however, focuses on DNA, RNA, and protein, leaving genome architecture, a fundamental component regulating processes like the cell cycle and cell-fate determination, underexplored. Here, we introduce ARCH3D: a foundation model for global genome architecture. ARCH3D uses a novel masked locus modeling task that increases input contextual information to include genome-wide contact profiles of loci spread across the entirety of the genome. We demonstrate this strategy captures global genome structure by showing ARCH3D embeddings preserve genomic spatial structure, reconstruct interchromosomal interactions under extreme sparsity, and enable identification of multi-way interactions. Ultimately, ARCH3D provides a potential structural foundation for building the virtual genome, an artificial intelligence-based model capable of simulating genome behavior and dynamics.


  • Open Access

    Low-rank Bayesian matrix completion via geodesic Hamiltonian Monte Carlo on Stiefel manifolds

    by Tiangang Cui, Alex A. Gorodetsky

    We present a new sampling-based approach for enabling efficient computation of low-rank Bayesian matrix completion and quantifying the associated uncertainty. First, we design a new prior model based on the singular-value-decomposition (SVD) parametrization of low-rank matrices. Our prior is analogous to the seminal nuclear-norm regularization used in non-Bayesian setting and enforces orthogonality in the factor matrices by constraining them to Stiefel manifolds. Then, we design a geodesic Hamiltonian Monte Carlo (-within-Gibbs) algorithm for generating posterior samples of the SVD factor matrices. We demonstrate that our approach resolves the sampling difficulties encountered by standard Gibbs samplers for the common two-matrix factorization used in matrix completion. More importantly, the geodesic Hamiltonian sampler allows for sampling in cases with more general likelihoods than the typical Gaussian likelihood and Gaussian prior assumptions adopted in most of the existing Bayesian matrix completion literature. We demonstrate applications of our approach to fit the categorical data of a mice protein dataset and the MovieLens recommendation problem. Numerical examples demonstrate superior sampling performance, including better mixing and faster convergence to a stationary distribution. Moreover, they demonstrate improved accuracy on the two real-world benchmark problems we considered.