Random feature methods proved successful in speeding up kernel methods [1]}, [2]}, [3]},
and more recently are used to efficiently approximate softmax [4]}.
In §REF , we use it
to derive an unbiased estimate to \(\exp (\langle \cdot \,,\cdot \rangle )\) 
and then an efficient approximation to softmax attention.
