The use of a policy and heuristic function for guiding search can be quite effective in adversarial problems, as demonstrated by AlphaGo its successors, which are based on the PUCT algorithm. While also used to solve single-agent deterministic it lacks guarantees effort computationally inefficient practice. Combining A* algorithm with learned tends work better these domains, but variants do not...

In this article, we define noiseless privacy, as a non-stochastic rival to differential requiring that the outputs of mechanism (i.e., function composition privacy-preserving mapping and query) attain only few values while varying data an individual (the logarithm number distinct is bounded by privacy budget). Therefore, output not fully informative individuals in dataset. We prove several guar...

We study a cache network under arbitrary adversarial request arrivals. propose distributed online policy based on the tabular greedy algorithm. Our achieves sublinear (1-1/e)-regret, also in case when update costs cannot be neglected. Numerical evaluation over several topologies supports our theoretical results and demonstrates that algorithm outperforms state-of-art algorithms.