On samples of independent random vectors in spaces of infinitely increasing dimension

1998 ◽  
Vol 50 (12) ◽  
pp. 1945-1951
Author(s):  
V. I. Stepakhno ◽  
M. Ya. Ruzhilo
Keyword(s):  
Random Vectors

A column-oriented optimization approach for the generation of correlated random vectors

OR Spectrum ◽  
2021 ◽  
Author(s):  
Jorge A. Sefair ◽  
Oscar Guaje ◽  
Andrés L. Medaglia
Keyword(s):  
Optimization Approach ◽  
Random Vectors

scholarly journals On Randomized Trace Estimates for Indefinite Matrices with an Application to Determinants

2021 ◽  
Author(s):  
Alice Cortinovis ◽  
Daniel Kressner
Keyword(s):  
Large Scale ◽  
Gaussian Process Regression ◽  
Likelihood Estimation ◽  
Random Vectors ◽  
Symmetric Positive Definite ◽  
Matrix Logarithm ◽  
The Matrix ◽  
Trace Estimation ◽  
Scale Matrix ◽  
Existing Result

AbstractRandomized trace estimation is a popular and well-studied technique that approximates the trace of a large-scale matrix B by computing the average of $$x^T Bx$$ x T B x for many samples of a random vector X. Often, B is symmetric positive definite (SPD) but a number of applications give rise to indefinite B. Most notably, this is the case for log-determinant estimation, a task that features prominently in statistical learning, for instance in maximum likelihood estimation for Gaussian process regression. The analysis of randomized trace estimates, including tail bounds, has mostly focused on the SPD case. In this work, we derive new tail bounds for randomized trace estimates applied to indefinite B with Rademacher or Gaussian random vectors. These bounds significantly improve existing results for indefinite B, reducing the number of required samples by a factor n or even more, where n is the size of B. Even for an SPD matrix, our work improves an existing result by Roosta-Khorasani and Ascher (Found Comput Math, 15(5):1187–1212, 2015) for Rademacher vectors. This work also analyzes the combination of randomized trace estimates with the Lanczos method for approximating the trace of f(B). Particular attention is paid to the matrix logarithm, which is needed for log-determinant estimation. We improve and extend an existing result, to not only cover Rademacher but also Gaussian random vectors.

Efficient generation of random vectors by using the ratio-of-uniforms method with ellipsoidal envelopes

2008 ◽  
Vol 18 (2) ◽  
pp. 209-217 ◽  
Author(s):  
C. J. Pérez ◽  
J. Martín ◽  
C. Rojano ◽  
F. J. Girón
Keyword(s):  
Random Vectors ◽  
Efficient Generation

Rates in the CLT for Sums of Dependent Multiindexed Random Vectors

2004 ◽  
Vol 122 (4) ◽  
pp. 3343-3358 ◽  
Author(s):  
A. V. Bulinskii ◽  
A. P. Shashkin
Keyword(s):  
Random Vectors

Moments of random vectors with skew t distribution and their quadratic forms

2003 ◽  
Vol 63 (4) ◽  
pp. 417-423 ◽  
Author(s):  
Hyoung-Moon Kim ◽  
Bani K. Mallick
Keyword(s):  
Quadratic Forms ◽  
Random Vectors ◽  
T Distribution
Sign in / Sign up

Export Citation Format

Share Document