Artificial intelligence has been around for awhile, but in rudimentary forms. But only recently have artificial intelligence developments gotten close to really aiding, and possibly replacing, professionals like attorneys. One of the recent revolutions in AI is the proliferation of successful machine learning. Machine learning allows computer programs to develop independently, through observing, evaluating, and deciding over and over and over again -- getting better each time. IBM's Watson technology, for example, can learn what tastes you enjoy and create brand new recipes based on those.

The web is full of good explanations of machine learning algorithms. And every second applicant for a data science position has finished the Coursera course on machine learning. Theory will not help you choose good values for the 16 parameters a standard implementation of a random forest takes. The default values are good to get started, but which parameters should you modify depending on your data? Choosing the right features, algorithms and parameters is an art.

It may not look like one of Isaac Asimov's robots or sound like HAL from "2001: A Space Odyssey," but artificial intelligence is here, and it is already having a huge impact on how the world works. From the way you shop for a pair of shoes online to how fast a Formula 1 team can push its car's engine, AI is helping businesses across the globe save millions by improving performance and efficiency. Still, problems like trust and security, not to mention fears of the so-called singularity, when artificial intelligence would overtake human thinking, remain hurdles that the technology must overcome before it goes mainstream. AI hit the news this week after a program called AlphaGo, developed by engineers at DeepMind, the AI startup acquired by Google in 2014 for 580 million, defeated the world's No. 1 Go player Lee Sedol. AlphaGo beat Sedol 4 games to 1, claiming a 1 million prize.

The field of intellectual property is rapidly evolving, both with respect to the law and the technologies being considered for protection. This session provides a primer about what a patent is, current best practices for protecting speech technologies and defending against assertion, and the recent evolution of intellectual property law in the United States, with emphasis on speech, software user interfaces, and mobile technologies. Fraudsters are using robodialing and ANI spoofing to wreak havoc on call centers. From the illegal practice of toll-free traffic pumping and international revenue-sharing fraud, to the more villainous acts of financial account fraud, identity theft, and drug trafficking, this seminar explores the unusual ways criminals are hacking our businesses. We also examine simple and cost-effective practices to protect our businesses, and our customers.

Technology showcased in the movie Minority Report, which enabled Tom Cruise to swipe through midair images in the 2002 film, could soon become a staple of hospital operating rooms. A new gesture-controlled computer interface aims to give surgeons easier access to medical images during marathon surgical operations. The experimental medical system takes advantage of Leap Motion controllers that can sense and track people's hand gestures. South Korean researchers developed their own "GestureHook" software that can translate the gestures captured by a Leap Motion device into commands for several different types of medical software. "We thought that using gestures as a new interface for controlling software in hospitals would provide access to computers for surgeons during procedures," says Ben Joonyeon Park, a software developer on the Medical Information Development Team at the Asan Medical Center in Seoul, South Korea.

Neuromorphic computing – brain inspired computing – has long been a tantalizing goal. The human brain does with around 20 watts what supercomputers do with megawatts. While neuromorphic computing progress has been intriguing, it has still not proven very practical. This week neuromorphic computing takes another step forward with a workshop being offered to users from academia, industry and education interested in using two European neuromorphic systems that have been years in development and are coming online for broader use – the BrainScaleS system launching at the Kirchhoff Institute for Physics of Heidelberg University and SpiNNaker, a complementary approach and similarly sized system at the University of Manchester. Ramping up BrainScaleS and SpiNNaker is an important milestone, strengthening Europe's position in hardware development for alternative computing. Both projects are part of the European Human Brain Project, originally funded by the European Commission's Future Emerging Technologies program (2005-2015).

Network data appear in a number of applications, such as online social networks and biological networks, and there is growing interest in both developing models for networks as well as studying the properties of such data. Since individual network datasets continue to grow in size, it is necessary to develop models that accurately represent the real-life scaling properties of networks. One behavior of interest is having a power law in the degree distribution. However, other types of power laws that have been observed empirically and considered for applications such as clustering and feature allocation models have not been studied as frequently in models for graph data. In this paper, we enumerate desirable asymptotic behavior that may be of interest for modeling graph data, including sparsity and several types of power laws. We outline a general framework for graph generative models using completely random measures; by contrast to the pioneering work of Caron and Fox (2015), we consider instantiating more of the existing atoms of the random measure as the dataset size increases rather than adding new atoms to the measure. We see that these two models can be complementary; they respectively yield interpretations as (1) time passing among existing members of a network and (2) new individuals joining a network. We detail a particular instance of this framework and show simulated results that suggest this model exhibits some desirable asymptotic power-law behavior.

Stochastic gradient descent is the method of choice for large-scale machine learning problems, by virtue of its light complexity per iteration. However, it lags behind its non-stochastic counterparts with respect to the convergence rate, due to high variance introduced by the stochastic updates. The popular Stochastic Variance-Reduced Gradient (SVRG) method mitigates this shortcoming, introducing a new update rule which requires infrequent passes over the entire input dataset to compute the full-gradient. In this work, we propose CheapSVRG, a stochastic variance-reduction optimization scheme. Our algorithm is similar to SVRG but instead of the full gradient, it uses a surrogate which can be efficiently computed on a small subset of the input data. It achieves a linear convergence rate ---up to some error level, depending on the nature of the optimization problem---and features a trade-off between the computational complexity and the convergence rate. Empirical evaluation shows that CheapSVRG performs at least competitively compared to the state of the art.

Perceptrons are neuronal devices capable of fully discriminating linearly separable classes. Although straightforward to implement and train, their applicability is usually hindered by non-trivial requirements imposed by real-world classification problems. Therefore, several approaches, such as kernel perceptrons, have been conceived to counteract such difficulties. In this paper, we investigate an enhanced perceptron model based on the notion of contrastive biclusters. From this perspective, a good discriminative bicluster comprises a subset of data instances belonging to one class that show high coherence across a subset of features and high differentiation from nearest instances of the other class under the same features (referred to as its contrastive bicluster). Upon each local subspace associated with a pair of contrastive biclusters a perceptron is trained and the model with highest area under the receiver operating characteristic curve (AUC) value is selected as the final classifier. Experiments conducted on a range of data sets, including those related to a difficult biosignal classification problem, show that the proposed variant can be indeed very useful, prevailing in most of the cases upon standard and kernel perceptrons in terms of accuracy and AUC measures.

Datasets are growing not just in size but in complexity, creating a demand for rich models and quantification of uncertainty. Bayesian methods are an excellent fit for this demand, but scaling Bayesian inference is a challenge. In response to this challenge, there has been considerable recent work based on varying assumptions about model structure, underlying computational resources, and the importance of asymptotic correctness. As a result, there is a zoo of ideas with few clear overarching principles. In this paper, we seek to identify unifying principles, patterns, and intuitions for scaling Bayesian inference. We review existing work on utilizing modern computing resources with both MCMC and variational approximation techniques. From this taxonomy of ideas, we characterize the general principles that have proven successful for designing scalable inference procedures and comment on the path forward.