SearcharxivSearch

arXiv subjects

Alma van der Merwe

Publications and source records attributed to Alma van der Merwe.

3 recordsLinked to original sources

Data-Specific Hyper-Parameter Design: A Paradigm Shift in Reservoir Computing

Reservoir computing typically relies on large, randomly generated reservoirs, enabling simple, often linear readouts. Over the past two decades, most constructions have exploited the freedom to select the reservoir, constrained primarily by stability conditions based on state contraction or memory capacity. However, these designs are largely independent of the input data and learning objective, resulting in a trial-and-error methodology driven by randomness. In high dimensions, the reservoir acts as a random embedding of the input history, implicitly relying on Johnson--Lindenstrauss--type concentration phenomena to preserve information. In contrast, we develop reservoir design principles from a geometric perspective for inputs generated by deterministic dynamical systems. Rather than relying on random embeddings, we require reservoir state increments to align within a cone around an input-determined vector subspace, and prove that such a cone concentration reduces ridge-regression training error. When the cone angle is small, the variance of reservoir states concentrates in the input-determined subspace, improving conditioning of the empirical second-moment matrix and strengthening alignment between dominant covariance directions and the state-target cross-covariance. For echo state networks, we provide a constructive approach to reservoir design. The reservoir matrix is chosen so that associated Krylov-chain directions remain nearly closed within an input-determined subspace while permitting controlled mixing in its orthogonal complement. We also provide a spectral diagnostic for ridge regression training that identifies when reservoir geometry concentrates predictive information into a few dominant covariance modes and when ``spectral pollution'' inhibits forecasting. Numerical experiments demonstrate consistent performance gains over arbitrary reservoir constructions.

math.DS

Convex invertible cones and Nevanlinna-Pick interpolation: The suboptimal case

Nevanlinna-Pick interpolation developed from a topic in classical complex analysis to a useful tool for solving various problems in control theory and electrical engineering. Over the years many extensions of the original problem were considered, including extensions to different function spaces, nonstationary problems, several variable settings and interpolation with matrix and operator points. Here we discuss a variation on Nevanlinna-Pick interpolation for positive real odd functions evaluated in real matrix points. This problem was studied by Cohen and Lewkowicz using convex invertible cones and the Lyapunov order, but was never fully resolved. In this paper we present a solution to this problem in a special case that we refer to as `suboptimal' based on connections with the classical case. The solution requires a representation of linear matrix maps going back to R.D. Hill and an analysis of when positive linear matrix maps are completely positive, on which we reported in earlier work and which we will briefly review here.

math.FA

A Hill-Pick matrix criteria for the Lyapunov order

The Lyapunov order appeared in the study of Nevanlinna-Pick interpolation for positive real odd functions with general (real) matrix points. For real or complex matrices $A$ and $B$ it is said that $B$ Lyapunov dominates $A$ if \begin{equation*} H=H^*,\quad HA+A^*H \geq 0 \quad \implies \quad HB+B^*H \geq 0. \end{equation*} (In case $A$ and $B$ are real we usually restrict to real Hermitian matrices $H$, i.e., symmetric $H$.) Hence $B$ Lyapunov dominates $A$ if all Lyapunov solutions of $A$ are also Lyapunov solutions of $B$. In this chapter we restrict to the case that appears in the study of Nevanlinna-Pick interpolation, namely where $B$ is in the bicommutant of $A$ and where $A$ is Lyapunov regular, meaning the eigenvalues $λ_j$ of $A$ satisfy \[ λ_i + \overlineλ_j \ne 0, \quad i,j=1,\ldots,n. \] In this case we provide a matrix criteria for Lyapunov dominance of $A$ by $B$. The result relies on a class of $*$-linear maps for which positivity and complete positivity coincide and a representation of $*$-linear matrix maps going back to work of R.D. Hill. The matrix criteria asks that a certain matrix, which we call the Hill-Pick matrix, be positive semidefinite.

math.FA