{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:12:30Z","timestamp":1742922750779,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030708658"},{"type":"electronic","value":"9783030708665"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-70866-5_12","type":"book-chapter","created":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T16:03:57Z","timestamp":1614701037000},"page":"184-203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Resource Allocation Algorithms for Cellular Networks"],"prefix":"10.1007","author":[{"given":"Thi Thuy Nga","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Brun","sequence":"additional","affiliation":[]},{"given":"Balakrishna J.","family":"Prabhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,3]]},"reference":[{"key":"12_CR1","unstructured":"MOSEK ApS: MOSEK optimizer API for Python manual. Version 9.2.21 (2019)"},{"key":"12_CR2","unstructured":"Chollet, F., et al.: Keras (2015). https:\/\/github.com\/fchollet\/keras"},{"issue":"4","key":"12_CR3","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02551274","volume":"2","author":"G Cybenko","year":"1989","unstructured":"Cybenko, G.: Approximation by superpositions of a sigmoidal function. Math. Control Sig. Syst. 2(4), 303\u2013314 (1989). https:\/\/doi.org\/10.1007\/BF02551274","journal-title":"Math. Control Sig. Syst."},{"issue":"83","key":"12_CR4","first-page":"1","volume":"17","author":"S Diamond","year":"2016","unstructured":"Diamond, S., Boyd, S.: CVXPY: a Python-embedded modeling language for convex optimization. J. Mach. Learn. Res. 17(83), 1\u20135 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"12_CR5","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT Press (2016). http:\/\/www.deeplearningbook.org"},{"key":"12_CR6","unstructured":"Gregor, K., LeCun, Y.: Learning fast approximations of sparse coding. In: Proceedings of the 27th International Conference on International Conference on Machine Learning, ICML 2010, Madison, WI, USA, pp. 399\u2013406. Omnipress (2010)"},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0893-6080(91)90009-T","volume":"4","author":"K Hornik","year":"1991","unstructured":"Hornik, K.: Approximation capabilities of multilayer feedforward networks. Neural Netw. 4(2), 251\u2013257 (1991)","journal-title":"Neural Netw."},{"issue":"5","key":"12_CR8","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0893-6080(89)90020-8","volume":"2","author":"K Hornik","year":"1989","unstructured":"Hornik, K., Stinchcombe, M., White, H.: Multilayer feedforward networks are universal approximators. Neural Netw. 2(5), 359\u2013366 (1989)","journal-title":"Neural Netw."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/T-WC.2009.071266","volume":"8","author":"J Huang","year":"2009","unstructured":"Huang, J., Subramanian, V., Agrawal, R., Berry, R.: Downlink scheduling and resource allocation for OFDM systems. IEEE Trans. Wirel. Commun. 8, 288\u2013296 (2009)","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1002\/ett.4460080106","volume":"8","author":"F Kelly","year":"1997","unstructured":"Kelly, F.: Charging and rate control for elastic traffic. Eur. Trans. Telecommun. 8(1), 33\u201337 (1997)","journal-title":"Eur. Trans. Telecommun."},{"key":"12_CR11","unstructured":"Kingma, D., Ba, J.: Adam: a method for stochastic optimization. In: International Conference on Learning Representations, December 2014"},{"issue":"5","key":"12_CR12","first-page":"953","volume":"114","author":"A Kolmogorov","year":"1957","unstructured":"Kolmogorov, A.: On the representation of continuous functions of many variables by superposition of continuous functions of one variable and addition. Dokl. Akad. Nauk SSSR 114(5), 953\u2013956 (1957)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1109\/TWC.2004.830826","volume":"3","author":"HJ Kushner","year":"2004","unstructured":"Kushner, H.J., Whiting, P.A.: Convergence of proportional-fair sharing algorithms under general conditions. IEEE Trans. Wirel. Commun. 3(4), 1250\u20131259 (2004)","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"12_CR14","unstructured":"Lecun, Y., Bottou, L., Orr, G., M\u00fcller, K.-R.: Efficient backprop, August 2000"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Lopez, P.A., et al.: Microscopic traffic simulation using sumo. In: The 21st IEEE International Conference on Intelligent Transportation Systems. IEEE (2018)","DOI":"10.1109\/ITSC.2018.8569938"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1109\/TNET.2014.2362928","volume":"24","author":"R Margolies","year":"2016","unstructured":"Margolies, R., et al.: Exploiting mobility in proportional fair cellular scheduling: measurements and algorithms. IEEE\/ACM Trans. Netw. 24(1), 355\u2013367 (2016)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Montanelli, H., Yang, H.: Error bounds for deep RELU networks using the Kolmogorov-Arnold superposition theorem (2019)","DOI":"10.1016\/j.neunet.2019.12.013"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-030-62885-7_9","volume-title":"Analytical and Stochastic Modelling Techniques and Applications","author":"TTN Nguyen","year":"2020","unstructured":"Nguyen, T.T.N., Brun, O., Prabhu, B.J.: An algorithm for improved proportional-fair utility for vehicular users. In: Gribaudo, M., Sopin, E., Kochetkova, I. (eds.) ASMTA 2019. LNCS, vol. 12023, pp. 115\u2013130. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62885-7_9"},{"key":"12_CR19","unstructured":"Nguyen, N., Brun, O., Prabhu, B.: Joint downlink power control and channel allocation based on a partial view of future channel conditions. In: The 15th Workshop on Resource Allocation, Cooperation and Competition in Wireless Networks, June 2020"},{"key":"12_CR20","unstructured":"Reddi, S.J., Kale, S., Kumar, S.: On the convergence of Adam and beyond. CoRR, abs\/1904.09237 (2019)"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Sun, H., Chen, X., Shi, Q., Hong, M., Fu, X., Sidiropoulos, N.D.: Learning to optimize: training deep neural networks for wireless resource management. CoRR, abs\/1705.09412 (2017)","DOI":"10.1109\/SPAWC.2017.8227766"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Sun, S., Chen, W., Wang, L., Liu, X., Liu, T.-Y.: On the depth of deep neural networks: a theoretical view. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI 2016, pp. 2066\u20132072. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10243"},{"key":"12_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807213","volume-title":"Fundamentals of Wireless Communication","author":"D Tse","year":"2005","unstructured":"Tse, D., Viswanath, P.: Fundamentals of Wireless Communication. Cambridge University Press, Cambridge (2005)"},{"key":"12_CR24","unstructured":"Wikipedia: Cross entropy, 20 June 2020. https:\/\/en.wikipedia.org\/wiki\/Cross_entropy"},{"key":"12_CR25","unstructured":"Wikipedia: Sorensen dice coefficient, 28 July 2020. https:\/\/en.wikipedia.org\/wiki\/S%C3%B8rensen%E2%80%93Dice_coefficient"},{"key":"12_CR26","unstructured":"Wikipedia: Huber loss, 29 May 2020. https:\/\/en.wikipedia.org\/wiki\/Huber_loss"},{"issue":"4","key":"12_CR27","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1002\/ett.1285","volume":"19","author":"Y Yi","year":"2008","unstructured":"Yi, Y., Chiang, M.: Stochastic network utility maximisation-a tribute to Kelly\u2019s paper published in this journal a decade ago. Eur. Trans. Telecommun. 19(4), 421\u2013442 (2008)","journal-title":"Eur. Trans. Telecommun."}],"container-title":["Lecture Notes in Computer Science","Machine Learning for Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-70866-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T19:12:42Z","timestamp":1671477162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-70866-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030708658","9783030708665"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-70866-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"3 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MLN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning for Networking","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mln2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.adda-association.org\/mln-2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}