Education
Scalable Deep Learning on Distributed Infrastructures: Challenges, Techniques and Tools
Mayer, Ruben, Jacobsen, Hans-Arno
Deep Learning (DL) has had an immense success in the recent past, leading to state-of-the-art results in various domains such as image recognition and natural language processing. One of the reasons for this success is the increasing size of DL models and the proliferation of vast amounts of training data being available. To keep on improving the performance of DL, increasing the scalability of DL systems is necessary. In this survey, we perform a broad and thorough investigation on challenges, techniques and tools for scalable DL on distributed infrastructures. This incorporates infrastructures for DL, methods for parallel DL training, multi-tenant resource scheduling and the management of training and model data. Further, we analyze and compare 11 current open-source DL frameworks and tools and investigate which of the techniques are commonly implemented in practice. Finally, we highlight future research trends in DL systems that deserve further research.
Improving Route Choice Models by Incorporating Contextual Factors via Knowledge Distillation
Liu, Qun, Mukhopadhyay, Supratik, Zhu, Yimin, Gudishala, Ravindra, Saeidi, Sanaz, Nabijiang, Alimire
Route Choice Models predict the route choices of travelers traversing an urban area. Most of the route choice models link route characteristics of alternative routes to those chosen by the drivers. The models play an important role in prediction of traffic levels on different routes and thus assist in development of efficient traffic management strategies that result in minimizing traffic delay and maximizing effective utilization of transport system. High fidelity route choice models are required to predict traffic levels with higher accuracy. Existing route choice models do not take into account dynamic contextual conditions such as the occurrence of an accident, the socio-cultural and economic background of drivers, other human behaviors, the dynamic personal risk level, etc. As a result, they can only make predictions at an aggregate level and for a fixed set of contextual factors. For higher fidelity, it is highly desirable to use a model that captures significance of subjective or contextual factors in route choice. This paper presents a novel approach for developing high-fidelity route choice models with increased predictive power by augmenting existing aggregate level baseline models with information on drivers' responses to contextual factors obtained from Stated Choice Experiments carried out in an Immersive Virtual Environment through the use of knowledge distillation.
TossingBot: Learning to Throw Arbitrary Objects with Residual Physics
Zeng, Andy, Song, Shuran, Lee, Johnny, Rodriguez, Alberto, Funkhouser, Thomas
We investigate whether a robot arm can learn to pick and throw arbitrary objects into selected boxes quickly and accurately. Throwing has the potential to increase the physical reachability and picking speed of a robot arm. However, precisely throwing arbitrary objects in unstructured settings presents many challenges: from acquiring reliable pre-throw conditions (e.g. initial pose of object in manipulator) to handling varying object-centric properties (e.g. mass distribution, friction, shape) and dynamics (e.g. aerodynamics). In this work, we propose an end-to-end formulation that jointly learns to infer control parameters for grasping and throwing motion primitives from visual observations (images of arbitrary objects in a bin) through trial and error. Within this formulation, we investigate the synergies between grasping and throwing (i.e., learning grasps that enable more accurate throws) and between simulation and deep learning (i.e., using deep networks to predict residuals on top of control parameters predicted by a physics simulator). The resulting system, TossingBot, is able to grasp and throw arbitrary objects into boxes located outside its maximum reach range at 500+ mean picks per hour (600+ grasps per hour with 85% throwing accuracy); and generalizes to new objects and target locations. Videos are available at https://tossingbot.cs.princeton.edu
Eye on A.I.-- Tracing A.I. Breakthroughs From Mars to Earth
If you need convincing that artificial intelligence will transform the world, I'd like to take you on a trip to Mars. Well, not the planet, but Amazon CEO Jeff Bezos's annual invite-only MARS conference last week in Palm Springs that takes its name from its focus on machine learning, automation, robotics, and space. Over 200 of the world's leading scientists and technologists gathered to discuss their latest far-out research, a nerve-racking experience for those who presented in front of Bezos himself. A.I., and its ability to make sense of data, was a common theme. But while it's easy to dream about the future of A.I., and all the benefits it will supposedly bring, our present day version has room for improvement.
Competence-based Curriculum Learning for Neural Machine Translation
Platanios, Emmanouil Antonios, Stretcu, Otilia, Neubig, Graham, Poczos, Barnabas, Mitchell, Tom M.
Current state-of-the-art NMT systems use large neural networks that are not only slow to train, but also often require many heuristics and optimization tricks, such as specialized learning rate schedules and large batch sizes. This is undesirable as it requires extensive hyperparameter tuning. In this paper, we propose a curriculum learning framework for NMT that reduces training time, reduces the need for specialized heuristics or large batch sizes, and results in overall better performance. Our framework consists of a principled way of deciding which training samples are shown to the model at different times during training, based on the estimated difficulty of a sample and the current competence of the model. Filtering training samples in this manner prevents the model from getting stuck in bad local optima, making it converge faster and reach a better solution than the common approach of uniformly sampling training examples. Furthermore, the proposed method can be easily applied to existing NMT models by simply modifying their input data pipelines. We show that our framework can help improve the training time and the performance of both recurrent neural network models and Transformers, achieving up to a 70% decrease in training time, while at the same time obtaining accuracy improvements of up to 2.2 BLEU.
Optimize TSK Fuzzy Systems for Big Data Regression Problems: Mini-Batch Gradient Descent with Regularization, DropRule and AdaBound (MBGD-RDA)
Wu, Dongrui, Yuan, Ye, Tan, Yihua
Takagi-Sugeno-Kang (TSK) fuzzy systems are very useful machine learning models for regression problems. However, to our knowledge, there has not existed an efficient and effective training algorithm that enables them to deal with big data. Inspired by the connections between TSK fuzzy systems and neural networks, we extend three powerful neural network optimization techniques, i.e., mini-batch gradient descent, regularization, and AdaBound, to TSK fuzzy systems, and also propose a novel DropRule technique specifically for training TSK fuzzy systems. Our final algorithm, mini-batch gradient descent with regularization, DropRule and AdaBound (MBGD-RDA), can achieve fast convergence in training TSK fuzzy systems, and also superior generalization performance in testing. It can be used for training TSK fuzzy systems on datasets of any size; however, it is particularly useful for big datasets, on which currently no other efficient training algorithms exist.
Gradient conjugate priors and multi-layer neural networks
Gurevich, Pavel, Stuke, Hannes
The paper deals with learning probability distributions of observed data by artificial neural networks. We suggest a so-called gradient conjugate prior (GCP) update appropriate for neural networks, which is a modification of the classical Bayesian update for conjugate priors. We establish a connection between the gradient conjugate prior update and the maximization of the log-likelihood of the predictive distribution. Unlike for the Bayesian neural networks, we use deterministic weights of neural networks, but rather assume that the ground truth distribution is normal with unknown mean and variance and learn by the neural networks the parameters of a prior (normal-gamma distribution) for these unknown mean and variance. The update of the parameters is done, using the gradient that, at each step, directs towards minimizing the Kullback--Leibler divergence from the prior to the posterior distribution (both being normal-gamma). We obtain a corresponding dynamical system for the prior's parameters and analyze its properties. In particular, we study the limiting behavior of all the prior's parameters and show how it differs from the case of the classical full Bayesian update. The results are validated on synthetic and real world data sets.
Data Science and Digital Systems: The 3Ds of Machine Learning Systems Design
There is a lot of talk about the fourth industrial revolution centered around AI. If we are at the start of the fourth industrial we also have the unusual honour of being the first to name our revolution before it's occurred. The technology that has driven the revolution in AI is machine learning. And when it comes to capitalising on the new generation of deployed machine learning solutions there are practical difficulties we must address. In 1987 the economist Robert Solow quipped "You can see the computer age everywehere but in the productivity statistics".
U of T receives $100-million gift for new artificial intelligence complex, the school's largest-ever donation The Star
This copy is for your personal non-commercial use only. To order presentation-ready copies of Toronto Star content for distribution to colleagues, clients or customers, or inquire about permissions/licensing, please go to: www.TorontoStarReprints.com The University of Toronto has received its largest ever donation, a $100-million gift to further the school's research on artificial intelligence. The donation from the Gerald Schwartz and Heather Reisman Foundation will in part go to a new 750,000-square-foot complex to be built at the northeast corner of College St. and Queen's Park starting this fall, school President Meric Gertler announced at a Monday news conference. The money will also help launch the Schwartz-Reisman Institute for Technology and Society. Gertler said the gift will help spark Canadian innovation and examine how technology shapes people's lives.
How GMU students' eating habits changed when delivery robots invaded their campus
In the first days after a fleet of 25 delivery robots descended on George Mason University's campus in January, school officials could only speculate about the machines' long-term impact. The Igloo cooler-sized robots from the Bay Area start-up Starship Technologies -- which were designed to deliver food on demand across campus -- appeared to elicit curious glances and numerous photos, but not much else. It was clear, officials said at the time, that more time and more data would be necessary to understand whether the robots would actually change the campus culture or become a forgettable novelty. Today, some of that data emerged for the first time. In the two months since the robots arrived at the Fairfax, Va.-based school, an extra 1,500 breakfast orders have been delivered autonomously, according to Starship Technologies and Sodexo, a company that manages food services for GMU on contract and works closely with the robots.