AB
Arturs Backurs
cs.DScs.LGcs.CCcs.CLcs.CRquant-phstat.MLcs.AIcs.CGcs.GT
On Valency
published · living versionsW_gqr7y4r5·v1 · currentpublished
Preprints & journals
34 papers in the corpus · 2011–2026Differentially Private Synthetic Data via APIs 4: Tabular Data2606.08259v1 · Toan Tran, Arturs Backurs, Zinan Lin et al.2026 · 0 citationsarXiv
Struct-Bench: A Benchmark for Differentially Private Structured Text Generation2509.10696v1 · Shuaiqi Wang, Vikas Raunak, Arturs Backurs et al.2025 · 1 citationarXiv
DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy Theory2501.06417v1 · Jerry Chee, Arturs Backurs, Rainie Heck et al.2025 · 0 citationsarXiv
Efficiently Computing Similarities to Private Datasets2403.08917v1 · Arturs Backurs, Zinan Lin, Sepideh Mahabadi et al.2024 · 1 citationarXiv
Differentially Private Synthetic Data via Foundation Model APIs 2: Text2403.01749v2 · Chulin Xie, Zinan Lin, Arturs Backurs et al.2024 · 2 citationsarXiv
Privately Aligning Language Models with Reinforcement Learning2310.16960v2 · Fan Wu, Huseyin A. Inan, Arturs Backurs et al.2023 · 1 citationarXiv
Exploring the Limits of Differentially Private Deep Learning with Group-wise Clipping2212.01539v1 · Jiyan He, Xuechen Li, Da Yu et al.2022 · 6 citationsarXiv
Unveiling Transformers with LEGO: a synthetic reasoning task2206.04301v3 · Yi Zhang, Arturs Backurs, S'ebastien Bubeck et al.2022 · 4 citationsarXiv
Differentially Private Model Compression2206.01838v1 · Fatemehsadat Mireshghallah, Arturs Backurs, Huseyin A Inan et al.2022 · 5 citationsarXiv
Differentially Private Fine-tuning of Language Models2110.06500v2 · Da Yu, Saurabh Naik, Arturs Backurs et al.2021 · 101 citationsarXiv
Faster Kernel Matrix Algebra via Density Estimation2102.08341v2 · Arturs Backurs, Piotr Indyk, Cameron Musco et al.2021 · 0 citationsarXiv
Data-to-text Generation by Splicing Together Nearest Neighbors2101.08248v4 · Sam Wiseman, Arturs Backurs, Karl Stratos2021 · 9 citationsarXiv
Impossibility Results for Grammar-Compressed Linear Algebra2010.14181v1 · Amir Abboud, Arturs Backurs, Karl Bringmann et al.2020 · 3 citationsarXiv
Active Local Learning2008.13374v2 · Arturs Backurs, Avrim Blum, Neha Gupta2020 · 0 citationsarXiv
Fast and Simple Modular Subset Sum2008.10577v3 · Kyriakos Axiotis, Arturs Backurs, Karl Bringmann et al.2020 · 7 citationsarXiv
Submodular Clustering in Low Dimensions2004.05494v1 · Arturs Backurs, Sariel Har-Peled2020 · 0 citationsarXiv
Scalable Nearest Neighbor Search for Optimal Transport1910.04126v4 · Arturs Backurs, Yihe Dong, Piotr Indyk et al.2019 · 21 citationsarXiv
Scalable Fair Clustering1902.03519v2 · Arturs Backurs, Piotr Indyk, Krzysztof Onak et al.2019 · 101 citationsarXivon Valency
Towards Tight Approximation Bounds for Graph Diameter and Eccentricities1808.08494v2 · Arturs Backurs, Liam Roditty, Gilad Segal et al.2018 · 32 citationsarXiv
Fast Modular Subset Sum using Linear Sketching1807.04825v1 · Kyriakos Axiotis, Arturs Backurs, Christos Tzamos2018 · 10 citationsarXiv
Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve1803.00796v1 · Amir Abboud, Arturs Backurs, Karl Bringmann et al.2018 · 26 citationsarXiv
On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks1704.02958v1 · Arturs Backurs, Piotr Indyk, Ludwig Schmidt2017 · 17 citationsarXiv
Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms1607.04229v2 · Arturs Backurs, Christos Tzamos2016 · 11 citationsarXiv
Tight Hardness Results for Maximum Weight Rectangles1602.05837v2 · Arturs Backurs, Nishanth Dikkala, Christos Tzamos2016 · 22 citationsarXiv
Which Regular Expression Patterns are Hard to Match?1511.07070v2 · Arturs Backurs, Piotr Indyk2015 · 83 citationsarXiv
Subtree Isomorphism Revisited1510.04622v1 · Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen et al.2015 · 0 citationsarXiv
If the Current Clique Algorithms are Optimal, so is Valiant's Parser1504.01431v2 · Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams2015 · 70 citationsarXiv
Quadratic-Time Hardness of LCS and other Sequence Similarity Measures1501.07053v2 · Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams2015 · 22 citationsarXiv
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)1412.0348v4 · Arturs Backurs, Piotr Indyk2014 · 259 citationsarXiv
On the sum of influences1302.4625v4 · Artūrs Backurs, Mohammad Bavarian2013 · 6 citationsarXiv
Optimal quantum query bounds for almost all Boolean functions1208.1122v1 · Andris Ambainis (U of Latvia), Arturs Backurs (U of Latvia), Juris Smotrovs (U of Latvia) et al.2012 · 5 citationsarXiv
Quantum strategies are better than classical in almost any XOR game1112.3330v1 · Andris Ambainis, Arturs Backurs, Kaspars Balodis et al.2011 · 14 citationsarXiv
Search by quantum walks on two-dimensional grid without amplitude amplification1112.3337v1 · Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs et al.2011 · 41 citationsarXiv
Worst case analysis of non-local games1112.2856v1 · Andris Ambainis, Arturs Backurs, Kaspars Balodis et al.2011 · 3 citationsarXiv
Career total: 63 works. 34 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.