I know this topic has been discussed many times. But I recently gave some talks on interpretability (for SCAI and France Innovation) and thought it would be good to include some of my work in this article. The importance of explainability for the decision-making process in machine learning doesn't need to be proved any longer. Users are demanding more explanations, and although there are no uniform and strict definitions of interpretability and explainability, the number of scientific papers explaining artificial intelligence (or XAI) is growing exponentially. As you may know, there are two ways to design an interpretable machine learning process.

Recent research in the field of computer vision strongly focuses on deep learning architectures to tackle image processing problems. Deep neural networks are often considered in complex image processing scenarios since traditional computer vision approaches are expensive to develop or reach their limits due to complex relations. However, a common criticism is the need for large annotated datasets to determine robust parameters. Annotating images by human experts is time-consuming, burdensome, and expensive. Thus, support is needed to simplify annotation, increase user efficiency, and annotation quality. In this paper, we propose a generic workflow to assist the annotation process and discuss methods on an abstract level. Thereby, we review the possibilities of focusing on promising samples, image pre-processing, pre-labeling, label inspection, or post-processing of annotations. In addition, we present an implementation of the proposal by means of a developed flexible and extendable software prototype nested in hybrid touchscreen/laptop device.

We review the scholarly contributions that utilise Natural Language Processing (NLP) methods to support the design process. Using a heuristic approach, we collected 223 articles published in 32 journals and within the period 1991-present. We present state-of-the-art NLP in-and-for design research by reviewing these articles according to the type of natural language text sources: internal reports, design concepts, discourse transcripts, technical publications, consumer opinions, and others. Upon summarizing and identifying the gaps in these contributions, we utilise an existing design innovation framework to identify the applications that are currently being supported by NLP. We then propose a few methodological and theoretical directions for future NLP in-and-for design research.

Artificial intelligence is driving the technological revolution, and experts in this field believe it has the potential to be the game-changing technology that will change the world. If you want to pursue a career in artificial intelligence, Python is one of the most important skills you should learn. If you want to learn Python for artificial intelligence, you must understand what Python is and how it can be used across multiple fields in the technology industry. This article will cover the quickest and most dependable educational paths for learning Python, as well as a step-by-step guide for learning Python for artificial intelligence. Python is an object oriented, interpreted general-purpose programming language.

There is a tendency across different subfields in AI to valorize a small collection of influential benchmarks. These benchmarks operate as stand-ins for a range of anointed common problems that are frequently framed as foundational milestones on the path towards flexible and generalizable AI systems. State-of-the-art performance on these benchmarks is widely understood as indicative of progress towards these long-term goals. In this position paper, we explore the limits of such benchmarks in order to reveal the construct validity issues in their framing as the functionally "general" broad measures of progress they are set up to be.

The metaverse, enormous virtual-physical cyberspace, has brought unprecedented opportunities for artists to blend every corner of our physical surroundings with digital creativity. This article conducts a comprehensive survey on computational arts, in which seven critical topics are relevant to the metaverse, describing novel artworks in blended virtual-physical realities. The topics first cover the building elements for the metaverse, e.g., virtual scenes and characters, auditory, textual elements. Next, several remarkable types of novel creations in the expanded horizons of metaverse cyberspace have been reflected, such as immersive arts, robotic arts, and other user-centric approaches fuelling contemporary creative outputs. Finally, we propose several research agendas: democratising computational arts, digital privacy, and safety for metaverse artists, ownership recognition for digital artworks, technological challenges, and so on. The survey also serves as introductory material for artists and metaverse technologists to begin creations in the realm of surrealistic cyberspace.

A key distinguishing feature of conversational recommender systems over traditional recommender systems is their ability to elicit user preferences using natural language. Currently, the predominant approach to preference elicitation is to ask questions directly about items or item attributes. These strategies do not perform well in cases where the user does not have sufficient knowledge of the target domain to answer such questions. Conversely, in a shopping setting, talking about the planned use of items does not present any difficulties, even for those that are new to a domain. In this paper, we propose a novel approach to preference elicitation by asking implicit questions based on item usage. Our approach consists of two main steps. First, we identify the sentences from a large review corpus that contain information about item usage. Then, we generate implicit preference elicitation questions from those sentences using a neural text-to-text model. The main contributions of this work also include a multi-stage data annotation protocol using crowdsourcing for collecting high-quality labeled training data for the neural model. We show that our approach is effective in selecting review sentences and transforming them to elicitation questions, even with limited training data. Additionally, we provide an analysis of patterns where the model does not perform optimally.

Venture Capitalists are hoping to find the next superstar tech unicorn, AI startup founders dreaming of creating the next unicorn, and corporates adopting AI need to consider their data growth strategy in order to be able to scale their AI-enabled services or products. The past decade has been one of explosive growth in digital data and AI capabilities across the digital media and e-commerce space. And it is no accident that the strongest AI capabilities reside in the Tech majors. The author argues that there will be no AI winter in the 2020s as there was in 1974 and 1987 as the internet (social media and e-commerce) are so dependent upon AI capabilities and so too with being the Metaverse, and the era of 5G enabled Edge Computing with the Internet of Things (IoT). Furthermore, the following infographics illustrate how many people globally use social media and hence how central these channels have become to the everyday lives of people. Likewise, the size of the e-commerce market is vast. Although the era of standalone 5G networks may enable a window of opportunity for a new wave of consumer-facing applications in the business to consumer (B2C) in relation to e-commerce and perhaps even new digital media platforms that may challenge the current incumbents, after all the arrival of 4G provided a window for the likes of Airbnb, Uber, and leading social media platforms such as Facebook, Instagram, etc. to scale.

BrainChip Holdings Ltd (ASX: BRN), (OTCQX: BCHPY) a leading provider of ultra-low power high performance artificial intelligence technology and the world's first commercial producer of neuromorphic AI chips and IP, today announced that MegaChips, a pioneer in the ASIC industry, has licensed BrainChip Akida IP to enhance and grow its technology positioning for next-generation, Edge-based AI solutions. A multibillion-dollar global fabless semiconductor company based in Japan, MegaChips provides chip solutions that fulfill various requirements, including low power consumption, cost and time to market, while achieving breakthrough functions and performance by fusing knowledge of Large Scale Integrations and applications for problems in device development. By partnering with BrainChip, MegaChips is able to quickly and easily maintain its industry innovator status by supplying solutions and applications that leverage the Akida revolutionary technology in markets such as automotive, IoT, cameras, gaming and industrial robotics. "As a trusted and loyal partner to market leaders, we deliver the technology and expertise they need to ensure products are uniquely designed for their customers and engineered for ultimate performance," said Tetsuo Hikawa, President and CEO of MegaChips. "Working with BrainChip and incorporating their Akida technology into our ASIC solutions service, we are better able to handle the development and support processes needed to design and manufacture integrated circuits and systems on chips that can take advantage of AI at the Edge."

We give the first polynomial-time algorithm to estimate the mean of a $d$-variate probability distribution with bounded covariance from $\tilde{O}(d)$ independent samples subject to pure differential privacy. Prior algorithms for this problem either incur exponential running time, require $\Omega(d^{1.5})$ samples, or satisfy only the weaker concentrated or approximate differential privacy conditions. In particular, all prior polynomial-time algorithms require $d^{1+\Omega(1)}$ samples to guarantee small privacy loss with "cryptographically" high probability, $1-2^{-d^{\Omega(1)}}$, while our algorithm retains $\tilde{O}(d)$ sample complexity even in this stringent setting. Our main technique is a new approach to use the powerful Sum of Squares method (SoS) to design differentially private algorithms. SoS proofs to algorithms is a key theme in numerous recent works in high-dimensional algorithmic statistics -- estimators which apparently require exponential running time but whose analysis can be captured by low-degree Sum of Squares proofs can be automatically turned into polynomial-time algorithms with the same provable guarantees. We demonstrate a similar proofs to private algorithms phenomenon: instances of the workhorse exponential mechanism which apparently require exponential time but which can be analyzed with low-degree SoS proofs can be automatically turned into polynomial-time differentially private algorithms. We prove a meta-theorem capturing this phenomenon, which we expect to be of broad use in private algorithm design. Our techniques also draw new connections between differentially private and robust statistics in high dimensions. In particular, viewed through our proofs-to-private-algorithms lens, several well-studied SoS proofs from recent works in algorithmic robust statistics directly yield key components of our differentially private mean estimation algorithm.