Pith. sign in

REVIEW 4 major objections 2 minor 41 references

SAGE-HLS: Syntax-Aware AST-Guided LLM for High-Level Synthesis Code Generation

T0 review · 4 major / 2 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read SAGE-HLS claims that a fine-tuned 7B model, trained on 16.7K Verilog-to-C ported designs with AST-guided prompts, generates HLS code that is nearly always synthesizable and functionally correct 75% of the time.

desk verdict As submitted, the paper cannot be reviewed: the full text is an unrelated PyLate IR paper, so every SAGE-HLS claim sits on an abstract alone. read the letter →

arxiv 2508.03558 v1 pith:Z4VFP6UR submitted 2025-08-05 cs.PL

M Zafir Sadik Khan , Nowfel Mashnoor , Mohammad Akyash , Kimia Azar , Hadi Kamali This is my paper
classification cs.PL
keywords high-levelsynthesisLLMcodegenerationVerilog-to-Cportingabstractsyntaxtreeinstructionfine-tuningsynthesizabilityfunctionalcorrectnessQwenCoder
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

High-level synthesis turns C/C++ into hardware, and this paper tries to show that a fine-tuned large language model can do that code-generation step on its own. The central claim is that SAGE-HLS, a 7B-parameter model fine-tuned on 16.7K HLS examples created by porting verified Verilog designs into C/C++, produces code that is almost always synthesizable and functionally correct about three-quarters of the time. To make that work, the authors build a Verilog-to-C/C++ porting pipeline, use instruction prompts guided by abstract syntax trees, and check outputs with a semi-automated VerilogEval-based framework. If true, this would move HLS code generation beyond prompt engineering and retrieval-augmented generation toward a dedicated fine-tuned model.

What carries the argument

The central mechanism is the pairing of a Verilog-to-C/C++ porting pipeline with AST-guided instruction fine-tuning. The porting pipeline converts verified, synthesizable Verilog designs into corresponding C/C++ code, producing a 16.7K-example training set. The fine-tuning strategy frames code generation as an instruction-prompting task in which the model must produce C/C++ code from a prompt while an abstract syntax tree guides the structure, which is how a 7B base model reaches high synthesizability. A semi-automated VerilogEval-based evaluation framework then checks whether the generated HLS code actually behaves as intended.

What would settle it

Run SAGE-HLS on a held-out suite of HLS designs that were not created by the paper's own Verilog-to-C/C++ porting process, synthesize each output with a standard HLS tool, and compare functional behavior against the original Verilog by simulation or formal equivalence; if the functional correctness rate drops well below 75% on such out-of-distribution designs, the central claim fails.

Watch

Extended reading notes

Core claim

The paper's core claim is that a relatively small fine-tuned model, QwenCoder 2.5 7B, can produce HLS code with a near-100% synthesizability rate and a 75% functional correctness rate, provided it is trained on a purpose-built HLS dataset and prompted with AST-guided instructions. The authors present this as the first fine-tuned LLM specifically trained for HLS code generation. The dataset is assembled by porting verified, synthesizable Verilog designs into equivalent C/C++, giving the model a large set of known-good input-output pairs rather than relying on general code corpora. The authors read the near-perfect synthesizability as evidence that the model has internalized HLS-specific syntax and structure, while the 75% correctness figure marks the remaining gap as semantic fidelity to the intended behavior.

Load-bearing premise

The load-bearing premise is that the Verilog-to-C/C++ porting produces C code that is correct, representative of real HLS programs, and suitable for fine-tuning, because the reported 100% and 75% success rates inherit whatever errors, omissions, or unusual coding patterns that porting process introduces.

Editorial extensions

If this is right

  • If the reported numbers hold, HLS designers could use the model to generate candidate C/C++ implementations that are very likely to compile for synthesis, saving iterations on syntax and interface errors.
  • The 16.7K Verilog-to-C/C++ ported dataset would become a reusable resource for training and benchmarking future HLS-focused language models.
  • AST-guided instruction prompting appears to be a transferable recipe for structured code-generation tasks beyond HLS.
  • The VerilogEval-based semi-automated evaluation framework gives the community a concrete way to measure the functionality, not just the syntax, of generated HLS code.
  • The wide gap between synthesizability and functional correctness implies that the next bottleneck is semantic accuracy, so future fine-tuning should target behavioral equivalence rather than compilability.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because the reported numbers come from a dataset built by the authors' own porting pipeline, the crucial transfer test is whether the model holds up on hand-written HLS code outside that pipeline; until such a test is done, the 75% figure should be read as a within-pipeline result.
  • The near-100% synthesizability with only 75% correctness suggests the model has mastered HLS syntax but often misses behavioral intent; a natural extension is training with simulation feedback or formal equivalence checking in the loop.
  • Extending the Verilog-to-C/C++ porting pipeline to include HLS pragmas and directives could turn the same method into a design-space-exploration tool that generates alternative implementations with different area and latency trade-offs.
  • The supplied full text of the manuscript is an unrelated paper, so this summary is grounded in the abstract; the detailed experimental evidence needed to audit the dataset and evaluation is not present in the provided text.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 2 minor

Summary. The submission presents an abstract claiming a new fine-tuned LLM, SAGE-HLS, for high-level synthesis (HLS) code generation, with a reported near-100% synthesizability rate and 75% functional correctness on VerilogEval. However, the supplied full text is the PyLate paper (arXiv:2508.03555, cs.IR), which describes a library for late-interaction retrieval models and contains no mention of SAGE-HLS, HLS, Verilog, or any of the claimed experiments. The manuscript as submitted therefore consists of an abstract and a body that are about entirely different papers. No methodology, dataset construction details, fine-tuning procedure, or evaluation protocol for SAGE-HLS is present, making the central claims unverifiable.

Significance. If the abstract's claims were fully supported, SAGE-HLS would be a significant contribution to EDA and HLS automation, potentially opening a new direction for fine-tuning LLMs on HLS-specific code. The idea of creating an HLS dataset via Verilog-to-C/C++ porting is interesting, and the reported performance numbers would be impressive. However, the submitted manuscript does not contain the technical content needed to validate any of these claims. The paper cannot be assessed for soundness, and its potential significance is therefore entirely conditional on a body of work that is absent from the submission.

major comments (4)
  1. [Full Text (all sections)] The full text is the PyLate paper, which is about late-interaction models for neural retrieval and is unrelated to the abstract's topic. Sections 1 through 6 of the full text discuss ColBERT, MaxSim, training libraries, and BEIR benchmarks; they never mention SAGE-HLS, high-level synthesis, Verilog, or the claimed experiments. Consequently, the central claim of the abstract—that SAGE-HLS achieves near-100% synthesizability and 75% functional correctness—is entirely unsupported by any methodology, results, or analysis in the manuscript. This is a load-bearing failure that cannot be remedied by local revision.
  2. [Abstract, dataset construction] The abstract states that the dataset is created by 'Verilog-to-C/C++ porting, converting verified and synthesizable Verilog codes into corresponding C,' yielding 16.7K HLS codes. The full text provides no details of this porting process: there is no description of the source Verilog corpus, the porting tool or rules, handling of bit-widths, control flow, loops, or memory access patterns, or insertion of HLS directives. Without these details it is impossible to assess whether the resulting C code is functionally equivalent to the Verilog, whether it follows HLS-synthesizable idioms, or whether it is representative of realistic HLS designs. The correctness of the fine-tuning data is the foundational assumption of the entire approach and is left unstated.
  3. [Abstract, evaluation framework] The abstract mentions a 'semi-automated evaluation framework using VerilogEval to assess the functionality of the generated HLS code,' but the full text contains no description of this framework. In particular, it is unknown whether functional correctness is measured by simulation against reference Verilog testbenches, whether the testbenches are held out from the training data, how synthesizability is checked, or whether the reported 75% figure is a single-run point estimate or an average over multiple runs. This makes the headline numbers uninterpretable and impossible to reproduce.
  4. [Abstract, novelty claim] The abstract claims SAGE-HLS is 'the first-of-its-kind fine-tuned LLM specifically for HLS code generation.' The full text provides no comparison to prior work, such as existing HLS-oriented LLM approaches, prompt-engineering methods, or RAG-based systems. Without a literature context and comparative experiments, this novelty claim cannot be evaluated.
minor comments (2)
  1. [Abstract] There is a typo: 'fined-tuned' should be 'fine-tuned'.
  2. [Abstract] The abstract refers to 'QwenCoder (2.5) 7B' without a citation or version identifier; providing the exact model name and a reference would help reproducibility.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity identified; the supplied full text is an unrelated PyLate paper, so SAGE-HLS claims cannot be checked at all.

full rationale

The abstract of arXiv:2508.03558 claims that SAGE-HLS, a fine-tuned LLM for HLS code generation, achieves near 100% synthesizability and 75% functional correctness, using a dataset built by Verilog-to-C/C++ porting and an AST-guided fine-tuning strategy. However, the actual full text supplied is the PyLate paper (cs.IR) on late interaction retrieval, which does not mention SAGE-HLS, Verilog, HLS, or any of the abstract's methodology. Because the full text is absent, there is no derivational chain of equations, fitted parameters, training details, or evaluation protocols to walk through. Circularity requires quoting the paper and exhibiting a specific reduction, such as a fitted input being renamed as a prediction or an ansatz smuggled in via self-citation. None of that can be demonstrated here. The mismatch between abstract and full text is a verifiability and integrity problem rather than a circularity problem. The skeptical concern about the Verilog-to-C porting process is a dataset-quality and external-validity concern, not a circularity concern. Therefore, the honest finding is no significant circularity, with score 0.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

From the abstract alone, we can only infer the domain assumptions listed above; no free parameters are stated. The full text is missing, so the ledger is necessarily incomplete.

assumptions (3)
  • domain assumption Verilog-to-C porting produces correct and representative HLS training data.
    Abstract states dataset is created by converting verified Verilog to C; correctness of this conversion is assumed.
  • domain assumption AST-guided fine-tuning improves HLS code generation over plain instruction tuning.
    Abstract presents AST guidance as a key contribution, but no ablation is visible to isolate its effect.
  • domain assumption VerilogEval provides a valid measure of functional correctness for generated HLS code.
    Abstract says evaluation uses a semi-automated framework based on VerilogEval; the validity of this mapping is assumed.

how reviews work

0 comments
Cite this review

Pith. "Pith review of SAGE-HLS: Syntax-Aware AST-Guided LLM for High-Level Synthesis Code Generation." pith.science (2026). https://pith.science/paper/Z4VFP6UR

@misc{pith2026250803558,
  author       = {Pith},
  title        = {Pith review of: SAGE-HLS: Syntax-Aware AST-Guided LLM for High-Level Synthesis Code Generation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/Z4VFP6UR}},
  note         = {Machine review of arXiv:2508.03558}
}
read the original abstract

In today's rapidly evolving field of electronic design automation (EDA), the complexity of hardware designs is increasing, necessitating more sophisticated automation solutions. High-level synthesis (HLS), as a pivotal solution, automates hardware designs from high-level abstractions (e.g., C/C++). However, it faces significant challenges, particularly in design space exploration and optimization. While large language models (LLMs) have shown notable capabilities in code generation, their application to HLS has been limited due to the scarcity of (publicly) available HLS code datasets. Hence, research in this domain has primarily focused on techniques such as prompt engineering and retrieval-augmented generation (RAG). To overcome this limitation, this paper introduces SAGE-HLS, the first-of-its-kind fine-tuned LLM specifically for HLS code generation. Our method includes three key advancements: (i) We implement Verilog-to-C/C++ porting, converting verified and synthesizable Verilog codes into corresponding C, creating a dataset of 16.7K HLS codes; (ii) We implement a fine-tuning strategy, which is based on instruction prompting to code generation guided by abstract syntax tree (AST); (iii) We develop a semi-automated evaluation framework using VerilogEval to assess the functionality of the generated HLS code. Our experiments show that SAGE-HLS, fined-tuned on the QwenCoder (2.5) 7B model, achieves a near 100% success rate in code synthesizability and a 75% success rate in functional correctness.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

41 extracted references · 17 canonical work pages

  1. [1]

    Elias Bassani. 2022. ranx: A Blazing-Fast Python Library for Ranking Evaluation and Comparison. In Advances in Information Retrieval - 44th European Conference on IR Research, ECIR 2022, Stavanger, Norway, April 10-14, 2022, Proceedings, Part II (Lecture Notes in Computer Science, Vol. 13186) , Matthias Hagen, Suzan Verberne, Craig Macdonald, Christin Sei...

    work page doi:10.1007/978-3-030-99739-7_30 2022

  2. [2]

    Jo Kristian Bergum. 2024. Announcing Vespa Long-Context ColBERT. https: //blog.vespa.ai/announcing-long-context-colbert-in-vespa/

    work page 2024

  3. [3]

    Antoine Chaffin. 2025. GTE-ModernColBERT. https://huggingface.co/lightonai/ GTE-ModernColBERT-v1

    2025

  4. [4]

    Antoine Chaffin. 2025. Reason-ModernColBERT. https://huggingface.co/ lightonai/Reason-ModernColBERT

    work page 2025

  5. [5]

    Jianlv Chen, Shitao Xiao, Peitian Zhang, Kun Luo, Defu Lian, and Zheng Liu

  6. [6]

    Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey Hinton. 2020. A simple framework for contrastive learning of visual representations. In Proceed- ings of the 37th International Conference on Machine Learning (ICML’20). JMLR.org, Article 149, 11 pages

    work page 2020

  7. [7]

    Benjamin Clavié. 2024. JaColBERTv2.5: Optimising Multi-Vector Retrievers to Create State-of-the-Art Japanese Retrievers with Constrained Resources. CoRR abs/2407.20750 (2024). doi:10.48550/ARXIV.2407.20750 arXiv:2407.20750

    arXiv doi:10.48550/arxiv.2407.20750 2024

  8. [8]

    Benjamin Clavié. 2024. rerankers: A Lightweight Python Library to Unify Ranking Methods. arXiv:2408.17344 [cs.IR] https://arxiv.org/abs/2408.17344

    work page Pith review arXiv 2024

Show all 41 references
  1. [9]

    Benjamin Clavié. 2024. Small but Mighty: Introducing answerai-colbert-small. https://www.answer.ai/posts/2024-08-13-small-but-mighty-colbert.html

    2024

  2. [10]

    Benjamin Clavié, Antoine Chaffin, and Griffin Adams. 2024. Reducing the Foot- print of Multi-Vector Retrieval with Minimal Performance Impact via Token Pooling. arXiv:2409.14683 [cs.IR] https://arxiv.org/abs/2409.14683

    2024 arXiv

  3. [11]

    Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In Proceedings of the 2019 Conference of the North American Chapter of the Associa- tion for Computational Linguistics: Hum...

    2019

  4. [12]

    Manuel Faysse, Hugues Sibille, Tony Wu, Bilel Omrani, Gautier Viaud, Céline Hudelot, and Pierre Colombo. 2024. Colpali: Efficient document retrieval with vision language models. In The Thirteenth International Conference on Learning Representations

    2024

  5. [13]

    Luyu Gao, Yunyi Zhang, Jiawei Han, and Jamie Callan. 2021. Scaling Deep Contrastive Learning Batch Size under Memory Limited Setup. In Proceedings of the 6th Workshop on Representation Learning for NLP (RepL4NLP-2021) , Anna Rogers, Iacer Calixto, Ivan Vulić, Naomi Saphra, Nor...

    2021 doi

  6. [14]

    Rohan Jha, Bo Wang, Michael Günther, Georgios Mastrapas, Saba Sturua, Isabelle Mohr, Andreas Koukounas, Mohammad Kalim Wang, Nan Wang, and Han Xiao

  7. [15]

    Ziwei Ji, Himanshu Jain, Andreas Veit, Sashank J Reddi, Sadeep Jayasumana, Ankit Singh Rawat, Aditya Krishna Menon, Felix Yu, and Sanjiv Kumar. 2024. Efficient Document Ranking with Learnable Late Interactions. arXiv preprint arXiv:2406.17968 (2024)

    2024 arXiv

  8. [16]

    InProceedings of the Fourth Workshop on Multilingual Representation Learn- ing (MRL 2024), Jonne Sälevä and Abraham Owodunni (Eds.)

    Jina-ColBERT-v2: A General-Purpose Multilingual Late Interaction Re- triever. InProceedings of the Fourth Workshop on Multilingual Representation Learn- ing (MRL 2024), Jonne Sälevä and Abraham Owodunni (Eds.). Association for Com- putational Linguistics, Miami, Florida, USA, ...

    2024 doi

  9. [17]

    Vladimir Karpukhin, Barlas Oguz, Sewon Min, Patrick Lewis, Ledell Wu, Sergey Edunov, Danqi Chen, and Wen-tau Yih. 2020. Dense Passage Retrieval for Open- Domain Question Answering. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, EMNLP...

    2020 doi

  10. [18]

    Reddi, Sadeep Jayasumana, Ankit Singh Rawat, Aditya Krishna Menon, Felix X

    Ziwei Ji, Himanshu Jain, Andreas Veit, Sashank J. Reddi, Sadeep Jayasumana, Ankit Singh Rawat, Aditya Krishna Menon, Felix X. Yu, and Sanjiv Kumar

  11. [19]

    CoRR abs/2406.17968 (2024)

    Efficient Document Ranking with Learnable Late Interactions. CoRR abs/2406.17968 (2024). doi:10.48550/ARXIV.2406.17968 arXiv:2406.17968

    2024 doi arXiv

  12. [20]

    Chaofan Li, Zheng Liu, Shitao Xiao, and Yingxia Shao. 2023. Making Large Lan- guage Models A Better Foundation For Dense Retrieval. arXiv:2312.15503 [cs.CL]

    2023

  13. [21]

    Omar Khattab and Matei Zaharia. 2020. ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT. In Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval, SIGIR 2020, Virtual Event, C...

    2020

  14. [22]

    Jinhyuk Lee, Zhuyun Dai, Sai Meher Karthik Duddu, Tao Lei, Iftekhar Naim, Ming-Wei Chang, and Vincent Zhao. 2023. Rethinking the Role of Token ������� �������� �������� ��� ��������� ��� ���� ����������� ������ �������� Retrieval in Multi-Vector Retrieval. In Advances in Neura...

    2023

  15. [23]

    Malkov and Dmitry A

    Yury A. Malkov and Dmitry A. Yashunin. 2020. Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs.IEEE Trans. Pattern Anal. Mach. Intell. 42, 4 (2020), 824–836. doi:10.1109/TPAMI.2018. 2889473

    2020 doi

  16. [24]

    Zehan Li, Xin Zhang, Yanzhao Zhang, Dingkun Long, Pengjun Xie, and Meishan Zhang. 2023. Towards general text embeddings with multi-stage contrastive learning. arXiv preprint arXiv:2308.03281 (2023)

    2023 arXiv

  17. [25]

    Sean MacAvaney, Andrew Yates, Sergey Feldman, Doug Downey, Arman Cohan, and Nazli Goharian. 2021. Simplified Data Wrangling with ir_datasets. In SIGIR

    2021

  18. [26]

    Saahil Ognawala and Alex Cureton-Griffiths. 2025. Long-Context Embed- ding Models are Blind Beyond 4K Tokens. https://jina.ai/news/long-context- embedding-models-are-blind-beyond-4k-tokens/

    2025

  19. [27]

    Niklas Muennighoff, Nouamane Tazi, Loïc Magne, and Nils Reimers. 2023. MTEB: Massive Text Embedding Benchmark. In Proceedings of the 17th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2023, Dubrovnik, Croatia, May 2-6, 2023 , Andreas...

    2023 doi

  20. [28]

    Morris, Brandon Duderstadt, and Andriy Mulyar

    Zach Nussbaum, John X. Morris, Brandon Duderstadt, and Andriy Mulyar

  21. [29]

    arXiv:2402.01613 [cs.CL]

    Nomic Embed: Training a Reproducible Long Context Text Embedder. arXiv:2402.01613 [cs.CL]

    arXiv

  22. [30]

    Keshav Santhanam, Omar Khattab, Jon Saad-Falcon, Christopher Potts, and Matei Zaharia. 2022. ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction. In Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational ...

    2022

  23. [31]

    Nils Reimers and Iryna Gurevych. 2019. Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks. In Proceedings of the 2019 Conference on Em- pirical Methods in Natural Language Processing . Association for Computational Linguistics. https://arxiv.org/abs/1908.10084

    2019 arXiv

  24. [32]

    Ruiyang Ren, Yingqi Qu, Jing Liu, Wayne Xin Zhao, QiaoQiao She, Hua Wu, Haifeng Wang, and Ji-Rong Wen. 2021. RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-ranking. In Proceedings of the 2021 Conference on Empirical Methods in Natural Language P...

    2021 doi

  25. [33]

    Keshav Santhanam, Omar Khattab, Christopher Potts, and Matei Zaharia. 2022. PLAID: An Efficient Engine for Late Interaction Retrieval. In Proceedings of the 31st ACM International Conference on Information & Knowledge Management (Atlanta, GA, USA) (CIKM ’22). Association for C...

    2022

  26. [34]

    Spotify Voyager Team. 2024. Voyager: An Approximate Nearest-Neighbor Search Library for Python and Java. https://github.com/spotify/voyager

    2024

  27. [35]

    Saba Sturua, Isabelle Mohr, Mohammad Kalim Akram, Michael Günther, Bo Wang, Markus Krimmel, Feng Wang, Georgios Mastrapas, Andreas Koukounas, Andreas Koukounas, Nan Wang, and Han Xiao. 2024. jina-embeddings-v3: Multilingual Embeddings With Task LoRA. arXiv:2409.10173 [cs.CL] h...

    2024 arXiv

  28. [36]

    Siegel, Michael Tang, Ruoxi Sun, Jinsung Yoon, Sercan Ö

    Hongjin Su, Howard Yen, Mengzhou Xia, Weijia Shi, Niklas Muennighoff, Han-yu Wang, Haisu Liu, Quan Shi, Zachary S. Siegel, Michael Tang, Ruoxi Sun, Jinsung Yoon, Sercan Ö. Arik, Danqi Chen, and Tao Yu. 2025. BRIGHT: A Realistic and Challenging Benchmark for Reasoning-Intensive...

    2025

  29. [37]

    Nandan Thakur, Nils Reimers, Andreas Rücklé, Abhishek Srivastava, and Iryna Gurevych. 2021. Beir: A heterogenous benchmark for zero-shot evaluation of information retrieval models. arXiv preprint arXiv:2104.08663 (2021)

    2021 arXiv

  30. [39]

    Benjamin Warner, Antoine Chaffin, Benjamin Clavié, Orion Weller, Oskar Hall- ström, Said Taghadouini, Alexis Gallagher, Raja Biswas, Faisal Ladhak, Tom Aarsen, Nathan Cooper, Griffin Adams, Jeremy Howard, and Iacopo Poli. 2024. Smarter, Better, Faster, Longer: A Modern Bidirec...

    2024 arXiv

  31. [40]

    Xin Zhang, Yanzhao Zhang, Dingkun Long, Wen Xie, Ziqi Dai, Jialong Tang, Huan Lin, Baosong Yang, Pengjun Xie, Fei Huang, et al. 2024. mGTE: Generalized Long-Context Text Representation and Reranking Models for Multilingual Text Retrieval. In Proceedings of the 2024 Conference ...

    2024

  32. [41]

    Dawei Zhu, Liang Wang, Nan Yang, Yifan Song, Wenhao Wu, Furu Wei, and Sujian Li. 2024. LongEmbed: Extending Embedding Models for Long Context Retrieval. In Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024, Miami, FL, USA, Novem...

    2024

  33. [2024]

    arXiv:2402.03216 [cs.CL]

    BGE M3-Embedding: Multi-Lingual, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillation. arXiv:2402.03216 [cs.CL]

    arXiv

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.