Deep learning is one of the most successful methods that we have seen in computer science in the last couple of years. Results indicate that many problems can be tackled with this method and amazing results are published every day. In fact, many traditional methods in pattern recognition seem obsolete. In the scientific community, lecturers in pattern recognition and signal processing discuss whether we need to redesign all of our classes as many methods do no longer reflect the state-of-the-art anymore. It seems that all of them are outperformed by methods based on deep learning.

A novel computational model (CoDD) utilizing combinatory logic to create higher-order decision trees is presented. A theoretical analysis of general intelligence in terms of the formal theory of pattern recognition and pattern formation is outlined, and shown to take especially natural form in the case where patterns are expressed in CoDD language. Relationships between logical entropy and algorithmic information, and Shannon entropy and runtime complexity, are shown to be elucidated by this approach. Extension to the quantum computing case is also briefly discussed.

What kind of programming language would be most appropriate to serve the needs of integrative, multi-paradigm, multi-software-system approaches to AGI? This question is broached via exploring the more particular question of how to create a more scalable and usable version of the "Atomese" programming language that forms a key component of the OpenCog AGI design (an "Atomese 2.0") . It is tentatively proposed that the core of Atomese 2.0 should be a very flexible framework of rewriting rules for rewriting a metagraph (where the rules themselves are represented within the same metagraph, and some of the intermediate data created and used during the rule-interpretation process may be represented in the same metagraph). This framework should support concurrent rewriting of the metagraph according to rules that are labeled with various sorts of uncertainty-quantifications, and that are labeled with various sorts of types associated with various type systems. A gradual typing approach should be used to enable mixture of rules and other metagraph nodes/links associated with various type systems, and untyped metagraph nodes/links not associated with any type system. This must be done in a way that allows reasonable efficiency and scalability, including in concurrent and distributed processing contexts, in the case where a large percentage of of processing time is occupied with evaluating static pattern-matching queries on specific subgraphs of a large metagraph (including a rich variety of queries such as matches against nodes representing variables, and matches against whole subgraphs, etc.).

The Tsetlin Machine (TM) is a machine learning algorithm founded on the classical Tsetlin Automaton (TA) and game theory. It further leverages frequent pattern mining and resource allocation principles to extract common patterns in the data, rather than relying on minimizing output error, which is prone to overfitting. Unlike the intertwined nature of pattern representation in neural networks, a TM decomposes problems into self-contained patterns, represented as conjunctive clauses. The clause outputs, in turn, are combined into a classification decision through summation and thresholding, akin to a logistic regression function, however, with binary weights and a unit step output function. In this paper, we exploit this hierarchical structure by introducing a novel algorithm that avoids evaluating the clauses exhaustively. Instead we use a simple look-up table that indexes the clauses on the features that falsify them. In this manner, we can quickly evaluate a large number of clauses through falsification, simply by iterating through the features and using the look-up table to eliminate those clauses that are falsified. The look-up table is further structured so that it facilitates constant time updating, thus supporting use also during learning. We report up to 15 times faster classification and three times faster learning on MNIST and Fashion-MNIST image classification, and IMDb sentiment analysis.

In realistic settings, a speaker recognition system needs to identify a speaker given a short utterance, while the utterance used to enroll may be relatively long. However, existing speaker recognition models perform poorly with such short utterances. To solve this problem, we introduce a meta-learning scheme with imbalance length pairs. Specifically, we use a prototypical network and train it with a support set of long utterances and a query set of short utterances. However, since optimizing for only the classes in the given episode is not sufficient to learn discriminative embeddings for other classes in the entire dataset, we additionally classify both support set and query set against the entire classes in the training set to learn a well-discriminated embedding space. By combining these two learning schemes, our model outperforms existing state-of-the-art speaker verification models learned in a standard supervised learning framework on short utterance (1-2 seconds) on VoxCeleb dataset. We also validate our proposed model for unseen speaker identification, on which it also achieves significant gain over existing approaches.

Scanning today's headlines about Artificial Intelligence reveals an atmosphere of optimism tempered by caution. Artificial intelligence presents a huge opportunity for everyone in the value chain: health providers and organizations, vendors, regulatory agencies, and, perhaps most importantly, patients. It's driving stats like these: Sixty-two percent of respondents in a 2019 survey by OptumIQ report "having implemented an AI strategy--an increase of nearly 88% from 2018 (33%)--while 22% report being at late stages of implementation." But in these early days, the way forward can be unclear, muddied by too many choices, too many voices, and too much-sunk cost in legacy systems and thinking. To gauge how industry leaders are using or planning to deploy AI, and to collect the best thinking on the most urgent opportunities for AI in healthcare in the near term, we asked experts and influencers to weigh in.

Generalization in robotics is one of the most important problems. New generalization approaches use internet databases in order to solve new tasks. Modern search engines can return a large amount of information according to a query within milliseconds. However, not all of the returned information is task relevant, partly due to the problem of polysemes. Here we specifically address the problem of object generalization by using image search. We suggest a bi-modal solution, combining visual and textual information, based on the observation that humans use additional linguistic cues to demarcate intended word meaning. We evaluate the quality of our approach by comparing it to human labelled data and find that, on average, our approach leads to improved results in comparison to Google searches, and that it can treat the problem of polysemes.

Recent surveys, studies, forecasts and other quantitative assessments of the progress and impact of AI highlight the precarious nature of the future of work (long after the coronavirus pandemic ends), the continuing mixed attitudes of consumers about data privacy, and the possible resilience of this year's investments in AI. The IT department's need for AI talent has tripled between 2015 and 2019, but the number of AI jobs posted by IT is still less than half of that stemming from other business units; departments recruiting AI talent in high volumes include marketing, sales, customer service, finance, and research and development. By 2025, at least two of the top 10 global retailers will establish robot resource organizations to manage nonhuman workers; 77% of retailers plan to deploy AI by 2021, with the deployment of robotics for warehouse picking as the No. 1 use case [Gartner] By 2024, AI, virtual personal assistants, and chatbots will replace almost 69% of the manager's workload [Gartner] "Supervised machine learning doesn't live up to the hype. It isn't actual artificial intelligence akin to C-3PO, it's a sophisticated pattern-matching tool… Rather than seeing exponential improvements in the quality of AI performance (a la Moore's Law), we're instead seeing exponential increases in the cost to improve AI systems"--Stefan Seltz-Axmacher, founder, Starsky Robotics "…why are we holding our hands behind our back trying to build AI without mechanisms that infants have?"--Gary "We haven't really gone to great depth with deep learning yet. We've had a limited amount of training data so far. We've had limited structures with limited compute power. But the key point is that deep learning learns the concept, it learns the features. "…such capabilities [as "deepfake" transformation of the human face] were called image processing 15 years ago, but are routinely termed AI today.

Artificial intelligence systems are being employed for a wide range of tasks from recognition systems to autonomous activities, from pattern and anomaly detection to predictive analytics and conversational systems, and many other aspects . One of the areas where AI has shown particular capability is in the area of recognition, from image recognition to speech and other aspects of pattern recognition. Source: Can AI Detect Your Emotion Just By How You Walk?

In my previous post I talked about using a portable EEG device to detect Event Related Potentials (ERP's) in the brain. Specifically, I was able to detect a Reward Positivity (RewP) signal after a puzzle was solved correctly. I did this by graphing the signal immediately after the event and comparing it with the average RewP signal from this paper. Using my human brain's visual pattern recognition, I confirmed that I was getting the same pattern. Wouldn't it be interesting to train a machine learning model to recognize the same pattern so we can monitor these events automatically.