English
Related papers

Related papers: The Randomized Dependence Coefficient

200 papers

Computable Information Density (CID), the ratio of the length of a losslessly compressed data file to that of the uncompressed file, is a measure of order and correlation in both equilibrium and nonequilibrium systems. Here we show that…

Statistical Mechanics · Physics 2020-10-26 Stefano Martiniani , Yuval Lemberg , Paul M. Chaikin , Dov Levine

We provide a unified analysis of the predictive risk of ridge regression and regularized discriminant analysis in a dense random effects model. We work in a high-dimensional asymptotic regime where $p, n \to \infty$ and $p/n \to \gamma \in…

Statistics Theory · Mathematics 2015-11-05 Edgar Dobriban , Stefan Wager

Distance covariance and distance correlation are scalar coefficients that characterize independence of random vectors in arbitrary dimension. Properties, extensions, and applications of distance correlation have been discussed in the recent…

Methodology · Statistics 2014-07-10 Gabor J. Szekely , Maria L. Rizzo

George R. Terrell (1983, {Ann. Probab., vol. 11(3), pp. 823--826) showed that the Pearson coefficient of correlation of an ordered pair from a random sample of size two is at most one-half, and the equality is attained only for rectangular…

Probability · Mathematics 2022-05-31 Nickos Papadatos

The Regression Discontinuity (RD) design is a widely used non-experimental method for causal inference and program evaluation. While its canonical formulation only requires a score and an outcome variable, it is common in empirical work to…

Methodology · Statistics 2022-08-25 Matias D. Cattaneo , Luke Keele , Rocio Titiunik

Chatterjee's rank correlation is a directed measure of association designed to detect whether one variable can be predicted as a function of another. While the original coefficient is naturally defined for real-valued data, circular data…

Statistics Theory · Mathematics 2026-05-22 Sourav Majumdar

In this paper we construct the new coefficient which allows to measure quantitatively the independence of the two discrete random variables. The new inequalities for the matrices with non-negative elements are found

Probability · Mathematics 2010-08-04 E. A. Yanovich

We study principal components regression (PCR) in an asymptotic high-dimensional regression setting, where the number of data points is proportional to the dimension. We derive exact limiting formulas for the estimation and prediction…

Statistics Theory · Mathematics 2025-09-18 Alden Green , Elad Romanov

We extend the continuity-based framework to Regression Discontinuity Designs (RDDs) to identify and estimate causal effects under interference when units are connected through a network. Assignment to an "effective treatment," combining the…

Methodology · Statistics 2025-11-20 Elena Dal Torrione , Tiziano Arduini , Laura Forastiere

We consider a sparse high-dimensional varying coefficients model with random effects, a flexible linear model allowing covariates and coefficients to have a functional dependence with time. For each individual, we observe discretely sampled…

Statistics Theory · Mathematics 2021-10-14 Michael Law , Ya'acov Ritov

This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…

Numerical Analysis · Mathematics 2018-10-30 Sharif Rahman

Typical IRT rating-scale models assume that the rating category threshold parameters are the same over examinees. However, it can be argued that many rating data sets violate this assumption. To address this practical psychometric problem,…

Methodology · Statistics 2013-03-22 Ken Akira Fujimoto , George Karabatsos

As a computationally fast and working efficient tool, sure independence screening has received much attention in solving ultrahigh dimensional problems. This paper contributes two robust sure screening approaches that simultaneously take…

Methodology · Statistics 2021-07-27 Xiaochao Xia

We consider a static linear panel model with both correlated and uncorrelated random coefficients, where the former can depend arbitrarily on observable regressors while the latter are independent of them. We provide sufficient conditions…

Econometrics · Economics 2026-05-21 Irene Botosaru , James L. Powell

Distance correlation is a recent extension of Pearson's correlation, that characterises general statistical independence between Euclidean-space-valued random variables, not only linear relations. This review delves into how and when…

Statistics Theory · Mathematics 2020-09-30 Fernando Castro-Prado , Wenceslao González-Manteiga

We introduce a new random matrix model called distance covariance matrix in this paper, whose normalized trace is equivalent to the distance covariance. We first derive a deterministic limit for the eigenvalue distribution of the distance…

Statistics Theory · Mathematics 2021-05-18 Weiming Li , Qinwen Wang , Jianfeng Yao

This paper develops computationally feasible methods for estimating random effects models in the context of regression modelling of multiple independent time series of discrete valued counts in which there is serial dependence. Given…

Methodology · Statistics 2016-06-10 W. T. M. Dunsmuir , C. McKendry , R. T. Dean

We investigate the relative information content of six measures of dependence between two random variables $X$ and $Y$ for large or extreme events for several models of interest for financial time series. The six measures of dependence are…

Statistical Mechanics · Physics 2008-12-10 Y. Malevergne , D. Sornette

We generalize 2-Wasserstein dependence coefficients to measure dependence between a finite number of random vectors. This generalization includes theoretical properties, and in particular focuses on an interpretation of maximal dependence…

Methodology · Statistics 2024-04-11 Steven De Keyser , Irene Gijbels

Several important families of computational and statistical results in machine learning and randomized algorithms rely on uniform bounds on quadratic forms of random vectors or matrices. Such results include the Johnson-Lindenstrauss (J-L)…

Machine Learning · Computer Science 2019-12-06 Arindam Banerjee , Qilong Gu , Vidyashankar Sivakumar , Zhiwei Steven Wu
‹ Prev 1 4 5 6 7 8 10 Next ›