On Semantic Loss Fine-Tuning Approach for Preventing Model Collapse in Causal Reasoning

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Deshmukh, Pratik, Gupta, Atirek
Formato: Preprint
Publicado: 2026
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866913097058353152
author Deshmukh, Pratik
Gupta, Atirek
author_facet Deshmukh, Pratik
Gupta, Atirek
contents Standard fine-tuning of transformer models on causal reasoning tasks leads to catastrophic model collapse, where models learn trivial solutions such as always predicting "Yes" or "No" regardless of input structure. We demonstrate that fine-tuning Gemma 270M on transitivity and d-separation tasks without semantic loss results in 100% collapse rate, with models achieving misleadingly high accuracy (73.9%) while learning no causal reasoning. We propose a semantic loss function with graph-based logical constraints and dynamic lambda scheduling that prevents this collapse. Our approach achieves 70.4% accuracy on transitivity tasks and 68.6% on d-separation tasks with stable, context-dependent predictions, representing a 42.7% improvement over collapsed baselines. Adversarial evaluation on 1,000 structural reasoning samples shows semantic models achieve 67-70% accuracy while collapsed models fail catastrophically at 43-71%. We validate our findings through comprehensive benchmarking on 200,000+ evaluation samples across five model variants, demonstrating that semantic loss is essential and not optional, for stable causal reasoning in transformers.
format Preprint
id arxiv_https___arxiv_org_abs_2605_05438
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle On Semantic Loss Fine-Tuning Approach for Preventing Model Collapse in Causal Reasoning
Deshmukh, Pratik
Gupta, Atirek
Machine Learning
Artificial Intelligence
I.2.6; I.2.7
Standard fine-tuning of transformer models on causal reasoning tasks leads to catastrophic model collapse, where models learn trivial solutions such as always predicting "Yes" or "No" regardless of input structure. We demonstrate that fine-tuning Gemma 270M on transitivity and d-separation tasks without semantic loss results in 100% collapse rate, with models achieving misleadingly high accuracy (73.9%) while learning no causal reasoning. We propose a semantic loss function with graph-based logical constraints and dynamic lambda scheduling that prevents this collapse. Our approach achieves 70.4% accuracy on transitivity tasks and 68.6% on d-separation tasks with stable, context-dependent predictions, representing a 42.7% improvement over collapsed baselines. Adversarial evaluation on 1,000 structural reasoning samples shows semantic models achieve 67-70% accuracy while collapsed models fail catastrophically at 43-71%. We validate our findings through comprehensive benchmarking on 200,000+ evaluation samples across five model variants, demonstrating that semantic loss is essential and not optional, for stable causal reasoning in transformers.
title On Semantic Loss Fine-Tuning Approach for Preventing Model Collapse in Causal Reasoning
topic Machine Learning
Artificial Intelligence
I.2.6; I.2.7
url https://arxiv.org/abs/2605.05438