{"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/text-embeddings-by-weakly-supervised","title":"Text Embeddings by Weakly-Supervised Contrastive Pre-training","arxiv_id":"2212.03533","date":"2022-12-07","proceeding":null,"authors":["Liang Wang","Nan Yang","Xiaolong Huang","Binxing Jiao","Linjun Yang","Daxin Jiang","Rangan Majumder","Furu Wei"],"abstract":"This paper presents E5, a family of state-of-the-art text embeddings that transfer well to a wide range of tasks. The model is trained in a contrastive manner with weak supervision signals from our curated large-scale text pair dataset (called CCPairs). E5 can be readily used as a general-purpose embedding model for any tasks requiring a single-vector representation of texts such as retrieval, clustering, and classification, achieving strong performance in both zero-shot and fine-tuned settings. We conduct extensive evaluations on 56 datasets from the BEIR and MTEB benchmarks. For zero-shot settings, E5 is the first model that outperforms the strong BM25 baseline on the BEIR retrieval benchmark without using any labeled data. When fine-tuned, E5 obtains the best results on the MTEB benchmark, beating existing embedding models with 40x more parameters.","url_abs":"https://arxiv.org/abs/2212.03533v2","url_pdf":"https://arxiv.org/pdf/2212.03533v2.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":"text-embeddings-by-weakly-supervised","repo_url":"https://github.com/microsoft/unilm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"mteb-benchmark","task_name":"MTEB Benchmark"},{"task_slug":"task-1-grouping","task_name":"Only Connect Walls Dataset Task 1 (Grouping)"},{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/task-1-grouping-on-ocw","task":"Only Connect Walls Dataset Task 1 (Grouping)","dataset":"OCW","model":"E5 (BASE)","rank_in_archive_order":11,"of":22,"metrics":{" Wasserstein Distance (WD)":"83.8 ± .6","# Correct Groups":"89 ± 6","# Solved Walls":" 1 ± 0","Adjusted Mutual Information (AMI)":"19.5 ± .4","Adjusted Rand Index (ARI)":" 16.3 ± .4","Fowlkes Mallows Score (FMS)":"33.1 ± .3"},"uses_additional_data":true},{"leaderboard":"/sota/task-1-grouping-on-ocw","task":"Only Connect Walls Dataset Task 1 (Grouping)","dataset":"OCW","model":"E5 (LARGE)","rank_in_archive_order":13,"of":22,"metrics":{" Wasserstein Distance (WD)":"84.4 ± .7","# Correct Groups":"76 ± 5","# Solved Walls":"0 ± 0","Adjusted Mutual Information (AMI)":"18.5 ± .6","Adjusted Rand Index (ARI)":"15.4 ± .5","Fowlkes Mallows Score (FMS)":"32.3 ± .4"},"uses_additional_data":true}],"syntology":{"syntology_url":"https://syntology.ai/paper/2212.03533","atlas_url":"https://app.syntology.ai/?focus=2212.03533","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":"2212.03533"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2212.03533\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2212.03533"},"call":"get_concepts_for_paper(arxiv_id=\"2212.03533\")"}],"by_repo":[{"repo":"microsoft/unilm","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["2002.12804","2106.08254","2203.00555","2601.23174"],"harvested_for_calls":[{"arxiv_id":"2002.12804","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2002.12804"},"call":"get_harvested_code_for_paper(arxiv_id=\"2002.12804\")"},{"arxiv_id":"2106.08254","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.08254"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.08254\")"},{"arxiv_id":"2203.00555","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.00555"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.00555\")"},{"arxiv_id":"2601.23174","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2601.23174"},"call":"get_harvested_code_for_paper(arxiv_id=\"2601.23174\")"}]}],"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":"37d45f4fa985e6d30de40f4df4362a59f31dc2aa88f57f470c21ce0cb583fec5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}