Collaborative Content Moderation in the Fediverse

• URL: http://arxiv.org/abs/2501.05871v1
• Date: Fri, 10 Jan 2025 11:12:03 GMT
• Title: Collaborative Content Moderation in the Fediverse
• Abstract summary: This paper focuses on one particular challenge: content moderation, e.g. the need to remove spam or hate speech.<n>We design and evaluate FedMod, a collaborative content moderation system based on federated learning.<n>Our system enables servers to exchange parameters of partially trained local content moderation models with similar servers, creating a federated model shared among collaborating servers.
• Score: 8.001727491022999
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Fediverse, a group of interconnected servers providing a variety of interoperable services (e.g. micro-blogging in Mastodon) has gained rapid popularity. This sudden growth, partly driven by Elon Musk's acquisition of Twitter, has created challenges for administrators though. This paper focuses on one particular challenge: content moderation, e.g. the need to remove spam or hate speech. While centralized platforms like Facebook and Twitter rely on automated tools for moderation, their dependence on massive labeled datasets and specialized infrastructure renders them impractical for decentralized, low-resource settings like the Fediverse. In this work, we design and evaluate FedMod, a collaborative content moderation system based on federated learning. Our system enables servers to exchange parameters of partially trained local content moderation models with similar servers, creating a federated model shared among collaborating servers. FedMod demonstrates robust performance on three different content moderation tasks: harmful content detection, bot content detection, and content warning assignment, achieving average per-server macro-F1 scores of 0.71, 0.73, and 0.58, respectively.

Related papers

• DeTox-Fed: Detecting Toxic Conversations in the Fediverse with Federated Graph Neural Networks [0.18665975431697424]
  DeTox-Fed is a graph-learning framework for detecting toxic conversations in decentralized social networks.<n>It combines conversational structure, user-interaction patterns, conversation-level statistics, and aggregate sentiment signals.<n>We show that it achieves stable toxic conversation detection under limited local labels, partial client participation, and varying moderation thresholds.
  arXiv  Detail & Related papers  (2026-05-20T11:41:27Z)
• dFLMoE: Decentralized Federated Learning via Mixture of Experts for Medical Data Analysis [45.92342950385488]
  We propose a decentralized federated learning framework named dFLMoE. In our framework, clients directly exchange lightweight head models with each other. We validate our framework on multiple medical tasks, demonstrating that our method evidently outperforms state-of-the-art approaches.
  arXiv  Detail & Related papers  (2025-03-13T14:35:47Z)
• Decentralised Moderation for Interoperable Social Networks: A Conversation-based Approach for Pleroma and the Fediverse [10.791075186479622]
  We propose a decentralised conversation-aware content moderation approach suitable for the fediverse. Our approach employs a graph deep learning model (GraphNLI) trained locally on each server. Our model effectively detects toxicity on larger instances, exclusively trained using their local post information.
  arXiv  Detail & Related papers  (2024-04-03T20:29:40Z)
• Content Moderation on Social Media in the EU: Insights From the DSA Transparency Database [0.0]
  Digital Services Act (DSA) requires large social media platforms in the EU to provide clear and specific information whenever they restrict access to certain content. Statements of Reasons (SoRs) are collected in the DSA Transparency Database to ensure transparency and scrutiny of content moderation decisions. We empirically analyze 156 million SoRs within an observation period of two months to provide an early look at content moderation decisions of social media platforms in the EU.
  arXiv  Detail & Related papers  (2023-12-07T16:56:19Z)
• Scalable Collaborative Learning via Representation Sharing [53.047460465980144]
  Federated learning (FL) and Split Learning (SL) are two frameworks that enable collaborative learning while keeping the data private (on device) In FL, each data holder trains a model locally and releases it to a central server for aggregation. In SL, the clients must release individual cut-layer activations (smashed data) to the server and wait for its response (during both inference and back propagation). In this work, we present a novel approach for privacy-preserving machine learning, where the clients collaborate via online knowledge distillation using a contrastive loss.
  arXiv  Detail & Related papers  (2022-11-20T10:49:22Z)
• Meta Knowledge Condensation for Federated Learning [65.20774786251683]
  Existing federated learning paradigms usually extensively exchange distributed models at a central solver to achieve a more powerful model. This would incur severe communication burden between a server and multiple clients especially when data distributions are heterogeneous. Unlike existing paradigms, we introduce an alternative perspective to significantly decrease the communication cost in federate learning.
  arXiv  Detail & Related papers  (2022-09-29T15:07:37Z)
• MetaFed: Federated Learning among Federations with Cyclic Knowledge Distillation for Personalized Healthcare [22.248585185394347]
  Federated learning has attracted increasing attention to building models without accessing the raw user data. We propose a novel framework called MetaFed to facilitate trustworthy FL between different federations.
  arXiv  Detail & Related papers  (2022-06-17T02:36:23Z)
• Toxicity in the Decentralized Web and the Potential for Model Sharing [7.499765577591378]
  "Decentralised Web" (DW) relies on independent servers that mesh together in a peer-to-peer fashion to deliver a range of services. We quantify the presence of toxic content using a dataset of 9.9M posts from 117K users on Pleroma. We show that automating per-instance content moderation is challenging due to the lack of sufficient training data available and the effort required in labelling.
  arXiv  Detail & Related papers  (2022-04-27T05:42:51Z)
• Byzantine-Robust Decentralized Learning via ClippedGossip [61.03711813598128]
  We propose a ClippedGossip algorithm for Byzantine-robust consensus optimization. We demonstrate the encouraging empirical performance of ClippedGossip under a large number of attacks.
  arXiv  Detail & Related papers  (2022-02-03T12:04:36Z)
• Collaborative Unsupervised Visual Representation Learning from Decentralized Data [34.06624704343615]
  We propose a novel federated unsupervised learning framework, FedU. In this framework, each party trains models from unlabeled data independently using contrastive learning with an online network and a target network. FedU preserves data privacy as each party only has access to its raw data.
  arXiv  Detail & Related papers  (2021-08-14T08:34:11Z)
• Secure Distributed Training at Scale [65.7538150168154]
  Training in presence of peers requires specialized distributed training algorithms with Byzantine tolerance. We propose a novel protocol for secure (Byzantine-tolerant) decentralized training that emphasizes communication efficiency.
  arXiv  Detail & Related papers  (2021-06-21T17:00:42Z)
• News consumption and social media regulations policy [70.31753171707005]
  We analyze two social media that enforced opposite moderation methods, Twitter and Gab, to assess the interplay between news consumption and content regulation. Our results show that the presence of moderation pursued by Twitter produces a significant reduction of questionable content. The lack of clear regulation on Gab results in the tendency of the user to engage with both types of content, showing a slight preference for the questionable ones which may account for a dissing/endorsement behavior.
  arXiv  Detail & Related papers  (2021-06-07T19:26:32Z)
• WAFFLe: Weight Anonymized Factorization for Federated Learning [88.44939168851721]
  In domains where data are sensitive or private, there is great value in methods that can learn in a distributed manner without the data ever leaving the local devices. We propose Weight Anonymized Factorization for Federated Learning (WAFFLe), an approach that combines the Indian Buffet Process with a shared dictionary of weight factors for neural networks.
  arXiv  Detail & Related papers  (2020-08-13T04:26:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.