<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="zhou-etal-2021-low">
    <titleInfo>
        <title>Low Resource Quadratic Forms for Knowledge Graph Embeddings</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Zachary</namePart>
        <namePart type="family">Zhou</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Jeffery</namePart>
        <namePart type="family">Kline</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Devin</namePart>
        <namePart type="family">Conathan</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Glenn</namePart>
        <namePart type="family">Fung</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2021-11</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Second Workshop on Simple and Efficient Natural Language Processing</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Nafise</namePart>
            <namePart type="given">Sadat</namePart>
            <namePart type="family">Moosavi</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Iryna</namePart>
            <namePart type="family">Gurevych</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Angela</namePart>
            <namePart type="family">Fan</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Thomas</namePart>
            <namePart type="family">Wolf</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Yufang</namePart>
            <namePart type="family">Hou</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Ana</namePart>
            <namePart type="family">Marasović</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Sujith</namePart>
            <namePart type="family">Ravi</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Virtual</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>We address the problem of link prediction between entities and relations of knowledge graphs. State of the art techniques that address this problem, while increasingly accurate, are computationally intensive. In this paper we cast link prediction as a sparse convex program whose solution defines a quadratic form that is used as a ranking function. The structure of our convex program is such that standard support vector machine software packages, which are numerically robust and efficient, can solve it. We show that on benchmark data sets, our model’s performance is competitive with state of the art models, but training times can be reduced by a factor of 40 using only CPU-based (and not GPU-accelerated) computing resources. This approach may be suitable for applications where balancing the demands of graph completion performance against computational efficiency is a desirable trade-off.</abstract>
    <identifier type="citekey">zhou-etal-2021-low</identifier>
    <identifier type="doi">10.18653/v1/2021.sustainlp-1.1</identifier>
    <location>
        <url>https://aclanthology.org/2021.sustainlp-1.1</url>
    </location>
    <part>
        <date>2021-11</date>
        <extent unit="page">
            <start>1</start>
            <end>10</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Low Resource Quadratic Forms for Knowledge Graph Embeddings
%A Zhou, Zachary
%A Kline, Jeffery
%A Conathan, Devin
%A Fung, Glenn
%Y Moosavi, Nafise Sadat
%Y Gurevych, Iryna
%Y Fan, Angela
%Y Wolf, Thomas
%Y Hou, Yufang
%Y Marasović, Ana
%Y Ravi, Sujith
%S Proceedings of the Second Workshop on Simple and Efficient Natural Language Processing
%D 2021
%8 November
%I Association for Computational Linguistics
%C Virtual
%F zhou-etal-2021-low
%X We address the problem of link prediction between entities and relations of knowledge graphs. State of the art techniques that address this problem, while increasingly accurate, are computationally intensive. In this paper we cast link prediction as a sparse convex program whose solution defines a quadratic form that is used as a ranking function. The structure of our convex program is such that standard support vector machine software packages, which are numerically robust and efficient, can solve it. We show that on benchmark data sets, our model’s performance is competitive with state of the art models, but training times can be reduced by a factor of 40 using only CPU-based (and not GPU-accelerated) computing resources. This approach may be suitable for applications where balancing the demands of graph completion performance against computational efficiency is a desirable trade-off.
%R 10.18653/v1/2021.sustainlp-1.1
%U https://aclanthology.org/2021.sustainlp-1.1
%U https://doi.org/10.18653/v1/2021.sustainlp-1.1
%P 1-10

Markdown (Informal)

[Low Resource Quadratic Forms for Knowledge Graph Embeddings](https://aclanthology.org/2021.sustainlp-1.1) (Zhou et al., sustainlp 2021)

• Low Resource Quadratic Forms for Knowledge Graph Embeddings (Zhou et al., sustainlp 2021)

ACL

• Zachary Zhou, Jeffery Kline, Devin Conathan, and Glenn Fung. 2021. Low Resource Quadratic Forms for Knowledge Graph Embeddings. In Proceedings of the Second Workshop on Simple and Efficient Natural Language Processing, pages 1–10, Virtual. Association for Computational Linguistics.