IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v50y2025i2p1514-1554.html
   My bibliography  Save this article

Rank-One Boolean Tensor Factorization and the Multilinear Polytope

Author

Listed:
  • Alberto Del Pia

    (Department of Industrial and Systems Engineering & Wisconsin Institute for Discovery, University of Wisconsin–Madison, Madison, Wisconsin 53715)

  • Aida Khajavirad

    (Department of Industrial & Systems Engineering, Lehigh University, Bethlehem, Pennsylvania 18015)

Abstract

We consider the NP-hard problem of finding the closest rank-one binary tensor to a given binary tensor, which we refer to as the rank-one Boolean tensor factorization (BTF) problem. This optimization problem can be used to recover a planted rank-one tensor from noisy observations. We formulate rank-one BTF as the problem of minimizing a linear function over a highly structured multilinear set. Leveraging on our prior results regarding the facial structure of multilinear polytopes, we propose novel linear programming relaxations for rank-one BTF. We then establish deterministic sufficient conditions under which our proposed linear programs recover a planted rank-one tensor. To analyze the effectiveness of these deterministic conditions, we consider a semirandom model for the noisy tensor and obtain high probability recovery guarantees for the linear programs. Our theoretical results as well as numerical simulations indicate that certain facets of the multilinear polytope significantly improve the recovery properties of linear programming relaxations for rank-one BTF.

Suggested Citation

  • Alberto Del Pia & Aida Khajavirad, 2025. "Rank-One Boolean Tensor Factorization and the Multilinear Polytope," Mathematics of Operations Research, INFORMS, vol. 50(2), pages 1514-1554, May.
    • Handle: RePEc:inm:ormoor:v:50:y:2025:i:2:p:1514-1554
    DOI: 10.1287/moor.2022.0201
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.0201
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2022.0201?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:50:y:2025:i:2:p:1514-1554. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.