default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSemih Yagli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Mert Al
, Semih Yagli, Sun-Yuan Kung:
Privacy Enhancing Machine Learning via Removal of Unwanted Dependencies. IEEE Trans. Neural Networks Learn. Syst. 34(6): 3019-3033 (2023)- 2021
- [b1]Semih Yagli:
Topics in Information and Estimation Theory: Parameter Estimation, Lossless Compression, Constrained Channels, and Error Exponents. Princeton University, USA, 2021 - 2020
- [j3]Alex Dytso, Semih Yagli, H. Vincent Poor, Shlomo Shamai Shitz:
The Capacity Achieving Distribution for the Amplitude Constrained Additive Gaussian Channel: An Upper Bound on the Number of Mass Points. IEEE Trans. Inf. Theory 66(4): 2006-2022 (2020) - [c6]Semih Yagli, Alex Dytso, H. Vincent Poor:
Information-Theoretic Bounds on the Generalization Error and Privacy Leakage in Federated Learning. SPAWC 2020: 1-5 - [i5]Semih Yagli, Alex Dytso, H. Vincent Poor:
Information-Theoretic Bounds on the Generalization Error and Privacy Leakage in Federated Learning. CoRR abs/2005.02503 (2020) - [i4]Mert Al, Semih Yagli, Sun-Yuan Kung:
Privacy Enhancing Machine Learning via Removal of Unwanted Dependencies. CoRR abs/2007.15710 (2020)
2010 – 2019
- 2019
- [j2]Semih Yagli, Paul Cuff:
Exact Exponent for Soft Covering. IEEE Trans. Inf. Theory 65(10): 6234-6262 (2019) - [c5]Semih Yagli, Alex Dytso, H. Vincent Poor, Shlomo Shamai Shitz:
An Upper Bound on the Number of Mass Points in the Capacity Achieving Distribution for the Amplitude Constrained Additive Gaussian Channel. ISIT 2019: 1907-1911 - [c4]Semih Yagli, Alex Dytso, H. Vincent Poor:
Estimation of Bounded Normal Mean: An Alternative Proof for the Discreteness of the Least Favorable Prior. ITW 2019: 1-5 - [c3]Semih Yagli, Alex Dytso, H. Vincent Poor, Shlomo Shamai Shitz:
Some Aspects of Totally Positive Kernels Useful in Information Theory. WCNC Workshops 2019: 1-6 - [i3]Alex Dytso, Semih Yagli, H. Vincent Poor, Shlomo Shamai:
The Capacity Achieving Distribution for the Amplitude Constrained Additive Gaussian Channel: An Upper Bound on the Number of Mass Points. CoRR abs/1901.03264 (2019) - 2018
- [j1]Semih Yagli, Yucel Altug, Sergio Verdú:
Minimax Rényi Redundancy. IEEE Trans. Inf. Theory 64(5): 3715-3733 (2018) - [c2]Semih Yagli, Paul Cuff:
Exact Soft-Covering Exponent. ISIT 2018: 1680-1684 - [i2]Semih Yagli, Paul Cuff:
Exact Soft-Covering Exponent. CoRR abs/1801.00714 (2018) - 2017
- [c1]Semih Yagli, Yucel Altug, Sergio Verdú:
Minimax Rényi redundancy. ISIT 2017: 2980-2984 - [i1]Semih Yagli, Yücel Altug, Sergio Verdú:
Minimax Rényi Redundancy. CoRR abs/1701.01103 (2017)
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-08-23 19:26 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:
