Search

Highly magnified lensed galaxies allow us to probe the morphological and spectroscopic properties of high-redshift stellar systems in great detail. However, such objects are rare, and there are only a handful of lensed galaxies that are bright enough for a high-resolution spectroscopic study with current instrumentation. We report the discovery of a new massive lensing cluster, SDSS J120923.7+264047, at z= 0.558. Present around the cluster core, at angular distances of up to ∼40 arcsec, are many arcs and arc candidates, presumably due to lensing of background galaxies by the cluster gravitational potential. One of the arcs, 21 arcsec long, has an r-band magnitude of 20, making it one of the brightest known lensed galaxies. We obtained a low-resolution spectrum of this galaxy, using the Keck-I telescope, and found it is at redshift of z= 1.018. [ABSTRACT FROM AUTHOR]

Photometric redshift uncertainties are a major source of systematic error for ongoing and future photometric surveys. We study different sources of redshift error caused by choosing a suboptimal redshift histogram bin width and propose methods to resolve them. The selection of a too large bin width is shown to oversmooth small-scale structure of the radial distribution of galaxies. This systematic error can significantly shift cosmological parameter constraints by up to 6σ for the dark energy equation-of-state parameter w. Careful selection of bin width can reduce this systematic by a factor of up to 6 as compared with commonly used current binning approaches. We further discuss a generalized resampling method that can correct systematic and statistical errors in cosmological parameter constraints caused by uncertainties in the redshift distribution. This can be achieved without any prior assumptions about the shape of the distribution or the form of the redshift error. Our methodology allows photometric surveys to obtain unbiased cosmological parameter constraints using a minimum number of spectroscopic calibration data. For a DES-like galaxy clustering forecast, we obtain unbiased results with respect to errors caused by suboptimal histogram bin width selection, using only 5k representative spectroscopic calibration objects per tomographic redshift bin. [ABSTRACT FROM AUTHOR]

Photometric redshift uncertainties are a major source of systematic error for ongoing and future photometric surveys. We study different sources of redshift error caused by choosing a suboptimal redshift histogram bin width and propose methods to resolve them. The selection of a too large bin width is shown to oversmooth small-scale structure of the radial distribution of galaxies. This systematic error can significantly shift cosmological parameter constraints by up to 6σ for the dark energy equation-of-state parameter w. Careful selection of bin width can reduce this systematic by a factor of up to 6 as compared with commonly used current binning approaches. We further discuss a generalized resampling method that can correct systematic and statistical errors in cosmological parameter constraints caused by uncertainties in the redshift distribution. This can be achieved without any prior assumptions about the shape of the distribution or the form of the redshift error. Our methodology allows photometric surveys to obtain unbiased cosmological parameter constraints using a minimum number of spectroscopic calibration data. For a DES-like galaxy clustering forecast, we obtain unbiased results with respect to errors caused by suboptimal histogram bin width selection, using only 5k representative spectroscopic calibration objects per tomographic redshift bin. [ABSTRACT FROM AUTHOR]

We present an analysis of a general machine learning technique called 'stacking' for the estimation of photometric redshifts. Stacking techniques can feed the photometric redshift estimate, as output by a base algorithm, back into the same algorithm as an additional input feature in a subsequent learning round. We show how all tested base algorithms benefit from at least one additional stacking round (or layer). To demonstrate the benefit of stacking, we apply the method to both unsupervised machine learning techniques based on self-organizing maps (SOMs), and supervised machine learning methods based on decision trees. We explore a range of stacking architectures, such as the number of layers and the number of base learners per layer. Finally we explore the effectiveness of stacking even when using a successful algorithm such as AdaBoost. We observe a significant improvement of between 1.9 per cent and 21 per cent on all computed metrics when stacking is applied to weak learners (such as SOMs and decision trees). When applied to strong learning algorithms (such as AdaBoost) the ratio of improvement shrinks, but still remains positive and is between 0.4 per cent and 2.5 per cent for the explored metrics and comes at almost no additional computational cost. [ABSTRACT FROM AUTHOR]