Deep Learning
10 Wonderful Examples Of Using Artificial Intelligence (AI) For Good - Fujairah Observer
One of the many benefits of using artificial intelligence (AI) is to help us view societal problems from a different perspective. While there's been much hubbub about how AI might be misused, we must not overlook the many ways AI can be used for good. Our global issues are complex, and AI provides us with a valuable tool to augment human efforts to come up with solutions to vexing problems. Here are 10 of the best ways artificial intelligence is used for good. Artificial intelligence, powered by deep-learning algorithms, is already in use in healthcare.
Understanding Deep Learning
Artificial Intelligence (AI) and Machine Learning (ML) are some of the hottest topics right now. But most people don't understand it well. But in this article, I will describe the simplest description of deep learning. The basic idea is to make this article as simple as possible which will give the reader an overall idea about the working principle of deep learning. There are some basic terms which we need to understand first.
Everything So Far At CVPR 2020 Conference - Part 2
With about 7000 attendees, the 6 days virtual conference on computer vision concluded a plethora of paper presentations, workshops and tutorials. From the breakthroughs on computer vision to open-sourcing datasets and projects, this conference was loaded with interesting topics and areas including autonomous driving, video sensing, action recognition, and much more. We have already covered the topics and tutorials from day 1 and 2, i.e. In this article, we have listed down all the important topics and tutorials that have been discussed from 16th June to 19th June. This year, the conference witnessed a record of 1,470 research papers on computer vision accepted from 6,656 valid submissions.
Neuromorphic Computing: The Next-Level Artificial Intelligence
Can AI function like a human brain? But now, armed with Neuromorphic Computing, they are ready to show the world that their dream can change the world for better. As we unearth the benefits, the success of our machine learning and AI quest seem to depend to a great extent on the success of Neuromorphic Computing. The technologies of the future like autonomous vehicles and robots will need access to and utilization of an enormous amount of data and information in real-time. Today, to a limited extent, this is done by machine learning and AI that depend on supercomputer power.
Local Motion Phases Technique Boosts Basketball Animation Richness and Realism
Researchers from the University of Edinburgh School of Informatics and video game company Electronic Arts have proposed a novel framework that learns fast and dynamic character interactions. Trained on an unstructured basketball motion capture database, the model can animate multiple contacts between a player and the ball and other players and the environment. The team's modular and stable framework for data-driven character animation includes data processing, network training and runtime control; and was developed using Unity, Tensor flow, and PyTorch. The approach can perform complex and realistic animations of bipeds or quadrupeds engaged in sports and beyond. Enabling characters to perform a wide variety of dynamic fast-paced and quickly changing movements is a key challenge in character animation.
Track Seeding and Labelling with Embedded-space Graph Neural Networks
Choma, Nicholas, Murnane, Daniel, Ju, Xiangyang, Calafiura, Paolo, Conlon, Sean, Farrell, Steven, Prabhat, null, Cerati, Giuseppe, Gray, Lindsey, Klijnsma, Thomas, Kowalkowski, Jim, Spentzouris, Panagiotis, Vlimant, Jean-Roch, Spiropulu, Maria, Aurisano, Adam, Hewes, V, Tsaris, Aristeidis, Terao, Kazuhiro, Usher, Tracy
To address the unprecedented scale of HL-LHC data, the Exa.TrkX project is investigating a variety of machine learning approaches to particle track reconstruction. The most promising of these solutions, graph neural networks (GNN), process the event as a graph that connects track measurements (detector hits corresponding to nodes) with candidate line segments between the hits (corresponding to edges). Detector information can be associated with nodes and edges, enabling a GNN to propagate the embedded parameters around the graph and predict node-, edge- and graph-level observables. Previously, message-passing GNNs have shown success in predicting doublet likelihood, and we here report updates on the state-of-the-art architectures for this task. In addition, the Exa.TrkX project has investigated innovations in both graph construction, and embedded representations, in an effort to achieve fully learned end-to-end track finding. Hence, we present a suite of extensions to the original model, with encouraging results for hitgraph classification. In addition, we explore increased performance by constructing graphs from learned representations which contain non-linear metric structure, allowing for efficient clustering and neighborhood queries of data points. We demonstrate how this framework fits in with both traditional clustering pipelines, and GNN approaches. The embedded graphs feed into high-accuracy doublet and triplet classifiers, or can be used as an end-to-end track classifier by clustering in an embedded space. A set of post-processing methods improve performance with knowledge of the detector physics. Finally, we present numerical results on the TrackML particle tracking challenge dataset, where our framework shows favorable results in both seeding and track finding.
Group Equivariant Deep Reinforcement Learning
Mondal, Arnab Kumar, Nair, Pratheeksha, Siddiqi, Kaleem
In Reinforcement Learning (RL), Convolutional Neural Networks(CNNs) have been successfully applied as function approximators in Deep Q-Learning algorithms, which seek to learn action-value functions and policies in various environments. However, to date, there has been little work on the learning of symmetry-transformation equivariant representations of the input environment state. In this paper, we propose the use of Equivariant CNNs to train RL agents and study their inductive bias for transformation equivariant Q-value approximation. We demonstrate that equivariant architectures can dramatically enhance the performance and sample efficiency of RL agents in a highly symmetric environment while requiring fewer parameters. Additionally, we show that they are robust to changes in the environment caused by affine transformations.
Learning Post-Hoc Causal Explanations for Recommendation
Xu, Shuyuan, Li, Yunqi, Liu, Shuchang, Fu, Zuohui, Zhang, Yongfeng
State-of-the-art recommender systems have the ability to generate high-quality recommendations, but usually cannot provide intuitive explanations to humans due to the usage of black-box prediction models. The lack of transparency has highlighted the critical importance of improving the explainability of recommender systems. In this paper, we propose to extract causal rules from the user interaction history as post-hoc explanations for the black-box sequential recommendation mechanisms, whilst maintain the predictive accuracy of the recommendation model. Our approach firstly achieves counterfactual examples with the aid of a perturbation model, and then extracts personalized causal relationships for the recommendation model through a causal rule mining algorithm. Experiments are conducted on several state-of-the-art sequential recommendation models and real-world datasets to verify the performance of our model on generating causal explanations. Meanwhile, We evaluate the discovered causal explanations in terms of quality and fidelity, which show that compared with conventional association rules, causal rules can provide personalized and more effective explanations for the behavior of black-box recommendation models.
Deep reinforcement learning approach to MIMO precoding problem: Optimality and Robustness
Lee, Heunchul, Girnyk, Maksym, Jeong, Jaeseong
In this paper, we propose a deep reinforcement learning (RL)-based precoding framework that can be used to learn an optimal precoding policy for complex multiple-input multiple-output (MIMO) precoding problems. We model the precoding problem for a single-user MIMO system as an RL problem in which a learning agent sequentially selects the precoders to serve the environment of MIMO system based on contextual information about the environmental conditions, while simultaneously adapting the precoder selection policy based on the reward feedback from the environment to maximize a numerical reward signal. We develop the RL agent with two canonical deep RL (DRL) algorithms, namely deep Q-network (DQN) and deep deterministic policy gradient (DDPG). To demonstrate the optimality of the proposed DRL-based precoding framework, we explicitly consider a simple MIMO environment for which the optimal solution can be obtained analytically and show that DQN- and DDPG-based agents can learn the near-optimal policy to map the environment state of MIMO system to a precoder that maximizes the reward function, respectively, in the codebook-based and non-codebook based MIMO precoding systems. Furthermore, to investigate the robustness of DRL-based precoding framework, we examine the performance of the two DRL algorithms in a complex MIMO environment, for which the optimal solution is not known. The numerical results confirm the effectiveness of the DRL-based precoding framework and show that the proposed DRL-based framework can outperform the conventional approximation algorithm in the complex MIMO environment.
A Novel RL-assisted Deep Learning Framework for Task-informative Signals Selection and Classification for Spontaneous BCIs
Ko, Wonjun, Jeon, Eunjin, Suk, Heung-Il
In this work, we formulate the problem of estimating and selecting task-relevant temporal signal segments from a single EEG trial in the form of a Markov decision process and propose a novel reinforcement-learning mechanism that can be combined with the existing deep-learning based BCI methods. To be specific, we devise an actor-critic network such that an agent can determine which timepoints need to be used (informative) or discarded (uninformative) in composing the intention-related features in a given trial, and thus enhancing the intention identification performance. To validate the effectiveness of our proposed method, we conducted experiments with a publicly available big MI dataset and applied our novel mechanism to various recent deep-learning architectures designed for MI classification. Based on the exhaustive experiments, we observed that our proposed method helped achieve statistically significant improvements in performance.