15 research outputs found
Connectivity and Irreducibility of Algebraic Varieties of Finite Unit Norm Tight Frames
In this paper, we settle a long-standing problem on the connectivity of
spaces of finite unit norm tight frames (FUNTFs), essentially affirming a
conjecture first appearing in [Dykema and Strawn, 2003]. Our central technique
involves continuous liftings of paths from the polytope of eigensteps to spaces
of FUNTFs. After demonstrating this connectivity result, we refine our analysis
to show that the set of nonsingular points on these spaces is also connected,
and we use this result to show that spaces of FUNTFs are irreducible in the
algebro-geometric sense, and also that generic FUNTFs are full spark.Comment: 33 pages, 4 figure
The Geometric Median and Applications to Robust Mean Estimation
This paper is devoted to the statistical and numerical properties of the
geometric median, and its applications to the problem of robust mean estimation
via the median of means principle. Our main theoretical results include (a) an
upper bound for the distance between the mean and the median for general
absolutely continuous distributions in R^d, and examples of specific classes of
distributions for which these bounds do not depend on the ambient dimension
; (b) exponential deviation inequalities for the distance between the sample
and the population versions of the geometric median, which again depend only on
the trace-type quantities and not on the ambient dimension. As a corollary, we
deduce improved bounds for the (geometric) median of means estimator that hold
for large classes of heavy-tailed distributions. Finally, we address the error
of numerical approximation, which is an important practical aspect of any
statistical estimation procedure. We demonstrate that the objective function
minimized by the geometric median satisfies a "local quadratic growth"
condition that allows one to translate suboptimality bounds for the objective
function to the corresponding bounds for the numerical approximation to the
median itself. As a corollary, we propose a simple stopping rule (applicable to
any optimization method) which yields explicit error guarantees. We conclude
with the numerical experiments including the application to estimation of mean
values of log-returns for S&P 500 data.Comment: 28 pages, 2 figure
Numerical Approximation of Andrews Plots with Optimal Spatial-Spectral Smoothing
Andrews plots provide aesthetically pleasant visualizations of
high-dimensional datasets. This work proves that Andrews plots (when defined in
terms of the principal component scores of a dataset) are optimally ``smooth''
on average, and solve an infinite-dimensional quadratic minimization program
over the set of linear isometries from the Euclidean data space to
. By building technical machinery that characterizes the solutions
to general infinite-dimensional quadratic minimization programs over linear
isometries, we further show that the solution set is (in the generic case) a
manifold. To avoid the ambiguities presented by this manifold of solutions, we
add ``spectral smoothing'' terms to the infinite-dimensional optimization
program to induce Andrews plots with optimal spatial-spectral smoothing. We
characterize the (generic) set of solutions to this program and prove that the
resulting plots admit efficient numerical approximations. These
spatial-spectral smooth Andrews plots tend to avoid some ``visual clutter''
that arises due to the oscillation of trigonometric polynomials.Comment: 25 pages, 12 figure
Posterior consistency in linear models under shrinkage priors
We investigate the asymptotic behavior of posterior distributions of
regression coefficients in high-dimensional linear models as the number of
dimensions grows with the number of observations. We show that the posterior
distribution concentrates in neighborhoods of the true parameter under simple
sufficient conditions. These conditions hold under popular shrinkage priors
given some sparsity assumptions.Comment: To appear in Biometrik