WebMay 28, 2024 · This work extends the convex body chasing problem to an adversarial setting, where a player is tasked to chase a sequence of convex bodies generated adversarially by an opponent, and designs an algorithm that numerically generates policies with performance guarantees. Expand WebSince the nested convex body chasing problem corresponds to solving online LPs with arbitrary constraints (with both positive and negative entries) and a specific type of objective, understanding the nested convex body chasing problem is an essential step towards this goal. Indeed, this is one of our main motivations to consider this problem.

SODA20 Accepted Papers SIAM

WebJan 28, 2024 · In Euclidean space, our algorithm achieves nearly optimal competitive ratio [MATH HERE], compared to a lower bound of [MATH HERE]. Our approach extends the recent work [BKL + 20] which chases nested convex bodies using the classical Steiner point of a convex body. We define the functional Steiner point of a convex function and … WebNov 22, 2024 · The line chasing problem is a variant of a more general convex body chasing problem, where the sets X_t are arbitrary convex sets. To date, the best competitive ratio for the line chasing problem was 28.1, even in the plane. ... Chasing Nested Convex Bodies Nearly Optimally The convex body chasing problem, … txa woman trial

Chasing nested convex bodies nearly optimally - Tel Aviv …

WebThe convex body chasing problem, introduced by Friedman and Linial [FL93], is a competitive analysis problem on any normed vector space. In convex body chasing, for … WebChasing Nested Convex Bodies Nearly Optimally S ebastien Bubeck Bo’az Klartagy Yin Tat Leez Yuanzhi Lix Mark Sellke{. Abstract The convex body chasing problem, … WebThe convex body chasing problem, introduced by Friedman and Linial [FL93], is a competitive analysis problem on any normed vector space. In convex body chasing, for … tamblin way hatfield