Exploring photometric redshifts as an optimization problem: an ensemble MCMC and simulated annealing-driven template-fitting approach

October 2016 • 2016MNRAS.461.3432S

Authors • Speagle, Joshua S. • Capak, Peter L. • Eisenstein, Daniel J. • Masters, Daniel C. • Steinhardt, Charles L.

Abstract • Using a 4D grid of ∼2 million model parameters (Δz = 0.005) adapted from Cosmological Origins Survey photometric redshift (photo-z) searches, we investigate the general properties of template-based photo-z likelihood surfaces. We find these surfaces are filled with numerous local minima and large degeneracies that generally confound simplistic gradient-descent optimization schemes. We combine ensemble Markov Chain Monte Carlo sampling with simulated annealing to robustly and efficiently explore these surfaces in approximately constant time. Using a mock catalogue of 384 662 objects, we show our approach samples ∼40 times more efficiently compared to a `brute-force' counterpart while maintaining similar levels of accuracy. Our results represent first steps towards designing template-fitting photo-z approaches limited mainly by memory constraints rather than computation time.

Links

• SIMBAD http://simbad.u-strasbg.fr/simbo.pl?bibcode=2016MNRAS.461.3432S
• PDF https://academic.oup.com/mnras/pdf-lookup/doi/10.1093/mnras/stw1503
• PREPRINT http://arxiv.org/abs/1508.02484
• DATA https://irsa.ipac.caltech.edu/bibdata/2016/S/2016MNRAS.461.3432S.html
• ELECTR https://doi.org/10.1093%2Fmnras%2Fstw1503