papersSEP 12 04:00 UTC
Formal Abstractions Boost Combinatorial Optimization in Resource-Limited Language Models
A new arXiv paper proposes using formal abstractions to help language models solve combinatorial scheduling problems, where feasible answers must be found inside enormous search spaces under complex constraints. The authors focus on resource-constrained models, where limited compute makes such tasks especially difficult. The approach aims to raise accuracy without requiring larger models.