Learning Discrete Directed Acyclic Graphs via Backpropagation

被引：0
|
作者：
Wren, Andrew J. [1 ]
Minervini, Pasquale [1 ,2 ]
Franceschi, Luca [4 ]
Zantedeschi, Valentina [1 ,3 ,5 ]
机构：
[1] University College London, United Kingdom
[2] University of Edinburgh, United Kingdom
[3] Inria London, United Kingdom
[4] Amazon Web Services, United States
[5] ServiceNow, United States
来源：
arXiv | 2022年
关键词：
Compilation and indexing terms; Copyright 2024 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Combinatorial optimization - Directed graphs - Maximum likelihood estimation
引用
收藏
相关论文
共 50 条
  • [1] Linear time algorithms for two disjoint paths problems on directed acyclic graphs
    Institut für Informatik, Universität Augsburg, 86135 Augsburg, Germany
    Theor Comput Sci, (35-48):
  • [2] Simplex Closing Probabilities in Directed Graphs
    Technische Universität Graz, Austria
    不详
    arXiv,
  • [3] ON PICARD GROUPS AND JACOBIANS OF DIRECTED GRAPHS
    Jun, Jaiung
    Kim, Youngsu
    Pisano, Matthew
    arXiv, 2023,
  • [4] A Graph Convolution for Signed Directed Graphs
    Ko, Taewook
    Kim, Chong-Kwon
    arXiv, 2022,
  • [5] Independent set reconfiguration on directed graphs
    Ito, Takehiro
    Iwamasa, Yuni
    Kobayashi, Yasuaki
    Nakahata, Yu
    Otachi, Yota
    Takahashi, Masahiro
    Wasa, Kunihiro
    arXiv, 2022,
  • [6] On commutative association schemes and associated (directed) graphs
    Monzillo, Giusy
    Penjić, Safet
    arXiv, 2023,
  • [7] The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree
    Bressan, Marco
    Lanzinger, Matthias
    Roth, Marc
    Proceedings of the Annual ACM Symposium on Theory of Computing, 2023, : 542 - 552
  • [8] Circular flows in mono-directed signed graphs
    Li, Jiaao
    Naserasr, Reza
    Wang, Zhouningxin
    Zhu, Xuding
    arXiv, 2022,
  • [9] The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree
    Bressan, Marco
    Lanzinger, Matthias
    Roth, Marc
    arXiv, 2022,
  • [10] Learning acyclic probabilistic circuits using test paths
    Department of Computer Science, Yale University, New Haven, CT 06520, United States
    不详
    不详
    J. Mach. Learn. Res., (1881-1911):
12345