We lifted 3 functions out of this paper's own repositories and ran 1 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| raghavlite/GenEOL | canonical | 1 of 3 |
| Function | Status | Where it lives |
|---|---|---|
| get_sum_prompt_fs | Ran | raghavlite/GenEOL/geneol/prompts_utils.py pointer only (licence: NONE) · get_code("59a4325a6b63449e") |
| get_neg_prompt | Not yet run | raghavlite/GenEOL/geneol/prompts_utils.py pointer only (licence: NONE) · get_code("b51eca5b5d200326") |
| get_pos_prompt | Not yet run | raghavlite/GenEOL/geneol/prompts_utils.py pointer only (licence: NONE) · get_code("4e6c5d508a7c62a0") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Training-free embedding methods directly leverage pretrained large language models (LLMs) to embed text, bypassing the costly and complex procedure of contrastive learning. Previous training-free embedding methods have mainly focused on optimizing embedding prompts and have overlooked the benefits of utilizing the generative abilities of LLMs. We propose a novel method, GenEOL, which uses LLMs to generate diverse transformations of a sentence that preserve its meaning, and aggregates the resulting embeddings of these transformations to enhance the overall sentence embedding. GenEOL significantly outperforms the existing training-free embedding methods by an average of 2.85 points across several LLMs on the sentence semantic text similarity (STS) benchmark. GenEOL also achieves notable gains in clustering, reranking, and pair-classification tasks from the MTEB benchmark. Additionally, GenEOL stabilizes representation quality across LLM layers and remains robust to perturbations of embedding prompts.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2410.14635")
get_code_for_paper("2410.14635")
have("2410.14635")
Connect an agent — have() is free.