{"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/inference-with-reference-lossless","title":"Inference with Reference: Lossless Acceleration of Large Language Models","arxiv_id":"2304.04487","date":"2023-04-10","proceeding":null,"authors":["Nan Yang","Tao Ge","Liang Wang","Binxing Jiao","Daxin Jiang","Linjun Yang","Rangan Majumder","Furu Wei"],"abstract":"We propose LLMA, an LLM accelerator to losslessly speed up Large Language Model (LLM) inference with references. LLMA is motivated by the observation that there are abundant identical text spans between the decoding result by an LLM and the reference that is available in many real world scenarios (e.g., retrieved documents). LLMA first selects a text span from the reference and copies its tokens to the decoder and then efficiently checks the tokens' appropriateness as the decoding result in parallel within one decoding step. The improved computational parallelism allows LLMA to achieve over 2x speed-up for LLMs with identical generation results as greedy decoding in many practical generation scenarios where significant overlap between in-context reference and outputs exists (e.g., search engines and multi-turn conversations).","url_abs":"https://arxiv.org/abs/2304.04487v1","url_pdf":"https://arxiv.org/pdf/2304.04487v1.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":"inference-with-reference-lossless","repo_url":"https://github.com/microsoft/LMOps/tree/main/llma","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"jax","reach":null},{"paper_slug":"inference-with-reference-lossless","repo_url":"https://github.com/niyunsheng/ems-sd","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"language-modeling","task_name":"Language Modeling"},{"task_slug":"language-modelling","task_name":"Language Modelling"},{"task_slug":"large-language-model","task_name":"Large Language Model"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2304.04487","atlas_url":"https://app.syntology.ai/?focus=2304.04487","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":"2304.04487"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2304.04487\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2304.04487"},"call":"get_concepts_for_paper(arxiv_id=\"2304.04487\")"}],"by_repo":[{"repo":"microsoft/LMOps","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":5,"harvested_for":["2212.09611","2305.03495","2309.09530","2402.03898","2406.14491"],"harvested_for_calls":[{"arxiv_id":"2212.09611","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2212.09611"},"call":"get_harvested_code_for_paper(arxiv_id=\"2212.09611\")"},{"arxiv_id":"2305.03495","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.03495"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.03495\")"},{"arxiv_id":"2309.09530","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2309.09530"},"call":"get_harvested_code_for_paper(arxiv_id=\"2309.09530\")"},{"arxiv_id":"2402.03898","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2402.03898"},"call":"get_harvested_code_for_paper(arxiv_id=\"2402.03898\")"},{"arxiv_id":"2406.14491","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2406.14491"},"call":"get_harvested_code_for_paper(arxiv_id=\"2406.14491\")"}]},{"repo":"niyunsheng/ems-sd","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"ddf270c95d673807c1408789e3a0010de2c606e88b31980aaffd162734a5d12a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}