Papers › A flexible method for estimating luminosity functions via Kernel Density Estimation
A flexible method for estimating luminosity functions via Kernel Density Estimation
Zunli Yuan, Matt J. Jarvis, Jiancheng Wang
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We propose a flexible method for estimating luminosity functions (LFs) based on kernel density estimation (KDE), the most popular nonparametric density estimation approach developed in modern statistics, to overcome issues surrounding binning of LFs. One challenge in applying KDE to LFs is how to treat the boundary bias problem, since astronomical surveys usually obtain truncated samples predominantly due to the flux-density limits of surveys. We use two solutions, the transformation KDE method (ϕ̂ₜ), and the transformation-reflection KDE method (ϕ̂ₜᵣ) to reduce the boundary bias. We develop a new likelihood cross-validation criterion for selecting optimal bandwidths, based on which, the posterior probability distribution of bandwidth and transformation parameters for ϕ̂ₜ and ϕ̂ₜᵣ are derived within a Markov chain Monte Carlo (MCMC) sampling procedure. The simulation result shows that ϕ̂ₜ and ϕ̂ₜᵣ perform better than the traditional binned method, especially in the sparse data regime around the flux-limit of a survey or at the bright-end of the LF. To further improve the performance of our KDE methods, we develop the transformation-reflection adaptive KDE approach (ϕ̂ₜᵣₐ). Monte Carlo simulations suggest that it has a good stability and reliability in performance, and is around an order of magnitude more accurate than using the binned method. By applying our adaptive KDE method to a quasar sample, we find that it achieves estimates comparable to the rigorous determination by a previous work, while making far fewer assumptions about the LF. The KDE method we develop has the advantages of both parametric and non-parametric methods.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections