Papers with inversion
Invertible Tree Embeddings using a Cryptographic Role Embedding Scheme (2020.coling-main)
Copied to clipboard
| Challenge: | Unlike previous attempts, this method does not come at the cost of intractable representation size; it works well when there is sufficient randomness in the representation scheme for simple data and providing an upper bound on its error. |
| Approach: | They propose a method for embedding trees in a vector space based on Tensor-Product Representations (TPRs) that allows for inversion: the retrieval of the original tree structure and nodes from the vectorial embeddment. |
| Outcome: | The proposed method can provide invertibility with error 1% that previous methods would require 8.6 1057 dimensions to represent. |