Laura Măruşter

h-index16
2papers
4,055citations

2 Papers

12.9AIJun 16
DiagFlowBench: Evaluating How Language Models Handle Off-Procedure Inputs in Grounded Diagnostic Dialogue

Guillermo Gil de Avalle, Laura Maruster, Shaina Raza et al.

Language models increasingly serve as advisory systems in maintenance operations. To prevent hallucination, recent systems ground these models in procedural documentation to constrain them to approved steps. In practice, however, operator queries frequently stray from this path, requiring models to recognise out-of-scope inputs mid-conversation, a dynamic that current benchmarks rarely prioritise. We introduce DiagFlowBench, a dataset of 50 industrial diagnostic flowcharts from a consumer manufacturer converted into 1,676 multi-turn conversations that contrast compliant with out-of-scope utterances. Evaluating a panel of ten commercial and open-weight models reveals high variability in abstention rates, with models commonly selecting a real but contextually inadequate step rather than fabricating facts. The inherent plausibility and authority of this mapped but wrong advice exposes a challenging vulnerability for grounding systems.

1.2NAMay 29, 2009
On the Convex Feasibility Problem

Laura Maruster, Stefan Maruster

The convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a family depending of the two characteristics: the emptiness and boudedness of the intersection of the family. The case four (the interior of the intersection is empty and the intersection itself is bounded) is unsolved. In this paper we give a (partial) answer for the case four: in the case of two closed convex sets in R3 the regularity property holds.