arXiv (All)
open access
Provable Parameter-Free Fixed-Point Algorithms with Linear Convergence Rates
In this paper, we develop provable parameter-free fixed-point algorithms for contractive mappings, with an emphasis on automatically exploiting hidden contractivity without requiring prior knowledge of the contraction factor. Our first method is a parameter-free variant of the Halpern fixed-point it
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
- Voight-Kampff Machine v2#86904
- Persistent Magnitude Homology for Quantitative Equational Theories#1012312
- Analytic-Walk Rotary Positional Encodings for Graphs#1116509
- Rendezvous of Mobile Deterministic Automata in Graphs#440346
- Reconstruction of continuum robots by marker-free shape registration of image data using a kinematic model#635542
Record · ID 1296470
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