{"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/vlm-task-agnostic-video-language-model-pre","title":"VLM: Task-agnostic Video-Language Model Pre-training for Video Understanding","arxiv_id":"2105.09996","date":"2021-05-20","proceeding":"Findings (ACL) 2021 8","authors":["Hu Xu","Gargi Ghosh","Po-Yao Huang","Prahal Arora","Masoumeh Aminzadeh","Christoph Feichtenhofer","Florian Metze","Luke Zettlemoyer"],"abstract":"We present a simplified, task-agnostic multi-modal pre-training approach that can accept either video or text input, or both for a variety of end tasks. Existing pre-training are task-specific by adopting either a single cross-modal encoder that requires both modalities, limiting their use for retrieval-style end tasks or more complex multitask learning with two unimodal encoders, limiting early cross-modal fusion. We instead introduce new pretraining masking schemes that better mix across modalities (e.g. by forcing masks for text to predict the closest video embeddings) while also maintaining separability (e.g. unimodal predictions are sometimes required, without using all the input). Experimental results show strong performance across a wider range of tasks than any previous methods, often outperforming task-specific pre-training. Code is made available at https://github.com/pytorch/fairseq/tree/main/examples/MMPT.","url_abs":"https://arxiv.org/abs/2105.09996v3","url_pdf":"https://arxiv.org/pdf/2105.09996v3.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":"vlm-task-agnostic-video-language-model-pre","repo_url":"https://github.com/pytorch/fairseq","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"action-segmentation","task_name":"Action Segmentation"},{"task_slug":"language-modeling","task_name":"Language Modeling"},{"task_slug":"language-modelling","task_name":"Language Modelling"},{"task_slug":"retrieval","task_name":"Retrieval"},{"task_slug":"action-recognition","task_name":"Temporal Action Localization"},{"task_slug":"video-captioning","task_name":"Video Captioning"},{"task_slug":"video-retrieval","task_name":"Video Retrieval"},{"task_slug":"video-understanding","task_name":"Video Understanding"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/action-segmentation-on-coin","task":"Action Segmentation","dataset":"COIN","model":"VLM","rank_in_archive_order":5,"of":9,"metrics":{"Frame accuracy":"68.4"},"uses_additional_data":true},{"leaderboard":"/sota/temporal-action-localization-on-crosstask","task":"Temporal Action Localization","dataset":"CrossTask","model":"VLM","rank_in_archive_order":2,"of":7,"metrics":{"Recall":"46.5"},"uses_additional_data":true},{"leaderboard":"/sota/video-captioning-on-youcook2","task":"Video Captioning","dataset":"YouCook2","model":"VLM","rank_in_archive_order":5,"of":14,"metrics":{"BLEU-3":"17.78","BLEU-4":"12.27","CIDEr":"1.3869","METEOR":"18.22","ROUGE-L":"41.51"},"uses_additional_data":true},{"leaderboard":"/sota/video-retrieval-on-msr-vtt-1ka","task":"Video Retrieval","dataset":"MSR-VTT-1kA","model":"VLM","rank_in_archive_order":52,"of":63,"metrics":{"text-to-video Median Rank":"4","text-to-video R@1":"28.10","text-to-video R@10":"67.40","text-to-video R@5":"55.50"},"uses_additional_data":true},{"leaderboard":"/sota/video-retrieval-on-youcook2","task":"Video Retrieval","dataset":"YouCook2","model":"VLM","rank_in_archive_order":7,"of":16,"metrics":{"text-to-video Median Rank":"4","text-to-video R@1":"27.05","text-to-video R@10":"69.38","text-to-video R@5":"56.88"},"uses_additional_data":true}],"syntology":{"syntology_url":"https://syntology.ai/paper/2105.09996","atlas_url":"https://app.syntology.ai/?focus=2105.09996","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":"2105.09996"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2105.09996\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2105.09996"},"call":"get_concepts_for_paper(arxiv_id=\"2105.09996\")"}],"by_repo":[{"repo":"pytorch/fairseq","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":3,"harvested_for":["2105.08206","2105.14850","2203.09163"],"harvested_for_calls":[{"arxiv_id":"2105.08206","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.08206"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.08206\")"},{"arxiv_id":"2105.14850","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.14850"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.14850\")"},{"arxiv_id":"2203.09163","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.09163"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.09163\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"5a06f0a74ab43163754d60a5ea9825d95f49f7bfaf930e34f321b0ab7c17aec1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}