Cover Image

A Tale of Two Learning Algorithms: Multiple Stream Random Walk and Asynchronous Gossip

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gholami, Peyman, Seferoglu, Hulya
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved Generalization Bounds for Communication Efficient Federated Learning
by: Gholami, Peyman, et al.
Published: (2024)

DIGEST: Fast and Communication Efficient Decentralized Learning with Local Updates
by: Gholami, Peyman, et al.
Published: (2023)

Priority-Aware Model-Distributed Inference at Edge Networks
by: Li, Teng, et al.
Published: (2024)

Model-Distributed Inference for Large Language Models at the Edge
by: Macario, Davide, et al.
Published: (2025)

Asynchronous Gossip Algorithms for Rank-Based Statistical Methods
by: Van Elst, Anna, et al.
Published: (2025)

Privacy-Preserving Hierarchical Model-Distributed Inference
by: Dehkordi, Fatemeh Jafarian, et al.
Published: (2024)

Early-Exit meets Model-Distributed Inference at Edge Networks
by: Colocrese, Marco, et al.
Published: (2024)

On Gossip Algorithms for Machine Learning with Pairwise Objectives
by: Colin, Igor, et al.
Published: (2026)

Fast and Efficient Gossip Algorithms for Robust and Non-smooth Decentralized Learning
by: van Elst, Anna, et al.
Published: (2026)

Representer Theorems for Metric and Preference Learning: Geometric Insights and Algorithms
by: Morteza, Peyman
Published: (2023)

A Privacy Preserving Randomized Gossip Algorithm via Controlled Noise Insertion
by: Hanzely, Filip, et al.
Published: (2019)

Event-Triggered Gossip for Distributed Learning
by: Zhai, Zhiyuan, et al.
Published: (2026)

Robust Distributed Estimation: Extending Gossip Algorithms to Ranking and Trimmed Means
by: Van Elst, Anna, et al.
Published: (2025)

Towards Understanding Transformers in Learning Random Walks
by: Shi, Wei, et al.
Published: (2025)

Repelling Random Walks
by: Reid, Isaac, et al.
Published: (2023)

Revisiting Random Walks for Learning on Graphs
by: Kim, Jinwoo, et al.
Published: (2024)

Differentially Private Decentralized Learning with Random Walks
by: Cyffers, Edwige, et al.
Published: (2024)

Learning Long Range Dependencies on Graphs via Random Walks
by: Chen, Dexiong, et al.
Published: (2024)

Two Tales of Single-Phase Contrastive Hebbian Learning
by: Høier, Rasmus Kjær, et al.
Published: (2024)

Deep Reinforcement Learning and The Tale of Two Temporal Difference Errors
by: Rojas, Juan Sebastian, et al.
Published: (2026)

Optimal Time Complexity Algorithms for Computing General Random Walk Graph Kernels on Sparse Graphs
by: Choromanski, Krzysztof, et al.
Published: (2024)

Flock: A Knowledge Graph Foundation Model via Learning on Random Walks
by: Kim, Jinwoo, et al.
Published: (2025)

A Tale of Two Variances: When Single-Seed Benchmarks Fail in Bayesian Deep Learning
by: Zhan, Qishi, et al.
Published: (2026)

Technical Report: On the Convergence of Gossip Learning in the Presence of Node Inaccessibility
by: Liu, Tian, et al.
Published: (2024)

On the Statistical Query Complexity of Learning Semiautomata: a Random Walk Approach
by: Giapitzakis, George, et al.
Published: (2025)

Unveiling the Power of Multiple Gossip Steps: A Stability-Based Generalization Analysis in Decentralized Training
by: Li, Qinglun, et al.
Published: (2025)

A Tale of Two Geometries: Adaptive Optimizers and Non-Euclidean Descent
by: Xie, Shuo, et al.
Published: (2025)

Actor-Critic or Critic-Actor? A Tale of Two Time Scales
by: Bhatnagar, Shalabh, et al.
Published: (2022)

A Tale of Two Cities: Pessimism and Opportunism in Offline Dynamic Pricing
by: Bian, Zeyu, et al.
Published: (2024)

Incremental Sequence Labeling: A Tale of Two Shifts
by: Qiu, Shengjie, et al.
Published: (2024)

Random Walk Learning and the Pac-Man Attack
by: Chen, Xingran, et al.
Published: (2025)

Random Walk Guided Hyperbolic Graph Distillation
by: Long, Yunbo, et al.
Published: (2025)

AdaGossip: Adaptive Consensus Step-size for Decentralized Deep Learning with Communication Compression
by: Aketi, Sai Aparna, et al.
Published: (2024)

Learning From Simplicial Data Based on Random Walks and 1D Convolutions
by: Frantzen, Florian, et al.
Published: (2024)

The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits
by: Chawla, Ronshee, et al.
Published: (2020)

Learning in Inverse Optimization: Incenter Cost, Augmented Suboptimality Loss, and Algorithms
by: Scroccaro, Pedro Zattoni, et al.
Published: (2023)

A Tale of Two Problems: Multi-Task Bilevel Learning Meets Equality Constrained Multi-Objective Optimization
by: Zhang, Zhiyao, et al.
Published: (2026)

Learning Randomized Algorithms with Transformers
by: von Oswald, Johannes, et al.
Published: (2024)

Byzantine-Robust Gossip: Insights from a Dual Approach
by: Gaucher, Renaud, et al.
Published: (2024)

Unified Breakdown Analysis for Byzantine Robust Gossip
by: Gaucher, Renaud, et al.
Published: (2024)