Distributed Optimization via Local Computation Algorithms
نویسندگان
چکیده
منابع مشابه
Fast Local Computation Algorithms
For input x, let F (x) denote the set of outputs that are legal answers. Suppose x and members of F (x) are so large that there is not time to read them in their entirety. We propose a model of local computation algorithms which for a given input x, support queries by a user to values of specified locations yi in a legal output y ∈ F (x). When more than one legal output y exists for a given x, ...
متن کاملOptimizing quantum optimization algorithms via faster quantum gradient computation
We consider a generic framework of optimization algorithms based on gradient descent. We develop a quantum algorithm that computes the gradient of a multi-variate real-valued function f : Rd → R by evaluating it at only a logarithmic number of points in superposition. Our algorithm is an improved version of Jordan’s gradient calculation algorithm [Jor05], providing an approximation of the gradi...
متن کاملLocal Algorithms for Distributed Constraint Optimization in Dynamic, Anytime Environments
Many challenges in multi-agent coordination can be modeled as distributed constraint optimization problems (DCOPs) but existing complete algorithms do not scale well nor respond effectively to dynamic or anytime environments. As we move towards a future of ambient intelligence, in which large groups of agents must quickly coordinate, these deficiencies must be addressed. We decompose DCOP into ...
متن کاملConverting Online Algorithms to Local Computation Algorithms
We give a general method for converting online algorithms to localcomputation algorithms, by selecting a random permutation of the input, andsimulating running the online algorithm. We bound the number of steps of thealgorithm using a query tree, which models the dependencies between queries.We improve previous analyses of query trees on graphs of bounded degree, andextend t...
متن کاملSpace-efficient local computation algorithms
Recently Rubinfeld et al. (ICS 2011, pp. 223–238) proposed a new model of sublinear algorithms called local computation algorithms. In this model, a computation problem F may have more than one legal solution and each of them consists of many bits. The local computation algorithm for F should answer in an online fashion, for any index i, the i bit of some legal solution of F . Further, all the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2017
ISSN: 0163-5999
DOI: 10.1145/3152042.3152053