ParaChecker-SFT

English | ไธญๆ–‡

Overview

ParaChecker-SFT is a private ParadoxGPT Checker specialist model fine-tuned from a Qwen 4B base model. It is designed for research-paper workflows rather than general chat.

Intended Use

Use ParaChecker-SFT for:

  • paper-level scientific writing and review-support workflows;
  • converting paper context into structured reasoning traces;
  • internal ParadoxGPT research-agent training and evaluation;
  • assisting human researchers with evidence, argumentation, and risk analysis.

Outputs should be checked against the original paper context. This model is not a substitute for human scientific judgment.

Training Data

The model was supervised-fine-tuned on private dataset bhxdianzhang/ParaSFT-checker.

Split Samples
Train 35,272
Dev 2,055
Test 2,288
Total 39,615

Task distribution:

Task type Samples
K1_commitment_extraction 7,942
K2_claim_support_verification 7,939
K3_cross_section_consistency 7,911
K4_inconsistency_detection 7,904
K5_minimal_fix 7,919

Quality filter: each target answer contains exactly one balanced <think>...</think> reasoning block followed by the final answer.

Training Summary

Base model: Qwen 4B local base model.

Field Value
Epochs 3.0
Learning rate 3e-6
Scheduler cosine
Distributed devices 2
Gradient accumulation 8
Total train batch size 16
Final train loss 0.8032357919
Final eval loss 0.8563711047

Qualitative Behavior

Local side-by-side checks show clear gains on commitment extraction and claim-support verification, and useful behavior on cross-section consistency and minimal-fix tasks. The main residual issue is K4 inconsistency detection: the model can find useful signals but may over-expand and hit the token limit, so stricter decoding or later preference/RL tuning is recommended for production use.

ParaChecker-SFT is best used with rich paper context matching the training shape, such as title, abstract, introduction, selected body sections, figure/table captions, claims, reviews, or task-specific paper context depending on the skill.

Example Prompt Shape

ไฝ ๆ˜ฏ้กถไผš่ฎบๆ–‡ๅˆ†ๆžไธ“ๅฎถใ€‚็ป™ๅฎš่ฎบๆ–‡ไธŠไธ‹ๆ–‡๏ผŒ่ฏทๆŒ‰ๆŒ‡ๅฎšไปปๅŠกๅšไธญๆ–‡ๅˆ†ๆžใ€‚

่ฎบๆ–‡ๆ ‡้ข˜: ...

ๆ‘˜่ฆ: ...

ๅผ•่จ€: ...

ๆญฃๆ–‡ๅ…ณ้”ฎ็‰‡ๆฎต: ...

ๅ›พ่กจ/ๅฎž้ชŒ/claim ไฟกๆฏ: ...

ไปปๅŠก: ...

Concrete Example

Input:

ไฝ ๆ˜ฏ้กถไผš่ฎบๆ–‡่ฎบ่ฏ้—ญ็Žฏๆฃ€ๆŸฅไธ“ๅฎถใ€‚็ป™ๅฎš่ฎบๆ–‡ๅฎŒๆ•ดไธŠไธ‹ๆ–‡๏ผŒ่ฏทๆฃ€้ชŒๆฏไธชๆ ธๅฟƒ claim ๆ˜ฏๅฆ่ขซๆ–นๆณ•ๅ’Œๅฎž้ชŒๅ……ๅˆ†ๆ”ฏๆ’‘ใ€‚

่ฎบๆ–‡ๆ ‡้ข˜: Adaptive Evidence Routing for Retrieval-Augmented Scientific QA

ๆ‘˜่ฆ: The paper claims that an adaptive evidence router improves factuality and citation precision in scientific QA.

ๅผ•่จ€: The motivation is that different question types need different evidence sources.

ๆ–นๆณ•: The system adds three components over Base RAG: an evidence router, a citation-graph retriever, and a reranker.

ๅฎž้ชŒ: Table 3 reports Full System vs. Base RAG. The only ablation, "w/o adaptive evidence stack", removes all three components together.

Conclusion: The routing module is the key driver of factuality gains.

Expected ParaChecker-SFT-style output:

่ฟ™้‡Œๆœ€ๅคง็š„่ฎบ่ฏ็ผบๅฃๆ˜ฏ conclusion ๆŠŠ็ณป็ปŸ็บงๆๅ‡ๅฝ’ๅ› ็ป™ router๏ผŒไฝ†ๅฎž้ชŒๆฒกๆœ‰้š”็ฆป routerใ€‚

Commitment 1: router improves factuality.
ๆ”ฏๆ’‘ๅผบๅบฆ๏ผšweakใ€‚Table 3 ๅช่ƒฝ่ฏๆ˜Ž full evidence stack ๆฏ” Base RAG ๅฅฝ๏ผŒไธ่ƒฝ่ฏๆ˜Ž router ๅ•็‹ฌๆœ‰ๆ•ˆใ€‚ๅ› ไธบ ablation ๅŒๆ—ถ็งป้™คไบ† routerใ€citation graph ๅ’Œ rerankerใ€‚

Commitment 2: citation graph improves citation precision.
ๆ”ฏๆ’‘ๅผบๅบฆ๏ผšunclearใ€‚่ฎบๆ–‡ๆŠฅๅ‘Šไบ† citation precision ๆๅ‡๏ผŒไฝ†ๆฒกๆœ‰ๅ•็‹ฌๅŠ ๅ…ฅ citation graph ็š„ๅฏน็…ง๏ผŒๅ› ๆญคๆ— ๆณ•ๆŽ’้™ค reranker ๆˆ– router ๅธฆๆฅ็š„ๅฝฑๅ“ใ€‚

ๆœ€ๅฐไฟฎๅค๏ผšๅขžๅŠ  controlled ablation๏ผšBase RAGใ€+citation graphใ€+rerankerใ€+router๏ผŒๅนถไฟ่ฏ่ฎญ็ปƒๆ•ฐๆฎใ€ๆจกๅž‹ๅคงๅฐใ€่งฃ็ ่ฎพ็ฝฎไธ€่‡ดใ€‚ๅฆ‚ๆžœๆฅไธๅŠ่กฅๅฎž้ชŒ๏ผŒ่‡ณๅฐ‘ๆŠŠ conclusion ๆ”นๆˆโ€œthe full evidence stack improves factualityโ€๏ผŒไธ่ฆ่ฏด router ๆ˜ฏ key driverใ€‚

Limitations

  • The model is optimized for a narrow ParadoxGPT specialist workflow, not general chat.
  • It may inherit teacher-model annotation errors from the SFT data.
  • It should not be used as an authority on paper correctness without source verification.
  • K4 inconsistency detection may over-generate; monitor finish reason and consider lower max tokens or stricter answer format for deployment.

License and Use Restrictions

This repository is marked with license: other.

The model was trained on private ParadoxGPT SFT data derived from parsed academic papers, reviews, and teacher annotations. Rights to original papers and reviews remain with their respective authors, reviewers, venues, and publishers. This private model is provided for internal research and engineering use only. Redistribution or public release should be reviewed separately against source venue policies and applicable copyright rules.

Citation

@model{zhang2026paracheckersft,
  title        = {ParaChecker-SFT: A ParadoxGPT Checker Specialist Model},
  author       = {Heng Zhang},
  year         = {2026},
  publisher    = {Hugging Face},
  howpublished = {https://huggingface.co/bhxdianzhang/ParaChecker-SFT},
  note         = {Private ParadoxGPT supervised fine-tuned Checker model}
}

ไธญๆ–‡

ๆฆ‚่ฟฐ

ParaChecker-SFT ๆ˜ฏ ParadoxGPT ็š„ Checker ไธ“ๅฎถๆจกๅž‹๏ผŒ็”ฑ Qwen 4B ๅŸบๅบง็›‘็ฃๅพฎ่ฐƒ่€Œๆฅใ€‚ๅฎƒ้ขๅ‘็ง‘็ ”่ฎบๆ–‡ๅทฅไฝœๆต๏ผŒไธๆ˜ฏ้€š็”จ่Šๅคฉๆจกๅž‹ใ€‚

้€‚็”จๅœบๆ™ฏ

ParaChecker-SFT ้€‚ๅˆ็”จไบŽ๏ผš

  • ่ฎบๆ–‡็บง็ง‘็ ”ๅ†™ไฝœไธŽ review-support ๅทฅไฝœๆต๏ผ›
  • ๅฐ†่ฎบๆ–‡ไธŠไธ‹ๆ–‡่ฝฌๆˆ็ป“ๆž„ๅŒ– reasoning trace๏ผ›
  • ParadoxGPT ๅ†…้ƒจ research-agent ่ฎญ็ปƒไธŽ่ฏ„ๆต‹๏ผ›
  • ่พ…ๅŠฉ็ ”็ฉถ่€…ๅš่ฏๆฎใ€่ฎบ่ฏๅ’Œ้ฃŽ้™ฉๅˆ†ๆžใ€‚

่พ“ๅ‡บๅบ”็ป“ๅˆๅŽŸ่ฎบๆ–‡ไธŠไธ‹ๆ–‡ๅคๆ ธ๏ผŒไธ่ƒฝๆ›ฟไปฃไบบ็ฑป็ง‘็ ”ๅˆคๆ–ญใ€‚

่ฎญ็ปƒๆ•ฐๆฎ

ๆจกๅž‹ไฝฟ็”จ็งๆœ‰ๆ•ฐๆฎ้›† bhxdianzhang/ParaSFT-checker ่ฟ›่กŒ็›‘็ฃๅพฎ่ฐƒใ€‚

Split ๆ ทๆœฌๆ•ฐ
Train 35,272
Dev 2,055
Test 2,288
Total 39,615

ไปปๅŠกๅˆ†ๅธƒ๏ผš

Task type Samples
K1_commitment_extraction 7,942
K2_claim_support_verification 7,939
K3_cross_section_consistency 7,911
K4_inconsistency_detection 7,904
K5_minimal_fix 7,919

่ดจ้‡่ฟ‡ๆปค๏ผšๆฏๆก็›ฎๆ ‡็ญ”ๆกˆ้ƒฝๅŒ…ๅซไธ”ๅชๅŒ…ๅซไธ€ไธช้…ๅนณ็š„ <think>...</think> ๆ€่€ƒๅ—๏ผŒๅŽๆŽฅๆœ€็ปˆ็ญ”ๆกˆใ€‚

่ฎญ็ปƒๆ‘˜่ฆ

ๅŸบๅบงๆจกๅž‹๏ผšๆœฌๅœฐ Qwen 4B base modelใ€‚

ๅญ—ๆฎต ๆ•ฐๅ€ผ
Epochs 3.0
Learning rate 3e-6
Scheduler cosine
ๅˆ†ๅธƒๅผ่ฎพๅค‡ๆ•ฐ 2
Gradient accumulation 8
Total train batch size 16
Final train loss 0.8032357919
Final eval loss 0.8563711047

ๅฎšๆ€ง่กŒไธบ

ๆœฌๅœฐ side-by-side ๆฃ€ๆŸฅๆ˜พ็คบ๏ผŒParaChecker-SFT ๅœจ commitment extraction ๅ’Œ claim-support verification ไธŠๆๅ‡ๆ˜Žๆ˜พ๏ผŒๅœจ cross-section consistency ไธŽ minimal-fix ไปปๅŠกไธŠไนŸๆœ‰ๅฏ็”จ่กจ็Žฐใ€‚ไธป่ฆๆฎ‹็•™้—ฎ้ข˜้›†ไธญๅœจ K4 inconsistency detection๏ผšๆจกๅž‹่ƒฝๆ‰พๅˆฐๆœ‰็”จไฟกๅท๏ผŒไฝ†ๅฏ่ƒฝ่ฟ‡ๅบฆๅฑ•ๅผ€ๅนถ่งฆๅ‘ token ไธŠ้™๏ผ›็”Ÿไบงไฝฟ็”จๅปบ่ฎฎ้…ๅˆๆ›ดไธฅๆ ผ็š„ decoding ๆˆ–ๅŽ็ปญ preference/RL ่ฎญ็ปƒใ€‚

ไธบไบ†่Žทๅพ—ๆœ€ไฝณๆ•ˆๆžœ๏ผŒ่ฏทไฝฟ็”จไธŽ่ฎญ็ปƒๆ•ฐๆฎไธ€่‡ด็š„ไธฐๅฏŒ่ฎบๆ–‡ไธŠไธ‹ๆ–‡๏ผŒไพ‹ๅฆ‚ titleใ€abstractใ€introductionใ€ๆญฃๆ–‡ๅ…ณ้”ฎ็‰‡ๆฎตใ€figure/table captionsใ€claimsใ€reviews ๆˆ–ๅ…ทไฝ“ไปปๅŠกๆ‰€้œ€็š„ paper contextใ€‚

ๅ…ทไฝ“็คบไพ‹

่พ“ๅ…ฅ๏ผš

ไฝ ๆ˜ฏ้กถไผš่ฎบๆ–‡่ฎบ่ฏ้—ญ็Žฏๆฃ€ๆŸฅไธ“ๅฎถใ€‚็ป™ๅฎš่ฎบๆ–‡ๅฎŒๆ•ดไธŠไธ‹ๆ–‡๏ผŒ่ฏทๆฃ€้ชŒๆฏไธชๆ ธๅฟƒ claim ๆ˜ฏๅฆ่ขซๆ–นๆณ•ๅ’Œๅฎž้ชŒๅ……ๅˆ†ๆ”ฏๆ’‘ใ€‚

่ฎบๆ–‡ๆ ‡้ข˜: Adaptive Evidence Routing for Retrieval-Augmented Scientific QA

ๆ‘˜่ฆ: ่ฎบๆ–‡ๅฃฐ็งฐ adaptive evidence router ่ƒฝๆๅ‡ scientific QA ็š„ factuality ๅ’Œ citation precisionใ€‚

ๅผ•่จ€: ่ฎบๆ–‡ๅŠจๆœบๆ˜ฏไธๅŒ้—ฎ้ข˜็ฑปๅž‹้œ€่ฆไธๅŒ่ฏๆฎๆฅๆบใ€‚

ๆ–นๆณ•: ็ณป็ปŸ็›ธๆฏ” Base RAG ๅขžๅŠ ไธ‰ไธช็ป„ไปถ๏ผševidence routerใ€citation-graph retriever ๅ’Œ rerankerใ€‚

ๅฎž้ชŒ: Table 3 ๅชๆŠฅๅ‘Š Full System vs. Base RAGใ€‚ๅ”ฏไธ€ ablation ๆ˜ฏ "w/o adaptive evidence stack"๏ผŒๅŒๆ—ถ็งป้™คไธ‰ไธช็ป„ไปถใ€‚

Conclusion: The routing module is the key driver of factuality gains.

ParaChecker-SFT ๆœŸๆœ›่พ“ๅ‡บ็‰‡ๆฎต๏ผš

่ฟ™้‡Œๆœ€ๅคง็š„่ฎบ่ฏ็ผบๅฃๆ˜ฏ conclusion ๆŠŠ็ณป็ปŸ็บงๆๅ‡ๅฝ’ๅ› ็ป™ router๏ผŒไฝ†ๅฎž้ชŒๆฒกๆœ‰้š”็ฆป routerใ€‚

Commitment 1: router improves factuality.
ๆ”ฏๆ’‘ๅผบๅบฆ๏ผšweakใ€‚Table 3 ๅช่ƒฝ่ฏๆ˜Ž full evidence stack ๆฏ” Base RAG ๅฅฝ๏ผŒไธ่ƒฝ่ฏๆ˜Ž router ๅ•็‹ฌๆœ‰ๆ•ˆใ€‚ๅ› ไธบ ablation ๅŒๆ—ถ็งป้™คไบ† routerใ€citation graph ๅ’Œ rerankerใ€‚

Commitment 2: citation graph improves citation precision.
ๆ”ฏๆ’‘ๅผบๅบฆ๏ผšunclearใ€‚่ฎบๆ–‡ๆŠฅๅ‘Šไบ† citation precision ๆๅ‡๏ผŒไฝ†ๆฒกๆœ‰ๅ•็‹ฌๅŠ ๅ…ฅ citation graph ็š„ๅฏน็…ง๏ผŒๅ› ๆญคๆ— ๆณ•ๆŽ’้™ค reranker ๆˆ– router ๅธฆๆฅ็š„ๅฝฑๅ“ใ€‚

ๆœ€ๅฐไฟฎๅค๏ผšๅขžๅŠ  controlled ablation๏ผšBase RAGใ€+citation graphใ€+rerankerใ€+router๏ผŒๅนถไฟ่ฏ่ฎญ็ปƒๆ•ฐๆฎใ€ๆจกๅž‹ๅคงๅฐใ€่งฃ็ ่ฎพ็ฝฎไธ€่‡ดใ€‚ๅฆ‚ๆžœๆฅไธๅŠ่กฅๅฎž้ชŒ๏ผŒ่‡ณๅฐ‘ๆŠŠ conclusion ๆ”นๆˆโ€œthe full evidence stack improves factualityโ€๏ผŒไธ่ฆ่ฏด router ๆ˜ฏ key driverใ€‚

ๅฑ€้™

  • ๆจกๅž‹้’ˆๅฏน ParadoxGPT ็ช„ๅŸŸไธ“ๅฎถๅทฅไฝœๆตไผ˜ๅŒ–๏ผŒไธๆ˜ฏ้€š็”จ่Šๅคฉๆจกๅž‹ใ€‚
  • ๆจกๅž‹ๅฏ่ƒฝ็ปงๆ‰ฟ SFT ๆ•ฐๆฎไธญ็š„ teacher-model ๆ ‡ๆณจ่ฏฏๅทฎใ€‚
  • ไธๅบ”ๅœจๆœชๆฃ€ๆŸฅๅŽŸ่ฎบๆ–‡ไธŠไธ‹ๆ–‡็š„ๆƒ…ๅ†ตไธ‹๏ผŒๆŠŠ่พ“ๅ‡บๅฝ“ๆˆ็ง‘็ ”ไบ‹ๅฎžใ€‚
  • K4 inconsistency detection ๅฏ่ƒฝ่ฟ‡ๅบฆ็”Ÿๆˆ๏ผ›้ƒจ็ฝฒๆ—ถๅบ”็›‘ๆŽง finish reason๏ผŒๅนถ่€ƒ่™‘้™ไฝŽ max tokens ๆˆ–ไฝฟ็”จๆ›ดไธฅๆ ผ็š„ๅ›ž็ญ”ๆ ผๅผใ€‚

ๅผ•็”จ

@model{zhang2026paracheckersft,
  title        = {ParaChecker-SFT: A ParadoxGPT Checker Specialist Model},
  author       = {Heng Zhang},
  year         = {2026},
  publisher    = {Hugging Face},
  howpublished = {https://huggingface.co/bhxdianzhang/ParaChecker-SFT},
  note         = {Private ParadoxGPT supervised fine-tuned Checker model}
}
Downloads last month
7
Safetensors
Model size
5B params
Tensor type
BF16
ยท
Inference Providers NEW
This model isn't deployed by any Inference Provider. ๐Ÿ™‹ Ask for provider support

Model tree for bhxdianzhang/ParaChecker-SFT

Finetuned
Qwen/Qwen3.5-4B
Finetuned
(1223)
this model

Collection including bhxdianzhang/ParaChecker-SFT

Evaluation results