Black-Box Complexity of the Binary Value Function

04/09/2019
by   Nina Bulanova, et al.
0

The binary value function, or BinVal, has appeared in several studies in theory of evolutionary computation as one of the extreme examples of linear pseudo-Boolean functions. Its unbiased black-box complexity was previously shown to be at most _2 n + 2, where n is the problem size. We augment it with an upper bound of _2 n + 2.42141558 - o(1), which is more precise for many values of n. We also present a lower bound of _2 n + 1.1186406 - o(1). Additionally, we prove that BinVal is an easiest function among all unimodal pseudo-Boolean functions at least for unbiased algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/04/2010

Faster Black-Box Algorithms Through Higher Arity Operators

We extend the work of Lehre and Witt (GECCO 2010) on the unbiased black-...
research
08/02/2019

Merging variables: one technique of search in pseudo-Boolean optimization

In the present paper we describe new heuristic technique, which can be a...
research
01/15/2023

The Binary Linearization Complexity of Pseudo-Boolean Functions

We consider the problem of linearizing a pseudo-Boolean function f : {0,...
research
07/27/2010

Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions

With this paper, we contribute to the understanding of ant colony optimi...
research
10/21/2019

Maximum Probability Principle and Black-Box Priors

We present an axiomatic way of assigning probabilities to black box mode...
research
03/30/2014

Unbiased Black-Box Complexities of Jump Functions

We analyze the unbiased black-box complexity of jump functions with smal...
research
04/21/2021

MetricOpt: Learning to Optimize Black-Box Evaluation Metrics

We study the problem of directly optimizing arbitrary non-differentiable...

Please sign up or login with your details

Forgot password? Click here to reset