License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2023.107
URN: urn:nbn:de:0030-drops-181593
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/18159/
Go to the corresponding LIPIcs Volume Portal

Zamir, Or

The Wrong Direction of Jensen’s Inequality Is Algorithmically Right

pdf-format:
LIPIcs-ICALP-2023-107.pdf (0.6 MB)

Abstract

Let ? be an algorithm with expected running time e^X, conditioned on the value of some random variable X. We construct an algorithm A' with expected running time O (e^?[X]), that fully executes ?. In particular, an algorithm whose running time is a random variable T can be converted to one with expected running time O (e^?[ln T]), which is never worse than O(?[T]). No information about the distribution of X is required for the construction of ?'.

BibTeX - Entry

@InProceedings{zamir:LIPIcs.ICALP.2023.107,
  author =	{Zamir, Or},
  title =	{{The Wrong Direction of Jensen’s Inequality Is Algorithmically Right}},
  booktitle =	{50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
  pages =	{107:1--107:10},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-278-5},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{261},
  editor =	{Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2023/18159},
  URN =		{urn:nbn:de:0030-drops-181593},
  doi =		{10.4230/LIPIcs.ICALP.2023.107},
  annote =	{Keywords: algorithms, complexity, Jensen’s inequality}
}

Keywords: algorithms, complexity, Jensen’s inequality
Collection: 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Issue Date: 2023
Date of publication: 05.07.2023

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI