Local search for valued constraint satisfaction parameterized by treedepth

Sometimes local search algorithms cannot efficiently find even local peaks.

To understand why, I look at the structure of ascents in fitness landscapes from valued constraint satisfaction problems (VCSPs) parameterized by the treedepth of their constraint graphs.

There are existing constructions of VCSPs with logarithm treedepth that represent fitness landscapes where all ascents are exponential from some initial assignment.

I improve these bounds by showing that with loglog treedepth, superpolynomial ascents exist; and for polylog treedepth, there are initial assignments from which all ascents are superpolynomial.

My hope is that these examples of sparse VCSPs can help us better understand the barriers to efficient local search.