Arturs Backurs

Publication Activity (10 Years)

Years Active: 2011-2023
Publications (10 Years): 57

Top Venues

CoRR

FOCS

SODA

ICML

Massachusetts Institute of Technology, Cambridge, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, USA

PHD

Publications

Fan Wu, Huseyin A. Inan, Arturs Backurs, Varun Chandrasekaran, Janardhan Kulkarni, Robert Sim
Privately Aligning Language Models with Reinforcement Learning. CoRR (2023)
Jiyan He, Xuechen Li, Da Yu, Huishuai Zhang, Janardhan Kulkarni, Yin Tat Lee, Arturs Backurs, Nenghai Yu, Jiang Bian
Exploring the Limits of Differentially Private Deep Learning with Group-wise Clipping. ICLR (2023)
Yi Zhang, Arturs Backurs, Sébastien Bubeck, Ronen Eldan, Suriya Gunasekar, Tal Wagner
Unveiling Transformers with LEGO: a synthetic reasoning task. CoRR (2022)
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
Differentially Private Fine-tuning of Language Models. ICLR (2022)
Jiyan He, Xuechen Li, Da Yu, Huishuai Zhang, Janardhan Kulkarni, Yin Tat Lee, Arturs Backurs, Nenghai Yu, Jiang Bian
Exploring the Limits of Differentially Private Deep Learning with Group-wise Clipping. CoRR (2022)
Fatemehsadat Mireshghallah, Arturs Backurs, Huseyin A. Inan, Lukas Wutschitz, Janardhan Kulkarni
Differentially Private Model Compression. CoRR (2022)
Fatemehsadat Mireshghallah, Arturs Backurs, Huseyin A. Inan, Lukas Wutschitz, Janardhan Kulkarni
Differentially Private Model Compression. NeurIPS (2022)
Arturs Backurs, Piotr Indyk, Cameron Musco, Tal Wagner
Faster Kernel Matrix Algebra via Density Estimation. ICML (2021)
Arturs Backurs, Piotr Indyk, Cameron Musco, Tal Wagner
Faster Kernel Matrix Algebra via Density Estimation. CoRR (2021)
Arturs Backurs, Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev
Two-Sided Kirszbraun Theorem. SoCG (2021)
Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
Toward Tight Approximation Bounds for Graph Diameter and Eccentricities. SIAM J. Comput. 50 (4) (2021)
Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
Fast and Simple Modular Subset Sum. SOSA (2021)
Sam Wiseman, Arturs Backurs, Karl Stratos
Data-to-text Generation by Splicing Together Nearest Neighbors. EMNLP (1) (2021)
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
Differentially Private Fine-tuning of Language Models. CoRR (2021)
Sam Wiseman, Arturs Backurs, Karl Stratos
Generating (Formulaic) Text by Splicing Together Nearest Neighbors. CoRR (2021)
Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann
Impossibility Results for Grammar-Compressed Linear Algebra. NeurIPS (2020)
Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann
Impossibility Results for Grammar-Compressed Linear Algebra. CoRR (2020)
Arturs Backurs, Avrim Blum, Neha Gupta
Active Local Learning. CoRR (2020)
Arturs Backurs, Avrim Blum, Neha Gupta
Active Local Learning. COLT (2020)
Arturs Backurs, Sariel Har-Peled
Submodular Clustering in Low Dimensions. SWAT (2020)
Arturs Backurs, Sariel Har-Peled
Submodular Clustering in Low Dimensions. CoRR (2020)
Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
Fast and Simple Modular Subset Sum. CoRR (2020)
Arturs Backurs, Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
Scalable Nearest Neighbor Search for Optimal Transport. ICML (2020)
Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner
Scalable Fair Clustering. CoRR (2019)
Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner
Scalable Fair Clustering. ICML (2019)
Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu
Fast Modular Subset Sum using Linear Sketching. SODA (2019)
Arturs Backurs, Piotr Indyk, Tal Wagner
Space and Time Efficient Kernel Density Estimation in High Dimensions. NeurIPS (2019)
Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann
Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve. CoRR (2018)
Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
Towards tight approximation bounds for graph diameter and eccentricities. STOC (2018)
Arturs Backurs, Moses Charikar, Piotr Indyk, Paris Siminelakis
Efficient Density Evaluation for Smooth Kernels. FOCS (2018)
Arturs Backurs, Piotr Indyk
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False). SIAM J. Comput. 47 (3) (2018)
Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
Towards Tight Approximation Bounds for Graph Diameter and Eccentricities. CoRR (2018)
Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams
If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser. SIAM J. Comput. 47 (6) (2018)
Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir
Subtree Isomorphism Revisited. ACM Trans. Algorithms 14 (3) (2018)
Kyriakos Axiotis, Arturs Backurs, Christos Tzamos
Fast Modular Subset Sum using Linear Sketching. CoRR (2018)
Arturs Backurs, Piotr Indyk, Ludwig Schmidt
On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks. CoRR (2017)
Arturs Backurs, Piotr Indyk, Ludwig Schmidt
On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks. NIPS (2017)
Arturs Backurs, Christos Tzamos
Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms. ICML (2017)
Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann
Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve. FOCS (2017)
Arturs Backurs, Piotr Indyk, Ludwig Schmidt
Better Approximations for Tree Sparsity in Nearly-Linear Time. SODA (2017)
Amir Abboud, Arturs Backurs
Towards Hardness of Approximation for Polynomial Time Problems. ITCS (2017)
Arturs Backurs, Nishanth Dikkala, Christos Tzamos
Tight Hardness Results for Maximum Weight Rectangles. CoRR (2016)
Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir
Subtree Isomorphism Revisited. SODA (2016)
Arturs Backurs, Krzysztof Onak
Fast Algorithms for Parsing Sequences of Parentheses with Few Errors. PODS (2016)
Arturs Backurs, Piotr Indyk
Which Regular Expression Patterns Are Hard to Match? FOCS (2016)
Arturs Backurs, Piotr Indyk, Ilya P. Razenshteyn, David P. Woodruff
-median sketching. SODA (2016)
Arturs Backurs, Nishanth Dikkala, Christos Tzamos
Tight Hardness Results for Maximum Weight Rectangles. ICALP (2016)
Arturs Backurs, Christos Tzamos
Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms. CoRR (2016)
Arturs Backurs, Anastasios Sidiropoulos
Constant-Distortion Embeddings of Hausdorff Metrics into Constant-Dimensional l_p Spaces. APPROX-RANDOM (2016)
Arturs Backurs, Piotr Indyk
Which Regular Expression Patterns are Hard to Match? CoRR (2015)
Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir
Subtree Isomorphism Revisited. CoRR (2015)
Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams
If the Current Clique Algorithms are Optimal, so is Valiant's Parser. CoRR (2015)
Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams
Tight Hardness Results for LCS and Other Sequence Similarity Measures. FOCS (2015)
Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams
Quadratic-Time Hardness of LCS and other Sequence Similarity Measures. CoRR (2015)
Arturs Backurs, Piotr Indyk, Eric Price, Ilya P. Razenshteyn, David P. Woodruff
Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching. CoRR (2015)
Arturs Backurs, Piotr Indyk
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false). STOC (2015)
Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams
If the Current Clique Algorithms are Optimal, So is Valiant's Parser. FOCS (2015)
Arturs Backurs, Piotr Indyk
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false). CoRR (2014)
Arturs Backurs, Piotr Indyk
Better embeddings for planar Earth-Mover Distance over sparse sets. SoCG (2014)
Arturs Backurs, Mohammad Bavarian
On the Sum of L1 Influences. Computational Complexity Conference (2014)
Arturs Backurs, Mohammad Bavarian
On the sum of $L1$ influences CoRR (2013)
Arturs Backurs, Mohammad Bavarian
On the sum of L1 influences. Electron. Colloquium Comput. Complex. 20 (2013)
Andris Ambainis, Arturs Backurs, Juris Smotrovs, Ronald de Wolf
Optimal quantum query bounds for almost all Boolean functions. STACS (2013)
Andris Ambainis, Arturs Backurs, Kaspars Balodis, Agnis Skuskovniks, Juris Smotrovs, Madars Virza
Worst Case Analysis of Non-local Games. SOFSEM (2013)
Andris Ambainis, Arturs Backurs, Kaspars Balodis, Dmitrijs Kravcenko, Raitis Ozols, Juris Smotrovs, Madars Virza
Quantum Strategies Are Better Than Classical in Almost Any XOR Game. ICALP (1) (2012)
Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs, Raitis Ozols, Alexander Rivosh
Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification. TQC (2012)
Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs, Alexander Rivosh
Grover's Algorithm with Errors. MEMICS (2012)
Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs, Raitis Ozols, Alexander Rivosh
Search by quantum walks on two-dimensional grid without amplitude amplification CoRR (2011)
Andris Ambainis, Arturs Backurs, Kaspars Balodis, Dmitry Kravchenko, Raitis Ozols, Juris Smotrovs, Madars Virza
Quantum strategies are better than classical in almost any XOR game CoRR (2011)

Arturs Backurs.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Arturs Backurs