Constraining dark matter halo profiles with symbolic regression

• URL: http://arxiv.org/abs/2511.23073v1
• Date: Fri, 28 Nov 2025 11:02:30 GMT
• Title: Constraining dark matter halo profiles with symbolic regression
• Abstract summary: We use Exhaustive Symbolic Regression to constrain halo density profiles directly from observations.<n>We test the approach on mock weak lensing excess surface density data of synthetic clusters with NFW profiles.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Dark matter haloes are typically characterised by radial density profiles with fixed forms motivated by simulations (e.g. NFW). However, simulation predictions depend on uncertain dark matter physics and baryonic modelling. Here, we present a method to constrain halo density profiles directly from observations using Exhaustive Symbolic Regression (ESR), a technique that searches the space of analytic expressions for the function that best balances accuracy and simplicity for a given dataset. We test the approach on mock weak lensing excess surface density (ESD) data of synthetic clusters with NFW profiles. Motivated by real data, we assign each ESD data point a constant fractional uncertainty and vary this uncertainty and the number of clusters to probe how data precision and sample size affect model selection. For fractional errors around 5%, ESR recovers the NFW profile even from samples as small as 20 clusters. At higher uncertainties representative of current surveys, simpler functions are favoured over NFW, though it remains competitive. This preference arises because weak lensing errors are smallest in the outskirts, causing the fits to be dominated by the outer profile. ESR therefore provides a robust, simulation-independent framework both for testing mass models and determining which features of a halo's density profile are genuinely constrained by the data.

Related papers

• Beyond Point Estimates: Benchmarking Uncertainty Quantification Methods on the AION-1 Astronomical Foundation Model [47.71489969727656]
  Conformalized Quantile Regression (CQR) delivers the best coverage in the bin with the poorest model predictions.<n>Only the Locally Valid and Discriminative (LVD) framework provides finite-sample emphlocal validity.
  arXiv  Detail & Related papers  (2026-06-05T18:29:19Z)
• Distance Is All You Need: Radial Dispersion for Uncertainty Estimation in Large Language Models [13.41454380481593]
  We introduce bfRadial Dispersion Score (RDS), a simple, parameter-free, fully model-agnostic uncertainty metric.<n>RDS naturally extends to per-sample scoring, enabling applications such as best-of-$N$ selection and confidence-based filtering.
  arXiv  Detail & Related papers  (2025-12-04T00:53:49Z)
• Data-Dependent Smoothing for Protein Discovery with Walk-Jump Sampling [7.278972126771497]
  Diffusion models have emerged as a powerful class of generative models by learning to iteratively reverse the noising process.<n>Their ability to generate high-quality samples has extended beyond high-dimensional image data to other complex domains such as proteins.<n>We introduce a Data-Dependent Smoothing Walk-Jump framework that employs kernel density estimation (KDE) as a preprocessing step to estimate the noise scale $sigma$ for each data point.<n>By incorporating local data geometry into the denoising process, our method accounts for the heterogeneous distribution of protein data.
  arXiv  Detail & Related papers  (2025-09-02T08:17:59Z)
• Robust Representation Consistency Model via Contrastive Denoising [83.47584074390842]
  randomized smoothing provides theoretical guarantees for certifying robustness against adversarial perturbations.<n> diffusion models have been successfully employed for randomized smoothing to purify noise-perturbed samples.<n>We reformulate the generative modeling task along the diffusion trajectories in pixel space as a discriminative task in the latent space.
  arXiv  Detail & Related papers  (2025-01-22T18:52:06Z)
• IBADR: an Iterative Bias-Aware Dataset Refinement Framework for Debiasing NLU models [52.03761198830643]
  We propose IBADR, an Iterative Bias-Aware dataset Refinement framework. We first train a shallow model to quantify the bias degree of samples in the pool. Then, we pair each sample with a bias indicator representing its bias degree, and use these extended samples to train a sample generator. In this way, this generator can effectively learn the correspondence relationship between bias indicators and samples.
  arXiv  Detail & Related papers  (2023-11-01T04:50:38Z)
• Self-Supervised Dataset Distillation for Transfer Learning [77.4714995131992]
  We propose a novel problem of distilling an unlabeled dataset into a set of small synthetic samples for efficient self-supervised learning (SSL) We first prove that a gradient of synthetic samples with respect to a SSL objective in naive bilevel optimization is textitbiased due to randomness originating from data augmentations or masking. We empirically validate the effectiveness of our method on various applications involving transfer learning.
  arXiv  Detail & Related papers  (2023-10-10T10:48:52Z)
• Anomaly Detection with Variance Stabilized Density Estimation [49.46356430493534]
  We present a variance-stabilized density estimation problem for maximizing the likelihood of the observed samples. To obtain a reliable anomaly detector, we introduce a spectral ensemble of autoregressive models for learning the variance-stabilized distribution. We have conducted an extensive benchmark with 52 datasets, demonstrating that our method leads to state-of-the-art results.
  arXiv  Detail & Related papers  (2023-06-01T11:52:58Z)
• On the Size and Approximation Error of Distilled Sets [57.61696480305911]
  We take a theoretical view on kernel ridge regression based methods of dataset distillation such as Kernel Inducing Points. We prove that a small set of instances exists in the original input space such that its solution in the RFF space coincides with the solution of the original data. A KRR solution can be generated using this distilled set of instances which gives an approximation towards the KRR solution optimized on the full input data.
  arXiv  Detail & Related papers  (2023-05-23T14:37:43Z)
• Beyond the Universal Law of Robustness: Sharper Laws for Random Features and Neural Tangent Kernels [14.186776881154127]
  This paper focuses on empirical risk minimization in two settings, namely, random features and the neural tangent kernel (NTK) We prove that, for random features, the model is not robust for any degree of over- parameterization, even when the necessary condition coming from the universal law of robustness is satisfied. Our results are corroborated by numerical evidence on both synthetic and standard prototypical datasets.
  arXiv  Detail & Related papers  (2023-02-03T09:58:31Z)
• ManiFlow: Implicitly Representing Manifolds with Normalizing Flows [145.9820993054072]
  Normalizing Flows (NFs) are flexible explicit generative models that have been shown to accurately model complex real-world data distributions. We propose an optimization objective that recovers the most likely point on the manifold given a sample from the perturbed distribution. Finally, we focus on 3D point clouds for which we utilize the explicit nature of NFs, i.e. surface normals extracted from the gradient of the log-likelihood and the log-likelihood itself.
  arXiv  Detail & Related papers  (2022-08-18T16:07:59Z)
• Towards Reflectivity profile inversion through Artificial Neural Networks [0.0]
  The goal of Specular Neutron and X-ray Reflectometry is to infer materials Scattering Length Density profiles from experimental reflectivity curves. This paper focuses on investigating an original approach to the ill-posed non-invertible problem which involves the use of Artificial Neural Networks.
  arXiv  Detail & Related papers  (2020-10-15T10:09:09Z)
• Why have a Unified Predictive Uncertainty? Disentangling it using Deep Split Ensembles [39.29536042476913]
  Understanding and quantifying uncertainty in black box Neural Networks (NNs) is critical when deployed in real-world settings such as healthcare. We propose a conceptually simple non-Bayesian approach, deep split ensemble, to disentangle the predictive uncertainties.
  arXiv  Detail & Related papers  (2020-09-25T19:15:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.