Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
The intrinsic alignments (IA) of galaxies, a key contaminant in weak lensing analyses, arise from correlations in galaxy shapes driven by tidal interactions and galaxy formation processes. Accurate IA modeling is essential for robust cosmological inference, but current approaches rely on perturbative methods that break down on nonlinear scales or on expensive simulations. We introduce IAEmu, a neural network-based emulator that predicts the galaxy position-position ( ), position-orientation ( ), and orientation-orientation ( ) correlation functions and their uncertainties using mock catalogs based on the halo occupation distribution (HOD) framework. Compared to simulations, IAEmu achieves ~3% average error for and ~5% for , while capturing the stochasticity of without overfitting. The emulator provides both aleatoric and epistemic uncertainties, helping identify regions where predictions may be less reliable. We also demonstrate generalization to non-HOD alignment signals by fitting to IllustrisTNG hydrodynamical simulation data. As a fully differentiable neural network, IAEmu enables $ $ speed-ups in mapping HOD parameters to correlation functions on GPUs, compared to CPU-based simulations. This acceleration facilitates inverse modeling via gradient-based sampling, making IAEmu a powerful surrogate model for galaxy bias and IA studies with direct applications to Stage IV weak lensing surveys.more » « lessFree, publicly-accessible full text available December 2, 2026
-
Free, publicly-accessible full text available August 1, 2026
-
Free, publicly-accessible full text available May 19, 2026
-
We investigate the problem of designing differentially private (DP), revenue- maximizing single item auction. Specifically, we consider broadly applicable settings in mechanism design where agents’ valuation distributions are indepen- dent, non-identical, and can be either bounded or unbounded. Our goal is to design such auctions with pure, i.e., (ω, 0) privacy in polynomial time.more » « lessFree, publicly-accessible full text available February 2, 2026
-
Free, publicly-accessible full text available September 2, 2026
An official website of the United States government

Full Text Available