Genre
5 global problems that AI could help us solve – The Indian Economist
There's a great deal of concern over artificial intelligence; what it means for our jobs, whether robots will one day replace us in the workplace, whether it will one day lead to robot wars. But current research projects show that artificial intelligence (AI) can also be used for the greater good. Here are five global problems that machine learning could help us solve. One of the biggest benefits of AI is its ability to trawl through massive amounts of data in record time. This helps researchers pinpoint areas of focus for their own research.
Bloq Acquires Skry, Supercharges Blockchain Analytics With AI and Machine Learning
Bloq, a provider of blockchain technology solutions for global enterprises, announced that it has acquired Skry (formerly Coinalytics), a pioneer in blockchain analytics, to accelerate the development of its analytics capabilities and open the door for Artificial Intelligence (AI) on its platform. With the acquisition, Bloq wants to enhance its suite of analysis tools and position itself to maximize the value of blockchain data sets through AI and machine learning. The Chicago-based company focuses on solving key business issues surrounding security, provenance, authentication and reconciliation. The new acquisition, whose detailed terms haven't been disclosed, includes Skry's intellectual property and team, which seems a perfect fit for Bloq's focus on empowering better visibility and decision-making in a multi-blockchain, multi-network world. "Financial institutions will need a full suite of tools to take blockchain [technology]'s role from high-tech database to business-driver," Bloq's Co-Founder and Chairman Matthew Roszak explained to Bitcoin Magazine.
Machine Learning Algorithms Enhance Predictive Modeling of 2D Materials
Researchers from Argonne National Laboratory, using supercomputers at Berkeley Lab's National Energy Research Scientific Computing Center (NERSC), are employing machine learning algorithms to accurately predict the physical, chemical and mechanical properties of nanomaterials, reducing the time it takes to yield such predictions from years to months--in some cases even weeks. This approach could help accelerate the discovery and development of new materials. Using a modeling framework built around a molecular dynamics code (LAMMPS), the research team ran a series of simulations to study the structure and temperature-dependent thermal conductivity of stanene, a 2D material made up of a one-atom-thick sheet of tin. This work, which involved a set of parameters known as the "many-body interatomic potential" or "force field," yielded the first atomic-level computer model that accurately predicts stanene's structural, elastic and thermal properties. The findings were published in The Journal of Physical Chemistry Letters.
The Designer's AI Study Guide.
It seems like everyone wants to invest in artificial intelligence (AI). And it's not just the tech giants: USAA is using AI to protect its users from identity theft and Under Armour has connected its health app, MyFitnessPal, to IBM Watson so users can get a more thorough read of their health. AI is already a $15 billion dollar industry, according to the MIT Technology Review, with more than 2,600 companies developing their own tech, and the value of AI is reported to rise to over $70 billion by 2020. Because of AI's business opportunities, hundreds of designers in digital agencies, people who were taught to create products and services that live on the Internet, are starting to build physical products that interact with us, respond to our moods, and make decisions for us. It's a challenge that requires every skill they've learned, plus many they haven't. Still, designers know the basics: The principles of user-centric design lay the groundwork for building a great AI system.
Artificial Intelligence and Additive Manufacturing to Transform the Supply Chain Process, Reports SpendEdge
LONDON--(BUSINESS WIRE)--Artificial intelligence and additive manufacturing or 3D printing are emerging technologies that have a huge potential in a variety of industries and applications. Despite both technologies being fairly new, particularly 3D printing, procurement market intelligence experts at SpendEdge state that these technologies have several applications in the supply chain for addressing procurement challenges, and will very soon become an integral part due to its improved and sophisticated functionalities. Rapid prototyping is one of the most common uses of additive manufacturing. Since designing a successful product can be very expensive and time-consuming, 3D printed prototyping makes it quite simple at the same time shortens the manufacturing cycle. The impact of AM on supply chain is massive, some of which include increased manufacturing flexibility, reduced material waste, and the ability to employ decentralized manufacturing strategies.
Neural Machine Translation and Sequence-to-sequence Models: A Tutorial
This tutorial introduces a new and powerful set of techniques variously called "neural machine translation" or "neural sequence-to-sequence models". These techniques have been used in a number of tasks regarding the handling of human language, and can be a powerful tool in the toolbox of anyone who wants to model sequential data of some sort. The tutorial assumes that the reader knows the basics of math and programming, but does not assume any particular experience with neural networks or natural language processing. It attempts to explain the intuition behind the various methods covered, then delves into them with enough mathematical detail to understand them concretely, and culiminates with a suggestion for an implementation exercise, where readers can test that they understood the content in practice.
A Theory of Output-Side Unsupervised Domain Adaptation
When learning a mapping from an input space to an output space, the assumption that the sample distribution of the training data is the same as that of the test data is often violated. Unsupervised domain shift methods adapt the learned function in order to correct for this shift. Previous work has focused on utilizing unlabeled samples from the target distribution. We consider the complementary problem in which the unlabeled samples are given post mapping, i.e., we are given the outputs of the mapping of unknown samples from the shifted domain. Two other variants are also studied: the two sided version, in which unlabeled samples are give from both the input and the output spaces, and the Domain Transfer problem, which was recently formalized. In all cases, we derive generalization bounds that employ discrepancy terms.
Graph sampling with determinantal processes
Tremblay, Nicolas, Amblard, Pierre-Olivier, Barthelmé, Simon
We present a new random sampling strategy for k-bandlimited signals defined on graphs, based on determinantal point processes (DPP). For small graphs, ie, in cases where the spectrum of the graph is accessible, we exhibit a DPP sampling scheme that enables perfect recovery of bandlimited signals. For large graphs, ie, in cases where the graph's spectrum is not accessible, we investigate, both theoretically and empirically, a sub-optimal but much faster DPP based on loop-erased random walks on the graph. Preliminary experiments show promising results especially in cases where the number of measurements should stay as small as possible and for graphs that have a strong community structure. Our sampling scheme is efficient and can be applied to graphs with up to $10^6$ nodes.
Spectral Clustering via Graph Filtering: Consistency on the High-Dimensional Stochastic Block Model
Pydi, Muni Sreenivas, Dukkipati, Ambedkar
Spectral clustering is amongst the most popular methods for community detection in graphs. A key step in spectral clustering algorithms is the eigen-decomposition of the $n{\times}n$ graph Laplacian matrix to extract its $k$ leading eigenvectors, where $k$ is the desired number of clusters among $n$ objects. This is prohibitively complex to implement for very large datasets. However, it has recently been shown that it is possible to bypass the eigen-decomposition by computing an approximate spectral embedding through graph filtering of random signals. In this paper, we prove that spectral clustering performed via graph filtering can still recover the planted clusters consistently, under mild conditions. We analyse the effects of sparsity, dimensionality and filter approximation error on the consistency of the algorithm.
Tensor-Dictionary Learning with Deep Kruskal-Factor Analysis
Stevens, Andrew, Pu, Yunchen, Sun, Yannan, Spell, Greg, Carin, Lawrence
A multi-way factor analysis model is introduced for tensor-variate data of any order. Each data item is represented as a (sparse) sum of Kruskal decompositions, a Kruskal-factor analysis (KFA). KFA is nonparametric and can infer both the tensor-rank of each dictionary atom and the number of dictionary atoms. The model is adapted for online learning, which allows dictionary learning on large data sets. After KFA is introduced, the model is extended to a deep convolutional tensor-factor analysis, supervised by a Bayesian SVM. The experiments section demonstrates the improvement of KFA over vectorized approaches (e.g., BPFA), tensor decompositions, and convolutional neural networks (CNN) in multi-way denoising, blind inpainting, and image classification. The improvement in PSNR for the inpainting results over other methods exceeds 1dB in several cases and we achieve state of the art results on Caltech101 image classification.