1 citations · 3 across the 7 of their papers we have counts for
9 papers
Optimal Online Discrepancy Minimization in Linear Time
Ishaq Aden-Ali
We provide an online algorithm with the following guarantee: for any fixed sequence of vectors with , the algorithm assigns each ar…
Subliminal Effects in Your Data: A General Mechanism via Log-Linearity
Ishaq Aden-Ali, Noah Golowich, Allen Liu +3
Training modern large language models (LLMs) has become a veritable smorgasbord of algorithms and datasets designed to elicit particular behaviors, making it critical to develop te…
Quantization for Vector Search under Streaming Updates
Ishaq Aden-Ali, Hakan Ferhatosmanoglu, Alexander Greaves-Tunnell +2
Large-scale vector databases for approximate nearest neighbor (ANN) search typically store a quantized dataset in main memory for fast access, and full precision data on remote dis…
On the Injective Norm of Sums of Random Tensors and the Moments of Gaussian Chaoses
Ishaq Aden-Ali
We prove an upper bound on the expected injective norm of sums of subgaussian random tensors. Our proof is simple and does not rely on any explicit geometric or chaining a…
Majority-of-Three: The Simplest Optimal Learner?
Ishaq Aden-Ali, Mikael Møller Høgsgaard, Kasper Green Larsen +1
Developing an optimal PAC learning algorithm in the realizable setting, where empirical risk minimization (ERM) is suboptimal, was a major open problem in learning theory for decad…
On the amortized complexity of approximate counting
Ishaq Aden-Ali, Yanjun Han, Jelani Nelson +1
Naively storing a counter up to value would require bits of memory. Nelson and Yu [NY22], following work of [Morris78], showed that if the query answers need only b…