arXiv (All)
open access
A numerical study of radius update rules in trust-region algorithms
Part I [arXiv:2606.30202] and Part II establish which trust-region radius update mechanisms can fail and under which hypotheses they must succeed. Neither says where the thresholds sit once a rule runs with real constants, or how the rule interacts with the model Hessian and the subproblem solver. T
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
- Gradient Residuals - The Calculus of Clearance - Research Note X: The Self-Modulating Operator#165033
- Stochastic Gradient Methods with Online Scaling#999915
- ALDP-FL for adaptive local differential privacy in federated learning#1226487
- Minimax Gaussian Mechanisms for Continual Machine Unlearning#1248908
- Adaptive Conformal Inference Under Delayed Feedback: Coverage Guarantees and a Delay-to-Memory Diagnostic#975302
Record · ID 1401313
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