default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Hazla
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Jan Hazla, Yan Jin, Elchanan Mossel, Govind Ramnarayan:
A Geometric Model of Opinion Polarization. Math. Oper. Res. 49(1): 251-277 (2024)- [c8]Donald Kougang-Yombi, Jan Hazla:
A Quantitative Version of More Capable Channel Comparison. ISIT 2024: 3392-3397 - [i12]Donald Kougang-Yombi, Jan Hazla:
A Quantitative Version of More Capable Channel Comparison. CoRR abs/2401.14214 (2024) - [i11]Abdou Majeed Alidou, Júlia Baligács, Max Hahn-Klimroth, Jan Hazla, Lukas Hintze, Olga Scheftelowitsch:
Inevitability of Polarization in Geometric Opinion Exchange. CoRR abs/2402.08446 (2024) - 2023
- [c7]Jan Hazla:
Optimal List Decoding from Noisy Entropy Inequality. ISIT 2023: 15-18 - 2022
- [c6]Ido Nachum, Jan Hazla, Michael Gastpar, Anatoly Khina:
A Johnson-Lindenstrauss Framework for Randomly Initialized CNNs. ICLR 2022 - [c5]Emmanuel Abbe, Elisabetta Cornacchia, Jan Hazla, Christopher Marquis:
An Initial Alignment between Neural Network and Target is Needed for Gradient Descent to Learn. ICML 2022: 33-52 - [i10]Emmanuel Abbe, Elisabetta Cornacchia, Jan Hazla, Christopher Marquis:
An initial alignment between neural network and target is needed for gradient descent to learn. CoRR abs/2202.12846 (2022) - [i9]Jan Hazla:
Optimal list decoding from noisy entropy inequality. CoRR abs/2212.01443 (2022) - 2021
- [j3]Jan Hazla, Ali Jadbabaie, Elchanan Mossel, M. Amin Rahimian
:
Bayesian Decision Making in Groups is Hard. Oper. Res. 69(2): 632-654 (2021) - [j2]Emmanuel Abbe, Jan Hazla, Ido Nachum:
Almost-Reed-Muller Codes Achieve Constant Rates for Random Errors. IEEE Trans. Inf. Theory 67(12): 8034-8050 (2021) - [c4]Jan Hazla, Alex Samorodnitsky, Ori Sberlo:
On codes decoding a constant fraction of errors on the BSC. STOC 2021: 1479-1488 - [i8]Elisabetta Cornacchia, Jan Hazla, Ido Nachum, Amir Yehudayoff:
Regularization by Misclassification in ReLU Neural Networks. CoRR abs/2111.02154 (2021) - [i7]Ido Nachum, Jan Hazla, Michael Gastpar, Anatoly Khina:
A Johnson-Lindenstrauss Framework for Randomly Initialized CNNs. CoRR abs/2111.02155 (2021) - 2020
- [j1]Jan Hazla:
On Arithmetic Progressions in Symmetric Sets in Finite Field Model. Electron. J. Comb. 27(3): 3 (2020) - [i6]Emmanuel Abbe, Jan Hazla, Ido Nachum:
Almost-Reed-Muller Codes Achieve Constant Rates for Random Errors. CoRR abs/2004.09590 (2020)
2010 – 2019
- 2019
- [c3]Jan Hazla, Ali Jadbabaie, Elchanan Mossel, M. Amin Rahimian:
Reasoning in Bayesian Opinion Exchange Networks Is PSPACE-Hard. COLT 2019: 1614-1648 - [i5]Jan Hazla, Yan Jin, Elchanan Mossel, Govind Ramnarayan:
A Geometric Model of Opinion Polarization. CoRR abs/1910.05274 (2019) - 2018
- [i4]Jan Hazla, Ali Jadbabaie, Elchanan Mossel, M. Amin Rahimian:
Reasoning in Bayesian Opinion Exchange Networks Is PSPACE-Hard. CoRR abs/1809.01077 (2018) - 2016
- [c2]Jan Hazla, Thomas Holenstein, Elchanan Mossel:
Lower Bounds on Same-Set Inner Product in Correlated Spaces. APPROX-RANDOM 2016: 34:1-34:11 - [i3]Jan Hazla, Thomas Holenstein, Anup Rao:
Forbidden Subgraph Bounds for Parallel Repetition and the Density Hales-Jewett Theorem. CoRR abs/1604.05757 (2016) - 2015
- [c1]Jan Hazla, Thomas Holenstein:
Upper Tail Estimates with Combinatorial Proofs. STACS 2015: 392-405 - [i2]Jan Hazla, Thomas Holenstein, Elchanan Mossel:
Lower Bounds on Same-Set Inner Product in Correlated Spaces. CoRR abs/1509.06191 (2015) - 2014
- [i1]Jan Hazla, Thomas Holenstein:
Upper Tail Estimates with Combinatorial Proofs. CoRR abs/1405.2349 (2014)
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-10-12 23:00 CEST 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:
