Problem Solving
Neuro-symbolic AI brings us closer to machines with common sense
This article is part of our coverage of the latest in AI research. Artificial intelligence research has made great achievements in solving specific applications, but we're still far from the kind of general-purpose AI systems that scientists have been dreaming of for decades. Among the solutions being explored to overcome the barriers of AI is the idea of neuro-symbolic systems that bring together the best of different branches of computer science. In a talk at the IBM Neuro-Symbolic AI Workshop, Joshua Tenenbaum, professor of computational cognitive science at the Massachusetts Institute of Technology, explained how neuro-symbolic systems can help to address some of the key problems of current AI systems. Among the many gaps in AI, Tenenbaum is focused on one in particular: "How do we go beyond the idea of intelligence as recognizing patterns in data and approximating functions and more toward the idea of all the things the human mind does when you're modeling the world, explaining and understanding the things you're seeing, imagining things that you can't see but could happen, and making them into goals that you can achieve by planning actions and solving problems?"
Sparse Subspace Clustering for Concept Discovery (SSCCD)
Vielhaben, Johanna, Blücher, Stefan, Strodthoff, Nils
Concepts are key building blocks of higher level human understanding. Explainable AI (XAI) methods have shown tremendous progress in recent years, however, local attribution methods do not allow to identify coherent model behavior across samples and therefore miss this essential component. In this work, we study concept-based explanations and put forward a new definition of concepts as low-dimensional subspaces of hidden feature layers. We novelly apply sparse subspace clustering to discover these concept subspaces. Moving forward, we derive insights from concept subspaces in terms of localized input (concept) maps, show how to quantify concept relevances and lastly, evaluate similarities and transferability between concepts. We empirically demonstrate the soundness of the proposed Sparse Subspace Clustering for Concept Discovery (SSCCD) method for a variety of different image classification tasks. This approach allows for deeper insights into the actual model behavior that would remain hidden from conventional input-level heatmaps.
Synopsys Releases Simpleware T-2022.03 for 3D Image Processing, Model Generation
MOUNTAIN VIEW, CA, USA, Mar 9, 2022 – Synopsys is pleased to announce the Simpleware Release T-2022.03. The latest release of Simpleware software includes many new features and improvements, including the new shoulder CT tool in the Simpleware AS Ortho module, contour measurements, improved 3D printing capabilities, and aortic valve analysis. Join us on March 30, 2022 to see the new features in action. Register to watch live or to receive the on-demand recording to view at your own convenience. Synopsys' Simpleware software provides an industry-leading, comprehensive 3D image processing platform for handling 3D scan data.
Computing unsatisfiable cores for LTLf specifications
Roveri, Marco, Di Ciccio, Claudio, Di Francescomarino, Chiara, Ghidini, Chiara
Linear-time temporal logic on finite traces (LTLf) is rapidly becoming a de-facto standard to produce specifications in many application domains (e.g., planning, business process management, run-time monitoring, reactive synthesis). Several studies approached the respective satisfiability problem. In this paper, we investigate the problem of extracting the unsatisfiable core in LTLf specifications. We provide four algorithms for extracting an unsatisfiable core leveraging the adaptation of state-of-the-art approaches to LTLf satisfiability checking. We implement the different approaches within the respective tools and carry out an experimental evaluation on a set of reference benchmarks, restricting to the unsatisfiable ones. The results show the feasibility, effectiveness, and complementarities of the different algorithms and tools.
Pinaki Laskar on LinkedIn: #artificialintelligence #robots #machinelearning
AI Researcher, Cognitive Technologist Inventor - AI Thinking, Think Chain Innovator - AIOT, XAI, Autonomous Cars, IIOT Founder Fisheyebox Spatial Computing Savant, Transformative Leader, Industry X.0 Practitioner How intellect is artificial intelligence today? It is as smart as its dump, dull and deficient (3d). Today's quasi-AI is biased, black box, oblique, weak and narrow. It could blindly and unknowingly perform strictly what it was designed for, videogame/chess/strategic games playing, self-driving, language translation, face recognition, fraud detection, speech communication, product recommendation, pattern matching, generating poetry or music or images or faces or new molecules, etc. It is all relying on statistical relationships in raw input data sets to generate some patterns that humans find useful.
TransDreamer: Reinforcement Learning with Transformer World Models
The Dreamer agent provides various benefits of Model-Based Reinforcement Learning (MBRL) such as sample efficiency, reusable knowledge, and safe planning. However, its world model and policy networks inherit the limitations of recurrent neural networks and thus an important question is how an MBRL framework can benefit from the recent advances of transformers and what the challenges are in doing so. In this paper, we propose a transformer-based MBRL agent, called TransDreamer. We first introduce the Transformer State-Space Model, a world model that leverages a transformer for dynamics predictions. We then share this world model with a transformer-based policy network and obtain stability in training a transformer-based RL agent. In experiments, we apply the proposed model to 2D visual RL and 3D first-person visual RL tasks both requiring long-range memory access for memory-based reasoning. We show that the proposed model outperforms Dreamer in these complex tasks.
Algorithms and Data Structures in Python (INTERVIEW Q&A)
In the first part of the course we are going to learn about basic data structures such as linked lists, stacks, queues, binary search trees, heaps and some advanced ones such as AVL trees and red-black trees.. The second part will be about graph algorithms such as spanning trees, shortest path algorithms and graph traversing. We will try to optimize each data structure as much as possible. In each chapter I am going to talk about the theoretical background of each algorithm or data structure, then we are going to write the code step by step in Python. Most of the advanced algorithms relies heavily on these topics so it is definitely worth understanding the basics. These principles can be used in several fields: in investment banking, artificial intelligence or electronic trading algorithms on the stock market. Research institutes use Python as a programming language in the main: there are a lot of library available for the public from machine learning to complex networks. Thanks for joining the course, let's get started!
Entropic Associative Memory for Manuscript Symbols
Morales, Rafael, Hernández, Noé, Cruz, Ricardo, Cruz, Victor D., Pineda, Luis A.
Manuscript symbols can be stored, recognized and retrieved from an entropic digital memory that is associative and distributed but yet declarative; memory retrieval is a constructive operation, memory cues to objects not contained in the memory are rejected directly without search, and memory operations can be performed through parallel computations. Manuscript symbols, both letters and numerals, are represented in Associative Memory Registers that have an associated entropy. The memory recognition operation obeys an entropy trade-off between precision and recall, and the entropy level impacts on the quality of the objects recovered through the memory retrieval operation. The present proposal is contrasted in several dimensions with neural networks models of associative memory. We discuss the operational characteristics of the entropic associative memory for retrieving objects with both complete and incomplete information, such as severe occlusions. The experiments reported in this paper add evidence on the potential of this framework for developing practical applications and computational models of natural memory.