{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/towards-machine-learning-based-optimal-has","title":"Towards Machine Learning-Based Optimal HAS","arxiv_id":"1808.08065","date":"2018-08-24","proceeding":null,"authors":["Christian Sieber","Korbinian Hagn","Christian Moldovan","Tobias Hoßfeld","Wolfgang Kellerer"],"abstract":"Mobile video consumption is increasing and sophisticated video quality\nadaptation strategies are required to deal with mobile throughput fluctuations.\nThese adaptation strategies have to keep the switching frequency low, the\naverage quality high and prevent stalling occurrences to ensure customer\nsatisfaction. This paper proposes a novel methodology for the design of machine\nlearning-based adaptation logics named HASBRAIN. Furthermore, the performance\nof a trained neural network against two algorithms from the literature is\nevaluated. We first use a modified existing optimization formulation to\ncalculate optimal adaptation paths with a minimum number of quality switches\nfor a wide range of videos and for challenging mobile throughput patterns.\nAfterwards we use the resulting optimal adaptation paths to train and compare\ndifferent machine learning models. The evaluation shows that an artificial\nneural network-based model can reach a high average quality with a low number\nof switches in the mobile scenario. The proposed methodology is general enough\nto be extended for further designs of machine learning-based algorithms and the\nprovided model can be deployed in on-demand streaming scenarios or be further\nrefined using reward-based mechanisms such as reinforcement learning. All\ntools, models and datasets created during the work are provided as open-source\nsoftware.","url_abs":"http://arxiv.org/abs/1808.08065v1","url_pdf":"http://arxiv.org/pdf/1808.08065v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"towards-machine-learning-based-optimal-has","repo_url":"https://github.com/csieber/hasbrain","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"towards-machine-learning-based-optimal-has","repo_url":"https://github.com/csieber/pydashsim","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"csieber/hasbrain","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"csieber/pydashsim","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"351f7c7009e18500714737477a20aa5a7aa1585422aa3bd7b36de0944403ab44","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}