Sign Rank Limitations for Inner Product Graph Decoders
<|reference_start|>Sign Rank Limitations for Inner Product Graph Decoders: Inner product-based decoders are among the most influential frameworks used to extract meaningful data from latent embeddings. However, such decoders have shown limitations in representation capacity in numerous works within the literature, which have been particularly notable in graph reconstruction problems. In this paper, we provide the first theoretical elucidation of this pervasive phenomenon in graph data, and suggest straightforward modifications to circumvent this issue without deviating from the inner product framework.<|reference_end|>
@article{lee2024sign,
    title={Sign Rank Limitations for Inner Product Graph Decoders},
    author={Su Hyeong Lee and Qingqi Zhang and Risi Kondor},
    journal={arXiv preprint arXiv:2402.06662},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.06662},
    primaryClass={cs.LG}
}