Efficient K-generalizable Learned Search
This paper shows that learned search can support arbitrary K with the preprocessing cost of a single top-1 model, and reduces total serving and preprocessing computation by up to 28%.
Yifan Peng, Jia-Fei Fan, Xing-Da Wei et al.
· 0 citations