Statistical Learning
Active Imitation Learning via Reduction to I.I.D. Active Learning
Judah, Kshitij (Oregon State University) | Fern, Alan Paul (Oregon State University) | Dietterich, Thomas Glenn (Oregon State University)
In standard passive imitation learning, the goal is to learn an expert’s policy by passively observing full execution trajectories of it. Unfortunately, generating such trajectories can require substantial expert effort and be impractical in some cases. In this paper, we consider Active Imitation Learning (AIL) with the goal of reducing this effort by querying the expert about the desired action at individual states, which are selected based on answers to past queries and the learner’s interactions with an environment simulator. Our new approach is based on reducing AIL to i.i.d. active learning, which can leverage progress in the i.i.d. setting. We introduce and analyze reductions for both non-stationary and stationary policies, showing that the label complexity (number of queries) of AIL can be substantially less than passive learning. We also introduce a practical algorithm inspired by the reductions, which is shown to be highly effective in four test domains compared to a number of alternatives.
How Is Grandma Doing? Predicting Functional Health Status from Binary Ambient Sensor Data
Robben, Saskia (Amsterdam University of Applied Science) | Englebienne, Gwenn (University of Amsterdam) | Pol, Margriet (Amsterdam University of Applied Sciences) | Kröse, Ben (University of Amsterdam)
Ambient activity monitoring systems produce large amounts of data, which can be used for health monitoring.The problem is that patterns in this data reflecting health status are not identified yet. In this paper the possibility is explored of predicting the functional health status (the motor score of AMPS = Assessment of Motor and Process Skills) of a person from data of binary ambient sensors. Data is collected of five independently living elderly people. Based on expert knowledge, features are extracted from the sensor data and several subsets are selected. We use standard linear regression and Gaussian processes for mapping the features to the functional status and predict the status of a test person using a leave-one-person-out cross validation. The results show that Gaussian processes perform better than the linear regression model, and that both models perform better with the basic feature set than with location or transition based features.Some suggestions are provided for better feature extraction and selection for the purpose of health monitoring.These results indicate that automated functional health assessment is possible, but some challenges lie ahead. The most important challenge is eliciting expert knowledge and translating that into quantifiable features.
Discovering Protein Clusters
Epstein, Susan (Hunter College and The Graduate Center of The City University of New York) | Li, Xingjian (Microsoft Online Services Division) | Valdez, Peter (Hunter College of The City University of New York) | Grayevsky, Sofia (Hunter College of The City University of New York) | Osisek, Eric (The Graduate Center of The City University of New York) | Yun, Xi (The Graduate Center of The City University of New York) | Xie, Lei (Hunter College of The City University of New York)
As biological data about genes and their interactions proliferates, scientists have the opportunity to identify sets of proteins whose interactions make them worthy of further investigation. This paper reports on a knowledge discovery technique to support that work. Foretell is an algorithm originally designed to support search for solutions to constraint satisfaction problems. Recent adaptations enable Foretell to detect sets of genes that interact heavily with one another. We provide empirical results, and describe ongoing work on biological meaning and knowledge infusion from the user.
Between Instruction and Reward: Human-Prompted Switching
Pilarski, Patrick M. (University of Alberta) | Sutton, Richard S. (University of Alberta)
Intelligent systems promise to amplify, augment, and extend innate human abilities. A principal example is that of assistive rehabilitation robots---artificial intelligence and machine learning enable new electromechanical systems that restore biological functions lost through injury or illness. In order for an intelligent machine to assist a human user, it must be possible for a human to communicate their intentions and preferences to their non-human counterpart. While there are a number of techniques that a human can use to direct a machine learning system, most research to date has focused on the contrasting strategies of instruction and reward. The primary contribution of our work is to demonstrate that the middle ground between instruction and reward is a fertile space for research and immediate technological progress. To support this idea, we introduce the setting of human-prompted switching, and illustrate the successful combination of switching with interactive learning using a concrete real-world example: human control of a multi-joint robot arm. We believe techniques that fall between the domains of instruction and reward are complementary to existing approaches, and will open up new lines of rapid progress for interactive human training of machine learning systems.
An Automated Machine Learning Approach Applied to Robotic Stroke Rehabilitation
Snoek, Jasper (University of Toronto) | Taati, Babak (University of Toronto) | Mihailidis, Alex (University of Toronto)
While machine learning methods have proven to be a highly valuable tool in solving numerous problems in assistive technology,state-of-the-art machine learning algorithms and corresponding results are not always accessible to assistive technology researchers due to required domain knowledge and complicated model parameters. This work explores the use of recent work in machine learning to entirely automate the machine learning pipeline, from feature extraction to classification. A nonparametrically guided autoencoder is used toextract features and perform classification while Bayesian optimization is used to automatically tune the parameters of the model for best performance. Empirical analysis is performed on a real-world rehabilitation research problem. The entirely automated approach significantly outperforms previously published results using carefully tuned machine learning algorithms on the same data.
Learning to Avoid Collisions
Sklar, Elizabeth (Brooklyn College, City University of New York) | Parsons, Simon (Brooklyn College, City University of New York) | Epstein, Susan L. (Hunter College, City University of New York) | Ozgelen, Arif Tuna (The Graduate Center, City University of New York) | Munoz, Juan Pablo (The Graduate Center, City University of New York) | Abbasi, Farah (College of Staten Island, City University of New York) | Schneider, Eric (Hunter College, City University of New York) | Costantino, Michael (College of Staten Island, City University of New York)
Members of a multi-robot team, operating within close quarters, need to avoid crashing into each other. Simple collision avoidance methods can be used to prevent such collisions, typically by computing the distance to other robots and stopping, perhaps moving away, when this distance falls below a certain threshold. While this approach may avoid disaster, it may also reduce the team's efficiency if robots halt for a long time to let others pass by or if they travel further to move around one another. This paper reports on experiments where a human operator, through a graphical user interface, watches robots perform an exploration task. The operator can manually suspend robots' movements before they crash into each other, and then resume their movements when their paths are clear. Experiment logs record the robots' states when they are paused and resumed. A behavior pattern for collision avoidance is learned, by classifying the states of the robots' environment when the human operator issues "wait" and "resume" commands. Preliminary results indicate that it is possible to learn a classifier which models these behavior patterns, and that different human operators consider different factors when making decisions about stopping and starting robots.
Learning to Select and Generalize Striking Movements in Robot Table Tennis
Muelling, Katharina (Max Planck Institute for Intelligent Systems) | Kober, Jens (Max Planck Institute for Intelligent Systems) | Kroemer, Oliver (Technische Universitaet Darmstadt) | Peters, Jan (Technische Universitaet Darmstadt)
Learning new motor tasks autonomously from interaction with a human being is an important goal for both robotics and machine learning. However, when moving beyond basic skills, most monolithic machine learning approaches fail to scale. In this paper, we take the task of learning table tennis as an example and present a new framework which allows a robot to learn cooperative table tennis from interaction with a human. Therefore, the robot first learns a set of elementary table tennis hitting movements from a human teacher by kinesthetic teach-in, which is compiled into a set of dynamical system motor primitives (DMPs). Subsequently, the system generalizes these movements to a wider range of situations using our mixture of motor primitives (MoMP) approach. The resulting policy enables the robot to select appropriate motor primitives as well as to generalize between them. Finally, the robot plays with a human table tennis partner and learns online to improve its behavior.
Global and Local Approach of Part-of-Speech Tagging for Large Corpora
Yu, Shi (University of Chicago) | Grossman, Robert (University of Chicago) | Rzhetsky, Andrey (University of Chicago)
We present Global-Local POS tagging, a framework to train generative stochastic Part-of-Speech models on large corpora. Global Taggers offer several advantages over their counter parts trained on small, curated corpus, including the ability to automatically extend and update their models to new text. Global Taggers also avoid a fundamental limitation of current models, whose performance heavily relies on curated text with manually assigned labels. We illustrate our approach by training several Global Taggers, implemented with generative stochastic models, on two large corpora using high performance computing architecture. We further demonstrate that global taggers can be improved by incorporating models trained on curated text, called Local Taggers, for better tagging performance derived from specific topics.