Valerio Crocetti
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Valerio Crocetti has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Davide Calvaresi
HES-SO Valais-Wallis, Sion, Switzerland
4 shared publications - Elia Pacioni
HES-SO Valais-Wallis, Sion, Switzerland
4 shared publications - Aldo Franco Dragoni
Università Politecnica delle Marche
2 shared publications - Michael Schumacher
HES-SO Valais-Wallis
2 shared publications - Andrei C. Coman
HES-SO Valais-Wallis
1 shared publication - Francisco Fernández de Vega
Universidad de Extremadura, Mérida, Spain
1 shared publication
Latest Publications
- Open Access
- 18 October 2026
- Published by Springer Nature in Genetic Programming and Evolvable Machines
- Vol. 27 (2) , 23
FedGP goes open source: reproducible evolutionary aggregation for federated learning with FASTER
Genetic Programming (GP) has recently been applied to evolve aggregation functions in Federated Learning (FL), instead of fixing them in advance. FedGP represents aggregation rules as symbolic expressions that evolve during training and has shown competitive performance under non-IID data. Progress on GP-based aggregation, however, has been constrained by two practical barriers: limited reproducibility in FL experimentation and the absence of a public FedGP implementation. This paper presents FASTER, an open-source platform that provides the first public implementation of FedGP and integrates it with standard baselines (FedAvg, weighted FedAvg, FedProx, and FedNova). FASTER provides a browser- and CLI-based configuration-driven workflow for controlled FL experiments with built-in or custom datasets, IID and non-IID partitions, client scheduling, churn simulation, live metric tracking, and structured artifact export. Each run is stored with its configuration, logs, metrics, metadata, checkpoints, and, for FedGP, the individuals evolved across generations. In a demonstration on FashionMNIST with non-IID data and client churn, FedGP outperforms all fixed baselines with statistically significant gains; GPU batch evaluation reduces the previously reported roughly tenfold wall-clock overhead to about 3.3× relative to fixed-rule methods. By placing evolved and fixed aggregation rules under identical controlled conditions, FASTER turns FedGP into a reusable, testable, and extensible research object for the evolutionary computation community.
- 18 October 2026
- Published by Springer Nature in Genetic Programming and Evolvable Machines
- Vol. 27 (2) , 23
Open AccessFedGP goes open source: reproducible evolutionary aggregation for federated learning with FASTER
Genetic Programming (GP) has recently been applied to evolve aggregation functions in Federated Learning (FL), instead of fixing them in advance. FedGP represents aggregation rules as symbolic expressions that evolve during training and has shown competitive performance under non-IID data. Progress on GP-based aggregation, however, has been constrained by two practical barriers: limited reproducibility in FL experimentation and the absence of a public FedGP implementation. This paper presents FASTER, an open-source platform that provides the first public implementation of FedGP and integrates it with standard baselines (FedAvg, weighted FedAvg, FedProx, and FedNova). FASTER provides a browser- and CLI-based configuration-driven workflow for controlled FL experiments with built-in or custom datasets, IID and non-IID partitions, client scheduling, churn simulation, live metric tracking, and structured artifact export. Each run is stored with its configuration, logs, metrics, metadata, checkpoints, and, for FedGP, the individuals evolved across generations. In a demonstration on FashionMNIST with non-IID data and client churn, FedGP outperforms all fixed baselines with statistically significant gains; GPU batch evaluation reduces the previously reported roughly tenfold wall-clock overhead to about 3.3× relative to fixed-rule methods. By placing evolved and fixed aggregation rules under identical controlled conditions, FASTER turns FedGP into a reusable, testable, and extensible research object for the evolutionary computation community.
- 3 October 2026
- Published by Springer Nature
- p. 499-513
Autonomous Skill Development: Neuro-Symbolic Agents that Self-generate Verifiable Tools
- 3 October 2026
- Published by Springer Nature
- p. 499-513
Autonomous Skill Development: Neuro-Symbolic Agents that Self-generate Verifiable Tools
- 3 October 2026
- Published by Springer Nature
- p. 226-240
AiDER: Auditing and Document Evaluation via Rule Compilation and Small Language Models – An Education Case Study
- 3 October 2026
- Published by Springer Nature
- p. 226-240
AiDER: Auditing and Document Evaluation via Rule Compilation and Small Language Models – An Education Case Study
- Open Access
- 4 August 2026
- Published by Springer Nature in Research Square
AiDER: Auditing and Document Evaluation via Rule Compilation and Small Language Models - An Education Case Study
Reviewing documents against natural-language requirements is hard when those requirements demand interpretation, contextual evidence, and non-trivial judgment. It is even harder when the review is to be automated reliably and made auditable. In domains like education, where teaching materials must align with pedagogical models and evolving expectations, including the rise of Large Language Models (LLMs), such decisions cannot be reduced to mechanical checks. When an LLM assigns a verdict directly, interpretation, evidence selection, and judgment collapse into a single opaque step, making errors hard to localize and outcomes hard to audit. AiDER separates interpretation from judgment under a deliberate 2B–4B parameter constraint. Each natural-language requirement is compiled into an executable Common Expression Language (CEL) rule, and static analysis of that rule produces a bounded-evidence scaffold that constrains what the model may extract from the document. The verdict is then computed deterministically by applying the rule to the extracted evidence (no LLM call at this step), yielding an inspectable trace from requirement to rule, rule to evidence, and evidence to verdict. We evaluate AiDER on four small models (Gemma 4 and Qwen3.5, at 2B and 4B) under three compilation strategies: human-written reference rules, direct compilation, and validation-loop repair. The evaluation uses 200 requirement-document pairs from a higher-education course pack. Across three performance dimensions (syntactic validity, semantic fidelity, and document-level agreement), direct compilation often yields valid but semantically divergent rules, whereas validation-driven repair substantially improves both validity and fidelity across all four models. An ablation shows that the static scaffold alone encodes most of the extraction intent: LLM-generated extraction contracts add little when the rule is well-specified, but matter more when it is ambiguous.
- 4 August 2026
- Published by Springer Nature in Research Square
Open AccessAiDER: Auditing and Document Evaluation via Rule Compilation and Small Language Models - An Education Case Study
Reviewing documents against natural-language requirements is hard when those requirements demand interpretation, contextual evidence, and non-trivial judgment. It is even harder when the review is to be automated reliably and made auditable. In domains like education, where teaching materials must align with pedagogical models and evolving expectations, including the rise of Large Language Models (LLMs), such decisions cannot be reduced to mechanical checks. When an LLM assigns a verdict directly, interpretation, evidence selection, and judgment collapse into a single opaque step, making errors hard to localize and outcomes hard to audit. AiDER separates interpretation from judgment under a deliberate 2B–4B parameter constraint. Each natural-language requirement is compiled into an executable Common Expression Language (CEL) rule, and static analysis of that rule produces a bounded-evidence scaffold that constrains what the model may extract from the document. The verdict is then computed deterministically by applying the rule to the extracted evidence (no LLM call at this step), yielding an inspectable trace from requirement to rule, rule to evidence, and evidence to verdict. We evaluate AiDER on four small models (Gemma 4 and Qwen3.5, at 2B and 4B) under three compilation strategies: human-written reference rules, direct compilation, and validation-loop repair. The evaluation uses 200 requirement-document pairs from a higher-education course pack. Across three performance dimensions (syntactic validity, semantic fidelity, and document-level agreement), direct compilation often yields valid but semantically divergent rules, whereas validation-driven repair substantially improves both validity and fidelity across all four models. An ablation shows that the static scaffold alone encodes most of the extraction intent: LLM-generated extraction contracts add little when the rule is well-specified, but matter more when it is ambiguous.