Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYu Xiang 0004
Person information
- affiliation: University of Utah, Electrical and Computer Engineering Department, Salt Lake City, UT, USA
- affiliation (2015-2018): Harvard University, School of Engineering and Applied Sciences, Cambridge, MA, USA
- affiliation (PhD 2015): University of California, San Diego, Department of electrical and computer engineering, CA, USA
Other persons with the same name
- Yu Xiang — disambiguation page
- Yu Xiang 0001 — University of Texas at Dallas, Department of Computer Science, Richardson, TX, USA (and 2 more)
- Yu Xiang 0002
![[0000-0001-9622-7661]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-9622-7661")
— University of Electronic Science and Technology of China, Chengdu, Sichuan, China (and 1 more) - Yu Xiang 0003 — AT&T Labs-Research, Inventive science, Bedminster, NJ, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Kang Du, Yu Xiang:
Causal Inference From Slowly Varying Nonstationary Processes. IEEE Trans. Signal Inf. Process. over Networks 10: 403-416 (2024)- [i15]Kang Du, Yu Xiang:
Low-Rank Approximation of Structural Redundancy for Self-Supervised Learning. CoRR abs/2402.06884 (2024) - 2023
- [j7]Kang Du, Yu Xiang:
Learning Invariant Representations Under General Interventions on the Response. IEEE J. Sel. Areas Inf. Theory 4: 808-819 (2023) - [j6]Mehrdad Pournaderi, Yu Xiang:
On Large-Scale Multiple Testing Over Networks: An Asymptotic Approach. IEEE Trans. Signal Inf. Process. over Networks 9: 442-457 (2023) - [c23]Mehrdad Pournaderi, Yu Xiang:
Communication-Efficient Distribution-Free Inference Over Networks. ACSSC 2023: 675-681 - [c22]Kang Du, Yu Xiang, Ilya Soloveychik:
Identifying Direct Causes Using Intervened Target Variable. ACSSC 2023: 915-919 - [c21]Austin Goddard, Yu Xiang, Ilya Soloveychik:
Error Probability Bounds for Invariant Causal Prediction via Multiple Access Channels. ACSSC 2023: 932-936 - [c20]Kang Du, Yu Xiang:
Generalized Invariant Matching Property Via Lasso. ICASSP 2023: 1-5 - [c19]Mehrdad Pournaderi, Yu Xiang:
Sample-and-Forward: Communication-Efficient Control of the False Discovery Rate in Networks. ISIT 2023: 1949-1954 - [i14]Kang Du, Yu Xiang:
Generalized Invariant Matching Property via LASSO. CoRR abs/2301.05975 (2023) - [i13]Mehrdad Pournaderi, Yu Xiang:
Communication-Efficient Distribution-Free Inference Over Networks. CoRR abs/2307.09850 (2023) - [i12]Austin Goddard, Yu Xiang, Ilya Soloveychik:
Error Probability Bounds for Invariant Causal Prediction via Multiple Access Channels. CoRR abs/2308.10119 (2023) - 2022
- [c18]Kang Du, Yu Xiang:
An Invariant Matching Property for Distribution Generalization under Intervened Response. EUSIPCO 2022: 1387-1391 - [c17]Mehrdad Pournaderi, Yu Xiang:
Communication-Efficient Distributed Multiple Testing for Large-Scale Inference. ISIT 2022: 1477-1482 - [c16]Austin Goddard, Yu Xiang, Ilya Soloveychik:
Lower Bounds on the Error Probability for Invariant Causal Prediction. MLSP 2022: 1-6 - [i11]Mehrdad Pournaderi, Yu Xiang:
Communication-Efficient Distributed Multiple Testing for Large-Scale Inference. CoRR abs/2201.13008 (2022) - [i10]Kang Du, Yu Xiang:
An Invariant Matching Property for Distribution Generalization under Intervened Response. CoRR abs/2205.09162 (2022) - [i9]Austin Goddard, Yu Xiang, Ilya Soloveychik:
Lower Bounds on the Error Probability for Invariant Causal Prediction. CoRR abs/2206.14362 (2022) - [i8]Kang Du, Yu Xiang:
Learning Invariant Representations under General Interventions on the Response. CoRR abs/2208.10027 (2022) - [i7]Mehrdad Pournaderi, Yu Xiang:
On Large-Scale Multiple Testing Over Networks: An Asymptotic Approach. CoRR abs/2211.16059 (2022) - 2021
- [c15]Xinran Wang, Yu Xiang, Jun Gao, Jie Ding:
Information Laundering for Model Privacy. ICLR 2021 - [c14]Kang Du, Yu Xiang:
Causal Inference Using Linear Time-Varying Filters with Additive Noise. ISIT 2021: 896-901 - [c13]Mehrdad Pournaderi, Yu Xiang:
Differentially Private Variable Selection via the Knockoff Filter. MLSP 2021: 1-6 - [c12]Austin Goddard, Yu Xiang:
A Subsampling-Based Method for Causal Discovery on Discrete Data. SSP 2021: 341-345 - [i6]Austin Goddard, Yu Xiang:
A Subsampling-Based Method for Causal Discovery on Discrete Data. CoRR abs/2108.13984 (2021) - [i5]Mehrdad Pournaderi, Yu Xiang:
Differentially Private Variable Selection via the Knockoff Filter. CoRR abs/2109.05402 (2021) - 2020
- [c11]Kang Du, Austin Goddard, Yu Xiang:
On the Robustness of Causal Discovery with Additive Noise Models on Discrete Data. DCC 2020: 365 - [i4]Xinran Wang, Yu Xiang, Jun Gao, Jie Ding:
Information Laundering for Model Privacy. CoRR abs/2009.06112 (2020) - [i3]Kang Du, Yu Xiang:
Causal Inference Using Linear Time-Varying Filters with Additive Noise. CoRR abs/2012.13025 (2020)
2010 – 2019
- 2019
- [j5]Yu Xiang, Jie Ding, Vahid Tarokh:
Estimation of the Evolutionary Spectra With Application to Stationarity Test. IEEE Trans. Signal Process. 67(5): 1353-1365 (2019) - [c10]Yu Xiang:
Distributed False Discovery Rate Control with Quantization. ISIT 2019: 246-249 - 2018
- [j4]Ilya Soloveychik, Yu Xiang, Vahid Tarokh:
Pseudo-Wigner Matrices. IEEE Trans. Inf. Theory 64(4): 3170-3178 (2018) - [j3]Ilya Soloveychik, Yu Xiang, Vahid Tarokh:
Symmetric Pseudo-Random Matrices. IEEE Trans. Inf. Theory 64(4): 3179-3196 (2018) - [c9]Yu Xiang, Jie Ding, Vahid Tarokh:
Evolutionary Spectra Based on the Multitaper Method with Application To Stationarity Test. ICASSP 2018: 3994-3998 - 2017
- [j2]Jie Ding, Yu Xiang, Lu Shen, Vahid Tarokh:
Multiple Change Point Analysis: Fast Implementation and Strong Consistency. IEEE Trans. Signal Process. 65(17): 4495-4510 (2017) - [c8]Jie Ding, Yu Xiang, Lu Shen, Vahid Tarokh:
Detecting structural changes in dependent data. GlobalSIP 2017: 750-754 - [c7]Ilya Soloveychik, Yu Xiang, Vahid Tarokh:
Pseudo-wigner matrices from dual BCH codes. ISIT 2017: 1381-1385 - [c6]Ilya Soloveychik, Yu Xiang, Vahid Tarokh:
Explicit symmetric pseudo-random matrices. ITW 2017: 424-428 - [i2]Ilya Soloveychik, Yu Xiang, Vahid Tarokh:
Pseudo-Wigner Matrices from Dual BCH Codes. CoRR abs/1701.05544 (2017) - 2014
- [c5]Yu Xiang, Young-Han Kim:
A few meta-theorems in network information theory. ITW 2014: 77-81 - 2013
- [j1]Yu Xiang, Young-Han Kim:
Gaussian Channel With Noisy Feedback and Peak Energy Constraint. IEEE Trans. Inf. Theory 59(8): 4746-4756 (2013) - [c4]Yu Xiang, Young-Han Kim:
Interactive hypothesis testing against independence. ISIT 2013: 2840-2844 - 2012
- [c3]Yu Xiang, Young-Han Kim:
Interactive hypothesis testing with communication constraints. Allerton Conference 2012: 1065-1072 - 2011
- [c2]Yu Xiang, Lele Wang, Young-Han Kim:
Information flooding. Allerton 2011: 45-51 - [i1]Yu Xiang, Young-Han Kim:
Gaussian Channel with Noisy Feedback and Peak Energy Constraint. CoRR abs/1108.3571 (2011) - 2010
- [c1]Yu Xiang, Young-Han Kim:
On the AWGN channel with noisy feedback and peak energy constraint. ISIT 2010: 256-259
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-05-08 02:43 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:
