An Improved Analysis of the ER-SpUD Dictionary Learning Algorithm. - Jaroslaw Blasiok; Jelani Nelson (ICALP, 2016)

ADAGIO: Fast Data-Aware Near-Isometric Linear Embeddings. - Jaroslaw Blasiok; Charalampos E. Tsourakakis (ICDM, 2016)

Continuous Monitoring of l_p Norms in Data Streams. - Jaroslaw Blasiok; Jian Ding; Jelani Nelson (APPROX-RANDOM, 2017)

Streaming symmetric norms via measure concentration. - Jaroslaw Blasiok; Vladimir Braverman; Stephen R. Chestnut; Robert Krauthgamer; Lin F. Yang (STOC, 2017)

Chain Minors are FPT. - Jaroslaw Blasiok; Marcin Jakub Kaminski (Algorithmica, 2017)

Continuous monitoring of 𝓁p norms in data streams. - Jian Ding; Jaroslaw Blasiok; Jelani Nelson (CoRR, 2017)

Predicting Positive and Negative Links with Noisy Queries: Theory & Practice. - Charalampos E. Tsourakakis; Michael Mitzenmacher; Jaroslaw Blasiok; Ben Lawson; Preetum Nakkiran; Vasileios Nakos (CoRR, 2017)

Polar Codes with Exponentially Small Error at Finite Block Length. - Jaroslaw Blasiok; Venkatesan Guruswami; Madhu Sudan 001 (APPROX-RANDOM, 2018)

The Generic Holdout: Preventing False-Discoveries in Adaptive Data Science. - Preetum Nakkiran; Jaroslaw Blasiok (CoRR, 2018)

General Strong Polarization. - Jaroslaw Blasiok; Venkatesan Guruswami; Preetum Nakkiran; Atri Rudra; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2018)

An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices. - Jaroslaw Blasiok; Patrick Lopatto; Kyle Luh; Jake Marcinek; Shravas Rao (FOCS, 2019)

Towards Instance-Optimal Private Query Release. - Jaroslaw Blasiok; Mark Bun; Aleksandar Nikolov; Thomas Steinke 002 (SODA, 2019)

Sparse Reconstruction from Hadamard Matrices: A Lower Bound. - Jaroslaw Blasiok; Patrick Lopatto; Kyle Luh; Jake Marcinek (CoRR, 2019)

Induced minors and well-quasi-ordering. - Jaroslaw Blasiok; Marcin Kaminski 001; Jean-Florent Raymond; Théophile Trunck (J. Comb. Theory B, 2019)

Optimal Streaming and Tracking Distinct Elements with High Probability. - Jaroslaw Blasiok (ACM Trans. Algorithms, 2020)

Fourier growth of structured $ mathbb{F}_2$-polynomials and applications. - Jaroslaw Blasiok; Peter Ivanov; Yaonan Jin; Chin Ho Lee; Rocco A. Servedio; Emanuele Viola (CoRR, 2021)

Fourier growth of structured 𝔽2-polynomials and applications. - Jaroslaw Blasiok; Peter Ivanov; Yaonan Jin; Chin Ho Lee; Rocco A. Servedio; Emanuele Viola (Electron. Colloquium Comput. Complex., 2021)

What You See is What You Get: Principled Deep Learning via Distributional Generalization. - Bogdan Kulynych; Yao-Yuan Yang; Yaodong Yu; Jaroslaw Blasiok; Preetum Nakkiran (NeurIPS, 2022)

What You See is What You Get: Distributional Generalization for Algorithm Design in Deep Learning. - Bogdan Kulynych; Yao-Yuan Yang; Yaodong Yu; Jaroslaw Blasiok; Preetum Nakkiran (CoRR, 2022)

Matrix Multiplication and Number on the Forehead Communication. - Josh Alman; Jaroslaw Blasiok (CCC, 2023)

Communication Complexity of Inner Product in Symmetric Normed Spaces. - Alexandr Andoni; Jaroslaw Blasiok; Arnold Filtser (ITCS, 2023)

When Does Optimizing a Proper Loss Yield Calibration? - Jaroslaw Blasiok; Parikshit Gopalan; Lunjia Hu; Preetum Nakkiran (NeurIPS, 2023)

A Unifying Theory of Distance from Calibration. - Jaroslaw Blasiok; Parikshit Gopalan; Lunjia Hu; Preetum Nakkiran (STOC, 2023)

Semirandom Planted Clique and the Restricted Isometry Property. - Jaroslaw Blasiok; Rares-Darius Buhai; Pravesh K. Kothari; David Steurer (FOCS, 2024)

Smooth ECE: Principled Reliability Diagrams via Kernel Smoothing. - Jaroslaw Blasiok; Preetum Nakkiran (ICLR, 2024)

Loss Minimization Yields Multicalibration for Large Neural Networks. - Jaroslaw Blasiok; Parikshit Gopalan; Lunjia Hu; Adam Tauman Kalai; Preetum Nakkiran (ITCS, 2024)

Hardness of Clique Approximation for Monotone Circuits. - Jaroslaw Blasiok; Linus Meierhöfer (CCC, 2025)

Efficient and Provable Algorithms for Covariate Shift. - Deeksha Adil; Jaroslaw Blasiok (CoRR, 2025)