Shortest Paths without a Map, but with an Entropic Regularizer
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912155108900864 |
|---|---|
| author | Bubeck, Sébastien Coester, Christian Rabani, Yuval |
| author_facet | Bubeck, Sébastien Coester, Christian Rabani, Yuval |
| contents | In a 1989 paper titled "shortest paths without a map", Papadimitriou and Yannakakis introduced an online model of searching in a weighted layered graph for a target node, while attempting to minimize the total length of the path traversed by the searcher. This problem, later called layered graph traversal, is parametrized by the maximum cardinality $k$ of a layer of the input graph. It is an online setting for dynamic programming, and it is known to be a rather general and fundamental model of online computing, which includes as special cases other acclaimed models. The deterministic competitive ratio for this problem was soon discovered to be exponential in $k$, and it is now nearly resolved: it lies between $Ω(2^k)$ and $O(k2^k)$. Regarding the randomized competitive ratio, in 1993 Ramesh proved, surprisingly, that this ratio has to be at least $Ω(k^2 / \log^{1+ε} k)$ (for any constant $ε> 0$). In the same paper, Ramesh also gave an $O(k^{13})$-competitive randomized online algorithm. Between 1993 and the results obtained in this paper, no progress has been reported on the randomized competitive ratio of layered graph traversal. In this work we show how to apply the mirror descent framework on a carefully selected evolving metric space, and obtain an $O(k^2)$-competitive randomized online algorithm. This matches asymptotically an improvement of the aforementioned lower bound (Bubeck, Coester, Rabani; STOC 2023), which we announced (among other results) after the initial publication of the results here. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2202_04551 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Shortest Paths without a Map, but with an Entropic Regularizer Bubeck, Sébastien Coester, Christian Rabani, Yuval Data Structures and Algorithms 68Q25, 68W20, 68W27, 68W40 In a 1989 paper titled "shortest paths without a map", Papadimitriou and Yannakakis introduced an online model of searching in a weighted layered graph for a target node, while attempting to minimize the total length of the path traversed by the searcher. This problem, later called layered graph traversal, is parametrized by the maximum cardinality $k$ of a layer of the input graph. It is an online setting for dynamic programming, and it is known to be a rather general and fundamental model of online computing, which includes as special cases other acclaimed models. The deterministic competitive ratio for this problem was soon discovered to be exponential in $k$, and it is now nearly resolved: it lies between $Ω(2^k)$ and $O(k2^k)$. Regarding the randomized competitive ratio, in 1993 Ramesh proved, surprisingly, that this ratio has to be at least $Ω(k^2 / \log^{1+ε} k)$ (for any constant $ε> 0$). In the same paper, Ramesh also gave an $O(k^{13})$-competitive randomized online algorithm. Between 1993 and the results obtained in this paper, no progress has been reported on the randomized competitive ratio of layered graph traversal. In this work we show how to apply the mirror descent framework on a carefully selected evolving metric space, and obtain an $O(k^2)$-competitive randomized online algorithm. This matches asymptotically an improvement of the aforementioned lower bound (Bubeck, Coester, Rabani; STOC 2023), which we announced (among other results) after the initial publication of the results here. |
| title | Shortest Paths without a Map, but with an Entropic Regularizer |
| topic | Data Structures and Algorithms 68Q25, 68W20, 68W27, 68W40 |
| url | https://arxiv.org/abs/2202.04551 |