TW
Tal Wagner
cs.DScs.LGcs.CGcs.CLcs.AIcs.IRstat.MLcs.CCcs.CRcs.DB
On Valency
published · living versionsW_gqr7y4r5·v1 · currentpublished
Scalable Fair Clustering
with Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber +1
1 version
Preprints & journals
35 papers in the corpus · 2014–2026Random Fourier Features in Near-Linear Time2610.14751v1 · Sepideh Mahabadi, Sandeep Silwal, Tal Wagner2026 · 0 citationsarXiv
Locality Sensitive Hashing for p-Exponential Kernels with Applications to Density Estimation2610.05174v1 · Barak Gorodissky, Tal Wagner2026 · 0 citationsarXiv
Learning Query Encoders Can Be Hard Even When Vector Retrieval Is Geometrically Easy2610.02749v1 · Anders Wikum, Nina Mishra, Amin Saberi et al.2026 · 0 citationsarXiv
QASP: Query-Adaptive Robust Vector Search Policy2607.29606v3 · Hakan Ferhatosmanoglu, Kushal Kumar, Tal Wagner et al.2026 · 0 citationsICDE 2027
Frustratingly Simple Black-Box Adaptation of Language Models via Logit Bias2607.22837v1 · Ofek I. Cohen, Lior Shani, Aviv Rosenberg et al.2026 · 0 citationsarXiv
Positional LSH: Binary Block Matrix Approximation for Attention with Linear Biases2605.09472v1 · Daniel Wolfson, Tal Wagner2026 · 0 citationsarXiv
New Bounds for Kernel Sums via Fast Spherical Embeddings2605.01263v1 · Tal Wagner2026 · 0 citationsarXiv
Quantization for Vector Search under Streaming Updates2512.18335v1 · Ishaq Aden-Ali, Hakan Ferhatosmanoglu, Alexander Greaves-Tunnell et al.2025 · 0 citationsarXiv
Graph-based Nearest Neighbors with Dynamic Updates via Random Walks2512.18060v1 · Nina Mishra, Yonatan Naamad, Tal Wagner et al.2025 · 0 citationsarXiv
SpEx: A Spectral Approach to Explainable Clustering2511.00885v1 · Tal Argov, Tal Wagner2025 · 0 citationsarXiv
Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions2507.23539v1 · Piotr Indyk, Michael Kapralov, Kshiteej Sheth et al.2025 · 0 citationsarXiv
Learning from End User Data with Shuffled Differential Privacy over Kernel Densities2502.14087v1 · Tal Wagner2025 · 0 citationsarXiv
Private Text Generation by Seeding Large Language Model Prompts2502.13193v1 · Supriya Nagesh, Justin Y. Chen, Nina Mishra et al.2025 · 0 citationsarXiv
Fast Private Kernel Density Estimation via Locality Sensitive Quantization2307.01877v1 · Tal Wagner, Yonatan Naamad, Nina Mishra2023 · 0 citationsarXiv
Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees2304.07652v1 · Nicholas Schiefer, Justin Y. Chen, Piotr Indyk et al.2023 · 1 citationarXiv
Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks2211.03232v2 · Anders Aamand, Justin Y. Chen, Piotr Indyk et al.2022 · 5 citationsarXiv
Budget-Constrained Bounds for Mini-Batch Estimation of Optimal Transport2210.13630v1 · David Alvarez-Melis, Nicolo Fusi, Lester Mackey et al.2022 · 1 citationarXiv
Streaming Algorithms for Support-Aware Histograms2207.08686v1 · Justin Y. Chen, Piotr Indyk, Tal Wagner2022 · 0 citationsarXiv
Generalization Bounds for Data-Driven Numerical Linear Algebra2206.07886v1 · Peter Bartlett, Piotr Indyk, Tal Wagner2022 · 2 citationsarXiv
Unveiling Transformers with LEGO: a synthetic reasoning task2206.04301v3 · Yi Zhang, Arturs Backurs, S'ebastien Bubeck et al.2022 · 4 citationsarXiv
Triangle and Four Cycle Counting with Predictions in Graph Streams2203.09572v1 · Justin Y. Chen, Talya Eden, Piotr Indyk et al.2022 · 4 citationsarXiv
Optimal (Euclidean) Metric Compression2110.03152v1 · Piotr Indyk, Tal Wagner2021 · 4 citationsarXiv
Learning-based Support Estimation in Sublinear Time2106.08396v1 · Talya Eden, Piotr Indyk, Shyam Narayanan et al.2021 · 11 citationsarXiv
Faster Kernel Matrix Algebra via Density Estimation2102.08341v2 · Arturs Backurs, Piotr Indyk, Cameron Musco et al.2021 · 0 citationsarXiv
Scalable Nearest Neighbor Search for Optimal Transport1910.04126v4 · Arturs Backurs, Yihe Dong, Piotr Indyk et al.2019 · 21 citationsarXiv
Sample-Optimal Low-Rank Approximation of Distance Matrices1906.00339v1 · Piotr Indyk, Ali Vakilian, Tal Wagner et al.2019 · 19 citationsarXiv
Scalable Fair Clustering1902.03519v2 · Arturs Backurs, Piotr Indyk, Krzysztof Onak et al.2019 · 101 citationsarXivon Valency
Learning Space Partitions for Nearest Neighbor Search1901.08544v4 · Yihe Dong, Piotr Indyk, Ilya Razenshteyn et al.2019 · 35 citationsarXiv
Multitasking Capacity: Hardness Results and Improved Constructions1809.02835v1 · Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths et al.2018 · 5 citationsarXiv
Approximate Nearest Neighbors in Limited Space1807.00112v1 · Piotr Indyk, Tal Wagner2018 · 7 citationsarXiv
Practical Data-Dependent Metric Compression with Provable Guarantees1711.01520v1 · Piotr Indyk, Ilya Razenshteyn, Tal Wagner2017 · 2 citationsarXiv
A Graph-Theoretic Approach to Multitasking1611.02400v2 · Noga Alon, Jonathan D. Cohen, Biswadip Dey et al.2016 · 10 citationsarXiv
Near-Optimal (Euclidean) Metric Compression1609.06295v3 · Piotr Indyk, Tal Wagner2016 · 9 citationsarXiv
Towards Resistance Sparsifiers1506.07568v1 · Michael Dinitz, Robert Krauthgamer, Tal Wagner2015 · 2 citationsarXiv
Cheeger-type approximation for sparsest -cut1410.3889v2 · Robert Krauthgamer, Tal Wagner2014 · 2 citationsarXiv
Career total: 49 works. 35 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.