اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDetection of Periodicity Based on Independence Tests - II. Improved Serial Independence Measure
43
0
0.0
(
0
)
تأليف
Shay Zucker
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce an improvement to a periodicity metric we have introduced in a previous paper.We improve on the Hoeffding-test periodicity metric, using the Blum-Kiefer-Rosenblatt (BKR) test. Besides a consistent improvement over the Hoeffding-test approach, the BKR approach turns out to perform superbly when applied to very short time series of sawtoothlike shapes. The expected astronomical implications are much more detections of RR-Lyrae stars and Cepheids in sparse photometric databases, and of eccentric Keplerian radial-velocity (RV) curves, such as those of exoplanets in RV surveys.
قيم البحث
اقرأ أيضاً
I present the Phase Distance Correlation (PDC) periodogram -- a new periodicity metric, based on the Distance Correlation concept of Gabor Szekely. For each trial period PDC calculates the distance correlation between the data samples and their phase
s. PDC requires adaptation of the Szekelys distance correlation to circular variables (phases). The resulting periodicity metric is best suited to sparse datasets, and it performs better than other methods for sawtooth-like periodicities. These include Cepheid and RR-Lyrae light curves, as well as radial velocity curves of eccentric spectroscopic binaries. The performance of the PDC periodogram in other contexts is almost as good as that of the Generalized Lomb-Scargle periodogram. The concept of phase distance correlation can be adapted also to astrometric data, and it has the potential to be suitable also for large evenly-spaced datasets, after some algorithmic perfection.
We introduce and test several novel approaches for periodicity detection in unevenly-spaced sparse datasets. Specifically, we examine five different kinds of periodicity metrics, which are based on non-parametric measures of serial dependence of the
phase-folded data. We test the metrics through simulations in which we assess their performance in various situations, including various periodic signal shapes, different numbers of data points and different signal to noise ratios. One of the periodicity metrics we introduce seems to perform significantly better than the classical ones in some settings of interest to astronomers. We suggest that this periodicity metric - the Hoeffding-test periodicity metric - should be used in addition to the traditional methods, to increase periodicity detection probability.
We investigate the problem of testing whether $d$ random variables, which may or may not be continuous, are jointly (or mutually) independent. Our method builds on ideas of the two variable Hilbert-Schmidt independence criterion (HSIC) but allows for
an arbitrary number of variables. We embed the $d$-dimensional joint distribution and the product of the marginals into a reproducing kernel Hilbert space and define the $d$-variable Hilbert-Schmidt independence criterion (dHSIC) as the squared distance between the embeddings. In the population case, the value of dHSIC is zero if and only if the $d$ variables are jointly independent, as long as the kernel is characteristic. Based on an empirical estimate of dHSIC, we define three different non-parametric hypothesis tests: a permutation test, a bootstrap test and a test based on a Gamma approximation. We prove that the permutation test achieves the significance level and that the bootstrap test achieves pointwise asymptotic significance level as well as pointwise asymptotic consistency (i.e., it is able to detect any type of fixed dependence in the large sample limit). The Gamma approximation does not come with these guarantees; however, it is computationally very fast and for small $d$, it performs well in practice. Finally, we apply the test to a problem in causal discovery.
We develop multiattribute auctions that accommodate generalized additive independent (GAI) preferences. We propose an iterative auction mechanism that maintains prices on potentially overlapping GAI clusters of attributes, thus decreases elicitation
and computational burden, and creates an open competition among suppliers over a multidimensional domain. Most significantly, the auction is guaranteed to achieve surplus which approximates optimal welfare up to a small additive factor, under reasonable equilibrium strategies of traders. The main departure of GAI auctions from previous literature is to accommodate non-additive trader preferences, hence allowing traders to condition their evaluation of specific attributes on the value of other attributes. At the same time, the GAI structure supports a compact representation of prices, enabling a tractable auction process. We perform a simulation study, demonstrating and quantifying the significant efficiency advantage of more expressive preference modeling. We draw random GAI-structured utility functions with various internal structures, generate additive functions that approximate the GAI utility, and compare the performance of the auctions using the two representations. We find that allowing traders to express existing dependencies among attributes improves the economic efficiency of multiattribute auctions.
Dependence measures based on reproducing kernel Hilbert spaces, also known as Hilbert-Schmidt Independence Criterion and denoted HSIC, are widely used to statistically decide whether or not two random vectors are dependent. Recently, non-parametric H
SIC-based statistical tests of independence have been performed. However, these tests lead to the question of the choice of the kernels associated to the HSIC. In particular, there is as yet no method to objectively select specific kernels with theoretical guarantees in terms of first and second kind errors. One of the main contributions of this work is to develop a new HSIC-based aggregated procedure which avoids such a kernel choice, and to provide theoretical guarantees for this procedure. To achieve this, we first introduce non-asymptotic single tests based on Gaussian kernels with a given bandwidth, which are of prescribed level $alpha in (0,1)$. From a theoretical point of view, we upper-bound their uniform separation rate of testing over Sobolev and Nikolskii balls. Then, we aggregate several single tests, and obtain similar upper-bounds for the uniform separation rate of the aggregated procedure over the same regularity spaces. Another main contribution is that we provide a lower-bound for the non-asymptotic minimax separation rate of testing over Sobolev balls, and deduce that the aggregated procedure is adaptive in the minimax sense over such regularity spaces. Finally, from a practical point of view, we perform numerical studies in order to assess the efficiency of our aggregated procedure and compare it to existing independence tests in the literature.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
