Outstanding achievements of graph neural networks for spatiotemporal time
series analysis show that relational constraints introduce an effective
inductive bias into neural forecasting architectures. Often, however, the
relational information characterizing the underlying data-generating process is
unavailable and the practitioner is left with the problem of inferring from
data which relational graph to use in the subsequent processing stages. We
propose novel, principled - yet practical - probabilistic score-based methods
that learn the relational dependencies as distributions over graphs while
maximizing end-to-end the performance at task. The proposed graph learning
framework is based on consolidated variance reduction techniques for Monte
Carlo score-based gradient estimation, is theoretically grounded, and, as we
show, effective in practice. In this paper, we focus on the time series
forecasting problem and show that, by tailoring the gradient estimators to the
graph learning problem, we are able to achieve state-of-the-art performance
while controlling the sparsity of the learned graph and the computational
scalability. We empirically assess the effectiveness of the proposed method on
synthetic and real-world benchmarks, showing that the proposed solution can be
used as a stand-alone graph identification procedure as well as a graph
learning component of an end-to-end forecasting architecture.

本文提出了一种基于分数的概率方法，学习图的关系依赖性。该方法可用于时间序列预测，可在最大化任务性能的同时控制图的稀疏性和计算可扩展性，同时提高了准确性。

时空序列中的稀疏图学习

Sparse Graph Learning from Spatiotemporal Time Series

Conventional word embeddings represent words with fixed vectors, which are
usually trained based on co-occurrence patterns among words. In doing so,
however, the power of such representations is limited, where the same word
might be functionalized separately under different syntactic relations. To
address this limitation, one solution is to incorporate relational dependencies
of different words into their embeddings. Therefore, in this paper, we propose
a multiplex word embedding model, which can be easily extended according to
various relations among words. As a result, each word has a center embedding to
represent its overall semantics, and several relational embeddings to represent
its relational dependencies. Compared to existing models, our model can
effectively distinguish words with respect to different relations without
introducing unnecessary sparseness. Moreover, to accommodate various relations,
we use a small dimension for relational embeddings and our model is able to
keep their effectiveness. Experiments on selectional preference acquisition and
word similarity demonstrate the effectiveness of the proposed model, and a
further study of scalability also proves that our embeddings only need 1/20 of
the original embedding size to achieve better performance.

本文提出了一种多重词向量模型，将不同单词之间的关系映射到嵌入空间中，从而实现更好的语义解析和性能提升。实验证明该模型能更好地区分单词之间的不同关系且维持了嵌入向量的有效性。

复合词词嵌入用于选择偏好习得

Multiplex Word Embeddings for Selectional Preference Acquisition

In many supervised learning tasks, the entities to be labeled are related to
each other in complex ways and their labels are not independent. For example,
in hypertext classification, the labels of linked pages are highly correlated.
A standard approach is to classify each entity independently, ignoring the
correlations between them. Recently, Probabilistic Relational Models, a
relational version of Bayesian networks, were used to define a joint
probabilistic model for a collection of related entities. In this paper, we
present an alternative framework that builds on (conditional) Markov networks
and addresses two limitations of the previous approach. First, undirected
models do not impose the acyclicity constraint that hinders representation of
many important relational dependencies in directed models. Second, undirected
models are well suited for discriminative training, where we optimize the
conditional likelihood of the labels given the features, which generally
improves classification accuracy. We show how to train these models
effectively, and how to use approximate probabilistic inference over the
learned model for collective classification of multiple related entities. We
provide experimental results on a webpage classification task, showing that
accuracy can be significantly improved by modeling relational dependencies.

本文提出一种基于 (条件) 马尔科夫网络的框架，可以 effectively 地训练 probabilistic relational models，并使用近似概率推断对多个相关对象进行 collective classification，从而解决了先前方法的两个限制：有向模型无法表示许多重要的关系依赖性和难以用于判别式训练。在网页分类任务上的实验证明，建模关系依赖性可以显著提高分类准确性。