Representing Unordered Data Using Complex-Weighted Multiset Automata

被引:0
|
作者
DeBenedetto, Justin [1 ]
Chiang, David [1 ]
机构
[1] Univ Notre Dame, Dept Comp Sci & Engn, Notre Dame, IN 46556 USA
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Unordered, variable-sized inputs arise in many settings across multiple fields. The ability for setand multiset-oriented neural networks to handle this type of input has been the focus of much work in recent years. We propose to represent multisets using complex-weighted multiset automata and show how the multiset representations of certain existing neural architectures can be viewed as special cases of ours. Namely, (1) we provide a new theoretical and intuitive justification for the Transformer model's representation of positions using sinusoidal functions, and (2) we extend the DeepSets model to use complex numbers, enabling it to outperform the existing model on an extension of one of their tasks.
引用
收藏
页数:9
相关论文
共 50 条
  • [1] Representing Unordered Data Using Complex-Weighted Multiset Automata
    DeBenedetto, Justin
    Chiang, David
    25TH AMERICAS CONFERENCE ON INFORMATION SYSTEMS (AMCIS 2019), 2019,
  • [2] Complex-weighted OFDM transmission with low PAPR
    Nikookar, Homayoun
    Soehartono, Djoko
    2007 EUROPEAN CONFERENCE ON WIRELESS TECHNOLOGIES, 2007, : 68 - 71
  • [3] Complex-weighted Plancherel formula and Jacobi transform
    刘建明
    郑维行
    Chinese Science Bulletin, 1996, (06) : 454 - 458
  • [4] Algorithms and Training for Weighted Multiset Automata and Regular Expressions
    DeBenedetto, Justin
    Chiang, David
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2018, 2018, 10977 : 146 - 158
  • [5] Complex-weighted Plancherel formula and Jacobi transform
    Liu, JM
    Zheng, WX
    CHINESE SCIENCE BULLETIN, 1996, 41 (06): : 454 - 458
  • [6] A compact data structure for representing a dynamic multiset
    Katajainen, Jyrki
    Rao, S. Srinivasa
    INFORMATION PROCESSING LETTERS, 2010, 110 (23) : 1061 - 1066
  • [7] Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
    Yamakami, Tomoyuki
    APPROXIMATION AND ONLINE ALGORITHMS, 2011, 6534 : 261 - 272
  • [8] Approximate counting for complex-weighted Boolean constraint satisfaction problems
    Yamakami, Tomoyuki
    INFORMATION AND COMPUTATION, 2012, 219 : 17 - 38
  • [9] Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems
    Yamakami, Tomoyuki
    INTELLIGENT COMPUTING, VOL 4, 2024, 2024, 1019 : 45 - 65
  • [10] Weighted register automata and weighted logic on data words
    Babari, Parvaneh
    Droste, Manfred
    Perevoshchikov, Vitaly
    THEORETICAL COMPUTER SCIENCE, 2018, 744 : 3 - 21