Hugging Face Trending Papers

Autonomous Collaborative Learning Among an Ensemble of Tsetlin Machines with Consensus-Based Inference

Tsetlin Machine (TM) is a rule-based machine-learning algorithm comprising collectives of two-action Tsetlin Automata (TAs) that cooperatively form conjunctive logical clauses from Boolean inputs through stochastic feedback. Although few recent studies have examined TM Federated Learning, the broader area of distributed and decentralized TM learning has not received much attention in the existing literature and warrants further exploration.

arXiv Machine Learning
Jul 23

Autonomous Collaborative Learning Among an Ensemble of Tsetlin Machines with Consensus-Based Inference

arXiv:2607. 20124v1 Announce Type: new Abstract: Tsetlin Machine (TM) is a rule-based machine-learning algorithm comprising collectives of two-action Tsetlin Automata (TAs) that cooperatively form conjunctive logical clauses from Boolean inputs through stochastic feedback.

By Yehuda Rudin, Osnat Keren, Michal Yemini, Alexander Fish
arXiv AI
Oct 5

Cordial Learning: Distributed Training with Correlated Data

The paper introduces cordial learning, a distributed training framework for agents with correlated data, where each agent’s label depends on inputs from other agents. By sharing only low‑dimensional outputs, agents train local models that extract informative signals from peers, forming a game‑theoretic loss that depends on others’ models. The authors prove convergence to a globally optimal solution for linear models and show empirical effectiveness on structured multi‑digit MNIST tasks, even in nonlinear settings.

By Sarah Shitrit, Ilai Bistritz
arXiv Machine Learning
Oct 3

Latent Information Sharing for Accelerating Federated Learning

The paper introduces a latent information sharing scheme for federated learning that mitigates client drift by sharing a small amount of hidden‑layer activations. The authors demonstrate both theoretically and empirically that this approach improves training efficiency while maintaining convergence guarantees and data privacy. Compared to existing methods such as FedProx, SCAFFOLD, FedPVR, FedProto, and SplitFed, the proposed method achieves higher model accuracy within a fixed round budget without adding significant communication overhead.

By Seungjun Lee, Ensieh Khazaei, Dimitrios Hatzinakos, Baturalp Buyukates, Sunwoo Lee