Portrait de Connor Stone n'est pas disponible

Connor Stone

Alumni

Publications

Pixelated Posterior Sampling of Point-spread Functions in Astronomical Images
Abstract We introduce a novel framework for upsampled point-spread function (PSF) modeling using pixel-level Bayesian inference. Accurate PS… (voir plus)F characterization is critical for precision measurements in many fields, including weak lensing, astrometry, and photometry. Our method defines the posterior distribution of the pixelized PSF model through the combination of an analytic Gaussian likelihood and a highly expressive generative diffusion model prior, trained on a library of Hubble Space Telescope effective PSF (ePSF) templates. Compared to traditional methods (parametric Moffat, ePSF template-based, and regularized likelihood), we demonstrate that our PSF models achieve orders-of-magnitude-higher likelihood and residuals consistent with noise, all while remaining visually realistic. Further, the method applies even for faint and heavily masked point sources, merely producing a broader posterior. By recovering a realistic, pixel-level posterior distribution, our technique enables the first meaningful propagation of detailed PSF morphological uncertainty in downstream analysis. An implementation of our posterior sampling procedure is available on GitHub.
Neglecting Dynamical Microlensing Can Bias Accretion Disk Size Measurements at the Population Level
Joshua Fagin
James Hung-Hsu Chan
Henry Best
Paras Sharma
Sophia Miskiewicz
Matthew O’Dowd
Simon Birrer
Microlensing of strongly lensed quasars probes unresolved accretion disks, but many inference methods use static magnification maps with fix… (voir plus)ed relative microlens positions. Using the GPU-accelerated simulator Microcaustics, we generate ten-year multiband light curves for three quadruply lensed quasar configurations. We compare dynamical microlensing with independent microlens motions against coherent bulk motion, and a microlens mass distribution against equal masses, keeping the velocity distribution of individual microlenses and mean mass fixed. We infer population disk sizes using ridge regression on the means and lower and upper scatters of ten variability and event metrics. We measure biases by applying models trained with simplified physics to simulations including both effects. Models trained on coherent motion interpret the additional variability from evolving caustics as smaller disks. For populations of 128 independent realizations, jointly inferred radii are consistently smaller by 6-28%. Microlens dynamics increase caustic-crossing rates pooled across all four macroimages by 5-15% and r-band high-magnification-event (HME) rates by 13-25%, while shortening median HME durations by 4-12%. Omitting the mass distribution produces configuration-dependent disk-size offsets from -12% to +5%. Including the mass distribution decreases caustic-crossing rates by 6-8% and HME rates by 6-12%. It also narrows the spread of ten-year averaged microlensing time-delay differences between macroimages by a median of 9-12% per system, while microlens dynamics have a smaller, image-pair-dependent effect. These results demonstrate the importance of microlens dynamics for population disk-size inference and motivate simulations that include dynamical microlensing and a microlens mass distribution.
Microcaustics: Fast GPU-Accelerated Dynamical Microlensing of Time-Dependent Extended Sources
Joshua Fagin
James Hung-Hsu Chan
Sophia Miskiewicz
Henry Best
Paras Sharma
Matthew O’Dowd
Simon Birrer
Gravitational microlensing probes unresolved quasar accretion disc structure and compact objects in lens galaxies and is an important system… (voir plus)atic in strong-lens time-delay cosmography. Most analyses use static microlensing map simulations because evolving individual microlenses and caustics is computationally prohibitive. We present Microcaustics, a GPU-accelerated Python package built on PyTorch for dynamical microlensing of time-dependent extended sources in strong gravitational lenses. It combines a local-exact/far-field deflection solver, source-directed lens-plane scouting with temporal reuse, and biquadratic inverse polygon mapping (IPM). GPU batching and fused Triton rasterization accelerate the calculation, while binary caustic labels track source-centred crossings. Across three simulated quadruply lensed quasar systems, our package generates a 10-year, 147-frame multiband light curve in an amortized median of 0.68 s (0.88 s with labels) on a consumer GPU with a median light-curve RMSE of 0.35 mmag, while recovering every reference source-centred caustic crossing. At comparable map accuracy, the batched throughput is 780 times higher than that of a recent CUDA IPM implementation and extrapolates to a speedup of millions relative to classic GPU-D. We demonstrate that our IPM converges as
Caustics: A Python Package for Accelerated Strong Gravitational Lensing Simulations
M. J. Yantovski-Barth
Landung Setiawan
Cordero Core
Charles Wilson
Gabriel Missael Barco
Neural Deprojection of Galaxy Stellar Mass Profiles
M. J. Yantovski-Barth
Hengyue Zhang
Martin Bureau
We introduce a neural approach to dynamical modeling of galaxies that replaces traditional imaging-based deprojections with a differentiable… (voir plus) mapping. Specifically, we train a neural network to translate Nuker profile parameters into analytically deprojectable Multi Gaussian Expansion components, enabling physically realistic stellar mass models without requiring optical observations. We integrate this model into SuperMAGE, a differentiable dynamical modelling pipeline for Bayesian inference of supermassive black hole masses. Applied to ALMA data, our approach finds results consistent with state-of-the-art models while extending applicability to dust-obscured and active galaxies where optical data analysis is challenging.
Mind the Information Gap: Unveiling Detailed Morphologies of z 0.5-1.0 Galaxies with SLACS Strong Lenses and Data-Driven Analysis
Pixellated Posterior Sampling of Point Spread Functions in Astronomical Images
We introduce a novel framework for upsampled Point Spread Function (PSF) modeling using pixel-level Bayesian inference. Accurate PSF charact… (voir plus)erization is critical for precision measurements in many fields including: weak lensing, astrometry, and photometry. Our method defines the posterior distribution of the pixelized PSF model through the combination of an analytic Gaussian likelihood and a highly expressive generative diffusion model prior, trained on a library of HST ePSF templates. Compared to traditional methods (parametric Moffat, ePSF template-based, and regularized likelihood), we demonstrate that our PSF models achieve orders of magnitude higher likelihood and residuals consistent with noise, all while remaining visually realistic. Further, the method applies even for faint and heavily masked point sources, merely producing a broader posterior. By recovering a realistic, pixel-level posterior distribution, our technique enables the first meaningful propagation of detailed PSF morphological uncertainty in downstream analysis. An implementation of our posterior sampling procedure is available on GitHub.
Blind Strong Gravitational Lensing Inversion: Joint Inference of Source and Lens Mass with Score-Based Models
caskade: building Pythonic scientific simulators
Echoes in the Noise: Posterior Samples of Faint Galaxy Surface Brightness Profiles with Score-based Likelihoods and Priors
Connor Bottrell
Laurence Perreaul-Levasseur
Examining the detailed structure of galaxy populations provides valuable insights into their formation and evolution mechanisms. Significant… (voir plus) barriers to such analysis are the nontrivial noise properties of real astronomical images and the point-spread function, which blurs structure. Here we present a framework which combines recent advances in score-based likelihood characterization and diffusion model priors to perform a Bayesian analysis of image deconvolution. The method, when applied to minimally processed Hubble Space Telescope data, recovers structures which have otherwise only become visible in next-generation James Webb Space Telescope imaging.
Tackling the Problem of Distributional Shifts: Correcting Misspecified, High-Dimensional Data-Driven Priors for Inverse Problems
Bayesian inference for inverse problems hinges critically on the choice of priors. In the absence of specific prior information, population-… (voir plus)level distributions can serve as effective priors for parameters of interest. With the advent of machine learning, the use of data-driven population-level distributions (encoded, e.g., in a trained deep neural network) as priors is emerging as an appealing alternative to simple parametric priors in a variety of inverse problems. However, in many astrophysical applications, it is often difficult or even impossible to acquire independent and identically distributed samples from the underlying data-generating process of interest to train these models. In these cases, corrupted data or a surrogate, e.g. a simulator, is often used to produce training samples, meaning that there is a risk of obtaining misspecified priors. This, in turn, can bias the inferred posteriors in ways that are difficult to quantify, which limits the potential applicability of these models in real-world scenarios. In this work, we propose addressing this issue by iteratively updating the population-level distributions by retraining the model with posterior samples from different sets of observations and showcase the potential of this method on the problem of background image reconstruction in strong gravitational lensing when score-based models are used as data-driven priors. We show that starting from a misspecified prior distribution, the updated distribution becomes progressively closer to the underlying population-level distribution, and the resulting posterior samples exhibit reduced bias after several updates.
PQMass: Probabilistic Assessment of the Quality of Generative Models Using Probability Mass Estimation
We propose a likelihood-free method for comparing two distributions given samples from each, with the goal of assessing the quality of gener… (voir plus)ative models. The proposed approach, PQMass, provides a statistically rigorous method for assessing the performance of a single generative model or the comparison of multiple competing models. PQMass divides the sample space into non-overlapping regions and applies chi-squared tests to the number of data samples that fall within each region, giving a