Chasing Convex Bodies Optimally

@inproceedings{Sellke2020ChasingCB,
  title={Chasing Convex Bodies Optimally},
  author={Mark Sellke},
  booktitle={SODA},
  year={2020}
}
  • Mark Sellke
  • Published in SODA 2020
  • Computer Science, Mathematics
  • In the chasing convex bodies problem, an online player receives a request sequence of $N$ convex sets $K_1,\dots, K_N$ contained in a normed space $\mathbb R^d$. The player starts at $x_0\in \mathbb R^d$, and after observing each $K_n$ picks a new point $x_n\in K_n$. At each step the player pays a movement cost of $||x_n-x_{n-1}||$. The player aims to maintain a constant competitive ratio against the minimum cost possible in hindsight, i.e. knowing all requests in advance. The existence of a… CONTINUE READING

    Topics from this paper.

    Chasing Convex Bodies with Linear Competitive Ratio
    11
    Online Multiserver Convex Chasing and Optimization
    1
    Dimension-Free Bounds on Chasing Convex Functions
    A PTAS for Euclidean TSP with Hyperplane Neighborhoods
    4
    The Online Min-Sum Set Cover Problem
    Online Optimization with Predictions and Non-convex Losses
    3
    Improved Path-length Regret Bounds for Bandits
    16

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 22 REFERENCES
    Chasing Nested Convex Bodies Nearly Optimally
    10
    On convex body chasing
    41
    Competitively chasing convex bodies
    15
    Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent
    23
    A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs
    43
    Introduction to Online Convex Optimization
    612
    An Elementary Introduction to Modern Convex Geometry
    460
    Flavors of Geometry
    56