Technical Report: On the Convergence of Gossip Learning in the Presence of Node Inaccessibility
Fuente:
arXiv
Guardado en:
| Autores principales: | Liu, Tian, Cui, Yue, Hu, Xueyang, Xu, Yecheng, Liu, Bo |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Decentralized Ranking Aggregation via Gossip: Convergence and Robustness
por: Caillec, Kerrian Le, et al.
Publicado: (2026)
por: Caillec, Kerrian Le, et al.
Publicado: (2026)
Mitigating Degree Bias Adaptively with Hard-to-Learn Nodes in Graph Contrastive Learning
por: Hu, Jingyu, et al.
Publicado: (2025)
por: Hu, Jingyu, et al.
Publicado: (2025)
Fast and Efficient Gossip Algorithms for Robust and Non-smooth Decentralized Learning
por: van Elst, Anna, et al.
Publicado: (2026)
por: van Elst, Anna, et al.
Publicado: (2026)
VIGraph: Generative Self-supervised Learning for Class-Imbalanced Node Classification
por: Hu, Yulan, et al.
Publicado: (2023)
por: Hu, Yulan, et al.
Publicado: (2023)
NC-NCD: Novel Class Discovery for Node Classification
por: Hou, Yue, et al.
Publicado: (2024)
por: Hou, Yue, et al.
Publicado: (2024)
Hide to Guide: Learning via Semantic Masking
por: Liu, Ruitao, et al.
Publicado: (2026)
por: Liu, Ruitao, et al.
Publicado: (2026)
Skywork Open Reasoner 1 Technical Report
por: He, Jujie, et al.
Publicado: (2025)
por: He, Jujie, et al.
Publicado: (2025)
ENADPool: The Edge-Node Attention-based Differentiable Pooling for Graph Neural Networks
por: Zhao, Zhehan, et al.
Publicado: (2024)
por: Zhao, Zhehan, et al.
Publicado: (2024)
Decentralised Resource Sharing in TinyML: Wireless Bilayer Gossip Parallel SGD for Collaborative Learning
por: Bao, Ziyuan, et al.
Publicado: (2025)
por: Bao, Ziyuan, et al.
Publicado: (2025)
Yi-Lightning Technical Report
por: Wake, Alan, et al.
Publicado: (2024)
por: Wake, Alan, et al.
Publicado: (2024)
Lightning OPD: Efficient Post-Training for Large Reasoning Models with Offline On-Policy Distillation
por: Wu, Yecheng, et al.
Publicado: (2026)
por: Wu, Yecheng, et al.
Publicado: (2026)
Provably Efficient Exploration in Inverse Constrained Reinforcement Learning
por: Yue, Bo, et al.
Publicado: (2024)
por: Yue, Bo, et al.
Publicado: (2024)
Local Causal Structure Learning in the Presence of Latent Variables
por: Xie, Feng, et al.
Publicado: (2024)
por: Xie, Feng, et al.
Publicado: (2024)
Weighted Graph Structure Learning with Attention Denoising for Node Classification
por: Wang, Tingting, et al.
Publicado: (2025)
por: Wang, Tingting, et al.
Publicado: (2025)
AdaFlow: Imitation Learning with Variance-Adaptive Flow-Based Policies
por: Hu, Xixi, et al.
Publicado: (2024)
por: Hu, Xixi, et al.
Publicado: (2024)
Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret
por: Zhong, Han, et al.
Publicado: (2023)
por: Zhong, Han, et al.
Publicado: (2023)
Preserving Node Distinctness in Graph Autoencoders via Similarity Distillation
por: Chen, Ge, et al.
Publicado: (2024)
por: Chen, Ge, et al.
Publicado: (2024)
BuffGraph: Enhancing Class-Imbalanced Node Classification via Buffer Nodes
por: Wang, Qian, et al.
Publicado: (2024)
por: Wang, Qian, et al.
Publicado: (2024)
Multi-order Graph Clustering with Adaptive Node-level Weight Learning
por: Liu, Ye, et al.
Publicado: (2024)
por: Liu, Ye, et al.
Publicado: (2024)
Virtual Sensing to Enable Real-Time Monitoring of Inaccessible Locations \& Unmeasurable Parameters
por: Kobayashi, Kazuma, et al.
Publicado: (2024)
por: Kobayashi, Kazuma, et al.
Publicado: (2024)
EPT-2 Technical Report
por: Molinaro, Roberto, et al.
Publicado: (2025)
por: Molinaro, Roberto, et al.
Publicado: (2025)
INTELLECT-3: Technical Report
por: Prime Intellect Team, et al.
Publicado: (2025)
por: Prime Intellect Team, et al.
Publicado: (2025)
LFM2 Technical Report
por: Amini, Alexander, et al.
Publicado: (2025)
por: Amini, Alexander, et al.
Publicado: (2025)
Continual Learning in the Presence of Repetition
por: Hemati, Hamed, et al.
Publicado: (2024)
por: Hemati, Hamed, et al.
Publicado: (2024)
STIMULUS: Achieving Fast Convergence and Low Sample Complexity in Stochastic Multi-Objective Learning
por: Liu, Zhuqing, et al.
Publicado: (2025)
por: Liu, Zhuqing, et al.
Publicado: (2025)
Unveiling the Power of Multiple Gossip Steps: A Stability-Based Generalization Analysis in Decentralized Training
por: Li, Qinglun, et al.
Publicado: (2025)
por: Li, Qinglun, et al.
Publicado: (2025)
FedAdamW: A Communication-Efficient Optimizer with Convergence and Generalization Guarantees for Federated Large Models
por: Liu, Junkang, et al.
Publicado: (2025)
por: Liu, Junkang, et al.
Publicado: (2025)
Technical Report of HelixFold3 for Biomolecular Structure Prediction
por: Liu, Lihang, et al.
Publicado: (2024)
por: Liu, Lihang, et al.
Publicado: (2024)
GRANITE : a Byzantine-Resilient Dynamic Gossip Learning Framework
por: Belal, Yacine, et al.
Publicado: (2025)
por: Belal, Yacine, et al.
Publicado: (2025)
Improving Detection of Rare Nodes in Hierarchical Multi-Label Learning
por: Xu, Isaac, et al.
Publicado: (2026)
por: Xu, Isaac, et al.
Publicado: (2026)
One Node Per User: Node-Level Federated Learning for Graph Neural Networks
por: Gao, Zhidong, et al.
Publicado: (2024)
por: Gao, Zhidong, et al.
Publicado: (2024)
Motif 2.6B Technical Report
por: Lim, Junghwan, et al.
Publicado: (2025)
por: Lim, Junghwan, et al.
Publicado: (2025)
Cisco Time Series Model Technical Report
por: Gou, Liang, et al.
Publicado: (2025)
por: Gou, Liang, et al.
Publicado: (2025)
Wide & Deep Learning for Node Classification
por: Chen, Yancheng, et al.
Publicado: (2025)
por: Chen, Yancheng, et al.
Publicado: (2025)
RLDX-1 Technical Report
por: Kim, Dongyoung, et al.
Publicado: (2026)
por: Kim, Dongyoung, et al.
Publicado: (2026)
A Sample Efficient Conditional Independence Test in the Presence of Discretization
por: Sun, Boyang, et al.
Publicado: (2025)
por: Sun, Boyang, et al.
Publicado: (2025)
TinyGraph: Joint Feature and Node Condensation for Graph Neural Networks
por: Liu, Yezi, et al.
Publicado: (2024)
por: Liu, Yezi, et al.
Publicado: (2024)
GLow -- A Novel, Flower-Based Simulated Gossip Learning Strategy
por: Belenguer, Aitor, et al.
Publicado: (2025)
por: Belenguer, Aitor, et al.
Publicado: (2025)
On The Presence of Double-Descent in Deep Reinforcement Learning
por: Veselý, Viktor, et al.
Publicado: (2025)
por: Veselý, Viktor, et al.
Publicado: (2025)
Data Heterogeneity Modeling for Trustworthy Machine Learning
por: Liu, Jiashuo, et al.
Publicado: (2025)
por: Liu, Jiashuo, et al.
Publicado: (2025)
Ejemplares similares
-
Decentralized Ranking Aggregation via Gossip: Convergence and Robustness
por: Caillec, Kerrian Le, et al.
Publicado: (2026) -
Mitigating Degree Bias Adaptively with Hard-to-Learn Nodes in Graph Contrastive Learning
por: Hu, Jingyu, et al.
Publicado: (2025) -
Fast and Efficient Gossip Algorithms for Robust and Non-smooth Decentralized Learning
por: van Elst, Anna, et al.
Publicado: (2026) -
VIGraph: Generative Self-supervised Learning for Class-Imbalanced Node Classification
por: Hu, Yulan, et al.
Publicado: (2023) -
NC-NCD: Novel Class Discovery for Node Classification
por: Hou, Yue, et al.
Publicado: (2024)