Arturs Backurs
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
28
Venues
11
Active years
2012–2025
Best venue rank
A*
Where they publish
Papers
28 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | COLT | DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy Theory. | Jerry Chee, Arturs Backurs, Rainie Heck, Li Zhang, Janardhan Kulkarni, Thomas Rothvoss, Sivakanth Gopi |
| 2024 | ICLR | Efficiently Computing Similarities to Private Datasets. | Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski |
| 2024 | ICLR | Privately Aligning Language Models with Reinforcement Learning. | Fan Wu, Huseyin A. Inan, Arturs Backurs, Varun Chandrasekaran, Janardhan Kulkarni, Robert Sim |
| 2024 | ICML | Differentially Private Synthetic Data via Foundation Model APIs 2: Text. | Chulin Xie, Zinan Lin, Arturs Backurs, Sivakanth Gopi, Da Yu, Huseyin A. Inan, Harsha Nori, Haotian Jiang, Huishuai Zhang, Yin Tat Lee, Bo Li, Sergey Yekhanin |
| 2023 | ICLR | Exploring the Limits of Differentially Private Deep Learning with Group-wise Clipping. | Jiyan He, Xuechen Li, Da Yu, Huishuai Zhang, Janardhan Kulkarni, Yin Tat Lee, Arturs Backurs, Nenghai Yu, Jiang Bian |
| 2022 | ICLR | Differentially Private Fine-tuning of Language Models. | Da Yu, Saurabh Naik, Arturs Backurs, Sivakanth Gopi, Huseyin A. Inan, Gautam Kamath, Janardhan Kulkarni, Yin Tat Lee, Andre Manoel, Lukas Wutschitz, Sergey Yekhanin, Huishuai Zhang |
| 2021 | EMNLP | Data-to-text Generation by Splicing Together Nearest Neighbors. | Sam Wiseman, Arturs Backurs, Karl Stratos |
| 2021 | ICML | Faster Kernel Matrix Algebra via Density Estimation. | Arturs Backurs, Piotr Indyk, Cameron Musco, Tal Wagner |
| 2020 | COLT | Active Local Learning. | Arturs Backurs, Avrim Blum, Neha Gupta |
| 2020 | ICML | Scalable Nearest Neighbor Search for Optimal Transport. | Arturs Backurs, Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner |
| 2019 | ICML | Scalable Fair Clustering. | Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner |
| 2019 | SODA | Fast Modular Subset Sum using Linear Sketching. | Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu |
| 2018 | FOCS | Efficient Density Evaluation for Smooth Kernels. | Arturs Backurs, Moses Charikar, Piotr Indyk, Paris Siminelakis |
| 2018 | STOC | Towards tight approximation bounds for graph diameter and eccentricities. | Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein |
| 2017 | FOCS | Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve. | Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Knnemann |
| 2017 | ICML | Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms. | Arturs Backurs, Christos Tzamos |
| 2017 | SODA | Better Approximations for Tree Sparsity in Nearly-Linear Time. | Arturs Backurs, Piotr Indyk, Ludwig Schmidt |
| 2016 | FOCS | Which Regular Expression Patterns Are Hard to Match? | Arturs Backurs, Piotr Indyk |
| 2016 | ICALP | Tight Hardness Results for Maximum Weight Rectangles. | Arturs Backurs, Nishanth Dikkala, Christos Tzamos |
| 2016 | PODS | Fast Algorithms for Parsing Sequences of Parentheses with Few Errors. | Arturs Backurs, Krzysztof Onak |
| 2016 | SODA | Subtree Isomorphism Revisited. | Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir |
| 2016 | SODA | Nearly-optimal bounds for sparse recovery in generic norms, with applications to | Arturs Backurs, Piotr Indyk, Ilya P. Razenshteyn, David P. Woodruff |
| 2015 | FOCS | Tight Hardness Results for LCS and Other Sequence Similarity Measures. | Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams |
| 2015 | FOCS | If the Current Clique Algorithms are Optimal, So is Valiant's Parser. | Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams |
| 2015 | STOC | Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false). | Arturs Backurs, Piotr Indyk |
| 2013 | STACS | Optimal quantum query bounds for almost all Boolean functions. | Andris Ambainis, Arturs Backurs, Juris Smotrovs, Ronald de Wolf |
| 2013 | SOFSEM | Worst Case Analysis of Non-local Games. | Andris Ambainis, Arturs Backurs, Kaspars Balodis, Agnis Skuskovniks, Juris Smotrovs, Madars Virza |
| 2012 | ICALP | Quantum Strategies Are Better Than Classical in Almost Any XOR Game. | Andris Ambainis, Arturs Backurs, Kaspars Balodis, Dmitrijs Kravcenko, Raitis Ozols, Juris Smotrovs, Madars Virza |