Auxiliary Learning as an Asymmetric Bargaining Game

Aviv Shamsian, Aviv Navon, Neta Glazer, Kenji Kawaguchi, Gal Chechik +1 more
1/1/2023

No official code found. Best implementation: AvivSham/auxinash (34 stars, MIT, last commit 2024-01-19).

Abstract

Auxiliary learning is an effective method for enhancing the generalization capabilities of trained models, particularly when dealing with small datasets. However, this approach may present several difficulties: (i) optimizing multiple objectives can be more challenging, and (ii) how to balance the auxiliary tasks to best assist the main task is unclear. In this work, we propose a novel approach, named AuxiNash, for balancing tasks in auxiliary learning by formalizing the problem as generalized bargaining game with asymmetric task bargaining power. Furthermore, we describe an efficient procedure for learning the bargaining power of tasks based on their contribution to the performance of the main task and derive theoretical guarantees for its convergence. Finally, we evaluate AuxiNash on multiple multi-task benchmarks and find that it consistently outperforms competing methods.

View on arXivView PDF

Code Implementations(1)

AvivSham/auxinashCommunity100%
MIT

Official implementation of Auxiliary learning as an Bargaining Game.

343PythonFeb 14, 20232 years agoMIT

Similar Papers

Cite this paper

@article{shamsian2023auxiliary,
  title  = {Auxiliary Learning as an Asymmetric Bargaining Game},
  author = {Aviv Shamsian and Aviv Navon and Neta Glazer and Kenji Kawaguchi and Gal Chechik and Ethan Fetaya},
  year   = {2023},
  eprint = {2301.13501},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/pdf/2301.13501},
  journal = {ICML 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.13501.svg)](https://codeofpaper.com/paper/2301.13501)

Discussion