default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiugang Wu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Daria Reshetova, Yikun Bai, Xiugang Wu, Ayfer Özgür:
Understanding Entropic Regularization in GANs. J. Mach. Learn. Res. 25: 218:1-218:32 (2024)- 2023
- [j8]Yikun Bai, Xiugang Wu
, Ayfer Özgür:
Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover. IEEE Trans. Inf. Theory 69(4): 2059-2073 (2023) - 2021
- [c16]Daria Reshetova, Yikun Bai, Xiugang Wu, Ayfer Özgür:
Understanding Entropic Regularization in GANs. ISIT 2021: 825-830 - [i12]Daria Reshetova, Yikun Bai, Xiugang Wu, Ayfer Özgür:
Understanding Entropic Regularization in GANs. CoRR abs/2111.01387 (2021) - 2020
- [j7]Cheuk Ting Li, Xiugang Wu, Ayfer Özgür, Abbas El Gamal:
Minimax Learning for Distributed Inference. IEEE Trans. Inf. Theory 66(12): 7929-7938 (2020) - [c15]Yikun Bai, Xiugang Wu, Ayfer Özgür:
Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover. ISIT 2020: 2210-2215 - [i11]Yikun Bai, Xiugang Wu, Ayfer Özgür:
Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover. CoRR abs/2008.10249 (2020)
2010 – 2019
- 2019
- [j6]Xiugang Wu, Leighton Pate Barnes, Ayfer Özgür:
"The Capacity of the Relay Channel": Solution to Cover's Problem in the Gaussian Case. IEEE Trans. Inf. Theory 65(1): 255-275 (2019) - [c14]Xiugang Wu, Ayfer Özgür, Michael Peleg, Shlomo Shamai Shitz:
New Upper Bounds on the Capacity of Primitive Diamond Relay Channels. ITW 2019: 1-5 - 2018
- [j5]Xiugang Wu, Ayfer Özgür:
Cut-Set Bound is Loose for Gaussian Relay Networks. IEEE Trans. Inf. Theory 64(2): 1023-1037 (2018) - [c13]Cheuk Ting Li, Xiugang Wu, Ayfer Özgür, Abbas El Gamal:
Minimax Learning for Remote Prediction. ISIT 2018: 541-545 - [i10]Cheuk Ting Li, Xiugang Wu, Ayfer Özgür, Abbas El Gamal:
Minimax Learning for Remote Prediction. CoRR abs/1806.00071 (2018) - [i9]Leighton Pate Barnes, Ayfer Özgür, Xiugang Wu:
An Isoperimetric Result on High-Dimensional Spheres. CoRR abs/1811.10533 (2018) - 2017
- [j4]Xiugang Wu, Ayfer Özgür, Liang-Liang Xie:
Improving on the Cut-Set Bound via Geometric Analysis of Typical Sets. IEEE Trans. Inf. Theory 63(4): 2254-2277 (2017) - [c12]Leighton Pate Barnes, Xiugang Wu, Ayfer Özgür:
A solution to cover's problem for the binary symmetric relay channel: Geometry of sets on the hamming sphere. Allerton 2017: 844-851 - [c11]Xiugang Wu, Leighton Pate Barnes, Ayfer Özgür:
The geometry of the relay channel. ISIT 2017: 2233-2237 - [i8]Xiugang Wu, Leighton Pate Barnes, Ayfer Özgür:
Cover's Open Problem: "The Capacity of the Relay Channel". CoRR abs/1701.02043 (2017) - 2016
- [j3]Xiugang Wu, Shengli Zhang, Ayfer Özgür:
STAC: Simultaneous Transmitting and Air Computing in Wireless Data Center Networks. IEEE J. Sel. Areas Commun. 34(12): 4024-4034 (2016) - [c10]Xiugang Wu, Leighton Pate Barnes, Ayfer Özgür:
Cover's open problem: "The Capacity of the Relay Channel". Allerton 2016: 148-155 - [c9]Xiugang Wu, Ayfer Özgür:
Improving on the cut-set bound for general primitive relay channels. ISIT 2016: 1675-1679 - [i7]Xiugang Wu, Ayfer Özgür, Liang-Liang Xie:
Improving on the Cut-Set Bound via Geometric Analysis of Typical Sets. CoRR abs/1602.08540 (2016) - [i6]Xiugang Wu, Ayfer Özgür:
Cut-Set Bound Is Loose for Gaussian Relay Networks. CoRR abs/1606.01374 (2016) - 2015
- [c8]Xiugang Wu, Ayfer Özgür:
Cut-set bound is loose for Gaussian relay networks. Allerton 2015: 1135-1142 - [c7]Shengli Zhang, Xiugang Wu, Ayfer Özgür:
STAC: Simultaneous transmitting and air computing in wireless data center networks. ICCC 2015: 1-7 - [c6]Xiugang Wu, Liang-Liang Xie, Ayfer Özgür:
Upper bounds on the capacity of symmetric primitive relay channels. ISIT 2015: 1282-1286 - [i5]Shengli Zhang, Xiugang Wu, Ayfer Özgür:
STAC: Simultaneous Transmitting and Air Computing in Wireless Data Center Networks. CoRR abs/1508.05935 (2015) - [i4]Xiugang Wu, Ayfer Özgür:
Cut-Set Bound Is Loose for Gaussian Relay Networks. CoRR abs/1510.04007 (2015) - 2014
- [j2]Xiugang Wu, Liang-Liang Xie:
A Unified Relay Framework With Both D-F and C-F Relay Nodes. IEEE Trans. Inf. Theory 60(1): 586-604 (2014) - 2013
- [b1]Xiugang Wu:
Coding Schemes for Multiple-Relay Channels. University of Waterloo, Ontario, Canada, 2013 - [j1]Xiugang Wu, Liang-Liang Xie:
On the Optimal Compressions in the Compress-and-Forward Relay Schemes. IEEE Trans. Inf. Theory 59(5): 2613-2628 (2013) - [c5]Xiugang Wu, Liang-Liang Xie:
A unified relay framework with both D-F and C-F relay nodes. CWIT 2013: 82-86 - 2012
- [i3]Xiugang Wu, Liang-Liang Xie:
A Unified Relay Framework with both D-F and C-F Relay Nodes. CoRR abs/1209.4889 (2012) - 2010
- [c4]Xiugang Wu, Liang-Liang Xie:
On the optimality of successive decoding in compress-and-forward relay schemes. Allerton 2010: 534-541 - [c3]Xiugang Wu, Liang-Liang Xie:
Codebook information does not reduce output entropy when rate is above capacity. Allerton 2010: 1496-1501 - [c2]Xiugang Wu, Liang-Liang Xie:
AEP of Output when Rate is above capacity: The Gaussian case. ISIT 2010: 305-309 - [c1]Xiugang Wu, Guangzhe Fan, Liang-Liang Xie:
An Optimality-Robustness Tradeoff in the Compress-and-Forward Relay Scheme. VTC Fall 2010: 1-5 - [i2]Xiugang Wu, Liang-Liang Xie:
On the Optimality of Successive Decoding in Compress-and-Forward Relay Schemes. CoRR abs/1009.5959 (2010)
2000 – 2009
- 2009
- [i1]Xiugang Wu, Liang-Liang Xie:
Asymptotic Equipartition Property of Output when Rate is above Capacity. CoRR abs/0908.4445 (2009)
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 2025-04-03 00:17 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:
