arXiv (OAI Expanded)
open access
Stochastic Optimization Algorithms for Problems with Controllable Biased Oracles
Motivated by emerging applications in machine learning, we consider an optimization problem in a general setting in which the gradient of the objective function is available via a biased stochastic oracle. We assume a bias-control parameter can reduce the bias magnitude; however, a lower bias requir
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
- Online Optimization with Unknown Time-Varying Parameters Using Noisy Gradient Measurements#1130559
- ABrA-GD: Adaptive Bregman Accelerated Gradient Descent for Relatively Smooth and (Strongly-)Convex Optimization#1143342
- Online Convex Optimization with Sublinear Noisy Probes#271829
- Projection-Free Algorithms for Nonsmooth Stochastic Convex-Concave Saddle-Point Problems#1129869
- Curvature-Independent Regret Bounds for Distributed Online Optimization on Hadamard Manifolds#1071415
Record · ID 1123900
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