Publications (18)
Low-Rank Tensor Decomposition over Finite Fields
Jason Yang
We show that finding rank- decompositions of a 3D tensor, for , over a fixed finite field can be done in polynomial time. However, if some cells in the tensor are allowe…
A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm
Philipp Baumann, Olivier Goldschmidt, Dorit S. Hochbaum +1
Anticlustering is an NP-hard combinatorial optimization problem that consists of partitioning a set of objects into equal-sized groups called anticlusters such that the objects in…
General Multimodal Protein Design Enables DNA-Encoding of Chemistry
Jarrid Rector-Brooks, Théophile Lambert, Marta Skreta +15
Evolution is an extraordinary engine for enzymatic diversity, yet the chemistry it has explored remains a narrow slice of what DNA can encode. Deep generative models can design new…
Faster search for tensor decomposition over finite fields
Jason Yang
We present an -time algorithm for determining whether the rank of a concise tensor $T\in\…
A comparative study of transformer-based embeddings for topic coherence
Alex Ding, Tarun Rapaka, Willy Rodriguez +1
Topic modeling is a branch of Natural Language Processing (NLP) that aims to organize large collections of texts into coherent groups according to word co-occurrence patterns, with…
Chip-Firing and Fractional Bases
Matvey Borodin, Hannah Han, Kaylee Ji +8
We study a particular chip-firing process on an infinite path graph. At any time when there are at least chips at a vertex, chips fire to the left and chips fire to t…