arXiv (All)open access
PROSE: A Theory of Optimal Stopping with Perishable Evidence for Peer Selection in Intermittently Connected Decentralised Learning
machine learning, 60g40, 62l15, 68t05, i.2.6; g.3; c.2.4
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Related documents
Record · ID 1050037
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.