Precision medicine and artificial intelligence (AI) are complicated by design: Both scientific fields rely on extreme specificity, complex equations, and forces that can't be seen. As both fields begin to alter the healthcare landscape, they could plant a number of legal landmines. Can algorithms or biomarkers be patented? Will centers be able to access the large data sets they need to perform accurate AI? What control over their data should patients have?

Stochastic convex optimization algorithms are the most popular way to train machine learning models on large-scale data. Scaling up the training process of these models is crucial in many applications, but the most popular algorithm, Stochastic Gradient Descent (SGD), is a serial algorithm that is surprisingly hard to parallelize. In this paper, we propose an efficient distributed stochastic optimization method based on adaptive step sizes and variance reduction techniques. We achieve a linear speedup in the number of machines, small memory footprint, and only a small number of synchronization rounds -- logarithmic in dataset size -- in which the computation nodes communicate with each other. Critically, our approach is a general reduction than parallelizes any serial SGD algorithm, allowing us to leverage the significant progress that has been made in designing adaptive SGD algorithms. We conclude by implementing our algorithm in the Spark distributed framework and exhibit dramatic performance gains on large-scale logistic regression problems.

In recent years, Convolutional Neural Networks (CNNs) have shown remarkable performance in many computer vision tasks such as object recognition and detection. However, complex training issues, such as "catastrophic forgetting" and hyper-parameter tuning, make incremental learning in CNNs a difficult challenge. In this paper, we propose a hierarchical deep neural network, with CNNs at multiple levels, and a corresponding training method for lifelong learning. The network grows in a tree-like manner to accommodate the new classes of data without losing the ability to identify the previously trained classes. The proposed network was tested on CIFAR-10 and CIFAR-100 datasets, and compared against the method of fine tuning specific layers of a conventional CNN. We obtained comparable accuracies and achieved 40% and 20% reduction in training effort in CIFAR-10 and CIFAR 100 respectively. The network was able to organize the incoming classes of data into feature-driven super-classes. Our model improves upon existing hierarchical CNN models by adding the capability of self-growth and also yields important observations on feature selective classification.

For many machine learning problem settings, particularly with structured inputs such as sequences or sets of objects, a distance measure between inputs can be specified more naturally than a feature representation. However, most standard machine models are designed for inputs with a vector feature representation. In this work, we consider the estimation of a function $f:\mathcal{X} \rightarrow \R$ based solely on a dissimilarity measure $d:\mathcal{X}\times\mathcal{X} \rightarrow \R$ between inputs. In particular, we propose a general framework to derive a family of \emph{positive definite kernels} from a given dissimilarity measure, which subsumes the widely-used \emph{representative-set method} as a special case, and relates to the well-known \emph{distance substitution kernel} in a limiting case. We show that functions in the corresponding Reproducing Kernel Hilbert Space (RKHS) are Lipschitz-continuous w.r.t. the given distance metric. We provide a tractable algorithm to estimate a function from this RKHS, and show that it enjoys better generalizability than Nearest-Neighbor estimates. Our approach draws from the literature of Random Features, but instead of deriving feature maps from an existing kernel, we construct novel kernels from a random feature map, that we specify given the distance measure. We conduct classification experiments with such disparate domains as strings, time series, and sets of vectors, where our proposed framework compares favorably to existing distance-based learning methods such as $k$-nearest-neighbors, distance-substitution kernels, pseudo-Euclidean embedding, and the representative-set method.

I have a thoroughly delightful chance today to interview Vinod Khosla, who many years ago started Khosla Ventures, one of the most successful venture capital firms in the world. Vinod, I think you started out in engineering in India at one of the most prestigious institutes of technology, then you went to Carnegie Mellon, and then Stanford. But engineering wasn't where you landed long-term, because at some point you started Sun Microsystems, right? When I started out, there wasn't a thing called computer science. That tells you how old I am. In those days, you could pursue any new area if you created your own program because there were not a lot of programs. At the Indian Institute of Technology, we started the computer science program, and then I moved to biomedical engineering. I went on to get a master's degree in biomedical engineering at Carnegie Mellon. That was also a tiny program in the basement.

MIT researchers have developed a chip designed to speed up the hard work of running neural networks, while also reducing the power consumed when doing so dramatically – by up to 95 percent, in fact. The basic concept involves simplifying the chip design so that shuttling of data between different processors on the same chip is taken out of the equation. The big advantage of this new method, developed by a team lead by MIT graduate student Avishek Biswas, is that it could potentially be used to run neural networks on smartphones, household devices and other portable gadgets, rather than requiring servers drawing constant power from the grid. Because it means that phones of the future using this chip could do things like advanced speech and face recognition using neural nets and deep learning locally, rather than requiring on more crude, rule-based algorithms, or routing information to the cloud and back to interpret results. Computing'at the edge,' as its called, or at the site of sensors actually gathering the data, is increasingly something companies are pursuing and implementing, so this new chip design method could have a big impact on that growing opportunity should it become commercialized.

In recent years, we've seen a resurgence in AI, or artificial intelligence, and machine learning. Machine learning has led to some amazing results, like being able to analyze medical images and predict diseases on-par with human experts. Google's AlphaGo program was able to beat a world champion in the strategy game go using deep reinforcement learning. Machine learning is even being used to program self driving cars, which is going to change the automotive industry forever. Imagine a world with drastically reduced car accidents, simply by removing the element of human error.

About this course: This is the second course in the Data Warehousing for Business Intelligence specialization. Ideally, the courses should be taken in sequence. In this course, you will learn exciting concepts and skills for designing data warehouses and creating data integration workflows. These are fundamental skills for data warehouse developers and administrators. You will have hands-on experience for data warehouse design and use open source products for manipulating pivot tables and creating data integration workflows.You will also gain conceptual background about maturity models, architectures, multidimensional models, and management practices, providing an organizational perspective about data warehouse development.

Advanced Data Mining Projects with R takes you one step ahead in understanding the most complex data mining algorithms and implementing them in the popular R language. Follow up to our course Data Mining Projects in R, this course will teach you how to build your own recommendation engine. You will also implement dimensionality reduction and use it to build a real-world project. Going ahead, you will be introduced to the concept of neural networks and learn how to apply them for predictions, classifications, and forecasting. Finally, you will implement ggplot2, plotly and aspects of geomapping to create your own data visualization projects.By the end of this course, you will be well-versed with all the advanced data mining techniques and how to implement them using R, in any real-world scenario.

Many developers (including myself) have included learning machine learning in their new year resolutions for 2018. Even after blocking an hour everyday in the calendar, I am hardly able to make progress. The key reason for this is the confusion on where to start and how to get started. It is overwhelming for an average developer to get started with machine learning. There are many tutorials, MOOCs, free resources, and blogs covering this topic. But they are only adding to the confusion by making it look complex.