Owing to the remarkable photometric precision of space observatories like Kepler, stellar and planetary systems beyond our own are now being characterized en masse for the first time. These characterizations are pivotal for endeavors such as searching for Earth-like planets and solar twins, understanding the mechanisms that govern stellar evolution, and tracing the dynamics of our Galaxy. The volume of data that is becoming available, however, brings with it the need to process this information accurately and rapidly. While existing methods can constrain fundamental stellar parameters such as ages, masses, and radii from these observations, they require substantial computational efforts to do so. We develop a method based on machine learning for rapidly estimating fundamental parameters of main-sequence solar-like stars from classical and asteroseismic observations. We first demonstrate this method on a hare-and-hound exercise and then apply it to the Sun, 16 Cyg A & B, and 34 planet-hosting candidates that have been observed by the Kepler spacecraft. We find that our estimates and their associated uncertainties are comparable to the results of other methods, but with the additional benefit of being able to explore many more stellar parameters while using much less computation time. We furthermore use this method to present evidence for an empirical diffusion-mass relation. Our method is open source and freely available for the community to use. The source code for all analyses and for all figures appearing in this manuscript can be found electronically at https://github.com/earlbellinger/asteroseismology

We propose a Bayesian nonparametric prior for time-varying networks. To each node of the network is associated a positive parameter, modeling the sociability of that node. Sociabilities are assumed to evolve over time, and are modeled via a dynamic point process model. The model is able to (a) capture smooth evolution of the interaction between nodes, allowing edges to appear/disappear over time (b) capture long term evolution of the sociabilities of the nodes (c) and yield sparse graphs, where the number of edges grows subquadratically with the number of nodes. The evolution of the sociabilities is described by a tractable time-varying gamma process. We provide some theoretical insights into the model and apply it to three real world datasets.

Ride sharing has important implications in terms of environmental, social and individual goals by reducing carbon footprints, fostering social interactions and economizing commuter costs. The ride sharing systems that are commonly available lack adaptive and scalable techniques that can simultaneously learn from the large scale data and predict in real-time dynamic fashion. In this paper, we study such a problem towards a smart city initiative, where a generic ride sharing system is conceived capable of making predictions about ride share opportunities based on the historically recorded data while satisfying real-time ride requests. Underpinning the system is an application of a powerful machine learning convex optimization framework called Network Lasso that uses the Alternate Direction Method of Multipliers (ADMM) optimization for learning and dynamic prediction. We propose an application of a robust and scalable unified optimization framework within the ride sharing case-study. The application of Network Lasso framework is capable of jointly optimizing and clustering different rides based on their spatial and model similarity. The prediction from the framework clusters new ride requests, making accurate price prediction based on the clusters, detecting hidden correlations in the data and allowing fast convergence due to the network topology. We provide an empirical evaluation of the application of ADMM network Lasso on real trip record and simulated data, proving their effectiveness since the mean squared error of the algorithm's prediction is minimized on the test rides.

Directed graphical models provide a useful framework for modeling causal or directional relationships for multivariate data. Prior work has largely focused on identifiability and search algorithms for directed acyclic graphical (DAG) models. In many applications, feedback naturally arises and directed graphical models that permit cycles occur. In this paper we address the issue of identifiability for general directed cyclic graphical (DCG) models satisfying the Markov assumption. In particular, in addition to the faithfulness assumption which has already been introduced for cyclic models, we introduce two new identifiability assumptions, one based on selecting the model with the fewest edges and the other based on selecting the DCG model that entails the maximum number of d-separation rules. We provide theoretical results comparing these assumptions which show that: (1) selecting models with the largest number of d-separation rules is strictly weaker than the faithfulness assumption; (2) unlike for DAG models, selecting models with the fewest edges does not necessarily result in a milder assumption than the faithfulness assumption. We also provide connections between our two new principles and minimality assumptions. We use our identifiability assumptions to develop search algorithms for small-scale DCG models. Our simulation study supports our theoretical results, showing that the algorithms based on our two new principles generally out-perform algorithms based on the faithfulness assumption in terms of selecting the true skeleton for DCG models.

Given a high-dimensional data set we often wish to find the strongest relationships within it. A common strategy is to evaluate a measure of dependence on every variable pair and retain the highest-scoring pairs for follow-up. This strategy works well if the statistic used is equitable [Reshef et al. 2015a], i.e., if, for some measure of noise, it assigns similar scores to equally noisy relationships regardless of relationship type (e.g., linear, exponential, periodic). In this paper, we introduce and characterize a population measure of dependence called MIC*. We show three ways that MIC* can be viewed: as the population value of MIC, a highly equitable statistic from [Reshef et al. 2011], as a canonical "smoothing" of mutual information, and as the supremum of an infinite sequence defined in terms of optimal one-dimensional partitions of the marginals of the joint distribution. Based on this theory, we introduce an efficient approach for computing MIC* from the density of a pair of random variables, and we define a new consistent estimator MICe for MIC* that is efficiently computable. In contrast, there is no known polynomial-time algorithm for computing the original equitable statistic MIC. We show through simulations that MICe has better bias-variance properties than MIC. We then introduce and prove the consistency of a second statistic, TICe, that is a trivial side-product of the computation of MICe and whose goal is powerful independence testing rather than equitability. We show in simulations that MICe and TICe have good equitability and power against independence respectively. The analyses here complement a more in-depth empirical evaluation of several leading measures of dependence [Reshef et al. 2015b] that shows state-of-the-art performance for MICe and TICe.

Jordan is renowned in the scientific community as an expert and leading researcher in the fields of artificial intelligence and machine learning. "Jibo is breaking new ground by bringing a human element to the robot experience -- something I believe the world needs and will benefit from embracing," said Michael I. Jordan, advisory board member of Jibo Inc. "My background and research in AI is uniquely suited to help in advancing Jibo's learning capabilities and developing his role and relationships within the home environment." Currently the Pehong Chen distinguished professor in electrical engineering, computer science and statistics at the University of California, Berkeley, Jordan has developed a wide range of novel methods in machine learning, natural language processing and signal processing. Jibo Inc. will apply artificial intelligence and machine learning techniques to the field of social rapport and relationships. Jordan joins the advisory board comprised of 10 industry leaders in fields central to Jibo Inc.'s ongoing development including voice and natural language technologies, artificial intelligence, human factors, behavioral science and more.

Up to 40 per cent of current Australian jobs could disappear within the next 10 to 15 years as robots and computers continue their unstoppable advance. They have already replaced humans in workplaces such as factories, supermarkets and airline check-in counters. Hugh Durrant-Whyte, director at the Centre for Translational Data Science at the University of Sydney, said technology was taking on middle-class professions once thought safe from automation -- professions such as law, accountancy and banking. "We always used to think of automation as moving everybody up," he said. "The big difference now is machine learning and artificial intelligence are solving jobs that we thought traditionally were very highly qualified jobs … it's eating out the middle of the job market, rather than the bottom end."

Nervana provides "AI on demand". Businesses use our Nervana Cloud platform to create and deploy solutions that include natural language processing, image recognition, computer vision and other types of artificial intelligence. We specialize in "deep learning", which is the technology that powers Apple's Siri, Facebook face recognition, and Google's self-driving cars and AlphaGo. The space is white hot right now!

Researchers at the University of Oslo's Robotics and Intelligent Systems (ROBIN) group are building 3D-printed self-learning robots.

Despite the tremendous progress we've made in the fields of robotics and artificial intelligence, building a robot that can convincingly emulate normal human behavior remains merely a fantasy at this stage. Some of them can speak and maybe even hold a conversation, but no robot comes close to being a real life'Ex Machina' yet. For the most part, the humanoid robots we've built so far come across as overly mechanical, unnervingly awkward and threateningly soulless… but somehow all of this creepiness makes them irresistibly fascinating. Tara the Android is perhaps the godmother of the robotic creepfest. While the video of this eerie singing mannequin was first uploaded back in 2009 and has since received over seven million views, little information is available about either Tara or her creator.