2 papers
cs.LG2026
Approximating Uniform Random Rotations by Two-Stage Structured Hadamard Rotations in High Dimensions
Tomer Zilca, Gal Mendelson
Uniform random rotations are useful in fast Johnson--Lindenstrauss embeddings, kernel approximation, communication-efficient learning, and recent AI compression pipelines, but are…
math.PR2023
The secretary problem with items arriving according to a random permutation avoiding a pattern of length three
Ross G. Pinsky, Tomer Zilca
In the classical secretary problem, ranked items arrive one by one, and each item's rank relative to its predecessors is noted. The observer must select or reject each item as…