Dimension-Free Bounds on Chasing Convex Functions release_22twcsug55f6fgj5hrgzjdr2qa

by C.J. Argue, Anupam Gupta, Guru Guruganesh

Released as a article .

2020  

Abstract

We consider the problem of chasing convex functions, where functions arrive over time. The player takes actions after seeing the function, and the goal is to achieve a small function cost for these actions, as well as a small cost for moving between actions. While the general problem requires a polynomial dependence on the dimension, we show how to get dimension-independent bounds for well-behaved functions. In particular, we consider the case where the convex functions are κ-well-conditioned, and give an algorithm that achieves an O(√(κ))-competitiveness. Moreover, when the functions are supported on k-dimensional affine subspaces–e.g., when the function are the indicators of some affine subspaces–we get O(min(k, √(k log T)))-competitive algorithms for request sequences of length T. We also show some lower bounds, that well-conditioned functions require Ω(κ^1/3)-competitiveness, and k-dimensional functions require Ω(√(k))-competitiveness.
In text/plain format

Archived Files and Locations

application/pdf  550.5 kB
file_itlllhehtvgpxa2dvnran7b3ta
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2020-05-28
Version   v1
Language   en ?
arXiv  2005.14058v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 4656192e-9bf5-4d08-aa26-ded15a9dde60
API URL: JSON