Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit

Yuanming Shi, Jun Zhang, Khaled Letaief

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

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 for the TIM problem compared with the state-of-the-art methods.

Original languageEnglish
Article number7438923
Pages (from-to)4703-4717
Number of pages15
JournalIEEE Transactions on Wireless Communications
Volume15
Issue number7
DOIs
Publication statusPublished - 1 Jul 2016
Externally publishedYes

Fingerprint

Matrix Completion
Low-rank Matrices
Pursuit
Interference
Matrix Completion Problem
Coding
Degree of freedom
Interference Channel
Channel state information
Channel State Information
Network Topology
Transmitter
Search Space
Optimization Methods
Convergence Rate
Transmitters
Quotient
Closure
NP-complete problem
Topology

Keywords

  • degrees-of-freedom
  • index coding
  • Interference alignment
  • low-rank matrix completion
  • quotient manifolds
  • Riemannian optimization
  • topological interference management

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit. / Shi, Yuanming; Zhang, Jun; Letaief, Khaled.

In: IEEE Transactions on Wireless Communications, Vol. 15, No. 7, 7438923, 01.07.2016, p. 4703-4717.

Research output: Contribution to journalArticle

@article{fd941a94c7d54d79be16f6bc7df09113,
title = "Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit",
abstract = "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 for the TIM problem compared with the state-of-the-art methods.",
keywords = "degrees-of-freedom, index coding, Interference alignment, low-rank matrix completion, quotient manifolds, Riemannian optimization, topological interference management",
author = "Yuanming Shi and Jun Zhang and Khaled Letaief",
year = "2016",
month = "7",
day = "1",
doi = "10.1109/TWC.2016.2544758",
language = "English",
volume = "15",
pages = "4703--4717",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit

AU - Shi, Yuanming

AU - Zhang, Jun

AU - Letaief, Khaled

PY - 2016/7/1

Y1 - 2016/7/1

N2 - 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 for the TIM problem compared with the state-of-the-art methods.

AB - 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 for the TIM problem compared with the state-of-the-art methods.

KW - degrees-of-freedom

KW - index coding

KW - Interference alignment

KW - low-rank matrix completion

KW - quotient manifolds

KW - Riemannian optimization

KW - topological interference management

UR - http://www.scopus.com/inward/record.url?scp=84978818142&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84978818142&partnerID=8YFLogxK

U2 - 10.1109/TWC.2016.2544758

DO - 10.1109/TWC.2016.2544758

M3 - Article

AN - SCOPUS:84978818142

VL - 15

SP - 4703

EP - 4717

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 7

M1 - 7438923

ER -