TinyverseGP: Towards a Modular Cross-domain Benchmarking Framework for Genetic Programming

• URL: http://arxiv.org/abs/2504.10253v1
• Date: Mon, 14 Apr 2025 14:14:27 GMT
• Title: TinyverseGP: Towards a Modular Cross-domain Benchmarking Framework for Genetic Programming
• Abstract summary: Genetic programming (GP) is capable of tackling multiple problem domains.<n>We propose a unified framework, dubbed TinyverseGP, which provides support to multiple representations and problem domains.
• Score: 2.764155611699866
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Over the years, genetic programming (GP) has evolved, with many proposed variations, especially in how they represent a solution. Being essentially a program synthesis algorithm, it is capable of tackling multiple problem domains. Current benchmarking initiatives are fragmented, as the different representations are not compared with each other and their performance is not measured across the different domains. In this work, we propose a unified framework, dubbed TinyverseGP (inspired by tinyGP), which provides support to multiple representations and problem domains, including symbolic regression, logic synthesis and policy search.

Related papers

• Transformer Semantic Genetic Programming for Symbolic Regression [0.8602553195689513]
  Transformer Genetic Programming (TSGP) is a novel and flexible semantic approach that uses a generative transformer model as search operator.<n>The model is trained on synthetic test problems and learns semantic similarities between solutions.<n>An analysis of the search dynamic reveals that the solutions generated by TSGP are semantically more similar than the solutions generated by the benchmark approaches.
  arXiv  Detail & Related papers  (2025-01-30T16:51:44Z)
• Multi-Representation Genetic Programming: A Case Study on Tree-based and Linear Representations [4.999866990999739]
  This paper proposes a multi-representation GP algorithm based on tree-based and linear representations. We also develop a new cross-representation crossover operator to harness the interplay between tree-based and linear representations. Empirical results show that navigating the learned knowledge between basic tree-based and linear representations successfully improves the effectiveness of GP.
  arXiv  Detail & Related papers  (2024-05-23T07:47:06Z)
• Domain Generalization via Causal Adjustment for Cross-Domain Sentiment Analysis [59.73582306457387]
  We focus on the problem of domain generalization for cross-domain sentiment analysis. We propose a backdoor adjustment-based causal model to disentangle the domain-specific and domain-invariant representations. A series of experiments show the great performance and robustness of our model.
  arXiv  Detail & Related papers  (2024-02-22T13:26:56Z)
• Multi-label Image Classification using Adaptive Graph Convolutional Networks: from a Single Domain to Multiple Domains [8.02139126500224]
  This paper proposes an adaptive graph-based approach for multi-label image classification. It is done by integrating an attention-based mechanism and a similarity-preserving strategy. The proposed framework is then extended to multiple domains using an adversarial training scheme.
  arXiv  Detail & Related papers  (2023-01-11T14:42:47Z)
• Multi-Domain Long-Tailed Learning by Augmenting Disentangled Representations [80.76164484820818]
  There is an inescapable long-tailed class-imbalance issue in many real-world classification problems. We study this multi-domain long-tailed learning problem and aim to produce a model that generalizes well across all classes and domains. Built upon a proposed selective balanced sampling strategy, TALLY achieves this by mixing the semantic representation of one example with the domain-associated nuisances of another.
  arXiv  Detail & Related papers  (2022-10-25T21:54:26Z)
• Failure Modes of Domain Generalization Algorithms [29.772370301145543]
  We propose an evaluation framework for domain generalization algorithms. We show that the largest contributor to the generalization error varies across methods, datasets, regularization strengths and even training lengths.
  arXiv  Detail & Related papers  (2021-11-26T20:04:19Z)
• Model-Based Domain Generalization [96.84818110323518]
  We propose a novel approach for the domain generalization problem called Model-Based Domain Generalization. Our algorithms beat the current state-of-the-art methods on the very-recently-proposed WILDS benchmark by up to 20 percentage points.
  arXiv  Detail & Related papers  (2021-02-23T00:59:02Z)
• Cross-Domain Grouping and Alignment for Domain Adaptive Semantic Segmentation [74.3349233035632]
  Existing techniques to adapt semantic segmentation networks across the source and target domains within deep convolutional neural networks (CNNs) do not consider an inter-class variation within the target domain itself or estimated category. We introduce a learnable clustering module, and a novel domain adaptation framework called cross-domain grouping and alignment. Our method consistently boosts the adaptation performance in semantic segmentation, outperforming the state-of-the-arts on various domain adaptation settings.
  arXiv  Detail & Related papers  (2020-12-15T11:36:21Z)
• Promoting Semantics in Multi-objective Genetic Programming based on Decomposition [0.0]
  We show how Semantic Similarity-based Crossover (SSC) in Evolutionary Algorithms based on Decomposition (MOEA/D) promotes semantic diversity yielding better results compared to when this is not present in canonical MOEA/D.
  arXiv  Detail & Related papers  (2020-12-08T20:07:47Z)
• Heterogeneous Domain Generalization via Domain Mixup [0.0]
  One of the main drawbacks of deep Convolutional Neural Networks (DCNN) is that they lack generalization capability. We propose a novel heterogeneous domain generalization method by mixing up samples across multiple source domains. Our experimental results based on the Visual Decathlon benchmark demonstrates the effectiveness of our proposed method.
  arXiv  Detail & Related papers  (2020-09-11T13:53:56Z)
• Cross-domain Detection via Graph-induced Prototype Alignment [114.8952035552862]
  We propose a Graph-induced Prototype Alignment (GPA) framework to seek for category-level domain alignment. In addition, in order to alleviate the negative effect of class-imbalance on domain adaptation, we design a Class-reweighted Contrastive Loss. Our approach outperforms existing methods with a remarkable margin.
  arXiv  Detail & Related papers  (2020-03-28T17:46:55Z)
• Differential Treatment for Stuff and Things: A Simple Unsupervised Domain Adaptation Method for Semantic Segmentation [105.96860932833759]
  State-of-the-art approaches prove that performing semantic-level alignment is helpful in tackling the domain shift issue. We propose to improve the semantic-level alignment with different strategies for stuff regions and for things. In addition to our proposed method, we show that our method can help ease this issue by minimizing the most similar stuff and instance features between the source and the target domains.
  arXiv  Detail & Related papers  (2020-03-18T04:43:25Z)

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.