Fetching the paper…
Reading the bibliography…
Intelligent mobile platforms such as smart vehicles and drones have recently become the focus of attention for onboard deployment of machine learning mechanisms to enable low latency decisions with low risk of privacy breach.
G. A. Watson, “Characterization of the subdifferential of some matrix norms,” Linear algebra and its applications , vol. 170, pp. 33–45, 1992
1992
Earlier work this paper cites.
G. Watson, “On matrix approximation problems with Ky Fan k k norms,” Numerical Algorithms , vol. 5, no. 5, pp. 263–272, 1993
1993
Earlier work this paper cites.
P. D. Tao and L. T. H. An, “Convex analysis approach to DC programming: Theory, algorithms and applications,” Acta Mathematica Vietnamica , vol. 22, no. 1, pp. 289–355, 1997
1997
Earlier work this paper cites.
S. Boyd and L. Vandenberghe, Convex optimization . Cambridge Univ. Press, 2004
2004
Earlier work this paper cites.
J. Dean and S. Ghemawat, “MapReduce: simplified data processing on large clusters,” Commun. ACM , vol. 51, no. 1, pp. 107–113, 2008
2008
Earlier work this paper cites.
V. R. Cadambe and S. A. Jafar, “Interference alignment and degrees of freedom of the k k -user interference channel,” IEEE Trans. Inf. Theory , vol. 54, no. 8, pp. 3425–3441, Aug. 2008
2008
Earlier work this paper cites.
K. Mohan and M. Fazel, “Iterative reweighted algorithms for matrix rank minimization,” J. Mach. Learn. Res. , vol. 13, pp. 3441–3473, Nov. 2012
2012
Earlier work this paper cites.
T. M. Cover and J. A. Thomas, Elements of information theory . John Wiley & Sons, 2012
2012
Earlier work this paper cites.
P. Bouboulis, K. Slavakis, and S. Theodoridis, “Adaptive learning in complex reproducing kernel Hilbert spaces employing Wirtinger’s subgradients,” IEEE Trans. Neural Netw. Learn. Syst. , vol. 23, no. 3, pp. 425–438, Mar. 2012
2012
Earlier work this paper cites.
G. Bresler, D. Cartwright, and D. Tse, “Feasibility of interference alignment for the MIMO interference channel,” IEEE Trans. Inf. Theory , vol. 60, no. 9, pp. 5573–5586, Sept. 2014
2014
Cited alongside, same era.
H. Maleki, V. R. Cadambe, and S. A. Jafar, “Index coding – an interference alignment perspective,” IEEE Trans. Inf. Theory , vol. 60, no. 9, pp. 5402–5432, Sept. 2014
2014
Cited alongside, same era.
2014
Cited alongside, same era.
Y. Shi, J. Zhang, B. O’Donoghue, and K. B. Letaief, “Large-scale convex optimization for dense wireless cooperative networks,” IEEE Trans. Signal Process. , vol. 63, no. 18, pp. 4729–4743, Sept. 2015
2015
Cited alongside, same era.
R. T. Rockafellar, Convex analysis . Princeton university press, 2015
X. V. Doan and S. Vavasis, “Finding the largest low-rank clusters with ky fan 2-k-norm and ℓ 1 \ell_{1} -norm,” SIAM J. Optim. , vol. 26, no. 1, pp. 274–312, 2016
2016
Later among the works it cites.
V. Sze, Y. H. Chen, T. J. Yang, and J. S. Emer, “Efficient processing of deep neural networks: A tutorial and survey,” Proc. IEEE , vol. 105, no. 12, pp. 2295–2329, Dec. 2017
2017
Later among the works it cites.
S. Li, Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “A scalable framework for wireless distributed computing,” IEEE/ACM Trans. Netw. , vol. 25, no. 5, pp. 2643–2654, Oct. 2017
2017
Later among the works it cites.
Y. Lin, S. Han, H. Mao, Y. Wang, and W. J. Dally, “Deep gradient compression: Reducing the communication bandwidth for distributed training,” Int. Conf. Learn. Representations (ICLR) , 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
S. Han, H. Mao, and W. J. Dally, “Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding,” Int. Conf. Learn. Representations (ICLR) , 2016
2016
Cited alongside, same era.
M. A. Davenport and J. Romberg, “An overview of low-rank matrix recovery from incomplete observations,” IEEE J. Sel. Topics Signal Process. , vol. 10, no. 4, pp. 608–622, Jun. 2016
2016
Cited alongside, same era.
Y. Shi, J. Zhang, and K. B. Letaief, “Low-rank matrix completion for topological interference management by Riemannian pursuit,” IEEE Trans. Wireless Commun. , vol. 15, no. 7, pp. 4703–4717, Jul. 2016
2016
Cited alongside, same era.
B. O’Donoghue, E. Chu, N. Parikh, and S. Boyd, “Conic optimization via operator splitting and homogeneous self-dual embedding,” J. Optim. Theory Appl. , vol. 169, no. 3, pp. 1042–1068, Jun 2016
2016
Cited alongside, same era.
K. Yang, Y. Shi, and Z. Ding, “Low-rank optimization for data shuffling in wireless distributed computing,” Proc. IEEE Int. Conf. Acoustics Speech Signal Process. (ICASSP) , 2018
2018
Closest in time.
Y. Cheng, D. Wang, P. Zhou, and T. Zhang, “Model compression and acceleration for deep neural networks: The principles, progress, and challenges,” IEEE Signal Process. Mag. , vol. 35, no. 1, pp. 126–136, Jan. 2018
2018
Closest in time.
S. Li, M. A. Maddah-Ali, Q. Yu, and A. S. Avestimehr, “A fundamental tradeoff between computation and communication in distributed computing,” IEEE Trans. Inf. Theory , vol. 64, no. 1, pp. 109–128, Jan. 2018
2018
Closest in time.
H. A. Le Thi and T. P. Dinh, “DC programming and DCA: thirty years of developments,” Math. Program. , pp. 1–64, 2018
2018
Closest in time.
J.-y. Gotoh, A. Takeda, and K. Tono, “DC formulations and algorithms for sparse optimization problems,” Math. Program. , vol. 169, no. 1, pp. 141–176, May 2018
2018
Closest in time.