Fast and Efficient Local Search for Genetic Programming Based Loss Function Learning

Christian Raymond, Qi Chen, Bing Xue, Mengjie Zhang
3/1/2024
cs.NEcs.AIcs.CV

No official code found. Best implementation: Decadz/Evolved-Model-Agnostic-Loss (16 stars, MIT, PyTorch, last commit 2024-08-05).

Abstract

In this paper, we develop upon the topic of loss function learning, an emergent meta-learning paradigm that aims to learn loss functions that significantly improve the performance of the models trained under them. Specifically, we propose a new meta-learning framework for task and model-agnostic loss function learning via a hybrid search approach. The framework first uses genetic programming to find a set of symbolic loss functions. Second, the set of learned loss functions is subsequently parameterized and optimized via unrolled differentiation. The versatility and performance of the proposed framework are empirically validated on a diverse set of supervised learning tasks. Results show that the learned loss functions bring improved convergence, sample efficiency, and inference performance on tabulated, computer vision, and natural language processing problems, using a variety of task-specific neural network architectures.

View on arXivView PDF

Code Implementations(1)

PyTorchMIT

[TPAMI 2023] Learning Symbolic Model-Agnostic Loss Functions via Meta-Learning. Paper Link: https://arxiv.org/abs/2209.08907

160PythonJul 19, 20222 years agoMIT
loss-function-learningmeta-learningpytorch

Similar Papers

Cite this paper

@article{raymond2024fast,
  title  = {Fast and Efficient Local Search for Genetic Programming Based Loss Function Learning},
  author = {Christian Raymond and Qi Chen and Bing Xue and Mengjie Zhang},
  year   = {2024},
  eprint = {2403.00865},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.00865v1}
}

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/2403.00865.svg)](https://codeofpaper.com/paper/2403.00865)

Discussion