The DOI matches its Crossref record; 45 of the 46 references it cites were found in a registry or an index.
Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit
Open accessAbstract
In this paper, we present a flexible low-rank matrix completion (LRMC) approach for topological interference management (TIM) in the partially connected $K$-user interference channel. No channel state information (CSI) is required at the transmitters except the network topology information. The previous attempt on the TIM problem is mainly based on its equivalence to the index coding problem, but so far only a few index coding problems have been solved. In contrast, in this paper, we present an algorithmic approach to investigate the achievable degrees-of-freedom (DoFs) by recasting the TIM problem as an LRMC problem. Unfortunately, the resulting LRMC problem is known to be NP-hard, and the main contribution of this paper is to propose a Riemannian pursuit (RP) framework to detect the rank of the matrix to be recovered by iteratively increasing the rank. This algorithm solves a sequence of fixed-rank matrix completion problems. To address the convergence issues in the existing fixed-rank optimization methods, the quotient manifold geometry of the search space of fixed-rank matrices is exploited via Riemannian optimization. By further exploiting the structure of the low-rank matrix varieties, i.e., the closure of the set of fixed-rank matrices, we develop an efficient rank increasing strategy to find good initial points in the procedure of rank pursuit. Simulation results demonstrate that the proposed RP algorithm achieves a faster convergence rate and higher achievable DoFs f…
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“To solve the large-scale rank constrained matrix optimization problems, Riemannian manifold optimization was proposed to optimize such nonconvex programs directly by exploiting the manifold geometric structures of fixed-rank matrices [100], [101].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [101]
Citations
Cites
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel
Cadambe, V. R., & Jafar, S. A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.926344 · Cited by 2,970
Elements of Information Theory
Nalewajski, R. F. (2011) · Perspectives in Electronic Structure Theory · doi:10.1007/978-3-642-20180-6_8 · Cited by 2,309
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
Multi-Cell MIMO Cooperative Networks: A New Look at Interference
Gesbert, D., Hanly, S., Huang, H., Shamai Shitz, S., Simeone, O., & Yu, W. (2010) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2010.101202 · Cited by 1,760
Alternating Minimization Algorithms for Hybrid Precoding in Millimeter Wave MIMO Systems
Yu, X., Shen, J.-C., Zhang, J., & Letaief, K. B. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2523903 · Cited by 1,444
Self-citation(2006) · Optimal Control and Forecasting of Complex Dynamical Systems · doi:10.1142/9789812774248_0002 · Cited by 1,362
Gomadam, K., Cadambe, V. R., & Jafar, S. A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2142270 · Cited by 871
Low-rank matrix completion using alternating minimization
Jain, P., Netrapalli, P., & Sanghavi, S. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488693 · Cited by 817
Wen, Z., Yin, W., & Zhang, Y. (2012) · Mathematical Programming Computation · doi:10.1007/s12532-012-0044-1 · Cited by 774
Research works printed but not linked: 2
- hassibi, 0, Topological interference alignment in wireless networks, Proc Int Workshop Smart Antennas, 1
- jain, 0, Proc ACM Symp Theory Comput, 665
Cited by
Federated Learning via Over-the-Air Computation
Yang, K., Jiang, T., Shi, Y., & Ding, Z. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2961673 · Cited by 1,084
“Sparse optimization and low-rank optimization have attracted much attention in machine learning, signal processing, high-dimensional statistics, as well as wireless communication [30], [31], [32], [33], [34].”
BackgroundSelf-citationEdge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
“To solve the large-scale rank constrained matrix optimization problems, Riemannian manifold optimization was proposed to optimize such nonconvex programs directly by exploiting the manifold geometric structures of fixed-rank matrices [100], [101].”
MethodSelf-citationLow-Rank Matrix Completion: A Contemporary Survey
Nguyen, L. T., Kim, J., & Shim, B. (2019) · IEEE Access · doi:10.1109/access.2019.2928130 · Cited by 181
Federated Learning Based on Over-the-Air Computation
Yang, K., Jiang, T., Shi, Y., & Ding, Z. J. (2019) · International Conference on Communications · doi:10.1109/icc.2019.8761429 · Cited by 54
Self-citationGeneralized Sparse and Low-Rank Optimization for Ultra-Dense Networks
Shi, Y., Zhang, J., Chen, W., & Letaief, K. B. (2018) · IEEE Communications Magazine · doi:10.1109/mcom.2018.1700472 · Cited by 44
Self-citation
Metadata
- Authors
- Shi, Y., Zhang, J., & Letaief, K. B.
- Affiliations
- ShanghaiTech University (CN)
- Hong Kong University of Science and Technology (HK)
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2016
- Pages
- 1-1
- ISSN
- 1536-1276 (ISSN-L)
- OpenAlex
- W2310614892
- Cited by
- 56
- References
- 46
- Citations by year
- 2025: 1 · 2024: 2 · 2023: 5 · 2022: 8 · 2021: 7 · 2020: 3 · 2019: 11 · 2018: 12 · 2017: 2 · 2016: 5
- FWCI
- 8.65
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Transactions on Wireless Communications (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced MIMO Systems Optimization
- Physical Sciences › Computer Science › Computer Networks and Communications › Cooperative Communication and Network Coding
- Keywords
- topological interference management, low-rank matrix completion, Riemannian optimization, degrees of freedom, interference channel, partially connected networks, index coding
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit. https://app.cochat.ai/papers/10.1109/twc.2016.2544758
- The paper
- Shi, Y., Zhang, J., & Letaief, K. B. (2016). Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit. IEEE Transactions on Wireless Communications. https://doi.org/10.1109/twc.2016.2544758
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.