Claned Co-founder Vesa Perala believes that instead of attempting to retrofit technology to out-dated educational systems, EdTech start-ups should be helping to write a new rulebook. For the past 3 years, Claned has been in what he describes as semi-stealth mode, focusing on developing a robust artificial intelligence system that uses machine-learning algorithms to map out what factors most impact individual learning. That knowledge, he says, was already out there, because it's something universities routinely do. Over time, tutors build an understanding of how each student learns, yet that data is trapped in a system which simply isn't scalable. Claned set out to solve this by combining these tried-and-tested academic evaluation metrics with machine learning algorithms and Artificial Intelligence.

Dato, a Seattle machine learning startup, will put its services in front of a large audience of potential customers through an integration with the next product release from its neighbor, Tableau Software. Tableau (NYSE: DATA), the data visualization and analytics company headquartered in Seattle's Fremont neighborhood, is currently beta-testing Tableau 10, which is due out later this summer and will include the Dato Predictive Services integration along with a host of new features. Dato product manager Roman Schindlauer says the integration will allow Tableau users to create predictive datasets within Tableau using the Python programming language, along with its hundreds of machine learning libraries and tools. That will enable "more complex scenarios" within Tableau--things like sentiment analysis, churn prediction, lead scoring and other predictive analytics that help companies put the reams of data they gather to good use, he says. "It's really the ability to make predictions about the potential future behavior of your users as a company," he says.

In the standard setting of approachability there are two players and a target set. The players play repeatedly a known vector-valued game where the first player wants to have the average vector-valued payoff converge to the target set which the other player tries to exclude it from this set. We revisit this setting in the spirit of online learning and do not assume that the first player knows the game structure: she receives an arbitrary vector-valued reward vector at every round. She wishes to approach the smallest ("best") possible set given the observed average payoffs in hindsight. This extension of the standard setting has implications even when the original target set is not approachable and when it is not obvious which expansion of it should be approached instead. We show that it is impossible, in general, to approach the best target set in hindsight and propose achievable though ambitious alternative goals. We further propose a concrete strategy to approach these goals. Our method does not require projection onto a target set and amounts to switching between scalar regret minimization algorithms that are performed in episodes. Applications to global cost minimization and to approachability under sample path constraints are considered.

David: I've gone through this myself in the past couple of years. There is so much out there right now that if you have any interest in machine learning or data science topics, you can buy any number of good books that will give you overviews and get you started. There are online courses and tons of blogs that will cover a lot of this stuff. I would say the best thing to do is to get started and just try some stuff. Honestly, for basic machine learning, a good start is to take a look at our presentation.

The traditional definition of artificial intelligence is the ability of machines to execute tasks and solve problems in ways normally attributed to humans. Some tasks that we consider simple--recognizing an object in a photo, driving a car--are incredibly complex for AI. Machines can surpass us when it comes to things like playing chess, but those machines are limited by the manual nature of their programming; a 30 gadget can beat us at a board game, but it can't do--or learn to do--anything else. This is where machine learning comes in. Show millions of cat photos to a machine, and it will hone its algorithms to improve at recognizing pictures of cats.

Thanks to its role underpinning many of the recent advances in artificial intelligence, machine learning has become of mainstream interest to many technologists and developers. Here we'll explain what it is, how you can get started plus the best tools and languages you need to develop machine learning technology. Machine learning is a subset of artificial intelligence defined by US computing pioneer Arthur Samuel in 1959 as a'field of study that gives computers the ability to learn without being explicitly programmed'. Instead, computers are'trained' to spot patterns or identify trends by feeding them large amounts of data. You may have also heard of'deep learning' or'neural networks', another subset within machine learning.

The most common question asked by prospective data scientists is – "What is the best programming language for Machine Learning?" The answer to this question always results in a debate whether to choose R, Python or MATLAB for Machine Learning. Nobody can, in reality, answer the question as to whether Python or R is best language for Machine Learning. However, the programming language one should choose for machine learning directly depends on the requirements of a given data problem, the likes and preferences of the data scientist and the context of machine learning activities they want to perform. According to a survey on Kaggler's Favourite Tools, the open source R programming language turned out to be the favourite among 543 Kagglers of the 1714 Kaggler's listing their data science tools.

We introduce the Mondrian kernel, a fast random feature approximation to the Laplace kernel. It is suitable for both batch and online learning, and admits a fast kernel-width-selection procedure as the random features can be re-used efficiently for all kernel widths. The features are constructed by sampling trees via a Mondrian process [Roy and Teh, 2009], and we highlight the connection to Mondrian forests [Lakshminarayanan et al., 2014], where trees are also sampled via a Mondrian process, but fit independently. This link provides a new insight into the relationship between kernel methods and random forests.

Ordinary least squares (OLS) is the default method for fitting linear models, but is not applicable for problems with dimensionality larger than the sample size. For these problems, we advocate the use of a generalized version of OLS motivated by ridge regression, and propose two novel three-step algorithms involving least squares fitting and hard thresholding. The algorithms are methodologically simple to understand intuitively, computationally easy to implement efficiently, and theoretically appealing for choosing models consistently. Numerical exercises comparing our methods with penalization-based approaches in simulations and data analyses illustrate the great potential of the proposed algorithms.

One startup makes a website that connects high-school students with the ideal college. Another operates a chatbot that can answer your simple medical questions. All have the resources of Microsoft backing them. Nine companies made pitches onstage Thursday night at Showbox SoDo as part of Microsoft Accelerator's third demo day in Seattle. The program selects 10 to 15 companies twice a year to participate in a startup accelerator program that provides resources, Microsoft Azure credits, and -- perhaps most compelling -- introductions to Microsoft's deep pool of customers.