Machine Learning is one of the most exciting fields in the world. Every week we discover something new, something amazing, something revolutionary. It's incredible, but it can also be overwhelming. That's why we created This Week in Machine Learning! Each week we publish a curated list of Machine Learning stories as a resource to help you keep pace with all these exciting developments.

The exponential rise of machine learning is as much a result of technological advancement as it is the active community growing around it. This includes researchers working on core algorithms, as well as practitioners who are pushing the boundaries of how machine learning can be applied. It also includes an increasing number of machine learning enthusiasts with atypical backgrounds who are joining the conversation, bringing in diverse experiences and points of view. The increasingly symbiotic relationship between companies that need machine learning expertise, and data science competition platforms like Kaggle, has greatly impacted how rapid advancement is being achieved. This relationship has also changed the hiring landscape.

We consider a collaborative online learning paradigm, wherein a group of agents connected through a social network are engaged in playing a stochastic multi-armed bandit game. Each time an agent takes an action, the corresponding reward is instantaneously observed by the agent, as well as its neighbours in the social network. We perform a regret analysis of various policies in this collaborative learning setting. A key finding of this paper is that natural extensions of widely-studied single agent learning policies to the network setting need not perform well in terms of regret. In particular, we identify a class of non-altruistic and individually consistent policies, and argue by deriving regret lower bounds that they are liable to suffer a large regret in the networked setting. We also show that the learning performance can be substantially improved if the agents exploit the structure of the network, and develop a simple learning algorithm based on dominating sets of the network. Specifically, we first consider a star network, which is a common motif in hierarchical social networks, and show analytically that the hub agent can be used as an information sink to expedite learning and improve the overall regret. We also derive networkwide regret bounds for the algorithm applied to general networks. We conduct numerical experiments on a variety of networks to corroborate our analytical results.

Learn how to build a personal chatbot for Facebook Messenger. I have created this step by step guide so you can create your own Facebook Messenger bot without coding. Facebook Messenger has a growing audience of 900 mln. It is an awesome opportunity to showcase your work and promote your services, automate conversations and build out your personal brand. By the end of the course you will be launch and promote your personal bot.

In June on /r/MachineLearning, there were free videos, free books, free courseware, and a quality curriculum made up of free offerings. The word of the month for June is clearly a four letter word starting with'F'. This lot of videos covers a wide range of topics, from general AI, to design issues, to cloud computing, to a variety of machine learning topics and beyond. Microsoft Research has added heavily to these offerings on what seems to be a daily basis since this Reddit post as well. Free knowledge from a top research institute in the field is always welcome.

CRF, HMM, MEMM - that I can do for sequence tagging, never tried it for something like this, it's probably extra hard. Although, I find probabilistic graphical models lacking and have redirected my efforts towards Learning to Search methods. If you check Structured models for fine-to-coarse sentiment analysis by McDonald et al. (2007), you'll see their structured prediction model is a CRF that is a bit hierarchical. You can use Leon Bottou's sgdcrf and adapt the model to get their model (little changes in the forward-backward and viterbi). The complexity of learning and inference for a single example for sentiment of document, paragraphs and sentences is O(M · (M2 P PM2 T)) O(M3 P T), where M is number of possible categorical values, P is number of paragraphs and T the average number of sentences in the paragraph. That's slow as fuck, although still fast if sgdcrf is used (about 500-2000 sentences per second).

Ashok Goel wants to expand high-quality education to "millions" more people over the internet. It's the same goal that's pushed universities to make more and more courses and degree programs available over the internet, making it possible for students living on the far sides of the word to get degrees from American universities -- and vice versa. But online education has a problem: Of the hordes of students that sign up for massive open online classes (MOOCs), an average of less than 7% finish. Goel thinks artificial intelligence can change that. "There are many reasons" students don't finish, he told Tech Insider.

A group of researchers from Nanyang Technological University, Singapore, have created a novel solution for large-scale Android malware detection. It's called DroidOL, and it's an adaptive and scalable malware detection framework based on online learning. "DroidOL's achieves superior accuracy through extracting high quality features from inter-procedural control-flow graphs (ICFGs) of apps, which are known to be robust against evasion and obfuscation techniques adopted by malware," the researchers explained. They used the Weisfeiler-Lehman (WL) graph kernel to extract semantic features from ICFGs, and finally, online learning to distinguish between benign and malicious apps. They attribute much of the success of their technique to the use of a scalable online learning classifier instead of batch-learning classifiers (which are not).

Students mostly couldn't tell'Jill Watson' wasn't human; 'Yep!' One day in January, Eric Wilson dashed off a message to the teaching assistants for an online course at the Georgia Institute of Technology. "I really feel like I missed the mark in giving the correct amount of feedback," he wrote, pleading to revise an assignment. Thirteen minutes later, the TA responded. "Unfortunately, there is not a way to edit submitted feedback," wrote Jill Watson, one of nine assistants for the 300-plus students. Last week, Mr. Wilson found out he had been seeking guidance from a computer.

For the past six years, I've been developing Python Tutor (pythontutor.com), Thousands of people use it every day to run tens of thousands of pieces of code in seven languages: Python, Java, JavaScript, TypeScript, Ruby, C, and C . This tool has also become a platform for HCI, educational technology, and computing education research. Most recently, it formed the basis for my faculty job applications that got me a job at UC San Diego. How did this project grow from nothing to its current state? I've been wanting to write a "history of Python Tutor" article for a while now but never found a good time to do so.