Aug. 4, 2022, 1:11 a.m. | David Herel, Dominika Zogatova, Matej Kripner, Tomas Mikolov

cs.LG updates on arXiv.org arxiv.org

One of the main problems of evolutionary algorithms is the convergence of the
population to local minima. In this paper, we explore techniques that can avoid
this problem by encouraging a diverse behavior of the agents through a shared
reward system. The rewards are randomly distributed in the environment, and the
agents are only rewarded for collecting them first. This leads to an emergence
of a novel behavior of the agents. We introduce our approach to the maze
problem and …

algorithms arxiv evolutionary algorithms

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne

Senior Machine Learning Engineer (MLOps)

@ Promaton | Remote, Europe

Senior Data Engineer

@ Quantexa | Sydney, New South Wales, Australia

Staff Analytics Engineer

@ Warner Bros. Discovery | NY New York 230 Park Avenue South