Automated Tail Bound Analysis for Probabilistic Recurrence Relations
نویسندگان
چکیده
Abstract Probabilistic recurrence relations (PRRs) are a standard formalism for describing the runtime of randomized algorithm. Given PRR and time limit $$\kappa $$ κ , we consider tail probability $$\Pr [T \ge \kappa ]$$ Pr [ T ≥ ] i.e., that T exceeds . Our focus is formal analysis bounds aims at finding tight asymptotic upper bound $$u \Pr [T\ge u To address this problem, classical most well-known approach cookbook method by Karp (JACM 1994), while other approaches mostly limited to deriving specific PRRs via involved custom analysis. In work, propose novel common exponentially-decreasing whose preprocessing random passed sizes observe discrete or (piecewise) uniform distribution recursive call either single procedure divide-and-conquer. We first establish theoretical Markov’s inequality, then instantiate with template-based algorithmic refined treatment exponentiation. Experimental evaluation shows our capable (i) asymptotically tighter than Karp’s method, (ii) match best-known manually-derived QuickSelect, (iii) only slightly worse (with $$\log \log n$$ log n factor) manually-proven optimal QuickSort. Moreover, handles all examples (including realistic such as QuickSort, DiameterComputation, etc.) in less 0.1 s, showing efficient practice.
منابع مشابه
( Probabilistic ) Recurrence Relations
The performance attributes of a broad class of randomised algorithms can be described by a recurrence relation of the form T(x) = a(x)+T(H(x)), where a is a function and H(x) is a random variable. For instance, T(x) may describe the running time of such an algorithm on a problem of size x. Then T(x) is a random variable, whose distribution depends on the distribution of H(x). To give high proba...
متن کاملProbabilistic Recurrence Relations for Work and Span of Parallel Algorithms
In this paper we present a method for obtaining tail-bounds for random variables satisfying certain probabilistic recurrences that arise in the analysis of randomized parallel divide and conquer algorithms. In such algorithms, some computation is initially done to process an input x, which is then randomly split into subproblems h1(x), . . . , hn(x), and the algorithm proceeds recursively in pa...
متن کاملThe Solution of Linear Probabilistic Recurrence Relations 1
Linear probabilistic divide-and-conquer recurrence relations arise when analyzing the running time of divide-and-conquer randomized algorithms. We consider first the problem of finding the expected value of the random process T (x), described as the output of a randomized recursive algorithm T . On input x , T generates a sample (h1, . . . , hk) from a given probability distribution on [0, 1]k ...
متن کاملProbabilistic Models for Automated ECG Interval Analysis
This thesis proposes a new approach for the automated analysis of electrocardiogram (ECG) signals, based on the framework of probabilistic modelling. The approach makes use of a number of techniques from machine learning, speech recognition and time-frequency analysis. The problem is to estimate from an ECG signal a number of timing intervals which occur in every heartbeat. The accurate measure...
متن کاملAdjoint methods and sensitivity analysis for recurrence relations
where subscripts denote partial derivatives, and should be thought of as row vectors, vs. column vectors x and p. So, for example, g x is a 1×K matrix, and f p is aK×P matrix. Equation (1) is derived simply by applying the chain rule to g = g(x,p) = g(f(xn−1,p),p) = g(f(f(xn−2,p),p),p) = · · ·. 1Note that if xn depends on xn−` for ` = 1, . . . , L, the recurrence can still be cast in terms of x...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-37709-9_2