Jaroslaw Blasiok

Orcid: 0000-0002-4372-9745

According to our database1, Jaroslaw Blasiok authored at least 25 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Loss Minimization Yields Multicalibration for Large Neural Networks.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Smooth ECE: Principled Reliability Diagrams via Kernel Smoothing.
CoRR, 2023

A Unifying Theory of Distance from Calibration.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

When Does Optimizing a Proper Loss Yield Calibration?
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Communication Complexity of Inner Product in Symmetric Normed Spaces.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Matrix Multiplication and Number on the Forehead Communication.
Proceedings of the 38th Computational Complexity Conference, 2023

2022
General Strong Polarization.
J. ACM, 2022

What You See is What You Get: Distributional Generalization for Algorithm Design in Deep Learning.
CoRR, 2022

What You See is What You Get: Principled Deep Learning via Distributional Generalization.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Fourier growth of structured 𝔽<sub>2</sub>-polynomials and applications.
Electron. Colloquium Comput. Complex., 2021

Fourier growth of structured $\mathbb{F}_2$-polynomials and applications.
CoRR, 2021

2020
Optimal Streaming and Tracking Distinct Elements with High Probability.
ACM Trans. Algorithms, 2020

2019
Sparse Reconstruction from Hadamard Matrices: A Lower Bound.
CoRR, 2019

Towards Instance-Optimal Private Query Release.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018
The Generic Holdout: Preventing False-Discoveries in Adaptive Data Science.
CoRR, 2018

Polar Codes with Exponentially Small Error at Finite Block Length.
Proceedings of the Approximation, 2018

2017
Predicting Positive and Negative Links with Noisy Queries: Theory & Practice.
CoRR, 2017

Continuous monitoring of 𝓁<sub>p</sub> norms in data streams.
CoRR, 2017

Chain Minors are FPT.
Algorithmica, 2017

Streaming symmetric norms via measure concentration.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Continuous Monitoring of l_p Norms in Data Streams.
Proceedings of the Approximation, 2017

2016
ADAGIO: Fast Data-Aware Near-Isometric Linear Embeddings.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

An Improved Analysis of the ER-SpUD Dictionary Learning Algorithm.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Induced minors and well-quasi-ordering.
Electron. Notes Discret. Math., 2015


  Loading...