Global optimization with space-filling curves

AbstractIt is shown that, contrary to a claim of Törn and Zilinskas, it is possible to efficiently optimize functions on n dimensions by projecting them into a single dimension using a space-filling curve

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

AGI and the Knight-Darwin Law: why idealized AGI reproduction requires collaboration

Can an AGI create a more intelligent AGI? Under idealized assumptions, for a certain theoretical type of intelligence, our answer is: “Not without outside help”. This is a paper on the mathematical structure of AGI populations when parent AGIs create child AGIs. We argue that such populations satisfy a certain biological law. Motivated by observations of sexual reproduction in seemingly-asexual species, the Knight-Darwin Law states that it is impossible for one organism to asexually produce another, which asexually produces another, and so on forever: that any sequence of organisms (each one a child of the previous) must contain occasional multi-parent organisms, or must terminate. By proving that a certain measure (arguably an intelligence measure) decreases when an idealized parent AGI single-handedly creates a child AGI, we argue that a similar Law holds for AGIs

Towards Autopoietic Computing

A key challenge in modern computing is to develop systems that address complex, dynamic problems in a scalable and efficient way, because the increasing complexity of software makes designing and maintaining efficient and flexible systems increasingly difficult. Biological systems are thought to possess robust, scalable processing paradigms that can automatically manage complex, dynamic problem spaces, possessing several properties that may be useful in computer systems. The biological properties of self-organisation, self-replication, self-management, and scalability are addressed in an interesting way by autopoiesis, a descriptive theory of the cell founded on the concept of a system's circular organisation to define its boundary with its environment. In this paper, therefore, we review the main concepts of autopoiesis and then discuss how they could be related to fundamental concepts and theories of computation. The paper is conceptual in nature and the emphasis is on the review of other people's work in this area as part of a longer-term strategy to develop a formal theory of autopoietic computing.Comment: 10 Pages, 3 figure

Effectiveness and cost-effectiveness of body psychotherapy in the treatment of negative symptoms of schizophrenia - a multi-centre randomised controlled trial

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited

Psoriasis prediction from genome-wide SNP profiles

<p>Abstract</p> <p>Background</p> <p>With the availability of large-scale genome-wide association study (GWAS) data, choosing an optimal set of SNPs for disease susceptibility prediction is a challenging task. This study aimed to use single nucleotide polymorphisms (SNPs) to predict psoriasis from searching GWAS data.</p> <p>Methods</p> <p>Totally we had 2,798 samples and 451,724 SNPs. Process for searching a set of SNPs to predict susceptibility for psoriasis consisted of two steps. The first one was to search top 1,000 SNPs with high accuracy for prediction of psoriasis from GWAS dataset. The second one was to search for an optimal SNP subset for predicting psoriasis. The sequential information bottleneck (sIB) method was compared with classical linear discriminant analysis(LDA) for classification performance.</p> <p>Results</p> <p>The best test harmonic mean of sensitivity and specificity for predicting psoriasis by sIB was 0.674(95% CI: 0.650-0.698), while only 0.520(95% CI: 0.472-0.524) was reported for predicting disease by LDA. Our results indicate that the new classifier sIB performs better than LDA in the study.</p> <p>Conclusions</p> <p>The fact that a small set of SNPs can predict disease status with average accuracy of 68% makes it possible to use SNP data for psoriasis prediction.</p

Self-explaining AI as an alternative to interpretable AI

The ability to explain decisions made by AI systems is highly sought after, especially in domains where human lives are at stake such as medicine or autonomous vehicles. While it is often possible to approximate the input-output relations of deep neural networks with a few human-understandable rules, the discovery of the double descent phenomena suggests that such approximations do not accurately capture the mechanism by which deep neural networks work. Double descent indicates that deep neural networks typically operate by smoothly interpolating between data points rather than by extracting a few high level rules. As a result, neural networks trained on complex real world data are inherently hard to interpret and prone to failure if asked to extrapolate. To show how we might be able to trust AI despite these problems we introduce the concept of self-explaining AI. Self-explaining AIs are capable of providing a human-understandable explanation of each decision along with confidence levels for both the decision and explanation. For this approach to work, it is important that the explanation actually be related to the decision, ideally capturing the mechanism used to arrive at the explanation. Finally, we argue it is important that deep learning based systems include a "warning light" based on techniques from applicability domain analysis to warn the user if a model is asked to extrapolate outside its training distribution. For a video presentation of this talk see https://www.youtube.com/watch?v=Py7PVdcu7WY& .Comment: 10pgs, 2 column forma

Evolving Generalised Maze Solvers

This paper presents a study of the efficacy of comparative controller design methods that aim to produce generalised problem solving behaviours. In this case study, the goal was to use neuro-evolution to evolve generalised maze solving behaviours. That is, evolved robot controllers that solve a broad range of mazes. To address this goal, this study compares objective, non-objective and hybrid approaches to direct the search of a neuro-evolution controller design method. The objective based approach was a fitness function, the non-objective based approach was novelty search, and the hybrid approach was a combination of both. Results indicate that, compared to the fitness function, the hybrid and novelty search evolve significantly more maze solving behaviours that generalise to larger and more difficult maze sets. Thus this research provides empirical evidence supporting novelty and hybrid novelty-objective search as approaches for potentially evolving generalised problem solvers

Prolog Technology Reinforcement Learning Prover: (System Description)

We present a reinforcement learning toolkit for experiments with guiding automated theorem proving in the connection calculus. The core of the toolkit is a compact and easy to extend Prolog-based automated theorem prover called plCoP. plCoP builds on the leanCoP Prolog implementation and adds learning-guided Monte-Carlo Tree Search as done in the rlCoP system. Other components include a Python interface to plCoP and machine learners, and an external proof checker that verifies the validity of plCoP proofs. The toolkit is evaluated on two benchmarks and we demonstrate its extendability by two additions: (1) guidance is extended to reduction steps and (2) the standard leanCoP calculus is extended with rewrite steps and their learned guidance. We argue that the Prolog setting is suitable for combining statistical and symbolic learning methods. The complete toolkit is publicly released. © 2020, Springer Nature Switzerland AG

How young adults in London experience the Clubhouse Model of mental health recovery: a thematic analysis

Clubhouses are recovery orientated, participatory communities in which people with mental health diagnoses can take part in the running of the clubhouse. The objective of this research was to produce the first qualitative study of its kind, examining how the clubhouse model of mental health recovery is perceived and experienced by young adults aged 16-25. Five participants provided lengthy and detailed semi-structured interviews regarding their experiences as members of a clubhouse in London. Analysis produced themes including mixed age services as a distinct benefit, the benefits of getting involved in the work of the clubhouse, the mostly positive perception of the clubhouse compared with other mental health services, and the sense of personal change and social improvement experienced on becoming members of the clubhouse. While further research is needed, it was concluded that the clubhouse model was beneficial to all its young members, for reasons including its entirely collaborative and consultative process between staff and members, its humanitarian approach, its lack of rigid or inflexible time limits, and its reciprocal relationships, where members are expected to both provide and receive support