Dr. Jörg Zimmermann
I am a postdoctoral researcher at the Institute for Computer Science, University of Bonn and a member of the Artificial Intelligence Foundations Group (AIF). I have worked on an EU project using evolutionary optimization to design real-world radio networks, and currently I am teaching courses on applying methods from statistics and machine learning to the analysis of biological data. The plethora of methods and approaches used in machine learning and optimization has inspired me to search for foundations and unifying principles of these fields.
Nothing is more important than to see the sources of invention, which are, in my opinion, more interesting than the inventions themselves.
Gottfried Wilhelm Leibniz
Currently my research focuses on foundations of artificial intelligence, aiming to establish a sound theoretical framework for concepts like intelligence, learning, and self-improvement. Ultimately, this should result in a set of axioms for "intelligence theory", much like we have axiomatic foundations for set theory (ZFC) or probability theory (Kolmogorov axioms) today.
The envisioned intelligence theory should be a theory whose main goal is not to describe, characterize, or implement a developed mind, but to find the laws of cognitive dynamics which will lead to the emergence of mind. It will treat intelligence as an inherently dynamic phenomenon, not only with regard to its interactions with the outside world, but also with regard to its internal organization. This outlook on intelligence theory can be seen in analogy to the development of physics, which has evolved via the stages of statics and kinematics into a dynamic theory of physical phenomena. In this sense, intelligence theory aims to discover the laws of evolution of mind instead of describing a snapshot of a developed mind. The Gödel machine introduced by J. Schmidhuber already captures this spirit very well. A scalable version of the Gödel machine, the Gödel agent, was presented at the conference on artificial general intelligence (AGI 2015). Eventually, this should lead to a set of rules describing a universal intelligence dynamics, a dynamics which will send any seed mind on an ascending trajectory of ever higher levels of cognition, intelligence, and insight.
One step in the direction of axiomatic foundations was a thorough analysis of the concept of uncertainty, which has led to an algebraic approach to characterize uncertainty calculi. This topic, algebraic uncertainty theory, was developed in my PhD thesis. Algebraic uncertainty theory enables a unifying perspective on reasoning under uncertainty by deriving, and not defining, the structure of uncertainty values - it is not a YAUC (yet another uncertainty calculus). Confidence theory, the theory resulting from the proposed axiom system NC12, subsumes probability theory and Dempster-Shafer theory and can solve longstanding problems like combining coherent conditionalization and a resolution of the Ellsberg paradox (see the slides of my defense talk). To my knowledge, no other current uncertainty calculus is able to do this. How to further develop and apply confidence theory and how to integrate it with other lines of research is the topic of ongoing investigations.
Another step in this endeavor was the analysis of the incomputability of universal induction, i.e., using the whole program space as possible models, as it arises in the framework introduced by R. Solomonoff in 1964. Changing this framework by embedding the agent and the environment into the same time structure, a synchronous agent framework, the incompatibility of universality and effectivity vanishes. This is outlined in an article presented at the Turing Centenary Conference in 2012.
After having found that universal induction can be made effective (effective just means computable in computer science), the focus has shifted to making it efficient. For this, one has to tackle the problem of a reference machine, i.e., a typical machine available for implementing universal induction, in detail. A first line of attack to this reference machine problem was the development of a "machine theory", for which a core axiomatic system was introduced at the MCU 2013. The goal here is to define a standard reference machine from first principles, or at least to reduce the contingent aspects of such a reference machine to a minimum.
Another important topic in order to achieve efficiency of universal induction is the initial complexity of algorithms, not their asymptotic one. Initial complexity deals with the resource requirements of an algorithm on the actually occurring inputs. Sometimes the asymptotic behavior reflects the initial behavior, but it can be misleading, and it is a working hypothesis of mine that in the context of artificial intelligence this divergence of initial and asymptotic behavior is the typical, not the exceptional case. There could be huge improvements of the initial behavior of an algorithm which would not count at all from the asymptotic complexity perspective. So one goal of future research is to look for algorithmic improvements within the initial complexity paradigm.
As a cross-cutting topic, I'm strongly interested in all kinds of robustness analyses in order to monitor, control, and communicate remaining contingent aspects of design decisions for reference machines, induction systems (especially priors in Bayesian inference), and agent policies. If one cannot eliminate all contingent aspects of a system, one should at least make transparent how changes in the contingent aspects propagate through a system and how they affect conclusions or actions drawn or taken by a system. This often boils down to the following question: if one perturbs a part A of a system S by ε, how can one bound the effect of this perturbation on another part B of system S, i.e., finding a function f so that the perturbation of part B can be bound by f(ε). Of course, in order to perform such a robustness analysis, one needs meaningful metric structures for the different parts of a system, and that was one reason to propose a candidate for a metric on machine space in the MCU article.
Finally, this research is motivated not only by sheer curiosity, but also by the conviction that intelligent tools can advance our civilization like mechanical tools have done in the past. Of course, powerful tools do not only create opportunities, but also risks. However, given the state of our world, relinquishment is not an option. We have to develop strategies which keep the risks of these tools in check, while reaping their potential to find smart solutions for the problems that currently plague our planet.
If you think the sequence is too short, then what is long enough? (Hint: Most people I have asked have a quick and strong opinion on the twelfth bit :)
There is not a "correct" answer, at least I do not know it (yet). But the AGI community, deeply concerned with prediction and universal induction, should at least strive for a consensus which answers the question for the twelfth bit. Maybe this results in the definition of a standard reference machine, which, in my opinion, would be an important stepping stone for future developments in universal induction and AGI.
Guesses, probabilities (probability intervals), and comments can be sent to email@example.com.
Xiaoxiao Zhang, Holger Fröhlich, Dima Grigoriev, Sergey Vakulenko, Jörg Zimmermann, and Andreas Weber: A Simple 3-Parameter Model for Cancer Incidences, Scientific Reports 8, Article number: 3388, doi:10.1038/s41598-018-21734-x, 2018 [Link]
Ashutosh Malhotra, Erfan Younesi, Sudeep Sahadevan, Jörg Zimmermann, and Martin Hofmann-Apitius: Exploring novel mechanistic insights in Alzheimer's disease by assessing reliability of protein interactions, Scientific Reports 5, Article number: 13634, doi:10.1038/srep13634, 2015 [Link]
Jörg Zimmermann, Henning H. Henze, and Armin B. Cremers: Gödel Agents in a Scalable Synchronous Agent Framework, J. Bieger, B. Goertzel, A. Potapov (Eds.): Proceedings of Artificial General Intelligence (AGI 2015), pp. 404-413, LNAI 9205, Springer, 2015. The original publication is available at www.springerlink.com [Link] [PDF]
Jörg Zimmermann and Armin B. Cremers:
Machine Spaces: Axioms and Metrics,
T. Neary, M. Cook (Eds.): Proceedings of Machines, Computations and Universality (MCU 2013),
pp. 33-34, EPTCS 128, doi:10.4204/EPTCS.128, 2013
MCU 2013 Talk: Machine Spaces: Axioms and Metrics [Slides]
Jörg Zimmermann and Armin B. Cremers:
Making Solomonoff Induction Effective or You Can Learn What You Can Bound,
S. B. Cooper, A. Dawar, B. Löwe (Eds.): How the World Computes,
pp. 745-754, LNCS 7318, Proceedings of the CiE 2012, Turing Centenary
Conference, Springer, 2012.
The original publication is available at www.springerlink.com
Turing Centenary Conference Talk: Making Solomonoff Induction Effective [Slides]
Jörg Zimmermann and Armin B. Cremers: The Quest for Uncertainty, C. Calude, G. Rozenberg, A. Salomaa (Eds.): Rainbow of Computer Science, pp. 270-283, Springer, 2011. The original publication is available at www.springerlink.com [Link] [PDF]
Jörg Zimmermann, Robin Höns, Heinz Mühlenbein: From Theory to Practice: An Evolutionary Algorithm for the Antenna Placement Problem, S. Tsutsui, A. Ghosh (Eds.): Advances in Evolutionary Computation, pp. 713-737, Springer, 2003
Jörg Zimmermann, Robin Höns, Heinz Mühlenbein: ENCON: An Evolutionary Algorithm for the Antenna Placement Problem, Computers & Industrial Engineering, 44(2): 209-226, 2003
Frank Schweitzer, Jörg Zimmermann, Heinz Mühlenbein: Coordination of Decisions in a spatial agent model, Physica A, 303: 189-216, 2002 [Link]
Frank Schweitzer and Jörg Zimmermann: Communication and Self-Organisation in Complex Systems: A Basic Approach, M. M. Fischer, J. Fröhlich (Eds.): Knowledge, Complexity and Innovation Systems, pp. 275-296, Springer, 2001
Heinz Mühlenbein and Jörg Zimmermann: Size of Neighborhood More Important than Temperature for Stochastic Local Search, Proceedings of the Congress on Evolutionary Computation (CEC), 2000 [PDF]
Jörg Zimmermann, Robin Höns, Heinz Mühlenbein: The Antenna Placement Problem - An Evolutionary Approach, B. Gavish (Ed.): 8th International Conference on Telecommunication Systems, pp. 358-366, 2000 [PDF]
The question of how to represent and process uncertainty is of fundamental importance to the scientific process, but also in everyday life. Currently there exist a lot of different calculi for managing uncertainty, each having its own advantages and disadvantages. Especially, almost all are defining the domain and structure of uncertainty values a priori, e.g., one real number, two real numbers, a finite domain, and so on, but maybe uncertainty is best measured by complex numbers, matrices or still another mathematical structure. This thesis investigates the notion of uncertainty from a foundational point of view, provides an ontology and axiomatic core system for uncertainty and derives and not defines the structure of uncertainty. The main result, the ring theorem, stating that uncertainty values are elements of the [0,1]-interval of a partially ordered ring, is used to derive a general decomposition theorem for uncertainty values, splitting them into a numerical interval and an "interaction term". In order to illustrate the unifying power of these results, the relationship to Dempster-Shafer theory is discussed and it is shown that all Dempster-Shafer measures over finite domains can be represented by ring-valued uncertainty measures. Finally, the historical development of approaches to modeling uncertainty which have led to the results of this thesis is reviewed.