PEFT
Safetensors
Chinese
kev
queue-position
decision-model
lora
sft
permutation-consistency
chinese
Eval Results (legacy)
Instructions to use fzkun/kev-queue-v4-4b with libraries, inference providers, notebooks, and local apps. Follow these links to get started.
- Libraries
- PEFT
How to use fzkun/kev-queue-v4-4b with PEFT:
from peft import PeftModel from transformers import AutoModel base_model = AutoModel.from_pretrained("Qwen/Qwen3.5-4B-Base") model = PeftModel.from_pretrained(base_model, "fzkun/kev-queue-v4-4b") - Notebooks
- Google Colab
- Kaggle
Download format.py from fzkun/kev-queue-v4-4b: direct link, hf CLI and curl.
- Browser
- Download file 4.17 kB
-
https://huggingface.co/fzkun/kev-queue-v4-4b/resolve/main/format.py
- Command line
-
hf download hf://fzkun/kev-queue-v4-4b/format.py
-
curl -L -o format.py https://huggingface.co/fzkun/kev-queue-v4-4b/resolve/main/format.py
4.17 kB
| """Pure queue-input formatting: no matching scan, no solved L/g/position features.""" | |
| from rule_templates import rule_text | |
| VARIANTS=('original','formula','minimal_options','formula_minimal','structured_formula', | |
| 'structured_exact','structured_exact_sorted','unified') | |
| def formula(case): | |
| if case['family']=='return_visit': | |
| return '计算约定:N是原队列人数,g=max(间隔参数,1)。仅当前7人有匹配时,L取全队最后匹配者的1基位次,插入位次=min(L+g+1,N+1);前7人无匹配时,插入位次=min(g+1,N+1)。' | |
| return '计算约定:N是原队列人数。仅当前5人有匹配时,L取全队最后匹配者的1基位次,插入位次=min(L+2,N+1);前5人无匹配时,插入位次=min(2,N+1)。' | |
| def render_position(meta,variant,rng,style=2): | |
| assert variant in VARIANTS | |
| case=meta['case'];queue=case['queue'];n=len(queue) | |
| ids=[f'P{i+1:02d}' for i in range(n)] | |
| entries=[f'{pid}(回诊={"是" if q["IsReturnWait"] else "否"},标记={q["Emergency"] or "无"})' for pid,q in zip(ids,queue)] | |
| state='现有队列由前至后:'+(';'.join(entries) if entries else '空')+'。新患者X不在原队列中。规则:'+rule_text(case,style) | |
| instructions='严格依据给定规则,选择新患者X最终插入位置。位次从1开始,索引从0开始。' | |
| indices=list(range(n+1));rng.shuffle(indices) | |
| criteria={} | |
| for i in indices: | |
| neighbor='队首' if i==0 else '队尾' if i==n else f'{ids[i-1]}和{ids[i]}之间' | |
| criteria[f'position_{i+1}']=f'第{i+1}位,0基索引{i},{neighbor}' | |
| if variant.startswith('structured_') or variant=='unified': | |
| entries=[f'第{i+1}位:回诊标志={"是" if q["IsReturnWait"] else "否"};标记={q["Emergency"] or "无"}' for i,q in enumerate(queue)] | |
| state='现有队列从前到后:\n'+('\n'.join(entries) if entries else '空')+'\n新患者X不在原队列中。规则:'+rule_text(case,style) | |
| if variant not in ('original','minimal_options','unified'):state+=formula(case) | |
| if variant.startswith('structured_exact') and case['family']=='return_visit': | |
| state+='匹配是严格的合取条件:回诊标志必须为是,且标记必须完全等于“回”“转”“续”之一;“回诊”“转诊”“续诊”均不匹配,回诊标志为否也不匹配。' | |
| if variant=='unified': | |
| if case['family']=='return_visit': | |
| cutoff=7 | |
| definition=f'间隔参数={case["gap"]},有效间隔g=max(间隔参数,1)。匹配必须同时满足:回诊标志为是,标记完全等于回、转、续之一。回诊/转诊/续诊不是完全相等,不能算匹配。' | |
| else: | |
| cutoff=5;marker='献血' if case['family']=='blood_priority' else '家优' | |
| definition=f'有效间隔g=1。标记中包含“{marker}”就匹配,回诊标志不影响匹配。' | |
| state='现有队列从前到后:\n'+('\n'.join(entries) if entries else '空')+'\n新患者X不在原队列中。规则:'+definition | |
| state+=f'N为原队列人数。先检查前{cutoff}位:若其中没有匹配,令L=0,忽略后面的匹配;若其中有匹配,L取全队最后一名匹配者的1基位次。最终插入位次=min(N,L+g)+1。' | |
| if variant not in ('original','formula'): | |
| criteria={k:f'第{int(k.split("_")[-1])}位' for k in criteria} | |
| instructions='严格依据规则选择最终插入位次。位次从1开始;原队列有N人时,插入位次范围是1到N+1。' | |
| if variant.endswith('_sorted') or variant=='unified': | |
| criteria=dict(sorted(criteria.items(),key=lambda kv:int(kv[0].split('_')[-1]))) | |
| # The oracle position is used only as a training/evaluation label, below. | |
| return {'state':state,'questions':{'position':{'type':'choice','instructions':instructions, | |
| 'criteria':criteria,'label':f'position_{meta["position"]}'}}, | |
| '_meta':{'id':meta['id'],'group_id':meta['group_id'],'source':'call_system_insertion_v3', | |
| 'split':meta['split'],'family':case['family'],'prompt_variant':variant,'template_style':style}} | |