arXiv (All)
open access
Safeguarded Accelerated Adaptive Search under Unreliable Gradient Oracles
From the probabilistic-model viewpoint, stochastic adaptive search can require any fraction $θ\in(0,1)$ of the predicted model reduction for acceptance. Classical backtracking with Nesterov acceleration pairs its momentum construction with a test certifying $1/2$ of this reduction. In stochastic sea
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
- Simple Evolutionary Optimization Can Rival Stochastic Gradient Descent in Neural Networks#19780
- Incomplete Observations Boost Evolutionary Performance in Ocean Modeling#386878
- MARS: A Monte Carlo Tree Search-based Adaptive and Responsive Scheduler#440344
- BlockMGARD: Accelerating Adaptive Scientific Data Reduction with Region-of-Interest Error Control on GPUs#627668
- SEArch: Optimistic Policy Selection Between Scene Noise and Drift for UAV Radar Search#246477
Record · ID 1130531
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