Beyond the classroom curriculum, many law schools are designing experiential modes of introducing law students to artificial intelligence. At Georgia State University School of Law, for instance, the Legal Analytics and Innovation Initiative gives law students a chance to collaborate closely with computer science and business students at the same university to design complex technologies that solve previously unsolvable legal problems (such as predicting to a high degree of accuracy how a particular judge will rule in cases defined by a large set of parameters). This kind of work not only has the potential to be a flow-through to the legal practitioner space, but could over time become a mechanism for law schools to "spin out" the kinds of revenue-generating start-up businesses that are a common facet of life science departments at research universities. These programs have also been shown (according to the programs' own statistics) to help law students land jobs at higher rates than the overall student body, no doubt because the intersection of technology and law is a rare and valuable skillset in the eyes of employers.

This story was co-published with ProPublica. Ariella Russcol specializes in drama at the Frank Sinatra School of the Arts in Queens, New York, and the senior's performance on this April afternoon didn't disappoint. While the library is normally the quietest room in the school, her ear-piercing screams sounded more like a horror movie than study hall. But they weren't enough to set off a small microphone in the ceiling that was supposed to detect aggression. A few days later, at the Staples Pathways Academy in Westport, Connecticut, junior Sami D'Anna inadvertently triggered the same device with a less spooky sound--a coughing fit from a lingering chest cold.

Online education provider Udacity said today it's launching a nanodegree program to teach product managers how to create AI-powered products. The nontechnical course will also teach product managers how to identify business opportunities with AI or machine learning. Enrollment for the first program begins today and consists of 6 lessons and 3 projects, and lasts about 2 months. "Students will start off by learning the foundations of AI and machine learning, starting with the unsupervised and supervised models that are used in industry today," Udacity founder Sebastian Thrun told VentureBeat in an email. "As a next step, they will learn how to use Figure Eight's data annotation platform to develop a labeled dataset for supervised learning. Finally, students will develop a business proposal for an AI product of their choice, while learning strategies for continuously learning and updating a machine learning model."

This article summarizes the lessons learned after two years of our team engaging with dozens of enterprise clients from different industries including manufacturing, financial services, retail, entertainment, and healthcare, among others. What are the most common ML problems faced by the enterprise? What is beyond training an ML model? How to address data preparation? How to scale to large datasets?

If Bill Gates were to drop out of Harvard University and start a new company today, it would be one that focuses on artificial intelligence, he said in an interview on Monday. The perspective shows that the Microsoft co-founder hasn't lost interest in the technology industry where his company has operated for the past 44 years. "Given my background, I would start an AI company whose goal would be to teach computers how to read, so that they can absorb and understand all the written knowledge of the world. That's an area where AI has yet to make progress, and it will be quite profound when we achieve that goal," Gates told David Rubinstein at an Economic Club of Washington event in the nation's capital on Monday. Gates has invested in Luminous, a start-up developing silicon for AI.

Developing learning methods which do not discriminate subgroups in the population is a central goal of algorithmic fairness. One way to reach this goal is by modifying the data representation in order to meet certain fairness constraints. In this work we measure fairness according to demographic parity. This requires the probability of the possible model decisions to be independent of the sensitive information. We argue that the goal of imposing demographic parity can be substantially facilitated within a multitask learning setting. We leverage task similarities by encouraging a shared fair representation across the tasks via low rank matrix factorization. We derive learning bounds establishing that the learned representation transfers well to novel tasks both in terms of prediction performance and fairness metrics. We present experiments on three real world datasets, showing that the proposed method outperforms state-of-the-art approaches by a significant margin.

This paper is a broad and accessible survey of the methods we have at our disposal for Monte Carlo gradient estimation in machine learning and across the statistical sciences: the problem of computing the gradient of an expectation of a function with respect to parameters defining the distribution that is integrated; the problem of sensitivity analysis. In machine learning research, this gradient problem lies at the core of many learning problems, in supervised, unsupervised and reinforcement learning. We will generally seek to rewrite such gradients in a form that allows for Monte Carlo estimation, allowing them to be easily and efficiently used and analysed. We explore three strategies--the pathwise, score function, and measure-valued gradient estimators-- exploring their historical developments, derivation, and underlying assumptions. We describe their use in other fields, show how they are related and can be combined, and expand on their possible generalisations. Wherever Monte Carlo gradient estimators have been derived and deployed in the past, important advances have followed. A deeper and more widely-held understanding of this problem will lead to further advances, and it is these advances that we wish to support.

Introduced by Breiman (2001), Random Forests (RF) is one of the algorithms of choice in many supervised learning applications. The appeal of these methods comes from their remarkable accuracy in a variety of tasks, the small number (or even the absence) of parameters to tune, their reasonable computational cost at training and prediction time, and their suitability in highdimensional settings. Most commonly used RF algorithms, such as the original random forest procedure (Breiman, 2001), extra-trees (Geurts et al., 2006), or conditional inference forest (Hothorn et al., 2010) are batch algorithms, that require the whole dataset to be available at once. Several online random forests variants have been proposed to overcome this issue and handle data that come sequentially. Utgoff (1989) was the first to extend Quinlan's ID3 batch decision tree algorithm (see Quinlan, 1986) to an online setting. Later on, Domingos and Hulten (2000) introduce Hoeffding Trees that can be easily updated: since observations are available sequentially, a cell is split when (i) enough observations have fallen into this cell, (ii) the best split in the cell is statistically relevant (a generic Hoeffding inequality being used to assess the quality of the best split). Since random forests are known to exhibit better empirical performances than individual decision trees, online random forests have been proposed (see, e.g., Saffari et al., 2009; Denil et al., 2013).

Intelligent agents can cope with sensory-rich environments by learning task-agnostic state abstractions. In this paper, we propose mechanisms to approximate causal states, which optimally compress the joint history of actions and observations in partially-observable Markov decision processes. Our proposed algorithm extracts causal state representations from RNNs that are trained to predict subsequent observations given the history. We demonstrate that these learned task-agnostic state abstractions can be used to efficiently learn policies for reinforcement learning problems with rich observation spaces. We evaluate agents using multiple partially observable navigation tasks with both discrete (GridWorld) and continuous (VizDoom, ALE) observation processes that cannot be solved by traditional memory-limited methods. Our experiments demonstrate systematic improvement of the DQN and tabular models using approximate causal state representations with respect to recurrent-DQN baselines trained with raw inputs.

Reinforcement learning agents that operate in diverse and complex environments can benefit from the structured decomposition of their behavior. Often, this is addressed in the context of hierarchical reinforcement learning, where the aim is to decompose a policy into lower-level primitives or options, and a higher-level meta-policy that triggers the appropriate behaviors for a given situation. However, the meta-policy must still produce appropriate decisions in all states. In this work, we propose a policy design that decomposes into primitives, similarly to hierarchical reinforcement learning, but without a high-level meta-policy. Instead, each primitive can decide for themselves whether they wish to act in the current state. We use an information-theoretic mechanism for enabling this decentralized decision: each primitive chooses how much information it needs about the current state to make a decision and the primitive that requests the most information about the current state acts in the world. The primitives are regularized to use as little information as possible, which leads to natural competition and specialization. We experimentally demonstrate that this policy architecture improves over both flat and hierarchical policies in terms of generalization.