Generalized Early Stopping in Evolutionary Direct Policy Search

08/07/2023
by   Etor Arza, et al.
0

Lengthy evaluation times are common in many optimization problems such as direct policy search tasks, especially when they involve conducting evaluations in the physical world, e.g. in robotics applications. Often, when evaluating a solution over a fixed time period, it becomes clear that the objective value will not increase with additional computation time (for example, when a two-wheeled robot continuously spins on the spot). In such cases, it makes sense to stop the evaluation early to save computation time. However, most approaches to stop the evaluation are problem-specific and need to be specifically designed for the task at hand. Therefore, we propose an early stopping method for direct policy search. The proposed method only looks at the objective value at each time step and requires no problem-specific knowledge. We test the introduced stopping criterion in five direct policy search environments drawn from games, robotics, and classic control domains, and show that it can save up to 75 problem-specific stopping criteria and demonstrate that it performs comparably while being more generally applicable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2019

DARTS+: Improved Differentiable Architecture Search with Early Stopping

Recently, there has been a growing interest in automating the process of...
research
11/20/2021

Quality and Computation Time in Optimization Problems

Optimization problems are crucial in artificial intelligence. Optimizati...
research
04/07/2023

A Policy for Early Sequence Classification

Sequences are often not received in their entirety at once, but instead,...
research
10/19/2015

NYTRO: When Subsampling Meets Early Stopping

Early stopping is a well known approach to reduce the time complexity fo...
research
05/04/2020

Time Efficiency in Optimization with a Bayesian-Evolutionary Algorithm

Not all generate-and-test search algorithms are created equal. Bayesian ...
research
03/21/2018

Mislearning from Censored Data: Gambler's Fallacy in a Search Problem

In the context of a sequential search problem, I explore large-generatio...
research
04/19/2023

Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives

A classic solution technique for Markov decision processes (MDP) and sto...

Please sign up or login with your details

Forgot password? Click here to reset