Metraipolis › archive › dc_b3154b87f33e
Riemannian Optimization on Unknown Manifolds via Stochastic Proximal Refinement — arXiv:2610.41379
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41379
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T07:51:17.524Z
- SHA-256 of the archived text
88f8d40b2fa45290c858d8c4a84486b0167aa915c0c1280ef71d3b69feeda381- Stable URL of this page
https://metraipolis.com/documento/dc_b3154b87f33e
How to cite
Riemannian Optimization on Unknown Manifolds via Stochastic Proximal Refinement — arXiv:2610.41379 — arXiv (en), https://arxiv.org/abs/2610.41379 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b3154b87f33e (Metraipolis archive dc_b3154b87f33e, sha256 88f8d40b2fa45290c858d8c4a84486b0167aa915c0c1280ef71d3b69feeda381)
BibTeX
@misc{dcb3154b87f33e,
title = {Riemannian Optimization on Unknown Manifolds via Stochastic Proximal Refinement — arXiv:2610.41379},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41379},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b3154b87f33e; sha256 88f8d40b2fa45290c858d8c4a84486b0167aa915c0c1280ef71d3b69feeda381},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41379. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study Riemannian optimization on an unknown manifold accessed only through feasible samples. The central challenge is to turn feasible samples into optimization steps, i.e., the samples are drawn from the unknown feasible manifold, but do not directly provide the tangent spaces, projections, or retractions required by classic Riemannian methods. Moreover, regions with low objective values may be sparsely represented in the data, so directly sampling from a distribution fitted to these observations can require many draws to find better feasible solutions. We introduce Proximal Refinement on Implicit Smooth Manifolds (PRISM), which turns feasible-sample access into an iterative optimization procedure by repeatedly sampling an objective-aware proximal distribution conditioned on the current iterate. Theoretically, we show that PRISM recovers the effect of Riemannian-gradient refinement, leading to provable objective descent, feasibility (manifold adherence), and convergence toward first-order stationarity. We demonstrate the effectiveness of our approach through synthetic experiments illustrating its geometric properties and applications to data-driven building control and diverse real world optimization tasks, highlighting its potential as a general framework for data-driven optimization across scientific and engineering domains. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Systems and Control (eess.SY) ; Machine Learning (cs.LG); Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2610.41379 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-02T07:40:00.254Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).