Search NASASearch

SEARCH · Search NASA

Results for “sampling algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

Emulator-Based Bayesian Calibration of the CISNET Colorectal Cancer Models

Purpose To calibrate Cancer Intervention and Surveillance Modeling Network (CISNET)'s SimCRC, MISCAN-Colon, and CRC-SPIN simulation models of the natural history colorectal cancer (CRC) with an emulator-based Bayesian algorithm and internally validate the model-predicted outcomes to calibration targets.Methods We used Latin hypercube sampling to sample up to 50,000 parameter sets for each CISNET-CRC model and generated the corresponding outputs. We trained multilayer perceptron artificial neural networks (ANNs) as emulators using the input and output samples for each CISNET-CRC model. We selected ANN structures with corresponding hyperparameters (i.e., number of hidden layers, nodes, activation functions, epochs, and optimizer) that minimize the predicted mean square error on the validation sample. We implemented the ANN emulators in a probabilistic programming language and calibrated the input parameters with Hamiltonian Monte Carlo-based algorithms to obtain the joint posterior distributions of the CISNET-CRC models' parameters. We internally validated each calibrated emulator by comparing the model-predicted posterior outputs against the calibration targets.Results The optimal ANN for SimCRC had 4 hidden layers and 360 hidden nodes, MISCAN-Colon had 4 hidden layers and 114 hidden nodes, and CRC-SPIN had 1 hidden layer and 140 hidden nodes. The total time for training and calibrating the emulators was 7.3, 4.0, and 0.66 h for SimCRC, MISCAN-Colon, and CRC-SPIN, respectively. The mean of the model-predicted outputs fell within the 95% confidence intervals of the calibration targets in 98 of 110 for SimCRC, 65 of 93 for MISCAN, and 31 of 41 targets for CRC-SPIN.Conclusions Using ANN emulators is a practical solution to reduce the computational burden and complexity for Bayesian calibration of individual-level simulation models used for policy analysis, such as the CISNET CRC models. In this work, we present a step-by-step guide to constructing emulators for calibrating 3 realistic CRC individual-level models using a Bayesian approach.

artificial neural networks

Asymptotic consistency of the WSINDy algorithm in the limit of continuum data

In this work we study the asymptotic consistency of the weak-form sparse identification of nonlinear dynamics algorithm (WSINDy) in the identification of differential equations from noisy samples of solutions. We prove that the WSINDy estimator is unconditionally asymptotically consistent for a wide class of models that includes the Navier–Stokes, Kuramoto–Sivashinsky and Sine–Gordon equations. We thus provide a mathematically rigorous explanation for the observed robustness to noise of weak-form equation learning. Conversely, we also show that, in general, the WSINDy estimator is only conditionally asymptotically consistent, yielding discovery of spurious terms with probability one if the noise level exceeds a critical threshold σ c . We provide explicit bounds on σ c in the case of Gaussian white noise and we explicitly characterize the spurious terms that arise in the case of trigonometric and/or polynomial libraries. Furthermore, we show that, if the data is suitably denoised (a simple moving average filter is sufficient), then asymptotic consistency is recovered for models with locally-Lipschitz, polynomial-growth nonlinearities. Our results reveal important aspects of weak-form equation learning, which may be used to improve future algorithms. We demonstrate our findings numerically using the Lorenz system, the cubic oscillator, a viscous Burgers-growth model and a Kuramoto–Sivashinsky-type high-order PDE.

asymptotic consistency

Barium stars as tracers of s -process nucleosynthesis in AGB stars

Barium (Ba) stars help to verify asymptotic giant branch (AGB) star nucleosynthesis models since they experienced pollution from an AGB binary companion and thus their spectra carry the signatures of the slow neutron capture process (s process). For a large number (180) of Ba stars, we searched for AGB stellar models that match the observed abundance patterns. We aim to uncover any systematic deviations of the sample abundances from the predictions of the nucleosynthesis models. We employed three machine learning algorithms as classifiers: a Random Forest method, developed for this work, and the two classifiers used in our previous study. Compared to that work, we also expanded our observational sample with 11 Ba stars available in the supersolar metallicity range. We studied the statistical behaviour of the different s-process elements in the observational sample to investigate if the AGB models systematically under- or overpredict the abundances observed in the Ba stars and show the results in the form of violin plots of the residuals between spectroscopic abundances and model predictions. We inspected the correlations between the observed [Fe/H], the s-process elemental abundances, and the residuals. We employed the [Zr/Fe] and [Nb/Fe] abundances as a thermometer to constrain the operational temperature that rules the production of these elements in the sample stars, assuming a steady-state s process. We also investigated the mass distribution of the identified polluter AGB stars and the behaviour of the δ parameter, which describes the fraction of accreted AGB material relative to the Ba star envelope. We find a significant trend in the residuals that implies an underproduction of the elements just after the first s-process peak (Nb, Mo, and Ru) in the models relative to the observations. This may originate from a neutron-capture process (e.g. the intermediate neutron-capture process, i process) not yet included in the AGB models of metallicity from solar to roughly 1/5 solar, corresponding to the range of the Ba stars. Correlations are found between the residuals of these peculiar elements, suggesting a common origin for the deviations from the models. In addition, there is a weak metallicity dependence of the residuals of these elements. The s-process temperatures derived with the [Zr/Fe] – [Nb/Fe] thermometer have an unrealistic value for the majority of our stars. The most likely explanation is that at least a fraction of these elements are not produced in a steady-state s process, and instead may be due to processes not included in the AGB models. The mass distribution of the identified models confirms that our sample of Ba stars was polluted by low-mass AGB stars (< 4 M ⊙ ). Most of the matching AGB models require low accreted mass, but a few systems with high accreted mass are needed to explain the observations.

79 ASTRONOMY AND ASTROPHYSICS

Accelerating Traction Motor Optimization Design with AI Surrogate Models

The advancement of artificial intelligence systems enables the use of data-driven physics-based surrogate models to explore design spaces rapidly and deeply for engineering projects. This work presents a surrogate model workflow that accelerates electric traction motor design optimization by replacing finite element analysis (FEA) with an artificial neural network (ANN) and using this model in a genetic algorithm for design optimization. A baseline interior permanent-magnet motor is parameterized and sampled to generate FEA-labeled training data, after which a feed-forward ANN predicts key outputs (e.g., loss components and weight). The validated surrogate enables genetic-algorithm optimization and deep search over the design space without new FEA runs, producing Pareto-optimal trade-offs between weight and losses and set of optimized designs for rapid downselection of manufacturable motor designs.

Ribeiro, Pedro [ORNL] (ORCID:0009000921026641)

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING

Virtual refrigerant charge sensing algorithm for residential CO₂ heat pumps

Natural refrigerants are increasingly adopted in next-generation heat pump systems, among which CO₂ heat pumps have attracted significant attention. However, due to their high operating pressures, the leakage risk is higher, resulting in undercharge conditions and degraded heat pump performance. Thus, developing an accurate refrigerant charge level detection technique is necessary to guarantee safe and efficient operation. Although virtual refrigerant charge (VRC) level calculation algorithms for CO₂ heat pumps exist, they typically rely on empirically selected features without a systematic selection framework, leading to multicollinearity and potential overfitting, which limit their prediction accuracy and generalizability. To address these issues, this study proposes a VRC algorithm framework with a systematic feature selection method that identifies physically meaningful and statistically significant features, and is applied using a residential CO₂ heat pump as a case study. The method is extended from previous work on conventional refrigerants to account for charge behavior in CO₂ gas coolers. The selected features include gas cooler outlet density, evaporator pressure, and superheat temperature. The results demonstrate that the proposed feature selection method significantly improves prediction accuracy compared to existing VRC approaches. A relatively small training dataset (∼30 samples) is sufficient for feature identification and model development. The developed algorithm achieves less than 3% prediction error under both undercharge and overcharge conditions, representing reductions of 46.7% and 35.3% compared to two recent reference VRC algorithms for transcritical CO₂ heat pumps reported in the literature. The proposed algorithm and feature selection method enhance leakage detection capability, facilitate the deployment of CO₂ heat pump systems, and contribute to reduced energy waste and maintenance costs.

Guo, Fangzhou [Lawrence Berkeley National Laborato

Equipartition and the Temperature of Maximum Density of TIP4P/2005 Water

Here, we simulate TIP4P/2005 water in the temperature range of 257 to 318 K with time-steps δ = 0.25, 0.50, 1.00, 2.00, and 4.00 fs. The density–temperature behavior obtained using 0.25 or 0.50 fs is in excellent agreement with each other but differs from those obtained using time steps that have been shown earlier to lead to a breakdown of equipartition. For δt = 0.25 or 0.50 fs, the temperature of maximum density (TMD) is 277.15 K and the density value is in close agreement with experiments. For δt = 1.00 fs, the TMD is 277.15 K, but the density value is shifted higher. For the other time steps considered here, the TMD is shifted to progressively lower values for longer time steps, a trend that holds for different thermostat/barostat combinations. Enhancing the water–water dispersion interaction, as has been recommended for simulating disordered proteins in TIP4P/2005, degrades the description of the liquid–vapor phase envelope. We present a simple physically transparent explanation that highlights the separation of the time scales between translational and rotational motion. We also develop a metric, χ, that we term the equipartition anomaly, to detect equipartition violations in simulations that include molecules that are treated as rigid objects. Calculating χ is shown to be straightforward and sensitive to equipartition violations. A key takeaway from this study is that using sufficiently short time steps (≤0.5 fs) to preserve equipartition is essential for obtaining meaningful liquid water properties and for producing reliable simulation data, as correct ensemble sampling is fundamental to ensure reproducibility across codes and simulation algorithms.

Asthagiri, Dilipkumar N. [Oak Ridge National Labor

Boosted decision tree reweighting of simulated neutrino interactions for O ( 1 ) GeV neutrino cross-section measurements

This paper illustrates a generic method for multidimensional reweighting of O ( 1 ) GeV neutrino interaction Monte Carlo samples. The reweighting is based on a boosted decision tree algorithm trained on high-dimensional space in detector final-state observables. This enables one generator’s events to be reweighted so that its reconstructed particle content and kinematics distributions, as well as detector efficiency, match those of a target model. The approach establishes an efficient way to reuse legacy Monte Carlo data, avoiding regeneration. As an example, we test its use in a measurement of transverse kinematic imbalance of the μ - and proton in charged-current quasielastic like ν μ events from the MINERvA experiment.

Lin, Z. [Rochester U.] (ORCID:0009000188903698)

Tusqh

SAND2025-00675O Tusqh is a software tool that generates cubical meshes in 2D and 3D and computes the homology of these meshes using persistent homology. It includes a grid cell in the output if its volume-fraction is above a selectable threshold, estimated by sampling points within the cell. Tusqh incorporates anti-aliasing algorithms to mitigate grid orientation and scale effects. It is designed for creating finite element meshes for simulations and can be used in various applications such as heat diffusion, mechanical simulations, and computer graphics rendering. The software outputs meshes in an open format compatible with downstream software. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

SciDAC

Evaluating Limits of Machine Learning-Assisted Raman Spectroscopy in Classification of Biological Samples

Machine learning (ML)-assisted Raman spectroscopy has become a powerful analytical tool for the classification and identification of analytes; however, technical challenges impacting its detection accuracy have not been thoroughly investigated. This study explores experimental factors affecting classification performance. Among the evaluated ML models, ML algorithms show minimal impact on classification accuracy. Instead, experimental factors, including spectral similarity between tested samples and data quality, dominate detection performance. Increases in spectral noise and spectral similarity significantly reduce classification accuracy. In well-controlled samples with low experimental noise, ML-assisted Raman spectroscopy can discriminate lipid mixtures with a composition difference of 1.85 mol %. To assess the effect of biological heterogeneity, we analyzed single-cell Raman spectra from Saccharomyces cerevisiae strains carrying single, double, or triple gene mutations. Intrinsic cell-to-cell variability introduced substantial spectral differences, severely reducing the accuracy of multiclass classification of these genetically similar strains at the single-cell level. Averaging Raman spectra across multiple cells improved classification accuracy by reducing this spectral variability. We also assess the effectiveness of transfer learning across different Raman spectrometers, specifically by applying an ML model trained on one instrument to another Raman spectrometer. Transfer learning can be improved with proper instrument calibration, highlighting the importance of instrument standardization. Overall, our results demonstrate that data quality and spectral similarity are the primary bottlenecks in ML-assisted Raman spectroscopy. Careful attention to sample preparation, data acquisition, measurement conditions, and instrument calibration is critical to achieving robust and reliable classification performance.

Fungi

Constraints on the normal branch of DGP gravity from SPT galaxy clusters with DES and HST weak-lensing mass calibration and from P l a n c k PR4 CMB anisotropies

We present constraints on the normal branch of the Dvali-Gabadadze-Porrati (nDGP) braneworld gravity model from the abundance of massive galaxy clusters. On scales below the nDGP crossover scale r c , the nDGP model features an effective gravitylike fifth force that alters the growth of structure, leading to an enhancement of the halo mass function (HMF) on cluster scales. The enhanced cluster abundance allows for constraints on the nDGP model using cluster samples. We employ the South Pole Telescope (SPT) cluster sample, selected through the thermal Sunyaev-Zel’dovich effect with the SPT and with mass calibration using weak-lensing data from the Dark Energy Survey (DES) and the Hubble Space Telescope (HST). The cluster sample contains 1,005 clusters with redshifts 0.25 < z < 1.78 , which are confirmed with the multicomponent matched filter algorithm using optical and near-infrared data. Weak-lensing data from DES and HST enable a robust mass measurement of the cluster sample. We use DES Year 3 data for 688 clusters with redshifts z < 0.95 , and HST data for 39 clusters with redshifts 0.6 < z < 1.7 . We account for the enhancement in the HMF through a semi-analytic correction factor to the standard cosmology HMF derived from the spherical collapse model in the nDGP model. We then further calibrate this model using N -body simulations. In addition, for the first time, we analyze the primary CMB temperature and polarization anisotropy measurements from Planck PR4 within the nDGP model. We obtain a competitive constraint from the joint analysis of the SPT cluster abundance with the Planck PR4 data, and report an upper bound of 1 / H 0 r c < 1.41 at 95% when assuming a cosmology with massive neutrinos.

Vogt, S. M.L. [Munich U. Observ.; LMU Munich (main

Simulation driven adaptive sampling for neutron-diffraction based strain mapping of additively manufactured parts

Neutron diffraction based strain mapping is a useful technique for measuring residual strains in additively manufactured (AM) metal parts. The measurement is traditionally done by scanning the sample in a point-wise raster pattern to extract the strain at each position. Since the overall scan can span several hours, adaptive sampling approaches using Bayesian optimization based on Gaussian process (BO-GP) regression have been introduced—demonstrating that even with a fraction of the typically made measurements the dominant strain patterns in the sample can be reconstructed. However, the parameters of the BO-GP algorithm have to be carefully chosen for best performance, and the movement time between arbitrary points can offset the time savings from a reduced number of measurement locations. In this paper, we propose algorithms to refine the BO-GP based methods by using simulations of strain patterns in AM parts based on the materials and the process used to print them. We demonstrate that the simulated strain patterns can be used to help choose better parameters for the BO-GP based framework—leading to low reconstruction error for the final strain pattern. Furthermore, we show that the strain mapping experiment can be initialized with a sampling pattern learnt from the simulation data and ordered to reduce movement time, dramatically enabling reduction in the overall time required to run the baseline BO-GP method.

Gaussian process regression

AutoEMX v1.

The invention consists in the full automation of compositional analysis of inorganic powder samples by scanning electron microscopy (SEM) with energy-dispersive X-ray spectroscopy (EDS). The measurements and analysis are controlled via python-based software, Auto-SEMEDS. Auto-SEMEDS fully automates the SEM-EDS measurements, and analyses the collected data via the use of machine-learning (ML) algorithms, which have never been used before for such scope. Auto-SEMEDS enables the identification in fully-automated fashion of the individual material phases present in a powder sample. Similar technologies, such as commercial SEM-EDS software, can automatically classify particles based on their composition, but they have significant limitations. These solutions typically provide inaccurate composition measurements and struggle to identify single phases in lab samples, where phases are often closely intermixed. In contrast, Auto-SEMEDS achieves unprecedented accuracy in composition measurements of powder samples, and furthermore leverages machine learning algorithms to effectively discern intermixed phases. Notably, while previous studies have demonstrated accurate measurements on individual particles, Auto-SEMEDS stands out by successfully analyzing mixture of different phases, a capability that has not been reported in the literature until now.

Giunto, Andrea [Lawrence Berkeley National Laborat

Models and Algorithms for Equilibrium Analysis of Mixed-Material Nucleic Acid Systems

Dynamic programming algorithms within the NUPACK software suite enable analysis of equilibrium base-pairing properties for complex and test tube ensembles containing arbitrary numbers of interacting nucleic acid strands. Currently, calculations are limited to single-material systems that are either all-RNA or all-DNA. Here, to enable analysis of mixed-material systems that are critical for modern applications in vitro, in situ, and in vivo, we develop physical models and dynamic programming algorithms that allow the material of the system to be specified at nucleotide resolution. Free energy parameter sets are constructed for both RNA/DNA and RNA/2'OMe-RNA mixed-material systems by combining available empirical mixed-material parameters with single-material parameter sets to enable treatment of the full complex and test tube ensembles. New dynamic programming recursions account for the material of each nucleotide throughout the recursive process. For a complex with N nucleotides, the mixed-material dynamic programming algorithms maintain the O(N 3 ) time complexity of the single-material algorithms, enabling efficient calculation of diverse physical quantities over complex and test tube ensembles (e.g., complex partition function, equilibrium complex concentrations, equilibrium base-pairing probabilities, minimum free energy secondary structure(s), and Boltzmann-sampled secondary structures) at a cost increase of roughly 2.0-3.5×. The results of existing single-material algorithms are exactly reproduced when applying the new mixed-material algorithms to single-material systems. Accuracy is significantly enhanced using mixed-material models and algorithms to predict RNA/DNA and RNA/2'OMe-RNA duplex melting temperatures from the experimental literature as well as RNA/DNA melt profiles from new experiments. In conclusion, mixed-material analyses can be performed online using the NUPACK web app (www.nupack.org) or locally using the NUPACK Python module.

2′OMe-RNA

X-ray nano-holotomography reconstruction with simultaneous probe retrieval

In conventional tomographic reconstruction, the pre-processing step includes flat-field correction, where each sample projection on the detector is divided by a reference image taken without the sample. When using coherent X-rays as a probe, this approach overlooks the phase component of the illumination field (probe), leading to artifacts in phase-retrieved projection images, which are then propagated to the reconstructed 3D sample representation. The problem intensifies in nano-holotomography with focusing optics, which, due to various imperfections creates high-frequency components in the probe function. Here, we present a new iterative reconstruction scheme for holotomography, simultaneously retrieving the complex-valued probe function. Implemented on GPUs, this algorithm results in 3D reconstruction resolving twice thinner layers in a 3D ALD standard sample measured using nano-holotomography.

Nikitin, Viktor

Reweighting simulated events using machine-learning techniques in the CMS experiment

Data analyses in particle physics rely on an accurate simulation of particle collisions and a detailed simulation of detector effects to extract physics knowledge from the recorded data. Event generators together with a GEANT -based simulation of the detectors are used to produce large samples of simulated events for analysis by the LHC experiments. These simulations come at a high computational cost, where the detector simulation and reconstruction algorithms have the largest CPU demands. This article describes how machine-learning (ML) techniques are used to reweight simulated samples obtained with a given set of parameters to samples with different parameters or samples obtained from entirely different simulation programs. The ML reweighting method avoids the need for simulating the detector response multiple times by incorporating the relevant information in a single sample through event weights. Results are presented for reweighting to model variations and higher-order calculations in simulated top quark pair production at the LHC. This ML-based reweighting is an important element of the future computing model of the CMS experiment and will facilitate precision measurements at the High-Luminosity LHC.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND

AI-Batt (Autonomous Identification of Battery Life Models) [SWR 21-36]

Autonomous Identification of Battery Life Models (AI-Batt) AI-Batt is a MATLAB code base for developing lifetime models for batteries from accelerated aging data. The code base provides many functions for processing, visualizing, and modeling battery aging data, making the data processing, exploration, and modeling workflow substantially faster. These tools are tailored for working with battery aging data sets, which usually consist of many separate time-series for each cell, with many test conditions and possible replicates at each condition, which makes it difficult to simply process or visualize the data set. Complex modeling tasks, such as cross-validation, sensitivity analysis, and uncertainty quantification have been implemented to enable thorough statistical investigation of model predictions. Additionally, several machine-learning algorithms are implemented to autonomously identify suitable models via symbolic regression. Data processing functions automatically cast data from the struct data type, which is commonly used to store experimental data, but is not an acceptable input for most algorithms, to the table data type, which can be easily used as input to any optimization algorithm. Also, the data can be separated into time-invariant and time-variant data tables, which is helpful for exploring the data set as well as developing separate models for time-variant and time-invariant aging mechanisms. For example, in aging tests with constant temperature, temperature is a time-invariant experimental condition. Visualization tools enable plotting of data, model fits, and model simulations possible with single-line function calls, empowering data exploration of complex data sets with both time-varying and time-invariant trends. Plots can be automatically generated for the whole data set, or separated by data group (groups of test replicates) or individual data series. Data points or data series can be automatically colored by the value of a variable with a variety of color maps, and model predictions can also be colored by the value of a fit statistic. Comparisons between data sets and the predictions/simulations of different models on the same data set can be easily plotted as well. Distributions of parameter values from bootstrap resampling can be plotted to visualize the reliability of parameter estimation, or determine any correlations between parameters. Modeling tools handle the complex task of creating and parsing symbolic equations for modeling battery lifetime. Equations are parsed to grab relevant data variables, parameter values, or specified sub-models for input into optimization, evaluation, or simulation functions. Models can be optimized locally (one set of parameters for each data series), bi-level (some parameters shared across the data set), or globally (single set of parameters for all data). Functions implementing symbolic regression algorithms help users to discover effective model equations, even in poorly sampled, high-dimensional data.

Smith, Kandler [National Renewable Energy Lab. (NR

Miscentring of optical galaxy clusters based on Sunyaev–Zeldovich counterparts

ABSTRACT The ‘miscentring effect’, i.e. the offset between a galaxy cluster’s optically defined centre and the centre of its gravitational potential, is a significant systematic effect on brightest cluster galaxy (BCG) studies and cluster lensing analyses. We perform a cross-match between the optical cluster catalogue from the Hyper Suprime-Cam (HSC) Survey S19A Data Release and the Sunyaev–Zeldovich cluster catalogue from Data Release 5 of the Atacama Cosmology Telescope (ACT). We obtain a sample of 186 clusters in common in the redshift range $0.1 \le z \le 1.4$ over an area of 469 deg$^2$. By modelling the distribution of centring offsets in this fiducial sample, we find a miscentred fraction (corresponding to clusters offset by more than 330 kpc) of ∼25 per cent, a value consistent with previous miscentring studies. We examine the image of each miscentred cluster in our sample and identify one of several reasons to explain the miscentring. Some clusters show significant miscentring for astrophysical reasons, i.e. ongoing cluster mergers. Others are miscentred due to non-astrophysical, systematic effects in the HSC data or the cluster-finding algorithm. After removing all clusters with clear, non-astrophysical causes of miscentring from the sample, we find a considerably smaller miscentred fraction, $\sim 10~\,\rm per\,cent$. We show that the gravitational lensing signal within 1 Mpc of miscentred clusters is considerably smaller than that of well-centred clusters, and we suggest that the ACT SZ centres are a better estimate of the true cluster potential centroid.

Ding, Jupiter (ORCID:0000000296119799)