{"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/constrained-size-tensorflow-models-for","title":"Constrained-size Tensorflow Models for YouTube-8M Video Understanding Challenge","arxiv_id":"1808.06739","date":"2018-08-21","proceeding":null,"authors":["Tianqi Liu","Bo Liu"],"abstract":"This paper presents our 7th place solution to the second YouTube-8M video\nunderstanding competition which challenges participates to build a\nconstrained-size model to classify millions of YouTube videos into thousands of\nclasses. Our final model consists of four single models aggregated into one\ntensorflow graph. For each single model, we use the same network architecture\nas in the winning solution of the first YouTube-8M video understanding\ncompetition, namely Gated NetVLAD. We train the single models separately in\ntensorflow's default float32 precision, then replace weights with float16\nprecision and ensemble them in the evaluation and inference stages., achieving\n48.5% compression rate without loss of precision. Our best model achieved\n88.324% GAP on private leaderboard. The code is publicly available at\nhttps://github.com/boliu61/youtube-8m","url_abs":"http://arxiv.org/abs/1808.06739v3","url_pdf":"http://arxiv.org/pdf/1808.06739v3.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":"constrained-size-tensorflow-models-for","repo_url":"https://github.com/boliu61/youtube-8m","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"constrained-size-tensorflow-models-for","repo_url":"https://github.com/TerenceLiu4444/Kaggle-solutions","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"video-understanding","task_name":"Video Understanding"}],"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":"boliu61/youtube-8m","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"TerenceLiu4444/Kaggle-solutions","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":"3e0c0655ccdc2c173f7883f4e43d6f5e11f0a27dc9cb30cd15b24f4d28cd41f9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}