Education
Gated Neural Networks for Targeted Sentiment Analysis
Zhang, Meishan (Heilongjiang University) | Zhang, Yue (Singapore University of Technology and Design) | Vo, Duy-Tin (Singapore University of Technology and Design)
Targeted sentiment analysis classifies the sentiment polarity towards each target entity mention in given text documents. Seminal methods extract manual discrete features from automatic syntactic parse trees in order to capture semantic information of the enclosing sentence with respect to a target entity mention. Recently, it has been shown that competitive accuracies can be achieved without using syntactic parsers, which can be highly inaccurate on noisy text such as tweets. This is achieved by applying distributed word representations and rich neural pooling functions over a simple and intuitive segmentation of tweets according to target entity mentions. In this paper, we extend this idea by proposing a sentence-level neural model to address the limitation of pooling functions, which do not explicitly model tweet-level semantics. First, a bi-directional gated neural network is used to connect the words in a tweet so that pooling functions can be applied over the hidden layer instead of words for better representing the target and its contexts. Second, a three-way gated neural network structure is used to model the interaction between the target mention and its surrounding contexts. Experiments show that our proposed model gives significantly higher accuracies compared to the current best method for targeted sentiment analysis.
Age of Exposure: A Model of Word Learning
Dascalu, Mihai (University Politehnica of Bucharest) | McNamara, Danielle S. (Arizona State University) | Crossley, Scott (Georgia State University) | Trausan-Matu, Stefan (University Politehnica of Bucharest)
Textual complexity is widely used to assess the difficulty of reading materials and writing quality in student essays. At a lexical level, word complexity can represent a building block for creating a comprehensive model of lexical networks that adequately estimates learnersโ understanding. In order to best capture how lexical associations are created between related concepts, we propose automated indices of word complexity based on Age of Exposure (AoE). AOE indices computationally model the lexical learning process as a function of a learner's experience with language. This study describes a proof of concept based on the on a large-scale learning corpus (i.e., TASA). The results indicate that AoE indices yield strong associations with human ratings of age of acquisition, word frequency, entropy, and human lexical response latencies providing evidence of convergent validity.
Instance Specific Metric Subspace Learning: A Bayesian Approach
Ye, Han-Jia (Nanjing University) | Zhan, De-Chuan (Nanjing University) | Jiang, Yuan (Nanjing University)
Instead of using a uniform metric, instance specific distance learning methods assign multiple metrics for different localities, which take data heterogeneity into consideration. Therefore, they may improve the performance of distance based classifiers, e.g., kNN. Existing methods obtain multiple metrics of test data by either transductively assigning metrics for unlabeled instances or designing distance functions manually, which are with limited generalization ability. In this paper, we propose isMets (Instance Specific METric Subspace) framework which can automatically span the whole metric space in a generative manner and is able to inductively learn a specific metric subspace for each instance via inferring the expectation over the metric bases in a Bayesian manner. The whole framework can be solved with Variational Bayes (VB). Experiment on synthetic data shows that the learned results are with good interpretability. Moreover, comprehensive results on real world datasets validate the effectiveness and robustness of isMets.
Asynchronous Distributed Semi-Stochastic Gradient Optimization
Zhang, Ruiliang (Hong Kong University of Science and Technology) | Zheng, Shuai (Hong Kong University of Science and Technology) | Kwok, James T. (Hong Kong University of Science and Technology)
With the recent proliferation of large-scale learning problems, there have been a lot of interest on distributed machine learning algorithms, particularly those that are based on stochastic gradient descent (SGD) and its variants. However, existing algorithms either suffer from slow convergence due to the inherent variance of stochastic gradients, or have a fast linear convergence rate but at the expense of poorer solution quality. In this paper, we combine their merits by proposing a fast distributed asynchronous SGD-based algorithm with variance reduction. A constant learning rate can be used, and it is also guaranteed to converge linearly to the optimal solution. Experiments on the Google Cloud Computing Platform demonstrate that the proposed algorithm outperforms state-of-the-art distributed asynchronous algorithms in terms of both wall clock time and solution quality.
Write-righter: An Academic Writing Assistant System
Liu, Yuanchao (Harbin Institute of Technology) | Wang, Xin (Harbin Institute of Technology) | Liu, Ming (Harbin Institute of Technology) | Wang, Xiaolong (Harbin Institute of Technology)
Writing academic articles in English is a challenging task for non-native speakers, as more effort has to be spent to enhance their language expressions. This paper presents an academic writing assistant system called Write-righter, which can provide real-time hint and recommendation by analyzing the input context. To achieve this goal, some novel strategies, e.g., semantic extension based sentence retrieval and LDA based sentence structure identification have been proposed. Write-righter is expected to help people express their ideas correctly by recommending top N most possible expressions.
BBookX: Building Online Open Books for Personalized Learning
Liang, Chen (Pennsylvania State University) | Wang, Shuting (Pennsylvania State University) | Wu, Zhaohui (Pennsylvania State University) | Williams, Kyle (Pennsylvania State University) | Pursel, Bart (Pennsylvania State University) | Brautigam, Benjamin (Pennsylvania State University) | Saul, Sherwyn (Pennsylvania State University) | Williams, Hannah (Pennsylvania State University) | Bowen, Kyle (Pennsylvania State University) | Giles, C. Lee (Pennsylvania State University)
We demonstrate BBookX, a novel system that auto-matically builds in collaboration with a user online openbooks by searching open educational resources (OER).This system explores the use of retrieval technologies todynamically generate zero-cost materials such as text-books for personalized learning.
co-rank: An Online Tool for Collectively Deciding Efficient Rankings Among Peers
Caragiannis, Ioannis (University of Patras) | Krimpas, George A. (University of Patras) | Panteli, Marianna (University of Patras) | Voudouris, Alexandros A. (University of Patras)
Ordinal peer grading is much simpler. It requires each student to grade a small number of Our aim with co-rank is to facilitate the grading of exams exam papers submitted by other students and report a ranking or assignments in massive open online courses (MOOCs). Then, an aggregation step will merge all the online platforms that offer, to a huge number of students partial rankings reported into a single one. Since professional graders are costly, inexpensive can do using the tool. The whole process is represented grading is absolutely necessary in order to make graphically in Figure 1. the new educational experience beneficial for the students First, the instructor creates a new exam.
Interactive Learning and Analogical Chaining for Moral and Commonsense Reasoning
Blass, Joseph A. (Northwestern University)
Autonomous systems must consider the moral ramifications of their actions. Moral norms vary among people and depend on common sense, posing a challenge for encoding them explicitly in a system. I propose to develop a model of repeated analogical chaining and analogical reasoning to enable autonomous agents to interactively learn to apply common sense and model an individualโs moral norms.
Natural Language Processing for Enhancing Teaching and Learning
Litman, Diane (University of Pittsburgh)
Advances in natural language processing (NLP) and educational technology, as well as the availability of unprecedented amounts of educationally-relevant text and speech data, have led to an increasing interest in using NLP to address the needs of teachers and students. Educational applications differ in many ways, however, from the types of applications for which NLP systems are typically developed. This paper will organize and give an overview of research in this area, focusing on opportunities as well as challenges.
Model AI Assignments 2016
Neller, Todd W. (Gettysburg College) | Brown, Laura E. (Michigan Technological University) | Marshall, James B. (Sarah Lawrence College) | Torrey, Lisa (St. Lawrence University) | Derbinsky, Nate (Wentworth Institute of Technology) | Ward, Andrew A. (Software Developer) | Allen, Thomas E. (University of Kentucky) | Goldsmith, Judy (University of Kentucky) | Muluneh, Nahom (University of Kentucky)
The Model AI Assignments session seeks to gather and disseminate the best assignment designs of the Artificial Intelligence (AI) Education community. Recognizing that assignments form the core of student learning experience, we here present abstracts of six AI assignments from the 2016 session that are easily adoptable, playfully engaging, and flexible for a variety of instructor needs.