default search action
Jaroslaw Blasiok
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c19]Jaroslaw Blasiok, Rares-Darius Buhai, Pravesh K. Kothari, David Steurer:
Semirandom Planted Clique and the Restricted Isometry Property. FOCS 2024: 959-969 - [c18]Jaroslaw Blasiok, Preetum Nakkiran:
Smooth ECE: Principled Reliability Diagrams via Kernel Smoothing. ICLR 2024 - [c17]Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Adam Tauman Kalai, Preetum Nakkiran:
Loss Minimization Yields Multicalibration for Large Neural Networks. ITCS 2024: 17:1-17:21 - [i23]Jaroslaw Blasiok, Rares-Darius Buhai, Pravesh K. Kothari, David Steurer:
Semirandom Planted Clique and the Restricted Isometry Property. CoRR abs/2404.14159 (2024) - 2023
- [c16]Josh Alman, Jaroslaw Blasiok
:
Matrix Multiplication and Number on the Forehead Communication. CCC 2023: 16:1-16:23 - [c15]Alexandr Andoni, Jaroslaw Blasiok
Communication Complexity of Inner Product in Symmetric Normed Spaces. ITCS 2023: 4:1-4:22 - [c14]Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Preetum Nakkiran:
When Does Optimizing a Proper Loss Yield Calibration? NeurIPS 2023 - [c13]Jaroslaw Blasiok
A Unifying Theory of Distance from Calibration. STOC 2023: 1727-1740 - [i22]Josh Alman, Jaroslaw Blasiok
Matrix Multiplication and Number On the Forehead Communication. CoRR abs/2302.11476 (2023) - [i21]Jaroslaw Blasiok
Loss minimization yields multicalibration for large neural networks. CoRR abs/2304.09424 (2023) - [i20]Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Preetum Nakkiran:
When Does Optimizing a Proper Loss Yield Calibration? CoRR abs/2305.18764 (2023) - [i19]Jaroslaw Blasiok
Smooth ECE: Principled Reliability Diagrams via Kernel Smoothing. CoRR abs/2309.12236 (2023) - 2022
- [j5]Jaroslaw Blasiok
General Strong Polarization. J. ACM 69(2): 11:1-11:67 (2022) - [c12]Bogdan Kulynych, Yao-Yuan Yang, Yaodong Yu, Jaroslaw Blasiok, Preetum Nakkiran:
What You See is What You Get: Principled Deep Learning via Distributional Generalization. NeurIPS 2022 - [i18]Bogdan Kulynych, Yao-Yuan Yang, Yaodong Yu, Jaroslaw Blasiok
What You See is What You Get: Distributional Generalization for Algorithm Design in Deep Learning. CoRR abs/2204.03230 (2022) - [i17]Alexandr Andoni, Jaroslaw Blasiok
Communication Complexity of Inner Product in Symmetric Normed Spaces. CoRR abs/2211.13473 (2022) - [i16]Jaroslaw Blasiok
A Unifying Theory of Distance from Calibration. CoRR abs/2211.16886 (2022) - 2021
- [c11]Jaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola:
Fourier Growth of Structured 𝔽2-Polynomials and Applications. APPROX-RANDOM 2021: 53:1-53:20 - [i15]Jaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola:
Fourier growth of structured $\mathbb{F}_2$-polynomials and applications. CoRR abs/2107.10797 (2021) - [i14]Jaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola:
Fourier growth of structured 𝔽2-polynomials and applications. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j4]Jaroslaw Blasiok
Optimal Streaming and Tracking Distinct Elements with High Probability. ACM Trans. Algorithms 16(1): 3:1-3:28 (2020)
2010 – 2019
- 2019
- [j3]Jaroslaw Blasiok
Induced minors and well-quasi-ordering. J. Comb. Theory B 134: 110-142 (2019) - [c10]Jaroslaw Blasiok
An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices. FOCS 2019: 1564-1567 - [c9]Jaroslaw Blasiok
Towards Instance-Optimal Private Query Release. SODA 2019: 2480-2497 - [i13]Jaroslaw Blasiok, Patrick Lopatto, Kyle Luh, Jake Marcinek:
Sparse Reconstruction from Hadamard Matrices: A Lower Bound. CoRR abs/1903.12135 (2019) - 2018
- [c8]Jaroslaw Blasiok, Venkatesan Guruswami, Madhu Sudan:
Polar Codes with Exponentially Small Error at Finite Block Length. APPROX-RANDOM 2018: 34:1-34:17 - [c7]Jaroslaw Blasiok
Optimal streaming and tracking distinct elements with high probability. SODA 2018: 2432-2448 - [c6]Jaroslaw Blasiok
General strong polarization. STOC 2018: 485-492 - [i12]Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan:
General Strong Polarization. CoRR abs/1802.02718 (2018) - [i11]Jaroslaw Blasiok:
Optimal streaming and tracking distinct elements with high probability. CoRR abs/1804.01642 (2018) - [i10]Preetum Nakkiran, Jaroslaw Blasiok:
The Generic Holdout: Preventing False-Discoveries in Adaptive Data Science. CoRR abs/1809.05596 (2018) - [i9]Jaroslaw Blasiok, Venkatesan Guruswami, Madhu Sudan:
Polar Codes with exponentially small error at finite block length. CoRR abs/1810.04298 (2018) - [i8]Jaroslaw Blasiok, Mark Bun, Aleksandar Nikolov, Thomas Steinke:
Towards Instance-Optimal Private Query Release. CoRR abs/1811.03763 (2018) - [i7]Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan:
General Strong Polarization. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j2]Jaroslaw Blasiok
Chain Minors are FPT. Algorithmica 79(3): 698-707 (2017) - [c5]Jaroslaw Blasiok, Jian Ding, Jelani Nelson:
Continuous Monitoring of l_p Norms in Data Streams. APPROX-RANDOM 2017: 32:1-32:13 - [c4]Jaroslaw Blasiok
Streaming symmetric norms via measure concentration. STOC 2017: 716-729 - [i6]Jian Ding, Jaroslaw Blasiok, Jelani Nelson:
Continuous monitoring of 𝓁p norms in data streams. CoRR abs/1704.06710 (2017) - [i5]Charalampos E. Tsourakakis, Michael Mitzenmacher, Jaroslaw Blasiok, Ben Lawson, Preetum Nakkiran, Vasileios Nakos:
Predicting Positive and Negative Links with Noisy Queries: Theory & Practice. CoRR abs/1709.07308 (2017) - 2016
- [c3]Jaroslaw Blasiok
An Improved Analysis of the ER-SpUD Dictionary Learning Algorithm. ICALP 2016: 44:1-44:14 - [c2]Jaroslaw Blasiok, Charalampos E. Tsourakakis
ADAGIO: Fast Data-Aware Near-Isometric Linear Embeddings. ICDM 2016: 31-40 - [i4]Jaroslaw Blasiok, Jelani Nelson:
An improved analysis of the ER-SpUD dictionary learning algorithm. CoRR abs/1602.05719 (2016) - [i3]Jaroslaw Blasiok, Charalampos E. Tsourakakis:
ADAGIO: Fast Data-aware Near-Isometric Linear Embeddings. CoRR abs/1609.05388 (2016) - 2015
- [j1]Jaroslaw Blasiok
Induced minors and well-quasi-ordering. Electron. Notes Discret. Math. 49: 197-201 (2015) - [i2]Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck:
Induced minors and well-quasi-ordering. CoRR abs/1510.07135 (2015) - 2013
- [c1]Jaroslaw Blasiok
Chain Minors Are FPT. IPEC 2013: 78-83 - [i1]Jaroslaw Blasiok, Marcin Kaminski:
Chain minors are FPT. CoRR abs/1304.5849 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: