AI Chat AI Image Generator AI Video Text to Speech

Chasing Convex Bodies with Linear Competitive Ratio

05/28/2019

∙

by C. J. Argue, et al.

∙

∙

We study the problem of chasing convex bodies online: given a sequence of convex bodies K_t⊆R^d the algorithm must respond with points x_t∈ K_t in an online fashion (i.e., x_t is chosen before K_t+1 is revealed). The objective is to minimize the total distance between successive points in this sequence. Recently, Bubeck et al. (STOC 2019) gave a 2^O(d)-competitive algorithm for this problem. We give an algorithm that is O((d, √(d T)))-competitive for any sequence of length T.

C. J. Argue
5 publications
Anupam Gupta
51 publications
Guru Guruganesh
16 publications
Ziye Tang
2 publications

page 1

page 2

page 3

page 4

research

∙ 11/22/2018

Better Bounds for Online Line Chasing

We study online competitive algorithms for the line chasing problem in E...

0 Marcin Bienkowski, et al. ∙

research

∙ 11/02/2018

Competitively Chasing Convex Bodies

Let F be a family of sets in some metric space. In the F-chasing problem...

0 Sébastien Bubeck, et al. ∙

research

∙ 06/22/2018

A Nearly-Linear Bound for Chasing Nested Convex Bodies

Friedman and Linial introduced the convex body chasing problem to explor...

0 C. J. Argue, et al. ∙

research

∙ 07/08/2018

Online exploration outside a convex obstacle

A watchman route is a path such that a direct line of sight exists betwe...

0 Eitan Tiktinsky, et al. ∙

research

∙ 04/04/2023

Chasing Positive Bodies

We study the problem of chasing positive bodies in ℓ_1: given a sequence...

0 Sayan Bhattacharya, et al. ∙

research

∙ 04/15/2021

Lipschitz Selectors may not Yield Competitive Algorithms for Convex Body Chasing

The current best algorithms for convex body chasing problem in online al...

0 C. J. Argue, et al. ∙

research

∙ 08/16/2017

Online Primal-Dual Algorithms with Configuration Linear Programs

Non-linear, especially convex, objective functions have been extensively...

0 Nguyen Kim Thang, et al. ∙