arXiv subjects

Cyrus Mostajeran

Publications and source records attributed to Cyrus Mostajeran.

At least 19 recordsLinked to original sources

arXiv2026

Wrench-Based Bayesian Pose Estimation via Matrix--Fisher Gaussian Inference

In this paper, a residual-safeguarded local Matrix Fisher--Gaussian (MFG) inference method is developed for wrench-based pose estimation on $\mathrm{SO}(3)\times\mathbb{R}^3$. The force/torque measurements are modeled by a quasi-static contact system in which the predicted wrench depends on the unknown object pose through an implicit equilibrium state. Since the resulting nonlinear likelihood is not globally conjugate to the coupled MFG family, a local Bayesian update is constructed by linearizing the reduced wrench residual and matching the induced Gauss--Newton posterior model to a coupled MFG distribution. It is shown that the reduced residual Jacobian has a Schur-complement form, and that the local quadratic posterior admits a closed-form MFG approximation matching the prescribed local first- and second-order posterior coefficients. The same sensitivity model yields a compensated rotational information score, which characterizes the weakest locally informative attitude direction after translational compensation. A residual-safeguarded recentering algorithm is further introduced to update the linearization point only through candidates that decrease the recomputed whitened wrench residual. In the tested sparse prior-mismatch regimes, the resulting estimator reduces residual merit and pose error relative to single-pass and local baseline variants, and controlled robot experiments provide a proof of concept under calibrated quasi-static conditions.

math.MG↗

arXiv2026

Universality of kernels on Riemannian symmetric spaces

We investigate universality properties of continuous, positive-definite invariant kernels on Riemannian symmetric spaces, providing a unified harmonic-analytic characterization across compact and non-compact settings. In the compact symmetric case, we prove that a continuous, positive-definite invariant kernel is $C$-universal if and only if all of its spherical coefficients are strictly positive, a sharpening of classical Bochner-type results. This characterization is extended to compact homogeneous spaces, where universality is shown to be equivalent to the strict positive-definiteness of coefficient matrices arising from a representation-theoretic expansion. In contrast, for non-compact symmetric spaces, we establish that any continuous, positive-definite invariant kernel that is $C_0$ and integrable is automatically $C_0$-universal. Our analysis essentially relies on spectral decompositions using spherical functions and group Fourier transforms, in order to provide alternative, harmonic-analytic formulations of universality conditions. Several examples (including kernels on spheres and compact Lie groups, as well as integrable kernels on hyperbolic spaces and symmetric cones) both illustrate the theory and demonstrate practical criteria for constructing universal kernels.

math.FA↗

arXiv2026

Intrinsic Muon: Spectral Optimization on Riemannian Matrix Manifolds

Muon and related norm-constrained matrix optimizers have become central to large-scale learning problems. They are formulated as a linear maximization oracle (LMO) over an ambient matrix-norm ball in unconstrained Euclidean space. However, these do not generalize cleanly to manifold-valued parameters such as low-rank factorizations, orthogonality constraints, or symmetric positive definite (SPD) matrices. Naively restricting the Muon LMO to the tangent space (i) breaks quotient symmetries and (ii) couples the tangent-space constraint with an ambient norm bound, thereby obstructing closed-form solutions on various manifolds of interest. We resolve both issues with a single observation: every Riemannian metric canonically lifts a unitarily invariant Euclidean norm to an intrinsic norm on each tangent space, and the resulting intrinsic norm constrained LMO is symmetry preserving. Building on this, we introduce intrinsic Muon (iMuon), a unified framework that yields closed-form updates on the fixed-rank, SPD, Stiefel, and Grassmann manifolds for any unitarily invariant norm, including the spectral, Frobenius, and nuclear norms. We establish convergence guarantees for both deterministic and stochastic iMuon with rate constants that depend only on the manifold dimension. Notably, on the fixed-rank manifold this constant depends only on the rank, making the rate independent of factor conditioning and removing the runtime factor-rescaling required by prior work. Experiments on LoRA finetuning of LLMs, image classification, and subspace learning illustrate the efficacy of the proposed approach.

cs.LG↗

arXiv2026

Geometric Renyi Differential Privacy: Ricci Curvature Characterized by Heat Diffusion Mechanisms

In this paper, we develop a novel privacy mechanism for Riemannian manifold-valued data. Our key contribution lies in uncovering unexpected connections among geometric analysis, heat diffusion models, and differential privacy (DP). We characterize the Renyi divergence via dimension-free Harnack inequalities on Riemannian manifolds and establish Renyi differential privacy guarantees governed by Ricci curvature. For manifolds with nonnegative Ricci curvature, we propose a mechanism based on heat diffusion. In contrast, for general manifolds we introduce a Langevin-process-based approach that yields intrinsic mechanisms supporting normalization-free sampling and continuous privacy-utility trade-offs. We derive detailed utility analyses for both mechanisms. As a statistical application, we develop privacy-preserving estimation of the generalized Frechet mean, including nontrivial sensitivity analysis and phase transition characterizations. Numerical experiments further demonstrate the advantages of the proposed DP mechanisms over existing approaches.

stat.ML↗

arXiv2026

Horospherical Depth and Busemann Median on Hadamard Manifolds

\We introduce the horospherical depth, an intrinsic notion of statistical depth on Hadamard manifolds, and define the Busemann median as the set of its maximizers. The construction exploits the fact that the linear functionals appearing in Tukey's half-space depth are themselves limits of renormalized distance functions; on a Hadamard manifold the same limiting procedure produces Busemann functions, whose sublevel sets are horoballs, the intrinsic replacements for halfspaces. The resulting depth is parametrized by the visual boundary, is isometry-equivariant, and requires neither tangent-space linearization nor a chosen base point. For arbitrary Hadamard manifolds, we prove that the depth regions are nested and geodesically convex, that a centerpoint of depth at least $1/(d+1)$ exists, and hence that the Busemann median exists for every Borel probability measure. Under strictly negative sectional curvature and mild regularity assumptions, the depth is strictly quasi-concave and the median is unique. We also establish robustness: the depth is stable under total-variation perturbations, and under contamination escaping to infinity the limiting median depends on the escape direction but not on how far the contaminating mass has moved along the geodesic ray, in contrast with the Fr\'echet mean. Finally, we establish uniform consistency of the sample depth and convergence of sample depth regions and sample Busemann medians; on symmetric spaces of noncompact type, the argument proceeds through a VC analysis of upper horospherical halfspaces, while on general Hadamard manifolds it follows from a compactness argument under a mild non-atomicity assumption.

math.ST↗

arXiv2026

Min-Max Grassmannian Optimization for Online Subspace Tracking

This paper discusses robustness guarantees for online tracking of time-varying subspaces from noisy data. Building on recent work in optimization over a Grassmannian manifold, we introduce a new approach for robust subspace tracking by modeling data uncertainty in a Grassmannian ball. The robust subspace tracking problem is cast into a min-max optimization framework, for which we derive a closed-form solution for the worst-case subspace, enabling a geometric robustness adjustment that is both analytically tractable and computationally efficient, unlike iterative convex relaxations. The resulting algorithm, GeRoST (Geometrically Robust Subspace Tracking), is validated on two case studies: tracking a linear time-varying system and online foreground-background separation in video.

eess.SY↗

arXiv2025

Robust Least-Squares Optimization for Data-Driven Predictive Control: A Geometric Approach

The paper studies a geometrically robust least-squares problem that extends classical and norm-based robust formulations. Rather than minimizing residual error for fixed or perturbed data, we interpret least-squares as enforcing approximate subspace inclusion between measured and true data spaces. The uncertainty in this geometric relation is modeled as a metric ball on the Grassmannian manifold, leading to a min-max problem over Euclidean and manifold variables. The inner maximization admits a closed-form solution, enabling an efficient algorithm with a transparent geometric interpretation. Applied to robust finite-horizon linear-quadratic tracking in data-enabled predictive control, the method improves upon existing robust least-squares formulations, achieving stronger robustness and favorable scaling under small uncertainty.

math.OC↗

arXiv2025

Geometrically robust least squares through manifold optimization

This paper presents a methodology for solving a geometrically robust least squares problem, which arises in various applications where the model is subject to geometric constraints. The problem is formulated as a minimax optimization problem on a product manifold, where one variable is constrained to a ball describing uncertainty. To handle the constraint, an exact penalty method is applied. A first-order gradient descent ascent algorithm is proposed to solve the problem, and its convergence properties are illustrated by an example. The proposed method offers a robust approach to solving a wide range of problems arising in signal processing and data-driven control.

math.OC↗

arXiv2025

Universal kernels via harmonic analysis on Riemannian symmetric spaces

The universality properties of kernels characterize the class of functions that can be approximated in the associated reproducing kernel Hilbert space and are of fundamental importance in the theoretical underpinning of kernel methods in machine learning. In this work, we establish fundamental tools for investigating universality properties of kernels in Riemannian symmetric spaces, thereby extending the study of this important topic to kernels in non-Euclidean domains. Moreover, we use the developed tools to prove the universality of several recent examples from the literature on positive definite kernels defined on Riemannian symmetric spaces, thus providing theoretical justification for their use in applications involving manifold-valued data.

cs.LG↗

arXiv2024

Geometric statistics with subspace structure preservation for SPD matrices

We present a geometric framework for the processing of SPD-valued data that preserves subspace structures and is based on the efficient computation of extreme generalized eigenvalues. This is achieved through the use of the Thompson geometry of the semidefinite cone. We explore a particular geodesic space structure in detail and establish several properties associated with it. Finally, we review a novel inductive mean of SPD matrices based on this geometry.

math.NA↗

arXiv2024

Programming evolution of geometry in shape-morphing sheets via spatiotemporal activation

Shape-programmed sheets morph from one surface into another upon activation by stimuli such as illumination, and have attracted much interest for their potential engineering applications, especially in soft robotics. Complex shape changes can be achieved by patterning a simple local active deformation (e.g. isotropic swelling), to generate differential growth. Usually the material itself is designed $\unicode{x2014}$ for example by patterning a molecular director $\unicode{x2014}$ such that a particular shape change occurs upon exposure to a spatially uniform stimulus. A limitation of this paradigm is that typically only one target geometry can be attained as the stimulus is adjusted. Here we show that this limitation can be overcome by patterning the stimulus itself, thereby exercising spatiotemporal control over local deformation magnitudes. Thus a single physical sample can be induced to traverse a continuous family of target geometries, opening the door to precise shape adjustments, new functionalities, and designable non-reciprocal loops in shape space. We illustrate these possibilities with examples including active parabolic reflectors, chiral flow guides, and bending channels. Finding the necessary patterns of activation involves solving families of metric inverse problems; we solve these by reduction to ODEs in an axisymmetric setting, then present a novel numerical scheme to solve them in generality.

cond-mat.soft↗

arXiv2024

Invariant kernels on the space of complex covariance matrices

The present work develops certain analytical tools required to construct and compute invariant kernels on the space of complex covariance matrices. The main result is the $\mathrm{L}^1$--Godement theorem, which states that any invariant kernel, which is (in a certain natural sense) also integrable, can be computed by taking the inverse spherical transform of a positive function. General expressions for inverse spherical transforms are then provided, which can be used to explore new families of invariant kernels, at a rather moderate computational cost. A further, alternative approach for constructing new invariant kernels is also introduced, based on Ramanujan's master theorem for symmetric cones. This leads to a novel closed-form invariant kernel, called the Beta-prime kernel. Numerical experiments highlight the computational and performance advantages of this kernel, especially in the context of two-sample hypothesis testing.

math.FA↗

arXiv2023

Invariant kernels on Riemannian symmetric spaces: a harmonic-analytic approach

This work aims to prove that the classical Gaussian kernel, when defined on a non-Euclidean symmetric space, is never positive-definite for any choice of parameter. To achieve this goal, the paper develops new geometric and analytical arguments. These provide a rigorous characterization of the positive-definiteness of the Gaussian kernel, which is complete but for a limited number of scenarios in low dimensions that are treated by numerical computations. Chief among these results are the L$^{\!\scriptscriptstyle p}$-$\hspace{0.02cm}$Godement theorems (where $p = 1,2$), which provide verifiable necessary and sufficient conditions for a kernel defined on a symmetric space of non-compact type to be positive-definite. A celebrated theorem, sometimes called the Bochner-Godement theorem, already gives such conditions and is far more general in its scope, but is especially hard to apply. Beyond the connection with the Gaussian kernel, the new results in this work lay out a blueprint for the study of invariant kernels on symmetric spaces, bringing forth specific harmonic analysis tools that suggest many future applications.

cs.LG↗

arXiv2023

Geometric Learning with Positively Decomposable Kernels

Kernel methods are powerful tools in machine learning. Classical kernel methods are based on positive-definite kernels, which map data spaces into reproducing kernel Hilbert spaces (RKHS). For non-Euclidean data spaces, positive-definite kernels are difficult to come by. In this case, we propose the use of reproducing kernel Krein space (RKKS) based methods, which require only kernels that admit a positive decomposition. We show that one does not need to access this decomposition in order to learn in RKKS. We then investigate the conditions under which a kernel is positively decomposable. We show that invariant kernels admit a positive decomposition on homogeneous spaces under tractable regularity assumptions. This makes them much easier to construct than positive-definite kernels, providing a route for learning with kernels for non-Euclidean data. By the same token, this provides theoretical foundations for RKKS-based methods in general.

cs.LG↗

arXiv2023

Determinantal expressions of certain integrals on symmetric spaces

The integral of a function $f$ defined on a symmetric space $M \simeq G/K$ may be expressed in the form of a determinant (or Pfaffian), when $f$ is $K$-invariant and, in a certain sense, a tensor power of a positive function of a single variable. The paper presents a few examples of this idea and discusses future extensions. Specifically, the examples involve symmetric cones, Grassmann manifolds, and classical domains.

math.DG↗

arXiv2023

Differential geometry with extreme eigenvalues in the positive semidefinite cone

Differential geometric approaches to the analysis and processing of data in the form of symmetric positive definite (SPD) matrices have had notable successful applications to numerous fields including computer vision, medical imaging, and machine learning. The dominant geometric paradigm for such applications has consisted of a few Riemannian geometries associated with spectral computations that are costly at high scale and in high dimensions. We present a route to a scalable geometric framework for the analysis and processing of SPD-valued data based on the efficient computation of extreme generalized eigenvalues through the Hilbert and Thompson geometries of the semidefinite cone. We explore a particular geodesic space structure based on Thompson geometry in detail and establish several properties associated with this structure. Furthermore, we define a novel iterative mean of SPD matrices based on this geometry and prove its existence and uniqueness for a given finite collection of points. Finally, we state and prove a number of desirable properties that are satisfied by this mean.

math.DG↗

arXiv2023

The Gaussian kernel on the circle and spaces that admit isometric embeddings of the circle

On Euclidean spaces, the Gaussian kernel is one of the most widely used kernels in applications. It has also been used on non-Euclidean spaces, where it is known that there may be (and often are) scale parameters for which it is not positive definite. Hope remains that this kernel is positive definite for many choices of parameter. However, we show that the Gaussian kernel is not positive definite on the circle for any choice of parameter. This implies that on metric spaces in which the circle can be isometrically embedded, such as spheres, projective spaces and Grassmannians, the Gaussian kernel is not positive definite for any parameter.

cs.LG↗

arXiv2022

Discontinuous metric programming in liquid crystalline elastomers

Liquid crystalline elastomers (LCEs) are shape-changing materials that exhibit large deformations in response to applied stimuli. Local control of the orientation of LCEs spatially directs the deformation of these materials to realize spontaneous shape change in response to stimuli. Prior approaches to shape programming in LCEs utilize patterning techniques that involve the detailed inscription of spatially varying nematic fields to produce sheets. These patterned sheets deform into elaborate geometries with complex Gaussian curvatures. Here, we present an alternative approach to realize shape-morphing in LCEs where spatial patterning of the crosslink density locally regulates the material deformation magnitude on either side of a prescribed interface curve. We also present a simple mathematical model describing the behavior of these materials. Further experiments coupled with the mathematical model demonstrate the control of the sign of Gaussian curvature, which is used in combination with heat transfer effects to design LCEs that self-clean as a result of temperature-dependent actuation properties.

cond-mat.soft↗