Unsupervised collaborative learning based on Optimal Transport theory

• URL: http://arxiv.org/abs/2103.12071v1
• Date: Mon, 22 Mar 2021 17:28:50 GMT
• Title: Unsupervised collaborative learning based on Optimal Transport theory
• Authors: Fatima Ezzahraa Ben Bouazza, Youn\`es Bennani
• Abstract summary: Collaborative learning has recently achieved very significant results. It still suffers from several issues, including the type of information that needs to be exchanged, the criteria for stopping and how to choose the right collaborators. We aim in this paper to improve the quality of the collaboration and to resolve these issues via a novel approach inspired by Optimal Transport theory.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Collaborative learning has recently achieved very significant results. It still suffers, however, from several issues, including the type of information that needs to be exchanged, the criteria for stopping and how to choose the right collaborators. We aim in this paper to improve the quality of the collaboration and to resolve these issues via a novel approach inspired by Optimal Transport theory. More specifically, the objective function for the exchange of information is based on the Wasserstein distance, with a bidirectional transport of information between collaborators. This formulation allows to learns a stopping criterion and provide a criterion to choose the best collaborators. Extensive experiments are conducted on multiple data-sets to evaluate the proposed approach.

Related papers

• Have We Really Understood Collaborative Information? An Empirical Investigation [30.425340147697842]
  Collaborative information serves as the cornerstone of recommender systems.<n>We clarify collaborative information in terms of item co-occurrence patterns, identifying its main characteristics, and presenting a quantitative definition.<n>We then estimate the distribution of collaborative information from several aspects, shedding light on how collaborative information is structured in practice.
  arXiv  Detail & Related papers  (2025-11-10T10:00:26Z)
• Rate-Distortion Optimized Communication for Collaborative Perception [47.737814518681326]
  We introduce a pragmatic rate-distortion theory for multi-agent collaboration, specifically formulated to analyze performance-communication trade-off.<n>We propose RDcomm, a communication-efficient collaborative perception framework that introduces two key innovations.<n>Experiments on 3D object detection and BEV segmentation demonstrate that RDcomm achieves state-of-the-art accuracy on DAIR-V2X and OPV2V, while reducing communication volume by up to 108 times.
  arXiv  Detail & Related papers  (2025-09-26T07:21:32Z)
• Adaptive collaboration for online personalized distributed learning with heterogeneous clients [22.507916490976044]
  We study the problem of online personalized learning with $N$ statistically heterogeneous clients collaborating to accelerate local training.<n>An important challenge in this setting is to select relevant collaborators to reduce variance while mitigating the introduced bias.
  arXiv  Detail & Related papers  (2025-07-09T13:44:27Z)
• Tacit Learning with Adaptive Information Selection for Cooperative Multi-Agent Reinforcement Learning [13.918498667158119]
  We introduce a novel cooperative MARL framework based on information selection and tacit learning. We integrate gating and selection mechanisms, allowing agents to adaptively filter information based on environmental changes. Experiments on popular MARL benchmarks show that our framework can be seamlessly integrated with state-of-the-art algorithms.
  arXiv  Detail & Related papers  (2024-12-20T07:55:59Z)
• Studying the Effects of Collaboration in Interactive Theme Discovery Systems [44.14387961657699]
  We study the impact of synchronous vs. asynchronous collaboration using two different NLP-assisted qualitative research tools. We present a comprehensive analysis of significant differences in the consistency, cohesiveness, and correctness of their outputs.
  arXiv  Detail & Related papers  (2024-08-16T21:57:23Z)
• Deep Pareto Reinforcement Learning for Multi-Objective Recommender Systems [60.91599969408029]
  optimizing multiple objectives simultaneously is an important task for recommendation platforms. Existing multi-objective recommender systems do not systematically consider such dynamic relationships.
  arXiv  Detail & Related papers  (2024-07-04T02:19:49Z)
• Emulating Full Participation: An Effective and Fair Client Selection Strategy for Federated Learning [50.060154488277036]
  In federated learning, client selection is a critical problem that significantly impacts both model performance and fairness. We propose two guiding principles that tackle the inherent conflict between the two metrics while reinforcing each other. Our approach adaptively enhances this diversity by selecting clients based on their data distributions, thereby improving both model performance and fairness.
  arXiv  Detail & Related papers  (2024-05-22T12:27:24Z)
• Collaborative Active Learning in Conditional Trust Environment [1.3846014191157405]
  We investigate collaborative active learning, a paradigm in which multiple collaborators explore a new domain by leveraging their combined machine learning capabilities without disclosing their existing data and models. This collaboration offers several advantages: (a) it addresses privacy and security concerns by eliminating the need for direct model and data disclosure; (b) it enables the use of different data sources and insights without direct data exchange; and (c) it promotes cost-effectiveness and resource efficiency through shared labeling costs.
  arXiv  Detail & Related papers  (2024-03-27T10:40:27Z)
• Collective Counterfactual Explanations via Optimal Transport [3.97478982737167]
  We propose a collective approach for formulating counterfactual explanations. Our problem naturally casts as an optimal transport problem. We illustrate how this collective method improves upon the desiderata of classical counterfactual explanations.
  arXiv  Detail & Related papers  (2024-02-07T04:39:23Z)
• Optimising Human-AI Collaboration by Learning Convincing Explanations [62.81395661556852]
  We propose a method for a collaborative system that remains safe by having a human making decisions. Ardent enables efficient and effective decision-making by adapting to individual preferences for explanations.
  arXiv  Detail & Related papers  (2023-11-13T16:00:16Z)
• Exploring Federated Unlearning: Analysis, Comparison, and Insights [101.64910079905566]
  federated unlearning enables the selective removal of data from models trained in federated systems. This paper examines existing federated unlearning approaches, examining their algorithmic efficiency, impact on model accuracy, and effectiveness in preserving privacy. We propose the OpenFederatedUnlearning framework, a unified benchmark for evaluating federated unlearning methods.
  arXiv  Detail & Related papers  (2023-10-30T01:34:33Z)
• UMC: A Unified Bandwidth-efficient and Multi-resolution based Collaborative Perception Framework [20.713675020714835]
  We propose a Unified Collaborative perception framework named UMC. It is designed to optimize the communication, collaboration, and reconstruction processes with the Multi-resolution technique. Our experiments prove that the proposed UMC greatly outperforms the state-of-the-art collaborative perception approaches.
  arXiv  Detail & Related papers  (2023-03-22T09:09:02Z)
• Assisting Human Decisions in Document Matching [52.79491990823573]
  We devise a proxy matching task that allows us to evaluate which kinds of assistive information improve decision makers' performance. We find that providing black-box model explanations reduces users' accuracy on the matching task. On the other hand, custom methods that are designed to closely attend to some task-specific desiderata are found to be effective in improving user performance.
  arXiv  Detail & Related papers  (2023-02-16T17:45:20Z)
• Efficient Real-world Testing of Causal Decision Making via Bayesian Experimental Design for Contextual Optimisation [12.37745209793872]
  We introduce a model-agnostic framework for gathering data to evaluate and improve contextual decision making. Our method is used for the data-efficient evaluation of the regret of past treatment assignments.
  arXiv  Detail & Related papers  (2022-07-12T01:20:11Z)
• Visualizing the Relationship Between Encoded Linguistic Information and Task Performance [53.223789395577796]
  We study the dynamic relationship between the encoded linguistic information and task performance from the viewpoint of Pareto Optimality. We conduct experiments on two popular NLP tasks, i.e., machine translation and language modeling, and investigate the relationship between several kinds of linguistic information and task performances. Our empirical findings suggest that some syntactic information is helpful for NLP tasks whereas encoding more syntactic information does not necessarily lead to better performance.
  arXiv  Detail & Related papers  (2022-03-29T19:03:10Z)
• A Field Guide to Federated Optimization [161.3779046812383]
  Federated learning and analytics are a distributed approach for collaboratively learning models (or statistics) from decentralized data. This paper provides recommendations and guidelines on formulating, designing, evaluating and analyzing federated optimization algorithms.
  arXiv  Detail & Related papers  (2021-07-14T18:09:08Z)
• Learning to Recover Reasoning Chains for Multi-Hop Question Answering via Cooperative Games [66.98855910291292]
  We propose a new problem of learning to recover reasoning chains from weakly supervised signals. How the evidence passages are selected and how the selected passages are connected are handled by two models. For evaluation, we created benchmarks based on two multi-hop QA datasets.
  arXiv  Detail & Related papers  (2020-04-06T03:54:38Z)

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.