Probabilistic inference over repeated insertion models

Batya Kenig, Lovro Ilijasić, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Distributions over rankings are used to model user preferences in various settings including political elections and electronic commerce. The Repeated Insertion Model (RIM) gives rise to various known probability distributions over rankings, in particular to the popular Mallows model. However, probabilistic inference on RIM is computationally challenging, and provably intractable in the general case. In this paper we propose an algorithm for computing the marginal probability of an arbitrary partially ordered set over RIM. We analyze the complexity of the algorithm in terms of properties of the model and the partial order, captured by a novel measure termed the “cover width”. We also conduct an experimental study of the algorithm over serial and parallelized implementations. Building upon the relationship between inference with rank distributions and counting linear extensions, we investigate the inference problem when restricted to partial orders that lend themselves to efficient counting of their linear extensions.

    Original languageEnglish (US)
    Title of host publication32nd AAAI Conference on Artificial Intelligence, AAAI 2018
    PublisherAAAI press
    Pages1897-1904
    Number of pages8
    ISBN (Electronic)9781577358008
    StatePublished - Jan 1 2018
    Event32nd AAAI Conference on Artificial Intelligence, AAAI 2018 - New Orleans, United States
    Duration: Feb 2 2018Feb 7 2018

    Other

    Other32nd AAAI Conference on Artificial Intelligence, AAAI 2018
    CountryUnited States
    CityNew Orleans
    Period2/2/182/7/18

    Fingerprint

    Electronic commerce
    Probability distributions

    ASJC Scopus subject areas

    • Artificial Intelligence

    Cite this

    Kenig, B., Ilijasić, L., Kimelfeld, B., Ping, H., & Stoyanovich, J. (2018). Probabilistic inference over repeated insertion models. In 32nd AAAI Conference on Artificial Intelligence, AAAI 2018 (pp. 1897-1904). AAAI press.

    Probabilistic inference over repeated insertion models. / Kenig, Batya; Ilijasić, Lovro; Kimelfeld, Benny; Ping, Haoyue; Stoyanovich, Julia.

    32nd AAAI Conference on Artificial Intelligence, AAAI 2018. AAAI press, 2018. p. 1897-1904.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Kenig, B, Ilijasić, L, Kimelfeld, B, Ping, H & Stoyanovich, J 2018, Probabilistic inference over repeated insertion models. in 32nd AAAI Conference on Artificial Intelligence, AAAI 2018. AAAI press, pp. 1897-1904, 32nd AAAI Conference on Artificial Intelligence, AAAI 2018, New Orleans, United States, 2/2/18.
    Kenig B, Ilijasić L, Kimelfeld B, Ping H, Stoyanovich J. Probabilistic inference over repeated insertion models. In 32nd AAAI Conference on Artificial Intelligence, AAAI 2018. AAAI press. 2018. p. 1897-1904
    Kenig, Batya ; Ilijasić, Lovro ; Kimelfeld, Benny ; Ping, Haoyue ; Stoyanovich, Julia. / Probabilistic inference over repeated insertion models. 32nd AAAI Conference on Artificial Intelligence, AAAI 2018. AAAI press, 2018. pp. 1897-1904
    @inproceedings{8629c5e6b01e4386b81ea2b49fbb3d55,
    title = "Probabilistic inference over repeated insertion models",
    abstract = "Distributions over rankings are used to model user preferences in various settings including political elections and electronic commerce. The Repeated Insertion Model (RIM) gives rise to various known probability distributions over rankings, in particular to the popular Mallows model. However, probabilistic inference on RIM is computationally challenging, and provably intractable in the general case. In this paper we propose an algorithm for computing the marginal probability of an arbitrary partially ordered set over RIM. We analyze the complexity of the algorithm in terms of properties of the model and the partial order, captured by a novel measure termed the “cover width”. We also conduct an experimental study of the algorithm over serial and parallelized implementations. Building upon the relationship between inference with rank distributions and counting linear extensions, we investigate the inference problem when restricted to partial orders that lend themselves to efficient counting of their linear extensions.",
    author = "Batya Kenig and Lovro Ilijasić and Benny Kimelfeld and Haoyue Ping and Julia Stoyanovich",
    year = "2018",
    month = "1",
    day = "1",
    language = "English (US)",
    pages = "1897--1904",
    booktitle = "32nd AAAI Conference on Artificial Intelligence, AAAI 2018",
    publisher = "AAAI press",

    }

    TY - GEN

    T1 - Probabilistic inference over repeated insertion models

    AU - Kenig, Batya

    AU - Ilijasić, Lovro

    AU - Kimelfeld, Benny

    AU - Ping, Haoyue

    AU - Stoyanovich, Julia

    PY - 2018/1/1

    Y1 - 2018/1/1

    N2 - Distributions over rankings are used to model user preferences in various settings including political elections and electronic commerce. The Repeated Insertion Model (RIM) gives rise to various known probability distributions over rankings, in particular to the popular Mallows model. However, probabilistic inference on RIM is computationally challenging, and provably intractable in the general case. In this paper we propose an algorithm for computing the marginal probability of an arbitrary partially ordered set over RIM. We analyze the complexity of the algorithm in terms of properties of the model and the partial order, captured by a novel measure termed the “cover width”. We also conduct an experimental study of the algorithm over serial and parallelized implementations. Building upon the relationship between inference with rank distributions and counting linear extensions, we investigate the inference problem when restricted to partial orders that lend themselves to efficient counting of their linear extensions.

    AB - Distributions over rankings are used to model user preferences in various settings including political elections and electronic commerce. The Repeated Insertion Model (RIM) gives rise to various known probability distributions over rankings, in particular to the popular Mallows model. However, probabilistic inference on RIM is computationally challenging, and provably intractable in the general case. In this paper we propose an algorithm for computing the marginal probability of an arbitrary partially ordered set over RIM. We analyze the complexity of the algorithm in terms of properties of the model and the partial order, captured by a novel measure termed the “cover width”. We also conduct an experimental study of the algorithm over serial and parallelized implementations. Building upon the relationship between inference with rank distributions and counting linear extensions, we investigate the inference problem when restricted to partial orders that lend themselves to efficient counting of their linear extensions.

    UR - http://www.scopus.com/inward/record.url?scp=85060489949&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85060489949&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:85060489949

    SP - 1897

    EP - 1904

    BT - 32nd AAAI Conference on Artificial Intelligence, AAAI 2018

    PB - AAAI press

    ER -