Batch Selection and Communication for Active Learning with Edge Labeling

• URL: http://arxiv.org/abs/2311.08053v4
• Date: Wed, 22 May 2024 21:47:03 GMT
• Title: Batch Selection and Communication for Active Learning with Edge Labeling
• Authors: Victor Croisfelt, Shashi Raj Pandey, Osvaldo Simeone, Petar Popovski,
• Abstract summary: Communication-Constrained Bayesian Active Knowledge Distillation (CC-BAKD) This work introduces Communication-Constrained Bayesian Active Knowledge Distillation (CC-BAKD)
• Score: 54.64985724916654
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Conventional retransmission (ARQ) protocols are designed with the goal of ensuring the correct reception of all the individual transmitter's packets at the receiver. When the transmitter is a learner communicating with a teacher, this goal is at odds with the actual aim of the learner, which is that of eliciting the most relevant label information from the teacher. Taking an active learning perspective, this paper addresses the following key protocol design questions: (i) Active batch selection: Which batch of inputs should be sent to the teacher to acquire the most useful information and thus reduce the number of required communication rounds? (ii) Batch encoding: Can batches of data points be combined to reduce the communication resources required at each communication round? Specifically, this work introduces Communication-Constrained Bayesian Active Knowledge Distillation (CC-BAKD), a novel protocol that integrates Bayesian active learning with compression via a linear mix-up mechanism. Comparisons with existing active learning protocols demonstrate the advantages of the proposed approach.

Related papers

• Learning to Construct Implicit Communication Channel [15.362651398484633]
  Implicit communication is an essential component in collaborative multi-agent systems. Previous works on learning implicit communication mostly rely on theory of mind (ToM) We propose the Implicit Channel Protocol (ICP) framework, which allows agents to construct implicit communication channels similar to the explicit ones.
  arXiv  Detail & Related papers  (2024-11-03T12:58:22Z)
• Will 6G be Semantic Communications? Opportunities and Challenges from Task Oriented and Secure Communications to Integrated Sensing [49.83882366499547]
  This paper explores opportunities and challenges of task (goal)-oriented and semantic communications for next-generation (NextG) networks through the integration of multi-task learning. We employ deep neural networks representing a dedicated encoder at the transmitter and multiple task-specific decoders at the receiver. We scrutinize potential vulnerabilities stemming from adversarial attacks during both training and testing phases.
  arXiv  Detail & Related papers  (2024-01-03T04:01:20Z)
• Context-aware Communication for Multi-agent Reinforcement Learning [6.109127175562235]
  We develop a context-aware communication scheme for multi-agent reinforcement learning (MARL) In the first stage, agents exchange coarse representations in a broadcast fashion, providing context for the second stage. Following this, agents utilize attention mechanisms in the second stage to selectively generate messages personalized for the receivers. To evaluate the effectiveness of CACOM, we integrate it with both actor-critic and value-based MARL algorithms.
  arXiv  Detail & Related papers  (2023-12-25T03:33:08Z)
• Multi-Receiver Task-Oriented Communications via Multi-Task Deep Learning [49.83882366499547]
  This paper studies task-oriented, otherwise known as goal-oriented, communications in a setting where a transmitter communicates with multiple receivers. A multi-task deep learning approach is presented for joint optimization of completing multiple tasks and communicating with multiple receivers.
  arXiv  Detail & Related papers  (2023-08-14T01:34:34Z)
• Adversarial Learning for Implicit Semantic-Aware Communications [104.08383219177557]
  We develop a novel adversarial learning-based implicit semantic-aware communication architecture (iSAC) We prove that by applying iSAC, the destination user can always learn an inference rule that matches the true inference rule of the source messages. Experimental results show that the proposed iSAC can offer up to a 19.69 dB improvement over existing non-inferential communication solutions.
  arXiv  Detail & Related papers  (2023-01-27T08:28:12Z)
• Learning to Communicate with Intent: An Introduction [2.007345596217044]
  We propose a novel framework to learn how to transmit messages over a wireless communication channel based on the end-goal of the communication. This stays in stark contrast to classical communication systems where the objective is to reproduce at the receiver side either exactly or approximately the message sent by the transmitter.
  arXiv  Detail & Related papers  (2022-11-17T16:02:13Z)
• Communication-Efficient and Privacy-Preserving Feature-based Federated Transfer Learning [11.758703301702012]
  Federated learning has attracted growing interest as it preserves the clients' privacy. Due to the limited radio spectrum, the communication efficiency of federated learning via wireless links is critical. We propose a feature-based federated transfer learning as an innovative approach to reduce the uplink payload by more than five orders of magnitude.
  arXiv  Detail & Related papers  (2022-09-12T16:48:52Z)
• Common Language for Goal-Oriented Semantic Communications: A Curriculum Learning Framework [66.81698651016444]
  A comprehensive semantic communications framework is proposed for enabling goal-oriented task execution. A novel top-down framework that combines curriculum learning (CL) and reinforcement learning (RL) is proposed to solve this problem. Simulation results show that the proposed CL method outperforms traditional RL in terms of convergence time, task execution time, and transmission cost during training.
  arXiv  Detail & Related papers  (2021-11-15T19:13:55Z)
• Exploring Zero-Shot Emergent Communication in Embodied Multi-Agent Populations [59.608216900601384]
  We study agents that learn to communicate via actuating their joints in a 3D environment. We show that under realistic assumptions, a non-uniform distribution of intents and a common-knowledge energy cost, these agents can find protocols that generalize to novel partners.
  arXiv  Detail & Related papers  (2020-10-29T19:23:10Z)
• Correcting Experience Replay for Multi-Agent Communication [18.12281605882891]
  We consider the problem of learning to communicate using multi-agent reinforcement learning (MARL) A common approach is to learn off-policy, using data sampled from a replay buffer. We introduce a 'communication correction' which accounts for the non-stationarity of observed communication induced by MARL.
  arXiv  Detail & Related papers  (2020-10-02T20:49:24Z)

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.