اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFast Algorithms and Efficient Statistics: N-point Correlation Functions
69
0
0.0
(
0
)
تأليف
Andrew Moore
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present here a new algorithm for the fast computation of N-point correlation functions in large astronomical data sets. The algorithm is based on kdtrees which are decorated with cached sufficient statistics thus allowing for orders of magnitude speed-ups over the naive non-tree-based implementation of correlation functions. We further discuss the use of controlled approximations within the computation which allows for further acceleration. In summary, our algorithm now makes it possible to compute exact, all-pairs, measurements of the 2, 3 and 4-point correlation functions for cosmological data sets like the Sloan Digital Sky Survey (SDSS; York et al. 2000) and the next generation of Cosmic Microwave Background experiments (see Szapudi et al. 2000).
قيم البحث
اقرأ أيضاً
We propose a method for computing n-time correlation functions of arbitrary spinorial, fermionic, and bosonic operators, consisting of an efficient quantum algorithm that encodes these correlations in an initially added ancillary qubit for probe and
control tasks. For spinorial and fermionic systems, the reconstruction of arbitrary n-time correlation functions requires the measurement of two ancilla observables, while for bosonic variables time derivatives of the same observables are needed. Finally, we provide examples applicable to different quantum platforms in the frame of the linear response theory.
We derive analytic covariance matrices for the $N$-Point Correlation Functions (NPCFs) of galaxies in the Gaussian limit. Our results are given for arbitrary $N$ and projected onto the isotropic basis functions of Cahn & Slepian (2020), recently show
n to facilitate efficient NPCF estimation. A numerical implementation of the 4PCF covariance is compared to the sample covariance obtained from a set of lognormal simulations, Quijote dark matter halo catalogues, and MultiDark-Patchy galaxy mocks, with the latter including realistic survey geometry. The analytic formalism gives reasonable predictions for the covariances estimated from mock simulations with a periodic-box geometry. Furthermore, fitting for an effective volume and number density by maximizing a likelihood based on Kullback-Leibler divergence is shown to partially compensate for the effects of a non-uniform window function.
As galaxy surveys begin to measure the imprint of baryonic acoustic oscillations (BAO) on large-scale structure at the sub-percent level, reconstruction techniques that reduce the contamination from nonlinear clustering become increasingly important.
Inverting the nonlinear continuity equation, we propose an Eulerian growth-shift reconstruction algorithm that does not require the displacement of any objects, which is needed for the standard Lagrangian BAO reconstruction algorithm. In real-space DM-only simulations the algorithm yields 95% of the BAO signal-to-noise obtained from standard reconstruction. The reconstructed power spectrum is obtained by adding specific simple 3- and 4-point statistics to the pre-reconstruction power spectrum, making it very transparent how additional BAO information from higher-point statistics is included in the power spectrum through the reconstruction process. Analytical models of the reconstructed density for the two algorithms agree at second order. Based on similar modeling efforts, we introduce four additional reconstruction algorithms and discuss their performance.
Correlation functions and related statistics have been favorite measures of the distributions of extragalactic objects ever since people started analyzing the clustering of the galaxies in the 1930s. I review the evolving reasons for this choice, and
comment on some of the present issues in the application and interpretation of these statistics, with particular attention to the question of how closely galaxies trace mass.
We consider strongly convex-concave minimax problems in the federated setting, where the communication constraint is the main bottleneck. When clients are arbitrarily heterogeneous, a simple Minibatch Mirror-prox achieves the best performance. As the
clients become more homogeneous, using multiple local gradient updates at the clients significantly improves upon Minibatch Mirror-prox by communicating less frequently. Our goal is to design an algorithm that can harness the benefit of similarity in the clients while recovering the Minibatch Mirror-prox performance under arbitrary heterogeneity (up to log factors). We give the first federated minimax optimization algorithm that achieves this goal. The main idea is to combine (i) SCAFFOLD (an algorithm that performs variance reduction across clients for convex optimization) to erase the worst-case dependency on heterogeneity and (ii) Catalyst (a framework for acceleration based on modifying the objective) to accelerate convergence without amplifying client drift. We prove that this algorithm achieves our goal, and include experiments to validate the theory.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
