I was electrified by Jonathan Berger's music before I knew he wrote about music. His chamber works arise out of a lightning storm of modernist angles, dramatic and startling, though anchored to melodies that sail like a swallow, as one of his string quartets is called. His one-act operas Theotokia and The War Reporter, performed together in concert, match taut musical brocades to the hallucinations of, respectively, a schizophrenic, hearing voices of various mothers, and a photojournalist, based on Paul Watson, who won the 1994 Pulitzer Prize for his image of the corpse of an American soldier being dragged through the streets of Mogadishu. A few years ago, I read some of Jonathan's academic writing about music, which had a sharp focus on neurology and acoustics. He is a professor of music at Stanford, where he teaches composition, music theory, and cognition at the Center for Computer Research in Music and Acoustics. On a hunch that he could connect with a popular audience, I asked him to write an essay for Nautilus about how composers upend expectations to keep listeners off guard and engaged. That article, "Composing Your Thoughts," and his next one for Nautilus, "How Music Hijacks Our Perception of Time," which contain musical clips to illustrate his points, have been among our most popular articles. There's a certain amount of problem solving that happens in the context of a band of noise. For this month's issue I called Jonathan and was delighted to learn he had thought a lot about noise.

Nasa has announced that it has found evidence of flowing water on Mars. Scientists have long speculated that Recurring Slope Lineae -- or dark patches -- on Mars were made up of briny water but the new findings prove that those patches are caused by liquid water, which it has established by finding hydrated salts. Several hundred camped outside the London store in Covent Garden. The 6s will have new features like a vastly improved camera and a pressure-sensitive "3D Touch" display

NEW YORK--(BUSINESS WIRE)--Today, Macy's (NYSE:M) announced the pilot of "Macy's On Call," a mobile web tool that allows customers to interact with an AI-powered platform via their mobile devices. "Macy's On Call" taps IBM Watson, via Satisfi, an intelligent engagement platform, to deliver a first-of-its-kind solution that will enhance the customer in-store shopping experience at 10 test locations nationwide. The mobile companion, accessed via a mobile browser, allows customers to input natural language questions regarding each participating store's unique product assortment, services and facilities and receive a customized response to the inquiry. There are a number of ways that customers may request information. For example, a customer could type, "Where are the women's shoes?" or type a combination of brand and product inquiry such as "I.N.C dress," and they will receive the relevant response and location of that product in the store.

There are different ways an algorithm can model a problem based on its interaction with the experience or environment or whatever we want to call the input data. It is popular in machine learning and artificial intelligence text books to first consider the learning styles that an algorithm can adopt. There are only a few main learning styles or learning models that an algorithm can have and we'll go through them here with a few examples of algorithms and problem types that they suit. This taxonomy or way of organizing machine learning algorithms is useful because it forces you to think about the the roles of the input data and the model preparation process and select one that is the most appropriate for your problem in order to get the best result. When crunching data to model business decisions, you are most typically using supervised and unsupervised learning methods.

Description: This tutorial will teach you the main ideas of Unsupervised Feature Learning and Deep Learning. By working through it, you will also get to implement several feature learning/deep learning algorithms, get to see them work for yourself, and learn how to apply/adapt these ideas to new problems. This tutorial assumes a basic knowledge of machine learning (specifically, familiarity with the ideas of supervised learning, logistic regression, gradient descent). If you are not familiar with these ideas, we suggest you go to this Machine Learning course and complete sections II, III, IV (up to Logistic Regression) first.

The aim of this workshop is to bring to bear on the expertise of a diverse set of researchers to progress in the evaluation of general purpose AI systems. Up to now, most AI systems are tested on specific tasks. However, to be considered truly intelligent, a system should exhibit enough flexibility to be able to learn how to perform a wide variety of tasks, some of which may not be known until after the system is deployed. This workshop will examine formalisations, methodologies and test benches for evaluating the numerous aspects of this type of general AI systems. More specifically, we are interested in theoretical or experimental research focused on the development of concepts, tools and clear metrics to characterise and measure the intelligence, and other cognitive abilities, of general AI agents.

The causal discovery of Bayesian networks is an active and important research area, and it is based upon searching the space of causal models for those which can best explain a pattern of probabilistic dependencies shown in the data. However, some of those dependencies are generated by causal structures involving variables which have not been measured, i.e., latent variables. Some such patterns of dependency "reveal" themselves, in that no model based solely upon the observed variables can explain them as well as a model using a latent variable. That is what latent variable discovery is based upon. Here we did a search for finding them systematically, so that they may be applied in latent variable discovery in a more rigorous fashion.

Siamak Ravanbakhsh, Barnab as P oczos, Jeff Schneider 1 and Dale Schuurmans, Russell Greiner 2 1 Carnegie Mellon University, 5000 Forbes Ave, Pittsburgh, PA 15213 2 University of Alberta, Edmonton, AB T6G 2E8, Canada Abstract We propose a Laplace approximation that creates a stochastic unit from any smooth monotonic activation function, using only Gaussian noise. This paper investigates the application of this stochastic approximation in training a family of Restricted Boltzmann Machines (RBM) that are closely linked to Bregman divergences. This family, that we call exponential family RBM (Exp-RBM), is a subset of the exponential family Harmoniums that expresses family members through a choice of smooth monotonic non-linearity for each neuron. Using contrastive divergence along with our Gaussian approximation, we show that Exp-RBM can learn useful representations using novel stochastic units. 1 Introduction Deep neural networks (LeCun et al., 2015; Bengio, 2009) have produced some of the best results in complex pattern recognition tasks where the training data is abundant. Here, we are interested in deep learning for generative modeling. Recent years has witnessed a surge of interest in directed generative models that are trained using (stochastic) back-propagation ( e.g., Kingma and Welling, 2013; Rezende et al., 2014; Goodfellow et al., 2014). These models are distinct from deep energy-based models - including deep Boltzmann machine (Hinton et al., 2006) and (convolutional) deep belief networkAppearing in Proceedings of the 19th International Conference on Artificial Intelligence and Statistics (AISTATS) 2016, Cadiz, Spain. Although, due to their use of Gaussian noise, the stochastic units that we introduce in this paper can be potentially used with stochastic back-propagation, this paper is limited to applications in RBM.

Semantic word embeddings represent the meaning of a word via a vector, and are created by diverse methods. Many use nonlinear operations on co-occurrence statistics, and have hand-tuned hyperparameters and reweighting methods. This paper proposes a new generative model, a dynamic version of the log-linear topic model of~\citet{mnih2007three}. The methodological novelty is to use the prior to compute closed form expressions for word statistics. This provides a theoretical justification for nonlinear models like PMI, word2vec, and GloVe, as well as some hyperparameter choices. It also helps explain why low-dimensional semantic embeddings contain linear algebraic structure that allows solution of word analogies, as shown by~\citet{mikolov2013efficient} and many subsequent papers. Experimental support is provided for the generative model assumptions, the most important of which is that latent word vectors are fairly uniformly dispersed in space.

A lot of approaches, each following a different strategy, have been proposed in the literature to provide AdaBoost with cost-sensitive properties. In the first part of this series of two papers, we have presented these algorithms in a homogeneous notational framework, proposed a clustering scheme for them and performed a thorough theoretical analysis of those approaches with a fully theoretical foundation. The present paper, in order to complete our analysis, is focused on the empirical study of all the algorithms previously presented over a wide range of heterogeneous classification problems. The results of our experiments, confirming the theoretical conclusions, seem to reveal that the simplest approach, just based on cost-sensitive weight initialization, is the one showing the best and soundest results, despite having been recurrently overlooked in the literature.