2026-07-22T11:38:06Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:18159 2024-03-06T11:01:10Z ddc:004 open_access

The Wrong Direction of Jensen’s Inequality Is Algorithmically Right Zamir, Or algorithms complexity Jensen’s inequality 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 𝒜'. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Or Zamir 2023 Is Part Of LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2023.107 urn:nbn:de:0030-drops-181593 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.107 eng https://creativecommons.org/licenses/by/4.0/legalcode