How to solve a classification problem using a cooperative tiling Multi-Agent System?

• URL: http://arxiv.org/abs/2209.14239v1
• Date: Thu, 15 Sep 2022 09:35:33 GMT
• Title: How to solve a classification problem using a cooperative tiling Multi-Agent System?
• Authors: Thibault Fourez (IRIT-SMAC), Nicolas Verstaevel (IRIT-SMAC), Fr\'ed\'eric Migeon (IRIT-SMAC), Fr\'ed\'eric Schettini, Fr\'ed\'eric Amblard (IRIT-SMAC)
• Abstract summary: We propose a framework to transform a classification problem into a cooperative tiling of the input variable space. We show that it is possible to use linear classifiers for online non-linear classification on three benchmark toy problems chosen for their different levels of linear separability.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Adaptive Multi-Agent Systems (AMAS) transform dynamic problems into problems of local cooperation between agents. We present smapy, an ensemble based AMAS implementation for mobility prediction, whose agents are provided with machine learning models in addition to their cooperation rules. With a detailed methodology, we propose a framework to transform a classification problem into a cooperative tiling of the input variable space. We show that it is possible to use linear classifiers for online non-linear classification on three benchmark toy problems chosen for their different levels of linear separability, if they are integrated in a cooperative Multi-Agent structure. The results obtained show a significant improvement of the performance of linear classifiers in non-linear contexts in terms of classification accuracy and decision boundaries, thanks to the cooperative approach.

Related papers

• POGEMA: A Benchmark Platform for Cooperative Multi-Agent Navigation [76.67608003501479]
  We introduce and specify an evaluation protocol defining a range of domain-related metrics computed on the basics of the primary evaluation indicators. The results of such a comparison, which involves a variety of state-of-the-art MARL, search-based, and hybrid methods, are presented.
  arXiv  Detail & Related papers  (2024-07-20T16:37:21Z)
• Toward Multi-class Anomaly Detection: Exploring Class-aware Unified Model against Inter-class Interference [67.36605226797887]
  We introduce a Multi-class Implicit Neural representation Transformer for unified Anomaly Detection (MINT-AD) By learning the multi-class distributions, the model generates class-aware query embeddings for the transformer decoder. MINT-AD can project category and position information into a feature embedding space, further supervised by classification and prior probability loss functions.
  arXiv  Detail & Related papers  (2024-03-21T08:08:31Z)
• MISS: Multiclass Interpretable Scoring Systems [13.902264070785986]
  We present a machine-learning approach for constructing Multiclass Interpretable Scoring Systems (MISS) MISS is a fully data-driven methodology for single, sparse, and user-friendly scoring systems for multiclass classification problems. Results indicate that our approach is competitive with other machine learning models in terms of classification performance metrics and provides well-calibrated class probabilities.
  arXiv  Detail & Related papers  (2024-01-10T10:57:12Z)
• Lp-Norm Constrained One-Class Classifier Combination [18.27510863075184]
  We consider the one-class classification problem by modelling the sparsity/uniformity of the ensemble. We present an effective approach to solve formulated convex constrained problem efficiently.
  arXiv  Detail & Related papers  (2023-12-25T16:32:34Z)
• On the existence of solutions to adversarial training in multiclass classification [0.0]
  We prove the existence of Borel measurable robust classifiers in three models of the problem of adversarial training in multiclass classification. As a corollary to our results, we prove the existence of Borel measurable solutions to the agnostic adversarial training problem in the binary classification setting.
  arXiv  Detail & Related papers  (2023-04-28T20:03:30Z)
• Adaptive Multi-Agent Continuous Learning System [1.2752808844888015]
  We propose an adaptive multi-agent clustering recognition system that can be self-supervised driven. The system is designed to use some different functional agents to build up a connection structure to improve adaptability to cope with environmental diverse demands.
  arXiv  Detail & Related papers  (2022-12-15T07:39:50Z)
• An ensemble Multi-Agent System for non-linear classification [0.0]
  smapy is an ensemble based AMAS implementation for mobility prediction. We show that it is possible to use linear models for nonlinear classification on a benchmark transport mode detection dataset.
  arXiv  Detail & Related papers  (2022-09-14T08:22:11Z)
• Semi-supervised Domain Adaptive Structure Learning [72.01544419893628]
  Semi-supervised domain adaptation (SSDA) is a challenging problem requiring methods to overcome both 1) overfitting towards poorly annotated data and 2) distribution shift across domains. We introduce an adaptive structure learning method to regularize the cooperation of SSL and DA.
  arXiv  Detail & Related papers  (2021-12-12T06:11:16Z)
• Efficient Model-Based Multi-Agent Mean-Field Reinforcement Learning [89.31889875864599]
  We propose an efficient model-based reinforcement learning algorithm for learning in multi-agent systems. Our main theoretical contributions are the first general regret bounds for model-based reinforcement learning for MFC. We provide a practical parametrization of the core optimization problem.
  arXiv  Detail & Related papers  (2021-07-08T18:01:02Z)
• Semantic Correspondence with Transformers [68.37049687360705]
  We propose Cost Aggregation with Transformers (CATs) to find dense correspondences between semantically similar images. We include appearance affinity modelling to disambiguate the initial correlation maps and multi-level aggregation. We conduct experiments to demonstrate the effectiveness of the proposed model over the latest methods and provide extensive ablation studies.
  arXiv  Detail & Related papers  (2021-06-04T14:39:03Z)
• Convolutional Dynamic Alignment Networks for Interpretable Classifications [108.83345790813445]
  We introduce a new family of neural network models called Convolutional Dynamic Alignment Networks (CoDA-Nets) Their core building blocks are Dynamic Alignment Units (DAUs), which linearly transform their input with weight vectors that dynamically align with task-relevant patterns. CoDA-Nets model the classification prediction through a series of input-dependent linear transformations, allowing for linear decomposition of the output into individual input contributions.
  arXiv  Detail & Related papers  (2021-03-31T18:03:53Z)

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.