{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:29:37Z","timestamp":1772908177085,"version":"3.50.1"},"reference-count":61,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61625203"],"award-info":[{"award-number":["61625203"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61832013"],"award-info":[{"award-number":["61832013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2017YFB0801701"],"award-info":[{"award-number":["2017YFB0801701"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1109\/tnet.2020.3048666","type":"journal-article","created":{"date-parts":[[2021,1,22]],"date-time":"2021-01-22T22:48:32Z","timestamp":1611355712000},"page":"723-736","source":"Crossref","is-referenced-by-count":27,"title":["Practically Deploying Heavyweight Adaptive Bitrate Algorithms With Teacher-Student Learning"],"prefix":"10.1109","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2009-7180","authenticated-orcid":false,"given":"Zili","family":"Meng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaning","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7228-4968","authenticated-orcid":false,"given":"Yixin","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minhu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7982-8892","authenticated-orcid":false,"given":"Jia","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4847-4585","authenticated-orcid":false,"given":"Mingwei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2480-2350","authenticated-orcid":false,"given":"Chen","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8710-247X","authenticated-orcid":false,"given":"Hongxin","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","year":"2020","journal-title":"Recommended Upload Encoding Settings—YouTube Help"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2601087"},{"key":"ref33","first-page":"627","article-title":"A reduction of imitation learning and structured prediction to no-regret online learning","author":"ross","year":"2011","journal-title":"Proc 14th Int Conf Artif Intell Statist (AISTATS)"},{"key":"ref32","author":"friedman","year":"1984","journal-title":"Classification and Regression Trees"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00034-4"},{"key":"ref30","first-page":"5045","article-title":"Programmatically interpretable reinforcement learning","author":"verma","year":"2018","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230556"},{"key":"ref36","first-page":"402","article-title":"Overfitting in neural nets: Backpropagation, conjugate gradient, and early stopping","author":"caruana","year":"2001","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2483977.2483991"},{"key":"ref34","year":"2020","journal-title":"Raw Data—Measuring Broadband America"},{"key":"ref60","article-title":"Real-world video adaptation with reinforcement learning","author":"mao","year":"2019","journal-title":"Proc ICML Reinforcement Learn Real Life Workshop"},{"key":"ref61","first-page":"801","article-title":"On the generalization ability of online strongly convex programming algorithms","author":"kakade","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref28","year":"2020","journal-title":"Official Youtube Blog With Nearly 2 Million Concurrent Viewers and Over 3 Million Live Watch Hours First Presidential Debate Breaks Political Record"},{"key":"ref27","year":"2020","journal-title":"Tsenart\/Vegeta Http Load Testing Tool and Library it’s Over 9000!"},{"key":"ref29","author":"rosset","year":"2020","journal-title":"Turing-NLG A 17-Billion-Parameter Language Model by Microsoft"},{"key":"ref2","year":"2020","journal-title":"Mobile Accounted for 62 Percent of Online Video Views"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3343031.3350866"},{"key":"ref20","first-page":"2494","article-title":"Verifiable reinforcement learning via policy extraction","author":"bastani","year":"2018","journal-title":"Proc NeurIPS"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2398776.2398799"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3343031.3356083"},{"key":"ref24","first-page":"131","article-title":"C3: Internet-scale control plane for video quality optimization","author":"ganjam","year":"2015","journal-title":"Proc 12th USENIX Symp Netw Syst Design Implement (NSDI)"},{"key":"ref23","first-page":"1","article-title":"Tensorflow. Js: Machine learning for the Web and beyond","author":"smilkov","year":"2019","journal-title":"Proc SysML"},{"key":"ref26","year":"2020","journal-title":"Tornado Web Server"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2910017.2910596"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2016.2616357"},{"key":"ref51","first-page":"1","article-title":"Pruning filters for efficient convnets","author":"li","year":"2017","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342080"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/3341216.3342218"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405859"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3341216.3342210"},{"key":"ref55","first-page":"3223","article-title":"Deep Q-learning from demonstrations","author":"hester","year":"2018","journal-title":"Proc AAAI"},{"key":"ref54","first-page":"1","article-title":"Guided policy search","author":"levine","year":"2013","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2934906"},{"key":"ref52","first-page":"2285","article-title":"Compressing neural networks with the hashing trick","author":"chen","year":"2015","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1943552.1943572"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2413176.2413189"},{"key":"ref40","first-page":"417","article-title":"Mahimahi: Accurate record- and-replay for HTTP","author":"netravali","year":"2015","journal-title":"Proc USENIX Annu Tech Conf (ATC)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140405"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2910017.2910593"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626296"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/PV.2013.6691442"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3123266.3123284"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3343031.3351014"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939778"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243792"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230558"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098843"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3204949.3204953"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524428"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787486"},{"key":"ref7","first-page":"645","article-title":"Neural adaptive content-aware Internet video delivery","author":"yeo","year":"2018","journal-title":"Proceedings of the 5th USENIX Symposium on Operating Systems Design and Implementation (OSDI)"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/2750858.2804262"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2018.00026"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011418"},{"key":"ref45","first-page":"3315","article-title":"Equality of opportunity in supervised learning","author":"hardt","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486025"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2525862"},{"key":"ref42","first-page":"42","article-title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks","author":"frankle","year":"2019","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref41","year":"2020","journal-title":"Chrome Devtools"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956813"},{"key":"ref43","first-page":"1057","article-title":"Policy gradient methods for reinforcement learning with function approximation","author":"sutton","year":"1999","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/9405508\/09334431.pdf?arnumber=9334431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,14]],"date-time":"2021-10-14T01:14:43Z","timestamp":1634174083000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9334431\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":61,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2020.3048666","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4]]}}}