{"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/efficient-video-classification-using-fewer","title":"Efficient Video Classification Using Fewer Frames","arxiv_id":"1902.10640","date":"2019-02-27","proceeding":"CVPR 2019 6","authors":["Shweta Bhardwaj","Mukundhan Srinivasan","Mitesh M. Khapra"],"abstract":"Recently,there has been a lot of interest in building compact models for\nvideo classification which have a small memory footprint (<1 GB). While these\nmodels are compact, they typically operate by repeated application of a small\nweight matrix to all the frames in a video. E.g. recurrent neural network based\nmethods compute a hidden state for every frame of the video using a recurrent\nweight matrix. Similarly, cluster-and-aggregate based methods such as NetVLAD,\nhave a learnable clustering matrix which is used to assign soft-clusters to\nevery frame in the video. Since these models look at every frame in the video,\nthe number of floating point operations (FLOPs) is still large even though the\nmemory footprint is small. We focus on building compute-efficient video\nclassification models which process fewer frames and hence have less number of\nFLOPs. Similar to memory efficient models, we use the idea of distillation\nalbeit in a different setting. Specifically, in our case, a compute-heavy\nteacher which looks at all the frames in the video is used to train a\ncompute-efficient student which looks at only a small fraction of frames in the\nvideo. This is in contrast to a typical memory efficient Teacher-Student\nsetting, wherein both the teacher and the student look at all the frames in the\nvideo but the student has fewer parameters. Our work thus complements the\nresearch on memory efficient video classification. We do an extensive\nevaluation with three types of models for video classification,viz.(i)\nrecurrent models (ii) cluster-and-aggregate models and (iii) memory-efficient\ncluster-and-aggregate models and show that in each of these cases, a see-it-all\nteacher can be used to train a compute efficient see-very-little student. We\nshow that the proposed student network can reduce the inference time by 30% and\nthe number of FLOPs by approximately 90% with a negligible drop in the\nperformance.","url_abs":"http://arxiv.org/abs/1902.10640v1","url_pdf":"http://arxiv.org/pdf/1902.10640v1.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":"efficient-video-classification-using-fewer","repo_url":"https://github.com/shwetabhardwaj44/EfficentVideoClassification_Youtube8M","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"video-classification","task_name":"Video Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/video-classification-on-youtube-8m","task":"Video Classification","dataset":"YouTube-8M","model":"Hierarchical LSTM with MoE","rank_in_archive_order":2,"of":3,"metrics":{"Global Average Precision":"81.1","Hit@1":"86.8","mAP":"41.4"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1902.10640","atlas_url":"https://app.syntology.ai/?focus=1902.10640","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1902.10640"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1902.10640\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1902.10640"},"call":"get_concepts_for_paper(arxiv_id=\"1902.10640\")"}],"by_repo":[{"repo":"shwetabhardwaj44/EfficentVideoClassification_Youtube8M","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":"e6a92f2edac6f5bfac364da3cf545123beacfa6c3793d2ee6e0401c86d379f03","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}