Goto

Collaborating Authors

 Expert Systems


Making sense of sensory input

arXiv.org Artificial Intelligence

This paper attempts to answer a central question in unsupervised learning: what does it mean to "make sense" of a sensory sequence? In our formalization, making sense involves constructing a symbolic causal theory that explains the sensory sequence and satisfies a set of unity conditions. This model was inspired by Kant's discussion of the synthetic unity of apperception in the Critique of Pure Reason. On our account, making sense of sensory input is a type of program synthesis, but it is unsupervised program synthesis. Our second contribution is a computer implementation, the Apperception Engine, that was designed to satisfy the above requirements. Our system is able to produce interpretable human-readable causal theories from very small amounts of data, because of the strong inductive bias provided by the Kantian unity constraints. A causal theory produced by our system is able to predict future sensor readings, as well as retrodict earlier readings, and "impute" (fill in the blanks of) missing sensory readings, in any combination. We tested the engine in a diverse variety of domains, including cellular automata, rhythms and simple nursery tunes, multi-modal binding problems, occlusion tasks, and sequence induction IQ tests. In each domain, we test our engine's ability to predict future sensor values, retrodict earlier sensor values, and impute missing sensory data. The Apperception Engine performs well in all these domains, significantly out-performing neural net baselines. We note in particular that in the sequence induction IQ tasks, our system achieved human-level performance. This is notable because our system is not a bespoke system designed specifically to solve IQ tasks, but a general purpose apperception system that was designed to make sense of any sensory sequence.


Enriching Visual with Verbal Explanations for Relational Concepts -- Combining LIME with Aleph

arXiv.org Artificial Intelligence

With the increasing number of deep learning applications, there is a growing demand for explanations. Visual explanations provide information about which parts of an image are relevant for a classifier's decision. However, highlighting of image parts (e.g., an eye) cannot capture the relevance of a specific feature value for a class (e.g., that the eye is wide open). Furthermore, highlighting cannot convey whether the classification depends on the mere presence of parts or on a specific spatial relation between them. Consequently, we present an approach that is capable of explaining a classifier's decision in terms of logic rules obtained by the Inductive Logic Programming system Aleph. The examples and the background knowledge needed for Aleph are based on the explanation generation method LIME. We demonstrate our approach with images of a blocksworld domain. First, we show that our approach is capable of identifying a single relation as important explanatory construct. Afterwards, we present the more complex relational concept of towers. Finally, we show how the generated relational rules can be explicitly related with the input image, resulting in richer explanations.



Method for the semantic indexing of concept hierarchies, uniform representation, use of relational database systems and generic and case-based reasoning

arXiv.org Artificial Intelligence

This paper presents a method for semantic indexing and describes its application in the field of knowledge representation. Starting point of the semantic indexing is the knowledge represented by concept hierarchies. The goal is to assign keys to nodes (concepts) that are hierarchically ordered and syntactically and semantically correct. With the indexing algorithm, keys are computed such that concepts are partially unifiable with all more specific concepts and only semantically correct concepts are allowed to be added. The keys represent terminological relationships. Correctness and completeness of the underlying indexing algorithm are proven. The use of classical relational databases for the storage of instances is described. Because of the uniform representation, inference can be done using case-based reasoning and generic problem solving methods.


Home - Knowledge Base

#artificialintelligence

I am writing this guide to cover all OSCP topics as well as other infosec knowledge in details, I will also provide a cheat-sheet in each section so that you can use the commands directly once you understand the topics/tools. But I think to become a good pentester you should know how things work. Pentesting is a very wide field, like if you are interested in webapp pentesting then you should know how application interacts with databases, basics of databses, webapp languages. Similarly if you want to become system/platform(OS) pentester, you should know how to setup the OS, how to do system configuration, and what people can miss when they do configuration. This can guide you to think in the direction of finding vulnerability.


A Unified Framework for Nonmonotonic Reasoning with Vagueness and Uncertainty

arXiv.org Artificial Intelligence

Answer set programming (ASP) is a declarative problem solvi ng paradigm for nonmonotonic reasoning. ASP allows intuitiive represe ntation of combinatorial search and optimization problems and is widely use d for knowledge representation and reasoning in various applications like plan generation, natural language processing etc [14, 15]. But ASP can not dea l with fuzzy information, where attributes and truth degrees lie in a con tinuous range of values. Fuzzy Answer Set Programming (F ASP) is proposed as a n extension of ASP that allows graded truth values from the interval [0,1 ]. Theoretical advancement of F ASP is remarkable [18, 32, 9, 22, 23]. Howeve r, this approach performs reasoning with absolutely certain but vagu e information and doesn't involve reasoning with uncertain information.


Spread-gram: A spreading-activation schema of network structural learning

arXiv.org Machine Learning

Network representation learning has exploded recently. However, existing studies usually reconstruct networks as sequences or matrices, which may cause information bias or sparsity problem during model training. Inspired by a cognitive model of human memory, we propose a network representation learning scheme. In this scheme, we learn node embeddings by adjusting the proximity of nodes traversing the spreading structure of the network. Our proposed method shows a significant improvement in multiple analysis tasks based on various real-world networks, ranging from semantic networks to protein interaction networks, international trade networks, human behavior networks, etc. In particular, our model can effectively discover the hierarchical structures in networks. The well-organized model training speeds up the convergence to only a small number of iterations, and the training time is linear with respect to the edge numbers.


Dynamically Pruned Message Passing Networks for Large-Scale Knowledge Graph Reasoning

arXiv.org Artificial Intelligence

We propose Dynamically Pruned Message Passing Networks (DPMPN) for large-scale knowledge graph reasoning. In contrast to existing models, embedding-based or path-based, we learn an input-dependent subgraph to explicitly model a sequential reasoning process. Each subgraph is dynamically constructed, expanding itself selectively under a flow-style attention mechanism. In this way, we can not only construct graphical explanations to interpret prediction, but also prune message passing in Graph Neural Networks (GNNs) to scale with the size of graphs. We take the inspiration from the consciousness prior proposed by Bengio to design a two-GNN framework to encode global input-invariant graph-structured representation and learn local input-dependent one coordinated by an attention module. Experiments show the reasoning capability in our model that is providing a clear graphical explanation as well as predicting results accurately, outperforming most state-of-the-art methods in knowledge base completion tasks.


Data Interpretation Support in Rescue Operations: Application for French Firefighters

arXiv.org Artificial Intelligence

--This work aims at developing a system that supports French firefighters in data interpretation during rescue operations. An application ontology is proposed based on existing crisis management ones and operational expertise collection. After that, a knowledge-based system will be developed and integrated in firefighters' environment. Our first studies are shown in this paper. Rescue of people consists in saving their life in case of distress situations by applying responsive operations. In France, it is defined as specific tasks to be accomplished by public services in order to ensure the safety of patients and victims by making them able to escape from dangers, securing intervention sites, providing medical help, and finally, ensuring the evacuation to an appropriate place of reception [1].


Basic 5. AI with Human Characters (Updated on 2019.9.23)

#artificialintelligence

You may pay USD 10 per week to subscribe the service.. 5.3 Experienced User/Business Customer has an Receptive Character AI to build his/her own habits and kingdom (knowledge system, social circles, resources, target-list,,,) Receptive AI: Hi, may I help you? User:I want to build my own kingdom.