How to trade electricity flexibility using artificial intelligence - An integrated algorithmic framework

On Testing of Uniform Samplers

Proceedings of the AAAI Conference on Artificial Intelligence ◽

10.1609/aaai.v33i01.33017777 ◽

2019 ◽

Vol 33 ◽

pp. 7777-7784 ◽

Cited By ~ 2

Author(s):

Sourav Chakraborty ◽

Kuldeep S. Meel

Keyword(s):

Artificial Intelligence ◽

Software Engineering ◽

Uniform Distribution ◽

Automobile Industry ◽

Probabilistic Reasoning ◽

State Of The Art ◽

Affirmative Answer ◽

Sampling Techniques ◽

Program Testing ◽

Algorithmic Framework

Recent years have seen an unprecedented adoption of artificial intelligence in a wide variety of applications ranging from medical diagnosis, automobile industry, security to aircraft collision avoidance. Probabilistic reasoning is a key component of such modern artificial intelligence systems. Sampling techniques form the core of the state of the art probabilistic reasoning systems. The divide between the existence of sampling techniques that have strong theoretical guarantees but fail to scale and scalable techniques with weak or no theoretical guarantees mirrors the gap in software engineering between poor scalability of classical program synthesis techniques and billions of programs that are routinely used by practitioners. One bridge connecting the two extremes in the context of software engineering has been program testing. In contrast to testing for deterministic programs, where one trace is sufficient to prove the existence of a bug, in case of samplers one sample is typically not sufficient to prove non-conformity of the sampler to the desired distribution. This makes one wonder whether it is possible to design testing methodology to test whether a sampler under test generates samples close to a given distribution. The primary contribution of this paper is an affirmative answer to the above question when the given distribution is a uniform distribution: We design, to the best of our knowledge, the first algorithmic framework, Barbarik, to test whether the distribution generated is ε−close or η−far from the uniform distribution. In contrast to the sampling techniques that require an exponential or sub-exponential number of samples for sampler whose support can be represented by n bits, Barbarik requires only O(1/(η−ε)4) samples. We present a prototype implementation of Barbarik and use it to test three state of the art uniform samplers over the support defined by combinatorial constraints. Barbarik can provide a certificate of uniformity to one sampler and demonstrate nonuniformity for the other two samplers.

Download Full-text

Artificial Intelligence + Distributed Systems = Agents

International Journal of Computers Communications & Control ◽

10.15837/ijccc.2009.1.2410 ◽

2009 ◽

Vol 4 (1) ◽

pp. 17 ◽

Cited By ~ 5

Author(s):

Ioan Dzitac ◽

Boldur E. Bărbat

Keyword(s):

Artificial Intelligence ◽

Distributed Systems ◽

Semantic Web ◽

Web Applications ◽

Broad Band ◽

Design Principles ◽

Position Paper ◽

Uncertain Environments ◽

Speed Up ◽

Algorithmic Framework

The connection with Wirth’s book goes beyond the title, albeit confining the area to modern Artificial Intelligence (AI). Whereas thirty years ago, to devise effective programs, it became necessary to enhance the classical algorithmic framework with approaches applied to limited and focused subdomains, in the context of broad-band technology and semantic web, applications - running in open, heterogeneous, dynamic and uncertain environments-current paradigms are not enough, because of the shift from programs to processes. Beside the structure as position paper, to give more weight to some basic assertions, results of recent research are abridged and commented upon in line with new paradigms. Among the conclusions: a) Nondeterministic software is unavoidable; its development entails not just new design principles but new computing paradigms. b) Agent-oriented systems, to be effectual, should merge conventional agent design with approaches employed in advanced distributed systems (where parallelism is intrinsic to the problem, not just a mean to speed up).

Download Full-text