default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFredrik Hellström
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Fredrik Hellström, Benjamin Guedj:
Comparing Comparators in Generalization Bounds. AISTATS 2024: 73-81- [c7]Matteo Zecchin, Sangwoo Park, Osvaldo Simeone, Fredrik Hellström:
Generalization and Informativeness of Conformal Prediction. ISIT 2024: 244-249 - [i9]Matteo Zecchin, Sangwoo Park, Osvaldo Simeone, Fredrik Hellström:
Generalization and Informativeness of Conformal Prediction. CoRR abs/2401.11810 (2024) - 2023
- [c6]Rui M. Castro, Fredrik Hellström, Tim van Erven:
Adaptive Selective Sampling for Online Prediction with Experts. NeurIPS 2023 - [i8]Rui M. Castro, Fredrik Hellström, Tim van Erven:
Adaptive Selective Sampling for Online Prediction with Experts. CoRR abs/2302.08397 (2023) - [i7]Fredrik Hellström, Giuseppe Durisi, Benjamin Guedj, Maxim Raginsky:
Generalization Bounds: Perspectives from Information Theory and PAC-Bayes. CoRR abs/2309.04381 (2023) - [i6]Fredrik Hellström, Benjamin Guedj:
Comparing Comparators in Generalization Bounds. CoRR abs/2310.10534 (2023) - 2022
- [c5]Fredrik Hellström, Giuseppe Durisi:
A New Family of Generalization Bounds Using Samplewise Evaluated CMI. NeurIPS 2022 - [c4]Fredrik Hellström, Giuseppe Durisi:
Evaluated CMI Bounds for Meta Learning: Tightness and Expressiveness. NeurIPS 2022 - [i5]Fredrik Hellström, Giuseppe Durisi:
A New Family of Generalization Bounds Using Samplewise Evaluated CMI. CoRR abs/2210.06422 (2022) - [i4]Fredrik Hellström, Giuseppe Durisi:
Evaluated CMI Bounds for Meta Learning: Tightness and Expressiveness. CoRR abs/2210.06511 (2022) - 2021
- [j2]Fredrik Hellström
, Giuseppe Durisi:
Corrections to "Generalization Bounds via Information Density and Conditional Information Density". IEEE J. Sel. Areas Inf. Theory 2(3): 1072-1073 (2021) - [c3]Fredrik Hellström, Giuseppe Durisi:
Fast-Rate Loss Bounds via Conditional Information Measures with Applications to Neural Networks. ISIT 2021: 952-957 - 2020
- [j1]Fredrik Hellström, Giuseppe Durisi:
Generalization Bounds via Information Density and Conditional Information Density. IEEE J. Sel. Areas Inf. Theory 1(3): 824-839 (2020) - [c2]Fredrik Hellström, Giuseppe Durisi:
Generalization Error Bounds via mth Central Moments of the Information Density. ISIT 2020: 2741-2746 - [i3]Fredrik Hellström, Giuseppe Durisi:
Generalization Error Bounds via $m$th Central Moments of the Information Density. CoRR abs/2004.09148 (2020) - [i2]Fredrik Hellström, Giuseppe Durisi:
Generalization Bounds via Information Density and Conditional Information Density. CoRR abs/2005.08044 (2020) - [i1]Fredrik Hellström, Giuseppe Durisi:
Nonvacuous Loss Bounds with Fast Rates for Neural Networks via Conditional Information Measures. CoRR abs/2010.11552 (2020)
2010 – 2019
- 2015
- [c1]Anders Lundström, Fredrik Hellström:
Getting to know electric cars through an app. AutomotiveUI 2015: 289-296
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-13 17:59 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:
