1 citations · 1 across the 1 of their papers we have counts for
2 papers
math.PR2021
When Rooks Miss: Probability through Chess
Steven J. Miller, Haoyu Sheng, Daniel Turek
A famous (and hard) chess problem asks what is the maximum number of safe squares possible in placing queens on an board. We examine related problems from placing $…
cs.CL2019★ 1 cited
Knowledge Distillation For Recurrent Neural Network Language Modeling With Trust Regularization
Yangyang Shi, Mei-Yuh Hwang, Xin Lei +1
Recurrent Neural Networks (RNNs) have dominated language modeling because of their superior performance over traditional N-gram based models. In many applications, a large Recurren…