Hierarchical Genetic Algorithms with evolving objective functions

12/01/2018
by   Harshavardhan Kamarthi, et al.
0

We propose a framework of genetic algorithms which use multi-level hierarchies to solve an optimization problem by searching over the space of simpler objective functions. We solve a variant of Travelling Salesman Problem called soft-TSP and show that when the constraints on the overall objective function are changed the algorithm adapts to churn out solutions for the changed objective. We use this idea to speed up learning by systematically altering the constraints to find a more globally optimal solution. We also use this framework to solve polynomial regression where the actual objective function is unknown but searching over space of available objective functions yields a good approximate solution.

READ FULL TEXT
research
06/25/2022

Solution and Fitness Evolution (SAFE): Coevolving Solutions and Their Objective Functions

We recently highlighted a fundamental problem recognized to confound alg...
research
03/13/2021

CACTUS: Detecting and Resolving Conflicts in Objective Functions

Machine learning (ML) models are constructed by expert ML practitioners ...
research
12/06/2002

Optimized Color Gamuts for Tiled Displays

We consider the problem of finding a large color space that can be gener...
research
06/03/2021

Semi-Empirical Objective Functions for MCMC Proposal Optimization

We introduce and demonstrate a semi-empirical procedure for determining ...
research
12/07/2018

The Modeling of SDL Aiming at Knowledge Acquisition in Automatic Driving

In this paper we proposed an ultimate theory to solve the multi-target c...
research
10/15/2020

Continuum-Armed Bandits: A Function Space Perspective

Continuum-armed bandits (a.k.a., black-box or 0^th-order optimization) i...
research
06/02/2021

Gradient Assisted Learning

In distributed settings, collaborations between different entities, such...

Please sign up or login with your details

Forgot password? Click here to reset