147,148 research outputs found
Graph Neural Networks with Generated Parameters for Relation Extraction
Recently, progress has been made towards improving relational reasoning in
machine learning field. Among existing models, graph neural networks (GNNs) is
one of the most effective approaches for multi-hop relational reasoning. In
fact, multi-hop relational reasoning is indispensable in many natural language
processing tasks such as relation extraction. In this paper, we propose to
generate the parameters of graph neural networks (GP-GNNs) according to natural
language sentences, which enables GNNs to process relational reasoning on
unstructured text inputs. We verify GP-GNNs in relation extraction from text.
Experimental results on a human-annotated dataset and two distantly supervised
datasets show that our model achieves significant improvements compared to
baselines. We also perform a qualitative analysis to demonstrate that our model
could discover more accurate relations by multi-hop relational reasoning
A Tutorial on Distributed Optimization for Cooperative Robotics: from Setups and Algorithms to Toolboxes and Research Directions
Several interesting problems in multi-robot systems can be cast in the
framework of distributed optimization. Examples include multi-robot task
allocation, vehicle routing, target protection and surveillance. While the
theoretical analysis of distributed optimization algorithms has received
significant attention, its application to cooperative robotics has not been
investigated in detail. In this paper, we show how notable scenarios in
cooperative robotics can be addressed by suitable distributed optimization
setups. Specifically, after a brief introduction on the widely investigated
consensus optimization (most suited for data analytics) and on the
partition-based setup (matching the graph structure in the optimization), we
focus on two distributed settings modeling several scenarios in cooperative
robotics, i.e., the so-called constraint-coupled and aggregative optimization
frameworks. For each one, we consider use-case applications, and we discuss
tailored distributed algorithms with their convergence properties. Then, we
revise state-of-the-art toolboxes allowing for the implementation of
distributed schemes on real networks of robots without central coordinators.
For each use case, we discuss their implementation in these toolboxes and
provide simulations and real experiments on networks of heterogeneous robots
Deep Memory Networks for Attitude Identification
We consider the task of identifying attitudes towards a given set of entities
from text. Conventionally, this task is decomposed into two separate subtasks:
target detection that identifies whether each entity is mentioned in the text,
either explicitly or implicitly, and polarity classification that classifies
the exact sentiment towards an identified entity (the target) into positive,
negative, or neutral.
Instead, we show that attitude identification can be solved with an
end-to-end machine learning architecture, in which the two subtasks are
interleaved by a deep memory network. In this way, signals produced in target
detection provide clues for polarity classification, and reversely, the
predicted polarity provides feedback to the identification of targets.
Moreover, the treatments for the set of targets also influence each other --
the learned representations may share the same semantics for some targets but
vary for others. The proposed deep memory network, the AttNet, outperforms
methods that do not consider the interactions between the subtasks or those
among the targets, including conventional machine learning methods and the
state-of-the-art deep learning models.Comment: Accepted to WSDM'1
- …