Efficient Few-Shot Learning Without Prompts
Paper • 2209.11055 • Published • 5
This is a SetFit model that can be used for Text Classification. This SetFit model uses sentence-transformers/paraphrase-multilingual-MiniLM-L12-v2 as the Sentence Transformer embedding model. A LogisticRegression instance is used for classification.
The model has been trained using an efficient few-shot learning technique that involves:
| Label | Examples |
|---|---|
| EMI |
|
| COD |
|
| ORTHO_FEATURES |
|
| ERGO_FEATURES |
|
| COMPARISON |
|
| WARRANTY |
|
| 100_NIGHT_TRIAL_OFFER |
|
| SIZE_CUSTOMIZATION |
|
| WHAT_SIZE_TO_ORDER |
|
| LEAD_GEN |
|
| CHECK_PINCODE |
|
| DISTRIBUTORS |
|
| MATTRESS_COST |
|
| PRODUCT_VARIANTS |
|
| ABOUT_SOF_MATTRESS |
|
| DELAY_IN_DELIVERY |
|
| ORDER_STATUS |
|
| RETURN_EXCHANGE |
|
| CANCEL_ORDER |
|
| PILLOWS |
|
| OFFERS |
|
First install the SetFit library:
pip install setfit
Then you can load this model and run inference.
from setfit import SetFitModel
# Download from the 🤗 Hub
model = SetFitModel.from_pretrained("huiyeong/setfit-sofmattress-neg")
# Run inference
preds = model("Do you deliver in Canada")
| Training set | Min | Median | Max |
|---|---|---|---|
| Word count | 1 | 4.3619 | 22 |
| Label | Training Sample Count |
|---|---|
| 100_NIGHT_TRIAL_OFFER | 20 |
| ABOUT_SOF_MATTRESS | 11 |
| CANCEL_ORDER | 11 |
| CHECK_PINCODE | 10 |
| COD | 12 |
| COMPARISON | 12 |
| DELAY_IN_DELIVERY | 12 |
| DISTRIBUTORS | 39 |
| EMI | 27 |
| ERGO_FEATURES | 13 |
| LEAD_GEN | 25 |
| MATTRESS_COST | 23 |
| OFFERS | 13 |
| ORDER_STATUS | 24 |
| ORTHO_FEATURES | 23 |
| PILLOWS | 13 |
| PRODUCT_VARIANTS | 24 |
| RETURN_EXCHANGE | 15 |
| SIZE_CUSTOMIZATION | 11 |
| WARRANTY | 13 |
| WHAT_SIZE_TO_ORDER | 22 |
| Epoch | Step | Training Loss | Validation Loss |
|---|---|---|---|
| 0.0043 | 1 | 0.2676 | - |
| 0.2137 | 50 | 0.1931 | - |
| 0.4274 | 100 | 0.1418 | - |
| 0.6410 | 150 | 0.1097 | - |
| 0.8547 | 200 | 0.0838 | - |
| 1.0684 | 250 | 0.0579 | - |
| 1.2821 | 300 | 0.0437 | - |
| 1.4957 | 350 | 0.0338 | - |
| 1.7094 | 400 | 0.0287 | - |
| 1.9231 | 450 | 0.0245 | - |
| 2.1368 | 500 | 0.0167 | - |
| 2.3504 | 550 | 0.0164 | - |
| 2.5641 | 600 | 0.0135 | - |
| 2.7778 | 650 | 0.0118 | - |
| 2.9915 | 700 | 0.0147 | - |
| 3.2051 | 750 | 0.0096 | - |
| 3.4188 | 800 | 0.008 | - |
| 3.6325 | 850 | 0.0094 | - |
| 3.8462 | 900 | 0.0084 | - |
| 4.0598 | 950 | 0.0107 | - |
| 4.2735 | 1000 | 0.0083 | - |
| 4.4872 | 1050 | 0.0068 | - |
| 4.7009 | 1100 | 0.0065 | - |
| 4.9145 | 1150 | 0.0064 | - |
@article{https://doi.org/10.48550/arxiv.2209.11055,
doi = {10.48550/ARXIV.2209.11055},
url = {https://arxiv.org/abs/2209.11055},
author = {Tunstall, Lewis and Reimers, Nils and Jo, Unso Eun Seo and Bates, Luke and Korat, Daniel and Wasserblat, Moshe and Pereg, Oren},
keywords = {Computation and Language (cs.CL), FOS: Computer and information sciences, FOS: Computer and information sciences},
title = {Efficient Few-Shot Learning Without Prompts},
publisher = {arXiv},
year = {2022},
copyright = {Creative Commons Attribution 4.0 International}
}