A comparative benchmarking study evaluating the regulatory comprehension of four open-source large language models, TinyLlama-1.1B-Chat, Gemma-2B-Instruct, Llama-3.1-8B-Instruct, and Mistral-7B-Instruct-v0.3, contributes an empirical characterization of small and medium language model regulatory comprehension and a reusable 100-question benchmark.
Abstract
This paper presents a comparative benchmarking study evaluating the regulatory comprehension of four open-source large language models, TinyLlama-1.1B-Chat, Gemma-2B-Instruct, Llama-3.1-8B-Instruct, and Mistral-7B-Instruct-v0.3, on the EU Artificial Intelligence Act (Regulation EU 2024/1689). A custom benchmark of 100 multiple-choice questions was constructed and classified across three dimensions, namely cognitive difficulty, knowledge type, and regulatory mechanism, with a balanced answer key distribution. Each model was evaluated under vanilla inference, relying exclusively on parametric knowledge, and retrieval-augmented generation (RAG), in which relevant Act passages are retrieved using a FAISS-indexed sentence embedding pipeline with standardized top three chunk retrieval applied uniformly across all models. Vanilla accuracy ranges from 22.0% for TinyLlama-1.1B to 80.0% for Llama-3.1-8B, indicating that larger models perform better. Under the retrieval configuration employed, RAG improves performance of the evaluated models, with gains from 3.0 percentage points for TinyLlama-1.1B to 17.0 for Gemma-2B and 10.0 for both 7B–8B models. Questions related to procedural knowledge, governance and enforcement emerge as weaknesses in the baseline, vanilla setting, partially mitigated by retrieval. Qualitative analysis identifies two RAG failure modes: retrieval failures, where the embedding mechanism returns informationally insufficient passages, and integration failures, where the correct passage is retrieved but not correctly exploited. The study contributes an empirical characterization of small and medium language model regulatory comprehension and a reusable 100-question benchmark.
Comparison of GPT-4, BERT (bidirectional encoder representations from transformers), Gemini, and DeepSeek large language models (LLM), focusing on architectures, training methodologies, and real-world applications reveals GPT-4 excels in natural language generation and complex reasoning, supporting up to 128K tokens wi...
Kavish Sanghvi, Aparna S. Sharma, Surbhi Hooda· Computer Science and Informa...· 0 citations
This work investigates LLM-based evaluators of natural language generation quality mechanistically through an eight-attack perturbation taxonomy across the Readability and Adequacy dimensions of NLG quality, a generation pipeline that produces paired clean and corrupt summaries with controlled error intensity and expli...
The results suggest that, although fine-tuned transformers outperform all GPT models, GPT-4 represents a significant improvement over third-generation GPT models and poses a challenge to the poverty of the stimulus hypothesis.
Cristiano Chesi, F. Vespignani, Roberto Zamparelli· Italian Journal of Computati...· 1 citation
A systematic, multi-model framework that combines Chain-of-Thought prompting with Low-Rank Adaptation parameter-efficient fine-tuning, and measures the contribution of each component independently is investigated, making capable SLM-based reasoning deployable without datacenter-scale infrastructure.
Aryan Raina, Shiwani Gupta, Jagruti Jadhav et al.· Journal of Computer Science· 0 citations
Large language models (LLMs) have shown a strong ability to solve a wide range of language tasks. However, they became less practical for subject-specific applications, especially when dealing with low-resource languages. This paper shows an example of adaptation of small language models (SLMs) to solve subject-specifi...
G. Askar, A. Mutaikhan, M. Aitkozhayeva et al.· NEWS of National Academy of...· 0 citations
Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.