default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMilad Sefidgaran
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Milad Sefidgaran
, Abdellatif Zaidi:
Data-Dependent Generalization Bounds via Variable-Size Compressibility. IEEE Trans. Inf. Theory 70(9): 6572-6595 (2024)- [c16]Milad Sefidgaran, Romain Chor, Abdellatif Zaidi, Yijun Wan:
Lessons from Generalization Error Analysis of Federated Learning: You May Communicate Less Often! ICML 2024 - [c15]Milad Sefidgaran, Abdellatif Zaidi, Piotr Krasnowski:
Minimal Communication-Cost Statistical Learning. ISIT 2024: 777-782 - [c14]Milad Sefidgaran, Abdellatif Zaidi:
Data-Dependent Generalization Bounds via Variable-Size Compressibility. ISIT 2024: 2682-2687 - [i13]Milad Sefidgaran, Abdellatif Zaidi, Piotr Krasnowski:
Minimum Description Length and Generalization Guarantees for Representation Learning. CoRR abs/2402.03254 (2024) - [i12]Milad Sefidgaran, Abdellatif Zaidi, Piotr Krasnowski:
Minimal Communication-Cost Statistical Learning. CoRR abs/2406.08193 (2024) - 2023
- [c13]Romain Chor, Milad Sefidgaran, Abdellatif Zaidi:
More Communication Does Not Result in Smaller Generalization Error in Federated Learning. ISIT 2023: 48-53 - [c12]Milad Sefidgaran, Abdellatif Zaidi, Piotr Krasnowski:
Minimum Description Length and Generalization Guarantees for Representation Learning. NeurIPS 2023 - [i11]Milad Sefidgaran, Abdellatif Zaidi:
Data-dependent Generalization Bounds via Variable-Size Compressibility. CoRR abs/2303.05369 (2023) - [i10]Romain Chor, Milad Sefidgaran, Abdellatif Zaidi:
More Communication Does Not Result in Smaller Generalization Error in Federated Learning. CoRR abs/2304.12216 (2023) - [i9]Milad Sefidgaran, Romain Chor, Abdellatif Zaidi, Yijun Wan:
Federated Learning You May Communicate Less Often! CoRR abs/2306.05862 (2023) - 2022
- [j2]Milad Sefidgaran, Mansoor I. Yousefi:
Lower Bound on the Capacity of the Continuous-Space SSFM Model of Optical Fiber. IEEE Trans. Inf. Theory 68(4): 2460-2478 (2022) - [c11]Milad Sefidgaran, Amin Gohari, Gaël Richard, Umut Simsekli:
Rate-Distortion Theoretic Generalization Bounds for Stochastic Learning Algorithms. COLT 2022: 4416-4463 - [c10]Milad Sefidgaran, Romain Chor, Abdellatif Zaidi:
Rate-Distortion Theoretic Bounds on Generalization Error for Distributed Learning. NeurIPS 2022 - [i8]Milad Sefidgaran, Amin Gohari, Gaël Richard, Umut Simsekli:
Rate-Distortion Theoretic Generalization Bounds for Stochastic Learning Algorithms. CoRR abs/2203.02474 (2022) - [i7]Milad Sefidgaran, Romain Chor, Abdellatif Zaidi:
Rate-Distortion Theoretic Bounds on Generalization Error for Distributed Learning. CoRR abs/2206.02604 (2022) - 2021
- [c9]Melih Barsbey, Milad Sefidgaran, Murat A. Erdogdu, Gaël Richard, Umut Simsekli:
Heavy Tails in SGD and Compressibility of Overparametrized Neural Networks. NeurIPS 2021: 29364-29378 - [i6]Milad Sefidgaran, Aslan Tchamkerten:
Zero-Error Sum Modulo Two with a Common Observation. CoRR abs/2102.00697 (2021) - [i5]Melih Barsbey, Milad Sefidgaran, Murat A. Erdogdu, Gaël Richard, Umut Simsekli:
Heavy Tails in SGD and Compressibility of Overparametrized Neural Networks. CoRR abs/2106.03795 (2021) - 2020
- [c8]Milad Sefidgaran, Aslan Tchamkerten:
Zero-Error Sum Modulo Two with a Common Observation. ITW 2020: 1-5 - [c7]Milad Sefidgaran, Mansoor I. Yousefi:
On the Capacity of the Continuous-Space SSFM Model of Optical Fiber. ITW 2020: 1-5 - [i4]Milad Sefidgaran, Mansoor I. Yousefi:
Lower Bound on the Capacity of the Continuous-Space SSFM Model of Optical Fiber. CoRR abs/2011.11341 (2020)
2010 – 2019
- 2016
- [j1]Milad Sefidgaran, Aslan Tchamkerten:
Distributed Function Computation Over a Rooted Directed Tree. IEEE Trans. Inf. Theory 62(12): 7135-7152 (2016) - 2015
- [c6]Milad Sefidgaran, Amin Gohari, Mohammad Reza Aref:
On Körner-Marton's sum modulo two problem. IWCIT 2015: 1-6 - 2013
- [c5]Milad Sefidgaran, Aslan Tchamkerten:
Distributed function computation over a tree network. ITW 2013: 1-5 - [i3]Milad Sefidgaran, Aslan Tchamkerten:
On Cooperation in Multi-Terminal Computation and Rate Distortion. CoRR abs/1303.0817 (2013) - [i2]Milad Sefidgaran, Aslan Tchamkerten:
Distributed Function Computation Over a Rooted Directed Tree. CoRR abs/1312.3631 (2013) - 2012
- [c4]Milad Sefidgaran, Aslan Tchamkerten:
On cooperation in multi-terminal computation and rate distortion. ISIT 2012: 766-770 - [c3]Milad Sefidgaran, Aslan Tchamkerten:
On function computation over a cascade network. ITW 2012: 472-476 - 2011
- [c2]Milad Sefidgaran, Aslan Tchamkerten:
Computing a function of correlated Sources: A rate region. ISIT 2011: 1856-1860 - [i1]Milad Sefidgaran, Aslan Tchamkerten:
Computing a Function of Correlated Sources. CoRR abs/1107.5806 (2011)
2000 – 2009
- 2009
- [c1]Milad Sefidgaran, Bahareh Akhbari, Yalda Mohsenzadeh, Mohammad Reza Aref:
Reliable source transmission over relay networks with Side Information. ISIT 2009: 699-703
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:57 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:
