arXiv (All)
open access
Non-Parametric Optimization for Scalable Learning in Stochastic Decision Problems
Stochastic optimization (SO) plays a central role in decision-making under uncertainty. Among SO problems, time-varying stochastic optimization (TV-SO) is particularly important due to its applications in adaptive control and machine learning. Non-parametric approaches have been proposed for time-va
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
- Learning-Based Surrogate Method for Stochastic Optimization under Decision-Dependent Uncertainty with Adaptive Random Designs#997967
- Nonparametric Sparse Online Learning of the Koopman Operator#144206
- Recursive Gradient Retraction Methods for Stochastic Nonconvex Optimization on Stiefel Manifolds#1354626
- Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization#677345
- Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization#674148
Record · ID 1387489
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