arXiv Analytics

Sign in

arXiv:1902.09737 [cs.LG]AbstractReferencesReviewsResources

Functional Transparency for Structured Data: a Game-Theoretic Approach

Guang-He Lee, Wengong Jin, David Alvarez-Melis, Tommi S. Jaakkola

Published 2019-02-26Version 1

We provide a new approach to training neural models to exhibit transparency in a well-defined, functional manner. Our approach naturally operates over structured data and tailors the predictor, functionally, towards a chosen family of (local) witnesses. The estimation problem is setup as a co-operative game between an unrestricted predictor such as a neural network, and a set of witnesses chosen from the desired transparent family. The goal of the witnesses is to highlight, locally, how well the predictor conforms to the chosen family of functions, while the predictor is trained to minimize the highlighted discrepancy. We emphasize that the predictor remains globally powerful as it is only encouraged to agree locally with locally adapted witnesses. We analyze the effect of the proposed approach, provide example formulations in the context of deep graph and sequence models, and empirically illustrate the idea in chemical property prediction, temporal modeling, and molecule representation learning.

Related articles: Most relevant | Search more
arXiv:2004.08483 [cs.LG] (Published 2020-04-17)
ETC: Encoding Long and Structured Data in Transformers
arXiv:1306.6709 [cs.LG] (Published 2013-06-28, updated 2014-02-12)
A Survey on Metric Learning for Feature Vectors and Structured Data
arXiv:1905.06147 [cs.LG] (Published 2019-05-15)
Embeddings and Representation Learning for Structured Data