Random Fourier features approximate a shift-invariant kernel in $\mathbb{R}^d$, such as the Gaussian kernel $\exp(-\tfrac12\|x-y\|_2^2)$, using independent samples from its spectral measure to construct an unbiased estimator for the kernel value with subgaussian concentration. However, generating $m$ such features requ...
S. Mahabadi, Sandeep Silwal, Tal Wagner· 0 citations
A fundamental challenge of vector search is achieving consistently high recall while minimizing computational costs. Fixed search parameters cause significant performance variance across queries, and conventional evaluation on average recall masks these per-query disparities. We introduce QASP (Query-Adaptive robust ve...
Hakan Ferhatosmanoglu, Kushal Kumar, Tal Wagner et al.· arXiv.org· 0 citations
This work develops a black-box method for learning a single context-independent logit-bias vector, added at every decoding step, without modifying model weights or requiring gradients, and suggests that learned logit bias is a lightweight mechanism for adapting language models under minimal access requirements.