DeepAI AI Chat
Log In Sign Up

The Query Complexity of Local Search and Brouwer in Rounds

by   Simina Branzei, et al.

We study the query complexity of local search and Brouwer fixed-point computation when there are k rounds of interaction with the oracle that answers queries. Thus in each round, any number of simultaneous queries can be issued, the oracle answers are received, and then the queries for the next round are submitted. The algorithm must stop by the end of the k-th round. This model captures distributed settings, where each query is time consuming and can be executed by a separate processor to speed up computation time. We present several new algorithms and lower bounds, which characterize the trade-off between the number of rounds of adaptivity and the total number of queries on local search and Brouwer fixed-point. We mainly focus on studying these problems on the d-dimensional grid [n]^d, where d is a constant. For local search, if the number of rounds k is a constant, then we obtain a query complexity of Θ(n^d^k+1 - d^k/d^k - 1) for both deterministic and randomized algorithms. On the other hand, when the number of rounds is polynomial, i.e. of the form n = k^α, where α is a constant with 0 < α < d/2, we obtain an upper bound of O(n^(d-1) - d-2/dα) and a lower bound of Ω(max(n^(d-1)-α, n^d/2)) for randomized algorithms. For Brouwer fixed-point, we have query complexity of Θ(n^d^k+1 - d^k/d^k - 1) for both deterministic and randomized algorithm.


page 1

page 2

page 3

page 4


The Sharp Power Law of Local Search on Expanders

Local search is a powerful heuristic in optimization and computer scienc...

Searching, Sorting, and Cake Cutting in Rounds

We study sorting and searching in rounds motivated by a cake cutting pro...

Improved Lower Bounds for Submodular Function Minimization

We provide a generic technique for constructing families of submodular f...

The Element Extraction Problem and the Cost of Determinism and Limited Adaptivity in Linear Queries

Two widely-used computational paradigms for sublinear algorithms are usi...

Graph Connectivity and Single Element Recovery via Linear and OR Queries

We study the problem of finding a spanning forest in an undirected, n-ve...

Improved Upper Bounds for Finding Tarski Fixed Points

We study the query complexity of finding a Tarski fixed point over the k...