Searcharxiv⌕ Search

arXiv subjects

Jakob Nylöf

Publications and source records attributed to Jakob Nylöf.

2 recordsLinked to original sources

Optimality of Affine Policies in Distributionally Robust Linear-Quadratic Control with Temporally Correlated Noise

We study finite-horizon distributionally robust linear-quadratic control with disturbances that can be arbitrarily correlated in time. The ambiguity set is modeled as a single 2-Wasserstein ball centered at a nominal elliptically contoured distribution of the disturbances. Despite the infinite-dimensionality of both the policy space and ambiguity set, we prove that the optimal policy is affine and that the worst-case distribution is an affine push-forward of the nominal distribution. These affine maps can be computed efficiently via a best-response algorithm based on the Frank--Wolfe algorithm. Experiments demonstrate improved out-of-sample performance over LQG and its distributionally robust extensions when the true disturbances are correlated, incurring only a small loss of performance under uncorrelated disturbances.

math.OC↗

Distributed Optimal Allocation with Quantized Communication and Privacy-Preserving Guarantees

In this paper, we analyze the problem of optimally allocating resources in a distributed and privacy-preserving manner. We propose a novel distributed optimal resource allocation algorithm with privacy-preserving guarantees, which operates over a directed communication network. Our algorithm converges in finite time and allows each node to process and transmit quantized messages. Our algorithm utilizes a distributed quantized average consensus strategy combined with a privacy-preserving mechanism. We show that the algorithm converges in finite-time, and we prove that, under specific conditions on the network topology, nodes are able to preserve the privacy of their initial state. Finally, to illustrate the results, we consider an example where test kits need to be optimally allocated proportionally to the number of infections in a region. It is shown that the proposed privacy-preserving resource allocation algorithm performs well with an appropriate convergence rate under privacy guarantees.

eess.SY↗