Related papers: It's the Journey Not the Destination: Building Genetic Algorithms Practitioners Can Trust

It's the Journey Not the Destination: Building Genetic Algorithms Practitioners Can Trust

URL: http://arxiv.org/abs/2010.06406v1
Date: Tue, 13 Oct 2020 14:07:30 GMT
Title: It's the Journey Not the Destination: Building Genetic Algorithms Practitioners Can Trust
Authors: Jakub Vincalek, Sean Walton and Ben Evans
Abstract summary: Survey shows attitudes of engineers and students with design experience with respect to optimisation algorithms. A common thread throughout participants responses is that there is a question of trust towards genetic algorithms within industry. Participants have expressed a desire to continue to remain in the design loop.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Genetic algorithms have been developed for decades by researchers in academia and perform well in engineering applications, yet their uptake in industry remains limited. In order to understand why this is the case, the opinions of users of engineering design tools were gathered. The results from a survey showing the attitudes of engineers and students with design experience with respect to optimisation algorithms are presented. A survey was designed to answer two research questions: To what extent is there a pre-existing sentiment (negative or positive) among students, engineers, and managers towards genetic algorithm-based design? and What are the requirements of practitioners with regards to design optimisation and the design optimisation process? A total of 23 participants (N = 23) took part in the 3-part mixed methods survey. Thematic analysis was conducted on the open-ended questions. A common thread throughout participants responses is that there is a question of trust towards genetic algorithms within industry. Perhaps surprising is that the key to gaining this trust is not producing good results, but creating algorithms which explain the process they take in reaching a result. Participants have expressed a desire to continue to remain in the design loop. This is at odds with the motivation of a portion of the genetic algorithms community of removing humans from the loop. It is clear we need to take a different approach to increase industrial uptake. Based on this, the following recommendations have been made to increase their use in industry: an increase of transparency and explainability of genetic algorithms, an increased focus on user experience, better communication between developers and engineers, and visualising algorithm behaviour.

Related papers

A Generalized Evolutionary Metaheuristic (GEM) Algorithm for Engineering Optimization [1.6589012298747952]
A major trend in recent years is the use of nature-inspired metaheustic algorithms (NIMA) There are over 540 algorithms in the literature, and there is no unified framework to understand the search mechanisms of different algorithms. We propose a generalized evolutionary metaheuristic algorithm to unify more than 20 different algorithms.
arXiv Detail & Related papers (2024-07-02T09:55:15Z)
Automated Metaheuristic Algorithm Design with Autoregressive Learning [25.967262411437403]
Current automated methods design algorithms within a fixed structure and operate from scratch. This paper proposes an autoregressive learning-based designer for automated design of metaheuristic algorithms.
arXiv Detail & Related papers (2024-05-06T12:36:17Z)
Learning-Augmented Algorithms with Explicit Predictors [67.02156211760415]
Recent advances in algorithmic design show how to utilize predictions obtained by machine learning models from past and present data. Prior research in this context was focused on a paradigm where the predictor is pre-trained on past data and then used as a black box. In this work, we unpack the predictor and integrate the learning problem it gives rise for within the algorithmic challenge.
arXiv Detail & Related papers (2024-03-12T08:40:21Z)
Discovering General Reinforcement Learning Algorithms with Adversarial Environment Design [54.39859618450935]
We show that it is possible to meta-learn update rules, with the hope of discovering algorithms that can perform well on a wide range of RL tasks. Despite impressive initial results from algorithms such as Learned Policy Gradient (LPG), there remains a gap when these algorithms are applied to unseen environments. In this work, we examine how characteristics of the meta-supervised-training distribution impact the performance of these algorithms.
arXiv Detail & Related papers (2023-10-04T12:52:56Z)
A Gold Standard Dataset for the Reviewer Assignment Problem [117.59690218507565]
"Similarity score" is a numerical estimate of the expertise of a reviewer in reviewing a paper. Our dataset consists of 477 self-reported expertise scores provided by 58 researchers. For the task of ordering two papers in terms of their relevance for a reviewer, the error rates range from 12%-30% in easy cases to 36%-43% in hard cases.
arXiv Detail & Related papers (2023-03-23T16:15:03Z)
DeepProphet2 -- A Deep Learning Gene Recommendation Engine [0.0]
The paper discusses the potential advantages of gene recommendation performed by artificial intelligence (AI) A transformer-based model has been trained on a well-curated freely available paper corpus, PubMed. A set of use cases illustrates the algorithm's potential applications in a real word setting.
arXiv Detail & Related papers (2022-08-03T08:54:13Z)
Investigating Positive and Negative Qualities of Human-in-the-Loop Optimization for Designing Interaction Techniques [55.492211642128446]
Designers reportedly struggle with design optimization tasks where they are asked to find a combination of design parameters that maximizes a given set of objectives. Model-based computational design algorithms assist designers by generating design examples during design. Black box methods for assistance, on the other hand, can work with any design problem.
arXiv Detail & Related papers (2022-04-15T20:40:43Z)
Non-Clairvoyant Scheduling with Predictions Revisited [77.86290991564829]
In non-clairvoyant scheduling, the task is to find an online strategy for scheduling jobs with a priori unknown processing requirements. We revisit this well-studied problem in a recently popular learning-augmented setting that integrates (untrusted) predictions in algorithm design. We show that these predictions have desired properties, admit a natural error measure as well as algorithms with strong performance guarantees.
arXiv Detail & Related papers (2022-02-21T13:18:11Z)
Generalization in portfolio-based algorithm selection [97.74604695303285]
We provide the first provable guarantees for portfolio-based algorithm selection. We show that if the portfolio is large, overfitting is inevitable, even with an extremely simple algorithm selector.
arXiv Detail & Related papers (2020-12-24T16:33:17Z)
A summary of the prevalence of Genetic Algorithms in Bioinformatics from 2015 onwards [0.0]
Genetic algorithms rarely form a full application, instead they rely on other vital algorithms such as support vector machines. Population-based searches, like GA, are often combined with other machine learning algorithms. The future of genetic algorithms could be open-ended evolutionary algorithms, which attempt to increase complexity and find diverse solutions.
arXiv Detail & Related papers (2020-08-20T15:15:43Z)
A Study of a Genetic Algorithm for Polydisperse Spray Flames [0.0]
The Genetic Algorithm (GA) is a powerful tool which enables the generation of high-quality solutions to optimization problems. In this piece of work, I would like to harness the GA capabilities to examine optimality with respect to a unique combustion problem. To be more precise, I would like to utilize it to answer the question : What form of an initial droplet size distribution (iDSD) will guarantee an optimal flame.
arXiv Detail & Related papers (2020-08-11T10:17:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.