Aug 2026· Journal of King Saud University: Computer and Information Sciences· Vol 38· 0 citations· 37 references
TL;DR
This work proposes PRISM-ZO, a projection-robust framework that samples low-dimensional random tangent subspaces and combines symmetric finite differences with median-of-means or Huber aggregation and establishes the unbiasedness of the correctly rescaled projected direction in expectation over the random subspace.
Abstract
Zeroth-order optimization on Riemannian manifolds is relevant when objectives are available only through function evaluations, but conventional tangent estimators can be unstable under non-Gaussian oracle errors. We propose PRISM-ZO, a projection-robust framework that samples low-dimensional random tangent subspaces and combines symmetric finite differences with median-of-means or Huber aggregation. We establish the unbiasedness of the correctly rescaled projected direction in expectation over the random subspace, quantify its conditional projection error, prove an explicit expected bound for convergence to an approximate first-order stationary point under a stated estimator-error model, and give a verifiable condition for detecting projected negative curvature. In sparse PCA experiments with 10 random seeds, PRISM-ZO variants are compared with full-dimensional zeroth-order and first-order power baselines under Gaussian, Student-t and Cauchy perturbations; the results report means, standard deviations and 95% confidence intervals and identify both beneficial and failure regimes. The hard-thresholded sparse update is treated as an empirical proxy rather than a smooth retraction.
An entropic variant of Korpelevich's extragradient algorithm---the Kullback--Leibler Mirror-Prox method---in which Euclidean projections are replaced by relative-entropy proximal steps, and a KL-type Tikhonov regularization that selects the equilibrium minimizing relative entropy with respect to a reference measure is...
Erhan Bayraktar, Ibrahim Ekren, Lukianiuk Vy et al.· 0 citations
A Hilbert-space majority theorem and a MOM-order deviation bound under a finite second moment are established and HOMER remains stable when a minority of block summaries is displaced.
It is shown that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces, which accurately preserve Grassmannian geometry while reducing computation, memory, and storage.
Rémi Delogne, L. Jacques· Trans. Mach. Learn. Res.· 0 citations
WG-SINDy estimator, a WG-SINDy estimator combining covariance-shaped spatial kernels, a ridge-stabilized local-polynomial projection, adaptive-LASSO/STLSQ selection, one in-sample per-component feasible diagonal GLS pass, and a PSD projection--Cholesky read-out with mild isotropic shrinkage is studied.
Sai Sathvik Gullipalli, A. EshwarR· arXiv.org· 0 citations
A matching lower bound is proved, up to logarithmic factors, across both dense-tail and sparse-tail regimes under a mild nondegeneracy condition, which enables a high-dimensional Gaussian approximation for the general-rank subspace estimation error with an explicit limiting covariance.
We introduce an intrinsic spectral sparsity model for nonparametric density estimation on compact connected Riemannian manifolds. Instead of penalizing coefficients in an arbitrarily chosen Laplace--Beltrami eigenbasis, we group each complete eigenspace and measure the Hilbert norm of its spectral component. The result...
Olga Klopp, Fedor Noskov· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.