Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2008.02906

MCMC Algorithms for Posteriors on Matrix Spaces

Alexandros Beskos·Kengo Kamatani
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study Markov chain Monte Carlo (MCMC) algorithms for target distributions defined on matrix spaces. Such an important sampling problem has yet to be analytically explored. We carry out a major step in covering this gap by developing the proper theoretical framework that allows for the identification of ergodicity properties of typical MCMC algorithms, relevant in such a context. Beyond the standard Random-Walk Metropolis (RWM) and preconditioned Crank--Nicolson (pCN), a contribution of this paper in the development of a novel algorithm, termed the `Mixed' pCN (MpCN). RWM and pCN are shown not to be geometrically ergodic for an important class of matrix distributions with heavy tails. In contrast, MpCN is robust across targets with different tail behaviour and has very good empirical performance within the class of heavy-tailed distributions. Geometric ergodicity for MpCN is not fully proven in this work, as some remaining drift conditions are quite challenging to obtain owing to the complexity of the state space. We do, however, make a lot of progress towards a proof, and show in detail the last steps left for future work. We illustrate the computational performance of the various algorithms through numerical applications, including calibration on real data of a challenging model arising in financial statistics.

Explore related subjects

stat.COstat.ME

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexandros Beskos, Kengo Kamatani. 2021-11-06. MCMC Algorithms for Posteriors on Matrix Spaces. https://arxiv.org/abs/2008.02906

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

KEEP EXPLORING

Related papers

arXiv2026

Wasserstein mixing of a systematic-scan random rotation sampler

We study the mixing time of a systematic-scan analogue of Kac's walk that was proposed as a fast surrogate for Haar-distributed orthogonal matrices in randomized high-dimensional algorithms and was conjectured to approach Haar measure after only logarithmically many sweeps. We show that this conjectured speed-up does not occur for convergence of the full matrix law to Haar measure in Frobenius Wasserstein distance. At fixed normalized accuracy, the mixing time lies between order $n/\log n$ and order $n$ sweeps; at fixed absolute Frobenius accuracy, the corresponding bounds are between order $n$ and order $n\log n$. More strongly, below the scale $n/\log n$, the normalized Wasserstein distance remains asymptotically at its extremal value. We also show that the output law is singular with respect to Haar measure for fewer than $n/2$ sweeps. Thus the sampler may provide effective application-specific randomization without exhibiting the much faster full-Haar mixing.

stat.CO↗
arXiv2026

Bayesian Calibration with Functional Outputs Using Elastic Partial Matching

Calibrating a simulation model involves estimating its parameters by comparing model outputs with experimental data, so that simulation results faithfully reproduce the experimental observations. When the outputs are functions of time, there are multiple ways to quantify the discrepancy between experimental and simulated curves. A recent approach based on elastic functional data analysis decomposes a functional output into two components: a function temporally aligned to a template, and the corresponding warping function. This decomposition splits the problem into two independent calibration tasks, thereby addressing functional misalignment. However, it assumes that experimental and simulated curves share the same temporal support, an assumption often violated in practice when initial or end times are themselves uncertain or depend on the calibration parameters. In this work, we reinterpret the decomposition step as an approximation to a more general Bayesian calibration problem that incorporates an error term on the time axis. This perspective allows us to naturally extend the framework to a broader family of time warpings with varying initial or end times, using partial elastic alignment. We illustrate the method on a synthetic test case, comparing it with existing Bayesian calibration methods and demonstrating improved surrogate performance and error modeling. We then apply the proposed approach to the calibration of an equation of state (a thermodynamic equation relating the state variables of a material).

stat.CO↗
arXiv2026

Some surprising properties of essential data points visualization

Essential Data Points (EDPs) - the vertices of the convex hull of a bilinear data matrix $\mathbf{D}$ in its row space, column space, or both - are widely used in chemometrics to reduce the size of large data sets while nominally preserving their underlying geometric structure. Using simulated three- and two-component chromatographic/spectral data sets and a real source-apportionment data set ($\mathbf{D = C\, A^\mathsf{T}}$), together with Borgen-Rajkó plots, Procrustes analysis, and variance-covariance comparisons, we show that this preservation is only \emph{partial}: row-wise EDP reduction preserves the row-space geometry (inner and outer polygons) exactly while distorting the column-space geometry, and column-wise reduction shows the opposite behavior; joint row-and-column reduction distorts both. We then give a rigorous, general proof - based on the four fundamental subspaces of a matrix and its singular value decomposition $\mathbf{D = U\,S\,V^\mathsf{T}}$ - that the subspace which is \emph{not} being reduced is always preserved exactly, up to an orthogonal rotation, whereas the subspace whose ambient dimension shrinks is related to the original only through a general, non-orthogonal isomorphism. This distinction is confirmed numerically to machine precision ($\sim 10^{-14}$-$10^{-16}$) on the real data set, and a deliberate negative control confirms that the "ambient-shrinking" map is genuinely non-orthogonal (residual $\approx 1$). These results demonstrate that the apparent rotation of an EDP-reduced polygon relative to the original is not, in general, a rigid rotation, and that visual or numerical comparisons between an EDP-reduced data set and the original data require an explicit, mode-dependent change-of-basis correction before any geometric or statistical conclusion can be drawn. A MATLAB implementation of this correction is provided.

stat.CO↗