64 citations · 285 across the 26 of their papers we have counts for
3 papers · 1 filter
Binary embeddings with structured hashed projections
Anna Choromanska, Krzysztof Choromanski, Mariusz Bojarski +3
We consider the hashing mechanism for constructing binary embeddings, that involves pseudo-random projections followed by nonlinear (sign function) mappings. The pseudo-random proj…
Coloring tournaments with forbidden substructures
Krzysztof Choromanski, Tony Jebara
Coloring graphs is an important algorithmic problem in combinatorics with many applications in computer science. In this paper we study coloring tournaments. A chromatic number of…
Bethe Learning of Conditional Random Fields via MAP Decoding
Kui Tang, Nicholas Ruozzi, David Belanger +1
Many machine learning tasks can be formulated in terms of predicting structured outputs. In frameworks such as the structured support vector machine (SVM-Struct) and the structured…