Papers for

cosmology data analysts

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Weak lensing machine learning challenge improves cosmology estimates

FAIR Universe Weak Lensing ML Uncertainty Challenge: Dataset and Cosmological Inference Competition

Abstract: Weak gravitational lensing is a powerful cosmological probe that enables direct mapping of the matter distribution and precise constraints on the fundamental parameters governing structure formation in the universe. In recent years, machine learning has shown strong potential for extracting cosmological information from weak-lensing data beyond traditional summary statistics. However, progress has been limited by the lack of standardized benchmarks that capture the complexity of the dataset, simulator imperfections, and various systematic biases encountered in realistic analyses. To address this gap, we present the FAIR Universe Weak Lensing Machine Learning Uncertainty Challenge, one of the NeurIPS 2025 competitions, as a benchmark dataset and evaluation study. Our dataset reflects realistic weak-lensing observations, incorporating multiple systematic biases, and thereby providing a controlled testbed for robust cosmological inference under uncertainties. We summarize the main methodological advances developed by the winners of our challenge, including data augmentation with conditional optimal transport, an AI-agent-driven approach for parameter inference, ensemble learning, Vision Transformer-based architectures, and physics-informed feature integration. By unifying the benchmark dataset and the winning solutions, this work provides a community resource for developing and evaluating machine learning methods for weak lensing cosmology and, more broadly, for scientific inference under systematic uncertainties.

Fri 6 NovArtificial IntelligenceComputer Vision and Pattern RecognitionMachine Learning
The gist
Weak gravitational lensing lets scientists see how matter is spread across the universe, helping them learn about how the universe grows and changes. The authors created a special challenge with realistic data that includes common errors scientists face, so machine learning approaches can be tested fairly. They also collected the best methods from the challenge, which include new ways to handle data and make predictions about the cosmos. This work gives the community tools and data to better use machine learning for understanding the universe despite uncertainties.
Open → 2611.10228v1

Markov chains produce work only with non-Gaussian models in Bayesian inference

Thermodynamic Cyclic Processes with Markov Samplers in Bayesian Inference

Abstract: The concept of Markov chain Monte Carlo (MCMC) cycles, an analogy to cyclic processes in heat engines, is presented in order to examine Bayesian inference problems. In this effort, we develop adaptive ensemble schedulers that allow the tuning of external parameters of a Bayesian canonical ensemble during an MCMC run, realising the MCMC cycles in practice. We run these cycles on different statistical models. As a fundamental insight, we find (both theoretically and in practice) that such systems can produce a non-zero net work output if and only if the considered model is non-Gaussian. As such, they may serve as a measure of non-Gaussianity in Bayesian inference, which we test on an example from supernova cosmology.

Mon 7 SeptArtificial Intelligence
The gist
The paper looks at Bayesian inference—the process computers use to make decisions based on data—and draws an analogy to heat engines that do cycles. The authors develop a way to run Markov chain Monte Carlo cycles by tuning parameters during sampling. They find that these cycles can produce a measurable effect, or "work," only when the statistical model is non-Gaussian, meaning it doesn't follow the simple bell curve. This discovery offers a way to tell if data or models are non-Gaussian, tested on a cosmology example with supernova data.
Open → 2609.07660v1