Fetching the paper…
Reading the bibliography…
Fueled by the availability of more data and computing power, recent breakthroughs in cloud-based machine learning (ML) have transformed every aspect of our lives from face recognition and medical diagnosis to natural language processing.
H. Markowitz, “Portfolio selection,” The Journal of Finance
1952
Earlier work this paper cites.
R. Sinkhorn, “A relationship between arbitrary positive matrices and doubly stochastic matrices,” Annals of Mathematical Statistics
1964
Earlier work this paper cites.
Harvard University, 1975
P. Werbos, Beyond Regression: New Tools for Prediction and Analysis in the Behavioral Sciences · 1975
Earlier work this paper cites.
L. G. Valiant, “A theory of the learnable,” Communications of the ACM
1984
Earlier work this paper cites.
K. Hornik, M. Stinchcombe, and H. White, “Multilayer feedforward networks are universal approximators,” Neural Networks
1989
Earlier work this paper cites.
G. Cybenko, “Approximation by superpositions of a sigmoidal function,” Mathematics of Control, Signals, and Systems
1989
Earlier work this paper cites.
D. Haussler, “Decision theoretic generalizations of the PAC model for neural net and other learning applications,” Information and Computation
1992
Earlier work this paper cites.
phdthesis, Univ. of Toronto, 1995
R. M. Neal, Bayesian Learning for Neural Networks · 1995
Earlier work this paper cites.
S. Hochreiter and J. Schmidhuber, “Long short-term memory,” Neural Computation
1997
Earlier work this paper cites.
S. Horchreiter and J. Schmidhuber, “Flat minima,” Neural Computation
1997
Earlier work this paper cites.
R. M. Gray and D. L. Neuhoff, “Quantization,” IEEE Transactions on Information Theory
1998
Earlier work this paper cites.
R. S. Sutton, D. McAllester, S. Singh, and Y. Mansour, “Policy gradient methods for reinforcement learning with function approximation,” in Proc. of the 12th NIPS
1999
Earlier work this paper cites.
The MIT Press, 1 ed., June 1999
C. D. Manning and H. Schuetze, Foundations of Statistical Natural Language Processing · 1999
Earlier work this paper cites.
D. A. McAllester, “Some PAC-Bayesian theorems,” Machine Learning
1999
Earlier work this paper cites.
N. Tishby, F. C. Pereira, and W. Bialek, “The information bottleneck method,” in Proc. of Allerton Conference
1999
Earlier work this paper cites.
J. Langford and M. Seeger, “Bounds for averaging classifiers,” tech. rep., Carnegie Mellon, Department of Computer Science, Jan. 2001
2001
Earlier work this paper cites.
M. Seeger, “PAC-Bayesian generalisation error bounds for gassian process classification,” The Journal of Machine Learning Research
2002
Earlier work this paper cites.
R. T. Rockafellar and S. Uryasev, “Conditional value-at-risk for general loss distributions,” Journal of Banking & Finance
2002
Earlier work this paper cites.
R. Meir and T. Zhang, “Generalization error bounds for bayesian mixture algorithms,” The Journal of Machine Learning Research
2003
Earlier work this paper cites.
G. Chechik, A. Globerson, N. Tishiby, and Y. Weiss, “Information bottleneck for gaussian variables,” The Journal of Machine Learning Research
2005
Earlier work this paper cites.
NY, USA: Wiley, 2nd ed., July 2006
T. M. Cover and J. A. Thomas, Elements of Information Theory · 2006
Earlier work this paper cites.
F. McSherry and K. Talwar, “Mechanism design via differential privacy,” in Proc. of the 48th FOCS
2007
Earlier work this paper cites.
J.-M. Lasry and P.-L. Lions, “Mean field games,” Japanese Journal of Mathematics
2007
Earlier work this paper cites.
H. Lee, R. Grosse, R. Ranganath, and A. Y. Ng, “Convolutional deep belief networks for scalable unsupervised learning of hierarchical representations,” in Proc. of the 26th ICML
2009
Earlier work this paper cites.
PhD thesis, Stanford Univ., 2009
C. Gentry and D. Boneh, A Fully Homomorphic Encryption Scheme · 2009
Earlier work this paper cites.
M. A. Zinkevich, M. Weimer, A. Smola, and L. Li, “Parallelized stochastic gradient decent,” in Proc. of NIPS
2010
Earlier work this paper cites.
L. Ralaivola, M. Szafranski, and G. Stempfel, “Chromatic PAC-Bayes bounds for non-IID data: Applications to ranking and stationary β \beta -mixing processes,” The Journal of Machine Learning Research
2010
Earlier work this paper cites.
E. Joelianto, “Networked control systems: Time delays and robust control design issues,” in Proc. of 2nd ICA
2011
Earlier work this paper cites.
D. C. Cireşan, U. Meier, J. Masci, L. M. Gambardella, and J. Schmidhuber, “Flexible, high performance convolutional neural networks for image classification,” in Proc. of IJCAI
2011
Earlier work this paper cites.
M. Welling and Y. W. Teh, “Bayesian learning via stochastic gradient langevin dynamics,” in Proc. of ICML
2011
Earlier work this paper cites.
J. Dean, G. S. Corrado, R. Monga, K. Chen, M. Devin, Q. V. Le, M. Z. Mao, M. Ranzato, A. Senior, P. Tucker, K. Yang, and A. Y. Ng, “Large scale distributed deep networks,” in Proc. of the 25th NIPS
2012
Earlier work this paper cites.
J. Zhang, Z. Zhang, X. Xiao, Y. Yang, and M. Winslett, “Functional mechanism: Regression analysis under differential privacy,” in Proc. VLDB Endow
2012
Earlier work this paper cites.
L. Wan, M. Zeiler, S. Zhang, Y. LeCun, and R. Fergus, “Regularization of neural networks using DropConnect,” in Proc. of ICML
2013
Earlier work this paper cites.
J. Fink, A. Ribeiro, and V. Kumar, “Robust control of mobility and communications in autonomous robot teams,” IEEE Access
2013
Earlier work this paper cites.
M. Cuturi, “Sinkhorn distances: Lightspeed computation of optimal transport,” in Proc. of the 26th NIPS
2013
Earlier work this paper cites.
SpringerBriefs in Mathematics, Springer-Verlag New York, 1 ed., 2013
A. Bensoussan and J. F. nad Phillip Yam, Mean Field Games and Mean Field Type Control Theory · 2013
Earlier work this paper cites.
Y. Zhang and D.-Y. Yeung, “A regularization approach to learning task relationships in multitask learning,” ACM Transactions on Knowledge Discovery from Data
2013
Earlier work this paper cites.
R. Johnson and T. Zhang, “Accelerating stochastic gradient descent using predictive variance reduction,” in Proc. of NIPS
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
C. Decker and R. Wattenhofer, “Information propagation in the bitcoin network,” in Proc. of IEEE P2P
2013
Earlier work this paper cites.
E. Akyol, U. Mitra, and A. Nayyar, “Controlled sensing and event based communication for remote estimation,” in Proc. of 52nd Allerton
2014
Earlier work this paper cites.
J. Li, P. Zeng, X. Zong, M. Zheng, and X. Zhang, “Communication and control co-design for wireless sensor networked control systems,” in Proc. of the 11th WCICA
2014
Earlier work this paper cites.
K. Cho, B. van Merrienboer, C. Gulcehre, D. Bahdanau, F. Bougares, H. Schwenk, and Y. Bengio, “Learning phrase representations using RNN encoder–decoder for statistical machine translation,” in Proc. of EMNLP
2014
Earlier work this paper cites.
N. Srivastava, G. Hinton, A. Krizhevsky, I. Sutskever, and R. Salakhutdinov, “Dropout: A simple way to prevent neural networks from overfitting,” Journal of Machine Learning Research
2014
Earlier work this paper cites.
G. E. Hinton, O. Vinyals, and J. Dean, “Distilling the knowledge in a neural network,” in Proc. of NIPS Wksp. Deep Learning
2014
Earlier work this paper cites.
O. Shamir, N. Srebro, and T. Zhang, “Communication-efficient distributed optimization using an approximate newton-type method,” in Proc. of the 31st ICML
2014
Earlier work this paper cites.
L. J. Ba and R. Caruana, “Do deep nets really need to be deep?,” in Proc. of NIPS
2014
Earlier work this paper cites.
M. Mirza and S. Osindero, “Conditional generative adversarial nets,” ArXiv preprint
2014
Earlier work this paper cites.
ITU-R M.2083, “Imt vision –ramework and overall objectives of the future development of imt for 2020 and beyond; recommendation m.5/bl/22,” tech. rep., 2015
2015
Earlier work this paper cites.
S. Lakhanpal, A. Gupta, and R. Agrawal, “Discover trending domains using fusion of supervised machine learning with natural language processing,” in Proc. of 18th Fusion
2015
Earlier work this paper cites.
A. Choromanska, M. Henaff, M. Mathieu, G. B. Arous, and Y. LeCun, “The loss surfaces of multilayer networks,” in Proc. of AISTATS
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
S. Zhang, A. Choromanska, and Y. LeCun, “Deep learning with elastic averaging SGD,” in Proc. of NIPS
2015
Earlier work this paper cites.
M. Haenggi, “The meta distribution of the SIR in poisson bipolar and cellular networks,” IEEE Transactions on Wireless Communications
2015
Earlier work this paper cites.
A. Tamar, Y. Glassner, and S. Mannor, “Optimizing the CVaR via sampling,” in Proc. of the 29th AAAI
2015
Earlier work this paper cites.
NGMN Alliance, “Recommendations for NGMN KPIs and requirements for 5G,” techreport, June 2016
2016
Earlier work this paper cites.
M. Mozaffari, W. Saad, M. Bennis, and M. Debbah, “Unmanned aerial vehicle with underlaid device-to-device communications: Performance and tradeoffs,” IEEE Transactions on Wireless Communications
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
J. Konecny, H. B. McMahan, F. X. Yu, P. Richtarik, A. T. Suresh, and D. Bacon, “Federated learning: strategies for improving communication efficiency,” in Proc. of NIPS Wksp. PMPML
2016
Earlier work this paper cites.
3GPP TS 22.891, “Feasibility study on new services and markets technology enablers,” Tech. Rep. 22.891 Rel-14, Sept. 2016
2016
Earlier work this paper cites.
MIT Press, 2016
I. Goodfellow, Y. Bengio, and A. Courville, Deep Learning · 2016
Earlier work this paper cites.
C-W. Huang, S. S. S. Narayanan, “Flow of Renyi information in deep neural networks,” in Proc. of IEEE MLSP
2016
Earlier work this paper cites.
J. Chen, R. Monga, S. Bengio, and R. Jozefowicz, “Revisiting distributed synchronous SGD,” in in Proc. ICLR
2016
Earlier work this paper cites.
P. H. Jin, Q. Yuan, F. Iandola, and K. KeutzerÂŽ, “How to scale distributed deep learning?,” in Proc. of NIPS Wksp. SysML
2016
Earlier work this paper cites.
S. Han, H. Mao, and W. J. Dally, “Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding,” in Proc. of ICLR
2016
Earlier work this paper cites.
Y. Wang, M. Sheng, X. Wang, L. Wang, and J. Li, “Mobile-edge computing: Partial computation offloading using dynamic voltage scaling,” IEEE Transactions on Communications
2016
Earlier work this paper cites.
J. Park, S.-L. Kim, and J. Zander, “Tractable resource management with uplink decoupled millimeter-wave overlay in ultra-dense cellular networks,” IEEE Transactions on Wireless Communications
2016
Earlier work this paper cites.
B. London, B. Huang, and L. Getoor, “Stability and generalization in structured prediction,” The Journal of Machine Learning Research
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
J. Park, S. Jung, S.-L. Kim, M. Bennis, and M. Debbah, “User-centric mobility management in ultra-dense cellular networks under spatio-temporal dynamics,” in Proc. of IEEE GLOBECOM
2016
Earlier work this paper cites.
G. Montavon, K.-R. Müller, and M. Cuturi, “Wasserstein training of restricted boltzmann machines,” in Proc. of NIPS
2016
Earlier work this paper cites.
V. Mnih, A. P. Badia, M. Mirza, A. Graves, T. Lillicrap, T. Harley, D. Silver, and K. Kavukcuoglu, “Asynchronous methods for deep reinforcement learning,” in Proc. of The 33rd ICML
2016
Earlier work this paper cites.
3GPP TR 38.801, “Study on new radio access technology: Radio access architecture and interfaces,” Tech. Rep. 38.801 Rel-14, Mar. 2017
2017
Earlier work this paper cites.
U. Aiman and V. P. Vishwakarma, “Face recognition using modified deep learning neural network,” in Proc. of 8th ICCCNT
2017
Cited alongside, same era.
L. Wan, N. Liu, H. Huo, and T. Fang, “Face recognition with convolutional neural networks and subspace learning,” in Proc. of 2nd ICIVC
2017
Cited alongside, same era.
N. G. Maity and S. Das, “Machine learning for improved diagnosis and prognosis in healthcare,” in Proc. of IEEE Aerospace Conference
2017
Cited alongside, same era.
P. Yang and Y. Chen, “A survey on sentiment analysis by using machine learning methods,” in Proc. of IEEE ITNEC
2017
Cited alongside, same era.
ABI Research and Qualcomm, “Augmented and virtual reality: The first wave of 5g killer apps,” white paper, Feb. 2017
2017
Cited alongside, same era.
L. Zhao, X. Chi, and Y. Zhu, “Martingales-based energy-efficient D-ALOHA algorithms for MTC networks with delay-insensitive/URLLC terminals co-existence,” IEEE Internet of Things Journal
2018
Closest in time.
W. Guan, X. Wen, L. Wang, Z. Lu, and Y. Shen, “A service-oriented deployment policy of end-to-end network slicing based on complex network theory,” IEEE Access
2018
Closest in time.
P. Popovski, K. F. Trillingsgaard, O. Simeone, and G. Durisi, “5G wireless network slicing for eMBB, URLLC, and mMTC: A communication-theoretic view,” IEEE Access
2018
Closest in time.
3GPP TS 22.261, “Service requirements for the 5g system; stage 1,” Tech. Rep. 22.261 Rel-14, Sept. 2018
2018
Closest in time.
M. Mozaffari, W. Saad, M. Bennis, and M. Debbah, “Communications and control for wireless drone-based antenna array,” accepted in the IEEE Transactions on Communications
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. Kagawa, F. Ono, L. Shan, K. Takizawa, R. Miura, H. Li, F. Kojima, and S. Kato, “A study on latency-guaranteed multi-hop wireless communication system for control of robots and drones,” in Proc. of 20th WPMC
2017
Cited alongside, same era.
H. B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-efficient learning of deep networks from decentralized data,” in Proc. of AISTATS
2017
Cited alongside, same era.
O. Naparstek and K. Cohen, “Deep multi-user reinforcement learning for dynamic spectrum access in multichannel wireless networks,” in Proc. of IEEE GLOBECOM
2017
Cited alongside, same era.
3GPP TS 38.802, “Study on new radio access technology physical layer aspects,” Tech. Rep. 38.802 Rel-14, Sept. 2017
2017
Cited alongside, same era.
ITU, “Minimum requirements related to technical performance for IMT-2020 radio interface(s),” Tech. Rep. ITU-R M.2410-0, International Telecommunication Union, Nov. 2017
2017
Cited alongside, same era.
Z. Wu, F. Zhao, and X. Liu, “Signal space diversity aided dynamic multiplexing for eMBB and URLLC traffics,” in Proc. of IEEE ICCC
2017
Cited alongside, same era.
S. Lien, S. Hung, D. Deng, and Y. J. Wang, “Efficient ultra-reliable and low latency communications and massive machine-type communications in 5G new radio,” in Proc. of IEEE GLOBECOM
2017
Cited alongside, same era.
2018
Closest in time.
Advances in Wireless Communication and Networking for Cooperating Autonomous Systems
E. Yanmaz, S. Yahyanejad, B. Rinner, H. Hellwagner, and C. Bettstetter, “Drone networks: Communications, coordination, and sensing,” Ad Hoc Networks · 2018
Closest in time.
M. Aljehani and M. Inoue, “Communication and autonomous control of multi-UAV system in disaster response tasks,” in Proc. of AAMAS
2018
Closest in time.
T. K. Vu, M. Bennis, M. Debbah, M. Latva-aho, and C. S. Hong, “Ultra-reliable communication in 5g mmwave networks: A risk-sensitive approach,” IEEE Communications Letters
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
A. M. Saxe, Y. Bansal, J. Dapello, M. Advani, A. Kolchinsky, B. D. Tracey, and D. D. Cox, “On the information bottleneck theory of deep learning,” in Proc. of ICLR
2018
Closest in time.
2018
Closest in time.
H. Li, Z. Xu, G. Taylor, C. Studer, and T. Goldstein, “Visualizing the loss landscape OF neural nets,” in Proc. of Advances in NIPS 31
2018
Closest in time.
F. Draxler, K. Veschgini, M. Salmhofer, and F. A. Hamprecht, “Essentially no barriers in neural network energy landscape,” in Proc. of ICML
2018
Closest in time.
https://www.7-cpu.com/cpu/skylake\textunderscorex.html
7-CPU, “Intel Skylake X.” [online, Accessed: 2018-12-04] · 2018
Closest in time.
https://www.anandtech.com/show/8104/intel-ssd-dc-p3700-review-the-pcie-ssd-transition-begins-with-nvme
AnandTech, “Intel SSD DC P3700 Review.” [online, Accessed: 2018-12-04] · 2018
Closest in time.
S. Narang et. al., “Mixed precision training,” in Proc. of ICLR
2018
Closest in time.
2018
Closest in time.
G. K. Dziugaite and D. M. Roy, “Entropy-SGD optimizes the prior of a PAC-Bayes bound: Generalization properties of entropy-SGD and data-dependent priors,” in Proc. of ICML
2018
Closest in time.
http://mathworld.wolfram.com/FractionalChromaticNumber.html
E. W. Weisstein, “Fractional chromatic number.” [online, Accessed: 2018-12-04] · 2018
Closest in time.
G. K. Dziugaite and D. M. Roy, “Data-dependent PAC-Bayes priors via differential privacy,” in Proc. of NIPS
2018
Closest in time.
2018
Closest in time.
S. Stanko, “Risk-averse distributional reinforcement learning,” Master’s thesis, Czech Technical University, May 2018
2018
Closest in time.
2018
Closest in time.
T.-W. Weng, H. Zhang, P.-Y. Chen, J. Yi, D. Su, Y. Gao, C.-J. Hsieh, and L. Daniel, “Evaluating the robustness of neural networks: An extreme value theory approach,” in Proc. of ICLR
2018
Closest in time.
E. M. Rudd, L. P. Jain, W. J. Scheirer, and T. E. Boult, “The extreme value machine,” IEEE Transactions on Pattern Analysis and Machine Intelligence
2018
Closest in time.
P. Khadivi, R. Tandon, and N. Ramakrishnan, “Flow of information in feed-forward deep neural networks,” in Proc. of ICCI*CC
2018
Closest in time.
F. Liu, “Generalized gaussian mechanism for differential privacy,” IEEE Transactions on Knowledge and Data Engineering
2018
Closest in time.
H. Kim, J. Park, M. Bennis, and S.-L. Kim, “Massive UAV-to-ground communication and its stable movement control: A mean-field approach,” in Proc. of IEEE SPAWC
2018
Closest in time.
Y. Yang, R. Luo, M. Li, M. Zhou, W. Zhang, and J. Wang, “Mean field multi-agent reinforcement learning,” in Proc. of the 35th ICML
2018
Closest in time.
H. Seo, J. Park, M. Bennis, and W. Choi, “Consensus-before-talk: Distributed dynamic spectrum access via distributed spectrum ledger technology,” in Proc. of DySPAN
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
R. Anil, G. Pereyra, A. Passos, R. Ormandi, G. E. Dahl, and G. E. Hinton, “Large scale distributed neural network training through online distillation,” ArXiv preprint
2018
Closest in time.
2018
Closest in time.
S. Srinivas and F. Fleuret, “Knowledge transfer with Jacobian matching,” in Proc. of ICML
2018
Closest in time.
T. Bansal, J. Pachocki, S. Sidor, I. Sutskever, and I. Mordatch, “Emergent complexity via multi-agent competition,” in Proc. of ICLR
2018
Closest in time.
S. U. Stich, J.-B. Cordonnier, and M. Jaggi, “Sparsified SGD with memory,” in Proc. of Advances in NIPS
2018
Closest in time.
T. Chen, G. Giannakis, T. Sun, and W. Yin, “LAG: Lazily aggregated gradient for communication-efficient distributed learning,” in Proc. of Advances in NIPS
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
X. Cao, F. Wang, J. Xu, R. Zhang, and S. Cui, “Joint computation and communication cooperation for mobile edge computing,” in Proc. of 16th WiOpt
2018
Closest in time.
J. McInerney, B. Lacker, S. Hansen, K. Higley, H. Bouchard, A. Gruson, and R. Mehrotra, “Explore, exploit, and explain: Personalizing explainable recommendations with bandits,” in Proc. of the 12th ACM RecSys
2018
Closest in time.
D. Lee, D. Ahm, T. Kim, and P. I. C. and. J-J. Kim, “Viterbi-based pruning for sparse matrix with fixed and high index compression ratio,” in Proc. of ICLR
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
https://bitcoin.org/bitcoin.pdf
S. Nakamoto, “Bitcoin: A peer-to-peer electronic cash system.” [online, Accessed: 2018-12-04] · 2018
Closest in time.
M. S. Elbamby, C. Perfecto, M. Bennis, and K. Doppler, “Edge computing meets millimeter-wave enabled VR: Paving the way to cutting the cord,” in Proc. of IEEE WCNC [accepted]
2018
Closest in time.
2018
Closest in time.
E. Balevi and J. G. Andrews, “One-bit OFDM receivers via deep learning,” IEEE Transactions on Communications
2019
Closest in time.
M. Rebato, J. Park, P. Popovski, E. D. Carvalho, , and M. Zorzi, “Stochastic geometric coverage analysis in mmWave cellular networks with realistic channel and antenna radiation models,” IEEE Transactions on Communications
2019
Closest in time.
X. Li, A. Alkhateeb, and C. Tepedelenlioglu, “Generative adversarial estimation of channel covariance in vehicular millimeter wave systems,” in Proc. of ACSSC 2018
2019
Closest in time.
Y. Wang, M. Narasimha, and R. W. H. Jr, “MmWave beam prediction with situational awareness: A machine learning approach,” IEEE Access
2019
Closest in time.
M. Chen, U. Challita, W. Saad, C. Yin, and M. Debbah, “Machine learning for wireless networks with artificial intelligence: A tutorial on neural networks,” IEEE Communications Surveys & Tutorials
2019
Closest in time.
2019
Closest in time.
A. Kolchinsky, B. D. Tracey, and S. V. Kuyk, “Caveats for information bottleneck in deterministic scenarios,” in Proc. of ICLR
2019
Closest in time.
A. Elgabli, M. Bennis, and V. Aggarwal, “Fast and communication efficient distributed machine learning for 5g and beyond,” in Proc. of Globecom [accepted]
2019
Closest in time.
M. Wang, C.-C. Huang, and J. Li, “Supporting very large models using automatic dataflow graph partitioning,” in Proc. of 14th EuroSys Conference
2019
Closest in time.
F. Schuiki, M. Schaffner, F. K. Gürkaynak, and L. Benini, “A scalable near-memory architecture for training deep neural networks on large in-memory datasets,” IEEE Transactions on Computing
2019
Closest in time.
M. S. Elbamby, C. Perfecto, C. Liu, J. Park, S. Samarakoon, X. Chen, and M. Bennis, “Wireless edge computing with latency and reliability guarantees,” Proceedings of the IEEE
2019
Closest in time.
G. Peyré and M. Cuturi, “Computational optimal transport,” Foundations and Trends in Machine Learning
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
Q. Yang, Y. Liu, T. Chen, and Y. Tong, “Federated machine learning: Concept and applications,” ACM Transactions on Intelligent Systems and Technology
2019
Closest in time.
P. Vepakomma, O. G. A. Dubey, and R. Raskar, “Reducing leakage in distributed deep learning for sensitive health data,” in Proc. of ICLR
2019
Closest in time.