Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0509225

The Caratheodory-Fejer-Pisarenko decomposition and its multivariable counterpart

Tryphon T. Georgiou
View original source ↗Read source document ↗Export metadata ↓

Abstract

When a covariance matrix with a Toeplitz structure is written as the sum of a singular one and a positive scalar multiple of the identity, the singular summand corresponds to the covariance of a purely deterministic component of a time-series whereas the identity corresponds to white noise--this is the Carathéodory-Fejér-Pisarenko (CFP) decomposition. In the present paper we study multivariable analogs for block-Toeplitz matrices as well as for matrices with the structure of state-covariances of finite-dimensional linear systems (which include block-Toeplitz ones). We characterize state-covariances which admit only a deterministic input power spectrum. We show that multivariable decomposition of a state-covariance in accordance with a ``deterministic component + white noise'' hypothesis for the input does not exist in general, and develop formulae for spectra corresponding to singular covariances via decomposing the contribution of the singular part. We consider replacing the ``scalar multiple of the identity'' in the CFP decomposition by a covariance of maximal trace which is admissible as a summand. The summand can be either (block-)diagonal corresponding to white noise or have a ``short-range correlation structure'' correponding to a moving average component. The trace represents the maximal variance/energy that can be accounted for by a process (e.g., noise) with the aforementioned structure at the input, and the optimal solution can be computed via convex optimization. The decomposition of covariances and spectra according to the range of their time-domain correlations is an alternative to the CFP-dictum with potentially great practical significance.

Explore related subjects

math.OCmath.FA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tryphon T. Georgiou. 2005-09-09. The Caratheodory-Fejer-Pisarenko decomposition and its multivariable counterpart. https://arxiv.org/abs/math/0509225

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Genericity of Polyak-Lojasiewicz Inequalities for Entropic Mean-Field Neural ODEs

We address the behavior of idealized deep residual neural networks (ResNets), modeled via an optimal control problem set over continuity (or adjoint transport) equations. The continuity equations describe the statistical evolution of the features in the asymptotic regime where the layers of the network form a continuum. The velocity field is expressed through the network activation function, which is itself viewed as a function of the statistical distribution of the network parameters (weights and biases). From a mathematical standpoint, the control is interpreted in a relaxed sense, taking values in the space of probability measures over the set of parameters. We investigate the optimal behavior of the network when the cost functional arises from a regression problem and includes an additional entropic regularization term on the distribution of the parameters. In this framework, we focus in particular on the existence of stable optimizers --that is, optimizers at which the Hessian of the cost is non-degenerate. We show that, for an open and dense set of initial data, understood here as probability distributions over features and associated labels, there exists a unique stable global minimizer of the control problem. Moreover, we show that such minimizers satisfy a local Polyak--Lojasiewicz inequality, which can lead to exponential convergence of the corresponding gradient descent when the initialization lies sufficiently close to the optimal parameters. This result thus demonstrates the genericity (with respect to the distribution of features and labels) of the Polyak--Lojasiewicz condition in ResNets with a continuum of layers and under entropic penalization.

math.OC↗
arXiv2026

A regret minimization approach to fixed-point iterations

We propose a conversion scheme that turns regret minimizing algorithms into fixed point iterations, with convergence guarantees following from regret bounds. The resulting iterations can be seen as a grand extension of the classical Krasnoselskii--Mann iterations, as the latter are recovered by converting the Online Gradient Descent algorithm. This approach yields new simple iterations for finding fixed points of non-self operators. We also focus on converting algorithms from the AdaGrad family of regret minimizers, and thus obtain fixed point iterations with adaptive guarantees of a new kind. Numerical experiments on various problems demonstrate faster convergence of AdaGrad-based fixed point iterations over Krasnoselskii--Mann iterations.

math.OC↗
arXiv2026

Variational Analysis in Spectral Decomposition Systems

This work is concerned with the variational analysis of functions defined on Euclidean spaces whose values depend solely on certain invariants (``spectrum'') of their arguments, a class we term ``spectral functions.'' Building on our previous work \cite{PartI} on the convex analysis of such functions, we work in the abstract framework of spectral decomposition systems, which covers a wide range of previously studied settings, including eigenvalue decomposition of Hermitian matrices and singular value decomposition of rectangular matrices, and allows the derivation of new results in more general settings such as normal decomposition systems. The main results of this work provide constructive formulae for computing the regular, limiting, and Clarke subdifferentials of a spectral function in terms of the corresponding objects of the associated invariant function. Finally, we obtain a generalization of Lidski\uı's theorem on the spectrum of additive perturbations of Hermitian matrices to arbitrary spectral decomposition systems.

math.OC↗