SPARSE AND LOW-RANK OPTIMIZATION FOR PLIABLE INDEX CODING

In this paper, we investigate the pliable index coding problem, where clients are interested in receiving any messages (instead of specific messages) that they do not have. The motivating applications including caching networks, recommendation systems and distributed computing systems, where the clients are happy to receive any messages not available in them. However, the pliable index coding problem turns out to be computationally intractable, for which we propose a novel sparse and low-rank optimization framework to assist efficient algorithms design in real field, thereby minimizing the number of channel uses for message delivery. To address the nonconvex challenges in this framework, we further propose the alternating projection algorithm to solve the sparse and low-rank optimization problem with local convergence guarantees. Simulation results demonstrate that the number of channel uses can be significantly reduced for message delivery via the sparse and low-rank optimization.

[1]  Yonina C. Eldar,et al.  Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices , 2012, IEEE Transactions on Information Theory.

[2]  Dmitriy Drusvyatskiy,et al.  Transversality and Alternating Projections for Nonconvex Sets , 2014, Found. Comput. Math..

[3]  C. Eckart,et al.  The approximation of one matrix by another of lower rank , 1936 .

[4]  Christina Fragouli,et al.  A pliable index coding approach to data shuffling , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[5]  Christina Fragouli,et al.  Content-type coding , 2015, 2015 International Symposium on Network Coding (NetCod).

[6]  Xiao Huang,et al.  Index coding and network coding via rank minimization , 2015, 2015 IEEE Information Theory Workshop - Fall (ITW).

[7]  Christina Fragouli,et al.  A polynomial-time algorithm for pliable index coding , 2016, ISIT.

[8]  Wei Chen,et al.  Generalized Sparse and Low-Rank Optimization for Ultra-Dense Networks , 2017, IEEE Communications Magazine.

[9]  Christina Fragouli,et al.  Pliable Index Coding , 2015, IEEE Trans. Inf. Theory.

[10]  Thrasyvoulos Spyropoulos,et al.  Soft Cache Hits: Improving Performance Through Recommendation and Delivery of Related Content , 2018, IEEE Journal on Selected Areas in Communications.

[11]  D. Russell Luke.  Prox-Regularity of Rank Constraint Sets and Implications for Algorithms , 2012, Journal of Mathematical Imaging and Vision.

[12]  Syed Ali Jafar,et al.  Index Coding - An Interference Alignment Perspective , 2014, IEEE Trans. Inf. Theory.

[13]  Yuanming Shi,et al.  Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit , 2016, IEEE Transactions on Wireless Communications.

[14]  Yuanming Shi,et al.  Topological Interference Management With User Admission Control via Riemannian Optimization , 2016, IEEE Transactions on Wireless Communications.

[15]  Syed Ali Jafar,et al.  Topological Interference Management Through Index Coding , 2013, IEEE Transactions on Information Theory.

[16]  Alexander Y. Kruger,et al.  Set regularities and feasibility problems , 2016, Math. Program..

[17]  Christina Fragouli,et al.  Making recommendations bandwidth aware , 2016, 2017 IEEE International Symposium on Information Theory (ISIT).

[18]  Aude Rondepierre,et al.  On Local Convergence of the Method of Alternating Projections , 2013, Foundations of Computational Mathematics.

[19]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2011, IEEE Trans. Inf. Theory.

[20]  M. Coste.  AN INTRODUCTION TO SEMIALGEBRAIC GEOMETRY , 2002 .

[21]  Boris Polyak,et al.  The method of projections for finding the common point of convex sets , 1967 .