198,501 research outputs found
Genetic algorithms with DNN-based trainable crossover as an example of partial specialization of general search
Universal induction relies on some general search procedure that is doomed to
be inefficient. One possibility to achieve both generality and efficiency is to
specialize this procedure w.r.t. any given narrow task. However, complete
specialization that implies direct mapping from the task parameters to
solutions (discriminative models) without search is not always possible. In
this paper, partial specialization of general search is considered in the form
of genetic algorithms (GAs) with a specialized crossover operator. We perform a
feasibility study of this idea implementing such an operator in the form of a
deep feedforward neural network. GAs with trainable crossover operators are
compared with the result of complete specialization, which is also represented
as a deep neural network. Experimental results show that specialized GAs can be
more efficient than both general GAs and discriminative models.Comment: AGI 2017 procedding, The final publication is available at
link.springer.co
Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence
This article is a brief personal account of the past, present, and future of
algorithmic randomness, emphasizing its role in inductive inference and
artificial intelligence. It is written for a general audience interested in
science and philosophy. Intuitively, randomness is a lack of order or
predictability. If randomness is the opposite of determinism, then algorithmic
randomness is the opposite of computability. Besides many other things, these
concepts have been used to quantify Ockham's razor, solve the induction
problem, and define intelligence.Comment: 9 LaTeX page
Club guessing and the universal models
We survey the use of club guessing and other pcf constructs in the context of
showing that a given partially ordered class of objects does not have a
largest, or a universal element
Universal Structures
We deal with the existence of universal members in a given cardinality for
several classes. First we deal with classes of Abelian groups, specifically
with the existence of universal members in cardinalities which are strong limit
singular of countable cofinality. Second, we deal with (variants of) the oak
property (from a work of Dzamonja and the author), a property of complete first
order theories, sufficient for the non-existence of universal models under
suitable cardinal assumptions. Third, we prove that the oak property holds for
the class of groups (naturally interpreted, so for quantifier free formulas)
and deal more with the existence of universals
- …