Get our free extension to see links to code for papers anywhere online!

Chrome logo  Add to Chrome

Firefox logo Add to Firefox
Picture for Kian Kenyon-Dean

Kian Kenyon-Dean

Deconstructing word embedding algorithms



Kian Kenyon-Dean , Edward Newell , Jackie Chi Kit Cheung

Figure 1 for Deconstructing word embedding algorithms
Figure 2 for Deconstructing word embedding algorithms
* EMNLP 2020, 6 pages. arXiv admin note: substantial text overlap with arXiv:1911.13280 
   Access Paper or Ask Questions

Learning Efficient Task-Specific Meta-Embeddings with Word Prisms



Jingyi He , KC Tsiolis , Kian Kenyon-Dean , Jackie Chi Kit Cheung

Figure 1 for Learning Efficient Task-Specific Meta-Embeddings with Word Prisms
Figure 2 for Learning Efficient Task-Specific Meta-Embeddings with Word Prisms
Figure 3 for Learning Efficient Task-Specific Meta-Embeddings with Word Prisms
Figure 4 for Learning Efficient Task-Specific Meta-Embeddings with Word Prisms

   Access Paper or Ask Questions

Deconstructing and reconstructing word embedding algorithms



Edward Newell , Kian Kenyon-Dean , Jackie Chi Kit Cheung

Figure 1 for Deconstructing and reconstructing word embedding algorithms
Figure 2 for Deconstructing and reconstructing word embedding algorithms
Figure 3 for Deconstructing and reconstructing word embedding algorithms
Figure 4 for Deconstructing and reconstructing word embedding algorithms
* 15 pages 
   Access Paper or Ask Questions

Word Embedding Algorithms as Generalized Low Rank Models and their Canonical Form



Kian Kenyon-Dean

Figure 1 for Word Embedding Algorithms as Generalized Low Rank Models and their Canonical Form
Figure 2 for Word Embedding Algorithms as Generalized Low Rank Models and their Canonical Form
Figure 3 for Word Embedding Algorithms as Generalized Low Rank Models and their Canonical Form
Figure 4 for Word Embedding Algorithms as Generalized Low Rank Models and their Canonical Form
* 82 pages; McGill University master's thesis, 2019 
   Access Paper or Ask Questions

Clustering-Oriented Representation Learning with Attractive-Repulsive Loss



Kian Kenyon-Dean , Andre Cianflone , Lucas Page-Caccia , Guillaume Rabusseau , Jackie Chi Kit Cheung , Doina Precup

Figure 1 for Clustering-Oriented Representation Learning with Attractive-Repulsive Loss
Figure 2 for Clustering-Oriented Representation Learning with Attractive-Repulsive Loss
Figure 3 for Clustering-Oriented Representation Learning with Attractive-Repulsive Loss
Figure 4 for Clustering-Oriented Representation Learning with Attractive-Repulsive Loss
* AAAI 2019 Workshop on Network Interpretability for Deep Learning (9 pages) 
   Access Paper or Ask Questions

Resolving Event Coreference with Supervised Representation Learning and Clustering-Oriented Regularization



Kian Kenyon-Dean , Jackie Chi Kit Cheung , Doina Precup

Figure 1 for Resolving Event Coreference with Supervised Representation Learning and Clustering-Oriented Regularization
Figure 2 for Resolving Event Coreference with Supervised Representation Learning and Clustering-Oriented Regularization
Figure 3 for Resolving Event Coreference with Supervised Representation Learning and Clustering-Oriented Regularization
Figure 4 for Resolving Event Coreference with Supervised Representation Learning and Clustering-Oriented Regularization
* 10 pages, 2 figures; to be published in the Proceedings of the Seventh Joint Conference on Lexical and Computational Semantics (*SEM 2018), June 2018, New Orleans, LA 
   Access Paper or Ask Questions