Research, develop, prototype and productize machine learning products using various AI approaches (supervised and unsupervised learning, deep learning, recommender systems, computer vision, natural language processing, etc.). Your passion for machine learning, curiosity, problem solving, and innovation will empower you to deliver stay up-to-date with research and to prototype new ideas quickly. Collaborate with a cross functional agile team spanning product management, engineering, user research and design to build innovative product solutions. Work closely with technology partners to leverage and improve our Machine Learning infrastructure.

One often reads that the complexities of anatomical pathology are now, or are soon to be unraveled by the latest machine learning technologies. Such incredible claims are bolstered by the experience of seeing a system classify histology images (or better, training one's own). It truly is remarkable that this is even possible. Yet, as this becomes a more common experience for the pathology community, it is likely that our current expectations and ambitions will be tempered by the constraints of reality. I remember being awe-struck at how realistic computer graphics were in the late 80's and early 90's.

In today's newsletter to all (subscribers and non-subscribers), we will share a best of the trend article (today we are sharing Google's ML trend prediction for 2020), machine learning pre-requisites and also a few plugs why you should subscribe. Only subscribers get easter eggs! These are important resources sent directly into their inbox. For example Winter Quarter, subscribers received url links self driving car resources and Pytorch textbook giveaways. January 2020 easter eggs are what is it like to be a machine learnist at work. Subscribers, your easter eggs will arrive soon!

The Thirty-Fourth annual meeting of AAAI just concluded in New York. As expected, it was a huge conference with thousands of AI Researches and practitioners in attendance. One big highlight was presentations from 2018 ACM Turing Award winners Geoffrey Hinton, Yann LeCun, and Yoshua Bengio as well as a panel discussion with Daniel Kahneman.

Presentations are a go-to approach to introduce new ideas or explaining new techniques in technology with text and infographics to engage an audience and retain attention. Over the years, presentations have catered to the needs of people who want to learn new things or get an overview of something new. Notably, in data science, explaining approaches with speech becomes difficult. Thus, presentation through slides is an effective way to learn or revise technology. Analytics India Magazine brings to you exciting data science presentation that will give a new perspective as well as introduce you to new developments in the landscape.

Deep learning has continued its forward movement during 2019 with advances in many exciting research areas like generative adversarial networks (GANs), auto-encoders, and reinforcement learning. In terms of deployments, deep learning is the darling of many contemporary application areas such as computer vision, image recognition, speech recognition, natural language processing, machine translation, autonomous vehicles, and many more. Earlier this year, we saw Google AI Language revolutionize the NLP segment of deep learning with the new language representation model called BERT, which stands for Bidirectional Encoder Representations from Transformers. The already seminal paper was released on arXiv on May 24. This has led to a storm of follow-on research results.

In this paper we focus on training deep neural networks for visual recognition tasks. One challenge is the lack of an informative regularization on the network parameters, to imply a meaningful control on the computed function. We propose a training strategy that takes advantage of kernel methods, where an existing kernel function represents useful prior knowledge about the learning task of interest. We derive an efficient algorithm using stochastic gradient descent, and demonstrate very positive results in a wide range of visual recognition tasks. Papers published at the Neural Information Processing Systems Conference.

In recent years, deep learning approaches have gained significant interest as a way of building hierarchical representations from unlabeled data. However, to our knowledge, these deep learning approaches have not been extensively studied for auditory data. In this paper, we apply convolutional deep belief networks to audio data and empirically evaluate them on various audio classification tasks. For the case of speech data, we show that the learned features correspond to phones/phonemes. In addition, our feature representations trained from unlabeled audio data show very good performance for multiple audio classification tasks.

Dealing with uncertainty is essential for efficient reinforcement learning. There is a growing literature on uncertainty estimation for deep learning from fixed datasets, but many of the most popular approaches are poorly-suited to sequential decision problems. Other methods, such as bootstrap sampling, have no mechanism for uncertainty that does not come from the observed data. We highlight why this can be a crucial shortcoming and propose a simple remedy through addition of a randomized untrainable prior' network to each ensemble member. We prove that this approach is efficient with linear representations, provide simple illustrations of its efficacy with nonlinear representations and show that this approach scales to large-scale problems far better than previous attempts.

Deep learning presents notorious computational challenges. These challenges include, but are not limited to, the non-convexity of learning objectives and estimating the quantities needed for optimization algorithms, such as gradients. While we do not address the non-convexity, we present an optimization solution that ex- ploits the so far unused "geometry" in the objective function in order to best make use of the estimated gradients. Previous work attempted similar goals with preconditioned methods in the Euclidean space, such as L-BFGS, RMSprop, and ADA-grad. In stark contrast, our approach combines a non-Euclidean gradient method with preconditioning.