Dynamical intricacy and average sample complexity
نویسندگان
چکیده
منابع مشابه
Average Circuit Depth and Average Communication Complexity
We use the techniques of Karchmer and Widgerson KW90] to derive strong lower bounds on the expected parallel time to compute boolean functions by circuits. By average time, we mean the time needed on a self-timed circuit, a model introduced recently by Jakoby, Reischuk, and Schindelhauer, JRS94] in which gates compute their output as soon as it is determined (possibly by a subset of the inputs ...
متن کاملRobust sample average approximation
Sample average approximation (SAA) is a widely popular approach to data-driven decisionmaking under uncertainty. Under mild assumptions, SAA is both tractable and enjoys strong asymptotic performance guarantees. Similar guarantees, however, do not typically hold in finite samples. In this paper, we propose a modification of SAA, which we term Robust SAA, which retains SAA’s tractability and asy...
متن کاملAverage and Randomized Communication Complexity
42 and transmits the index of the set that contains x. By the model assumption he doesn't need to transmit which partition was picked. P Y then, transmits 1 if y belongs to the same set in the partition and 0 otherwise. The number of bits transmitted is 1 + dlog n b1+2(n?1)c e. The error probability is clearly 0 if x = y and, by symmetry or a more cumbersome argument, at most 2 for x 6 = y. As ...
متن کاملAverage and randomized communication complexity
The communication complexity of a two-variable function f (x , y) is the number of information bits two communicators need to exchange to compute f when, initially, each knows only one of the variables. There are several communication-complexity measures corresponding to whether 1) the worst case or average number of bits is considered, 2) computation errors are allowed or not, and 3) randomiza...
متن کاملComplexity and Dynamical Depth
We argue that a critical difference distinguishing machines from organisms and computers from brains is not complexity in a structural sense, but a difference in dynamical organization that is not well accounted for by current complexity measures. We propose a measure of the complexity of a system that is largely orthogonal to computational, information theoretic, or thermodynamic conceptions o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Dynamical Systems
سال: 2017
ISSN: 1468-9367,1468-9375
DOI: 10.1080/14689367.2017.1374352