arXiv (All)
open access
Volume Sampling and Spectral Equalization in Randomized Alternating Projections
We study a family of randomized alternating projection methods that alternate among subspaces spanned by subsets of \(n\) vectors from a prescribed set. We derive an explicit characterization of performance bounds when these subspaces are sampled with probabilities proportional to the volumes subten
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Convergence of Random Products of Projections Under Infinite-Periodic Selections#1083446
- Sampling theorems for inverse problems on Riemannian manifolds#1069669
- A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle Model#1078286
- Convergence Analysis of a Greedy Algorithm for Conditioning Gaussian Random Variables#1014492
- NON-LINEAR HYBRID RANDOM PROJECTION TECHNIQUES FOR HIGH-DIMENSIONAL DATA#280702
Record · ID 1249770
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive