Deep Learning
2021: A year in AI (so far)
If 2020 was the year of large language models and meta-learning, 2021 so far has been the year of large, multi-modal models that combine vision and text together. OpenAI's CLIP and DALL-E models have shown just how robust the combination of language modeling and vision can be. DALL-E in particular has shown itself to be capable of generating very impressive images based on user-specified text prompts. Presumably, there's much more to come in this area, including integrations with robotics and a continued push toward bringing AI into the physical world. New questions are being raised about when and how AI should be applied, given established problems with bias in AI algorithms.
Accelerating Machine Learning Model Inference on Google Cloud Dataflow with NVIDIA GPUs
Today, in partnership with NVIDIA, Google Cloud announced Dataflow is bringing GPUs to the world of big data processing to unlock new possibilities. With Dataflow GPU, users can now leverage the power of NVIDIA GPUs in their machine learning inference workflows. Here we show you how to access these performance benefits with BERT. Google Cloud's Dataflow is a managed service for executing a wide variety of data processing patterns including both streaming and batch analytics. It has recently added GPU support can now accelerate machine learning inference workflows, which are running on Dataflow pipelines.
Deep Learning: GANs and Variational Autoencoders
Free Coupon Discount - Deep Learning: GANs and Variational Autoencoders, Generative Adversarial Networks and Variational Autoencoders in Python, Theano, and Tensorflow Created by Lazy Programmer Inc. Students also bought Natural Language Processing with Deep Learning in Python Advanced AI: Deep Reinforcement Learning in Python Deep Learning: Advanced Computer Vision (GANs, SSD, More!) Ensemble Machine Learning in Python: Random Forest, AdaBoost Cutting-Edge AI: Deep Reinforcement Learning in Python Deep Learning: Advanced NLP and RNNs Preview this Udemy Course GET COUPON CODE Description Variational autoencoders and GANs have been 2 of the most interesting developments in deep learning and machine learning recently. Yann LeCun, a deep learning pioneer, has said that the most important development in recent years has been adversarial training, referring to GANs. GAN stands for generative adversarial network, where 2 neural networks compete with each other. Unsupervised learning means we're not trying to map input data to targets, we're just trying to learn the structure of that input data. Once we've learned that structure, we can do some pretty cool things.
Optimal Auctions Through Deep Learning
Designing an incentive compatible auction that maximizes expected revenue is an intricate task. The single-item case was resolved in a seminal piece of work by Myerson in 1981. Even after 30–40 years of intense research, the problem remains unsolved for settings with two or more items. We overview recent research results that show how tools from deep learning are shaping up to become a powerful tool for the automated design of near-optimal auctions auctions. In this approach, an auction is modeled as a multilayer neural network, with optimal auction design framed as a constrained learning problem that can be addressed with standard machine learning pipelines. Through this approach, it is possible to recover to a high degree of accuracy essentially all known analytically derived solutions for multi-item settings and obtain novel mechanisms for settings in which the optimal mechanism is unknown. Optimal auction design is one of the cornerstones of economic theory. It is of great practical importance, as auctions are used across industries and by the public sector to organize the sale of their products and services. Concrete examples are the US FCC Incentive Auction, the sponsored search auctions conducted by web search engines such as Google, and the auctions run on platforms such as eBay. In the standard independent private valuations model, each bidder has a valuation function over subsets of items, drawn independently from not necessarily identical distributions.
Restricted Boltzmann Machine and Deep Belief Network: Tutorial and Survey
Ghojogh, Benyamin, Ghodsi, Ali, Karray, Fakhri, Crowley, Mark
This is a tutorial and survey paper on Boltzmann Machine (BM), Restricted Boltzmann Machine (RBM), and Deep Belief Network (DBN). We start with the required background on probabilistic graphical models, Markov random field, Gibbs sampling, statistical physics, Ising model, and the Hopfield network. Then, we introduce the structures of BM and RBM. The conditional distributions of visible and hidden variables, Gibbs sampling in RBM for generating variables, training BM and RBM by maximum likelihood estimation, and contrastive divergence are explained. Then, we discuss different possible discrete and continuous distributions for the variables. We introduce conditional RBM and how it is trained. Finally, we explain deep belief network as a stack of RBM models. This paper on Boltzmann machines can be useful in various fields including data science, statistics, neural computation, and statistical physics.
MLDev: Data Science Experiment Automation and Reproducibility Software
Khritankov, Anton, Pershin, Nikita, Ukhov, Nikita, Ukhov, Artem
In this paper we explore the challenges of automating experiments in data science. We propose an extensible experiment model as a foundation for integration of different open source tools for running research experiments. We implement our approach in a prototype open source MLDev software package and evaluate it in a series of experiments yielding promising results. Comparison with other state-of-the-art tools signifies novelty of our approach.
Predicting Game Engagement and Difficulty Using AI Players
Roohi, Shaghayegh, Guckelsberger, Christian, Relas, Asko, Heiskanen, Henri, Takatalo, Jari, Hämäläinen, Perttu
This paper presents a novel approach to automated playtesting for the prediction of human player behavior and experience. It has previously been demonstrated that Deep Reinforcement Learning (DRL) game-playing agents can predict both game difficulty and player engagement, operationalized as average pass and churn rates. We improve this approach by enhancing DRL with Monte Carlo Tree Search (MCTS). We also motivate an enhanced selection strategy for predictor features, based on the observation that an AI agent's best-case performance can yield stronger correlations with human data than the agent's average performance. Both additions consistently improve the prediction accuracy, and the DRL-enhanced MCTS outperforms both DRL and vanilla MCTS in the hardest levels. We conclude that player modelling via automated playtesting can benefit from combining DRL and MCTS. Moreover, it can be worthwhile to investigate a subset of repeated best AI agent runs, if AI gameplay does not yield good predictions on average.
Uncertainty-Aware Time-to-Event Prediction using Deep Kernel Accelerated Failure Time Models
Wu, Zhiliang, Yang, Yinchong, Fasching, Peter A., Tresp, Volker
Recurrent neural network based solutions are increasingly being used in the analysis of longitudinal Electronic Health Record data. However, most works focus on prediction accuracy and neglect prediction uncertainty. We propose Deep Kernel Accelerated Failure Time models for the time-to-event prediction task, enabling uncertainty-awareness of the prediction by a pipeline of a recurrent neural network and a sparse Gaussian Process. Furthermore, a deep metric learning based pre-training step is adapted to enhance the proposed model. Our model shows better point estimate performance than recurrent neural network based baselines in experiments on two real-world datasets. More importantly, the predictive variance from our model can be used to quantify the uncertainty estimates of the time-to-event prediction: Our model delivers better performance when it is more confident in its prediction. Compared to related methods, such as Monte Carlo Dropout, our model offers better uncertainty estimates by leveraging an analytical solution and is more computationally efficient.
Workpiece Image-based Tool Wear Classification in Blanking Processes Using Deep Convolutional Neural Networks
Molitor, Dirk Alexander, Kubik, Christian, Hetfleisch, Ruben Helmut, Groche, Peter
Blanking processes belong to the most widely used manufacturing techniques due to their economic efficiency. Their economic viability depends to a large extent on the resulting product quality and the associated customer satisfaction as well as on possible downtimes. In particular, the occurrence of increased tool wear reduces the product quality and leads to downtimes, which is why considerable research has been carried out in recent years with regard to wear detection. While processes have widely been monitored based on force and acceleration signals, a new approach is pursued in this paper. Blanked workpieces manufactured by punches with 16 different wear states are photographed and then used as inputs for Deep Convolutional Neural Networks to classify wear states. The results show that wear states can be predicted with surprisingly high accuracy, opening up new possibilities and research opportunities for tool wear monitoring of blanking processes.