arXiv (All)
open access
LFHE: Local-First Heuristic Evolution for Bounded Local Topology Search in Decentralized Learning with Non-IID Data
Decentralized learning is highly sensitive to communication topology under non-IID data. Adaptive peer-selection methods can exploit local model information, but broader peer discovery may require increasingly large control state, whereas direct spectral optimization typically relies on graph-wide i
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
- PACE: Dynamic node consolidation for near-energy-proportionality in edge clusters#460974
- Decentralized Nonconvex Optimization under Heavy-Tailed Noise: Normalization and Optimal Convergence#147084
- Graph Learning with Spectral Connectivity Priors for Scarce Data#1063489
- LoDAdaC: a unified local training-based decentralized framework with adaptive gradients and compressed communication#10325
- Variance-reduced accelerated methods for decentralized stochastic double-regularized nonconvex strongly-concave minimax problems#1187190
Record · ID 1217911
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