Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 110
Encontrada(s) 2 página(s)

e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publication Contribución de congreso (ConferenceOutput)

Eliminating Redundant Actions from Plans Using Classical Planning

  • Salerno, Mauricio Federico
  • Fuentetaja Pizán, Raquel
  • Seipp, Jendrik
Even though automated planning is PSPACE-complete in general, satisfcing planners are able to solve large planning tasks quickly. However, the found plans are often far from optimal and may even contain actions that can be removed while maintaining a valid plan. The problem of fnding and eliminating the most expensive set of such redundant actions in a plan is NP-complete and there is a compilation to MaxSAT that solves it. Here, we introduce a simple and natural formulation of the problem as a planning task. Solving it with an optimal planner guarantees fnding a minimal reduction. Our experiments show that this is competitive with the previous state of the art for optimal action elimination.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publication Artículo científico (JournalArticle)

A technical characterization of APTs by leveraging public resources

  • González Manzano, Lorena
  • Fuentes García-Romero de Tejada, José María de
  • Lombardi, Flavio
  • Ramos, Cristina
Advanced persistent threats (APTs) have rocketed over the last years. Unfortunately, their technical characterization is incomplete, it is still unclear if they are advanced usages of regular malware or a different form of malware. This is key to develop an effective cyberdefense. To address this issue, in this paper we analyze the techniques and tactics at stake for both regular and APT-linked malware. To enable reproducibility, our approach leverages only publicly available datasets and analysis tools. Our study involves 11,651 regular malware and 4686 APT-linked ones. Results show that both sets are not only statistically different, but can be automatically classified with F1 > 0.8 in most cases. Indeed, 8 tactics reach F1 > 0.9. Beyond the differences in techniques and tactics, our analysis shows thats actors behind APTs exhibit higher technical competence than those from non-APT malwares., This work has been partially supported by grant DEPROFAKE-CM-UC3M funded by UC3M and the Government of Madrid (CAM); by CAM through Project CYNAMON, Grant No. P2018/TCS-4566-CM, co-funded with ERDF; by Ministry of Science and Innovation of Spain by grant PID2019-111429RB-C21; by TRUST aWARE Project EU HORIZON 2020 Research and Innovation Programme GA No 101021377 trustaware.eu; and by TAILOR Project EU HORIZON 2020 Research and Innovation Programme GA No 952215 tailor-network.eu. Funding for APC: Universidad Carlos III de Madrid (Read & Publish Agreement CRUE-CSIC 2023).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publication Artículo científico (JournalArticle)

Finding Minimal Plan Reductions Using Classical Planning

  • Salerno, Mauricio Federico
  • Fuentetaja Pizán, Raquel
  • Seipp, Jendrik
Filiación correcta para investigadores uc3m: Universidad Carlos III de Madrid Published: Oct 6, 2025 While classical planning research has made tremendous progress in the last decades, many complex tasks can still only besolved suboptimally. The satisficing plans found for these tasks often contain actions that can be removed while maintainingplan validity. Removing such redundant actions is desirable since it can decrease the plan cost and simplify the plan. Reducinga plan to a minimum-cost plan without redundant actions is NP-complete and previous work addressed this problem with acompilation to weighted MaxSAT. In this work, we propose several simple and natural formulations to encode this problem asa classical planning task, and prove that solving the resulting tasks optimally guarantees finding minimal plan reductions. Weanalyze the relation of the classical planning formulations to the MaxSAT compilation, and prove theoretical properties of theknown concept ofplan action landmarks. Finally, we evaluate the new approaches experimentally and show that they arecompetitive with the previous state of the art in minimal plan reduction., This work was partially funded by grant PID2021-127647NB-C21 from MCIN/AEI/10.13039/501100011033, bythe ERDF “A way of making Europe”, and by the Madrid Government under the Multiannual Agreement withUC3M in the line of Excellence of University Professors (EPUC3M17) in the context of the V PRICIT (RegionalProgramme of Research and Technological Innovation). Furthermore, this work was partially supported by theWallenberg AI, Autonomous Systems and Software Program (WASP) funded by the Knut and Alice WallenbergFoundation and by TAILOR, a project funded by the EU Horizon 2020 research and innovation programme undergrant agreement no. 952215. The computations were enabled by resources provided by the National AcademicInfrastructure for Supercomputing in Sweden (NAISS) partially funded by the Swedish Research Council throughgrant agreement no. 2022-06725.
Repositorio Digital de la UPF
Publication Contribución de congreso (ConferenceOutput)

Generalized planning as heuristic search

  • Segovia-Aguas, Javier
  • Jiménez, Sergio
  • Jonsson, Anders, 1973-
Comunicació presentada a ICAPS2021, celebrat del 2 a 13 d'agost de 2021 de manera virtual., Although heuristic search is one of the most successful approaches to classical planning, this planning paradigm does not apply straightforwardly to Generalized Planning (GP). Planning as heuristic search traditionally addresses the computation of sequential plans by searching in a grounded state-space. On the other hand, GP aims at computing algorithm-like plans that can branch and loop, and that generalize to a (possibly infinite) set of planning instances. This paper adapts the {\em planning as heuristic search} paradigm to the particularities of GP and presents the first native heuristic search approach to GP. First, the paper defines a novel GP solution space that is independent of the number of planning instances in a GP problem, and the size of these instances. Second, the paper defines several evaluation and heuristic functions, that do not require grounding, for guiding a combinatorial search in the GP solution space, making it possible to handle state variables with large numerical domains (e.g. integers). Lastly, the paper defines an algorithm for GP called Best-First Generalized Planning (BFGP), that implements a best-first search in the solution space guided by our evaluation/heuristic functions., Javier Segovia-Aguas is supported by TAILOR, a project funded by EU H2020 research and innovation programme no. 952215, an ERC Advanced Grant no. 885107, and grant TIN-2015-67959-P from MINECO, Spain. Sergio Jiménez is supported by the Ramon y Cajal program, RYC-2015-18009, the Spanish MINECO project TIN2017-88476-C2-1-R. Anders Jonsson is partially supported by Spanish grants PID2019-108141GB-I00 and PCIN-2017-082.
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Hierarchical average-reward linearly-solvable Markov decision processes

  • Infante Molina, A. Guillermo
  • Jonsson, Anders, 1973-
  • Gómez Cerdà, Vicenç
We introduce a novel approach to hierarchical reinforcement learning for Linearly-solvable Markov Decision Processes (LMDPs) in the infinite-horizon average-reward setting. Unlike previous work, our approach allows learning low-level and high-level tasks simultaneously, without imposing limiting restrictions on the low-level tasks. Our method relies on partitions of the state space that create smaller subtasks that are easier to solve, and the equivalence between such partitions to learn more efficiently. We then exploit the compositionality of low-level tasks to exactly represent the value function of the high-level task. Experiments show that our approach can outperform flat average-reward reinforcement learning by one or several orders of magnitude., Anders Jonsson is partially funded by TAILOR (EU H2020 #952215), AGAUR SGR and Spanish grant PID2019-108141GB-I00. This publication is part of the action CNS2022-136178 financed by MCIN/AEI/10.13039/501100011033 and by the European Union Next Generation EU/PRTR.
Repositorio Digital de la UPF
Publication Contribución de congreso (ConferenceOutput)

Expressing and exploiting the common subgoal structure of classical planning domains using sketches

  • Drexler, Dominik
  • Seipp, Jendrik
  • Geffner, Héctor
Comunicació presentada a 18th International Conference on Principles of Knowledge Representation and Reasoning (KR2021), celebrat del 3 al 12 de novembre de 2021 de manera virtual., Width-based planning methods deal with conjunctive goals by decomposing problems into subproblems of low width. Algorithms like SIW thus fail when the goal is not easily serializable in this way or when some of the subproblems have a high width. In this work, we address these limitations by using a simple but powerful language for expressing finer problem decompositions introduced recently by Bonet and Geffner, called policy sketches. A policy sketch R over a set of Boolean and numerical features is a set of sketch rules that express how the values of these features are supposed to change. Like general policies, policy sketches are domain general, but unlike policies, the changes captured by sketch rules do not need to be achieved in a single step. We show that many planning domains that cannot be solved by SIW are provably solvable in low polynomial time with the SIW_R algorithm, the version of SIW that employs user-provided policy sketches. Policy sketches are thus shown to be a powerful language for expressing domain-specific knowledge in a simple and compact way and a convenient alternative to languages such as HTNs or temporal logics. Furthermore, they make it easy to express general problem decompositions and prove key properties of them like their width and complexity., This work was partially supported by an ERC Advanced Grant (grant agreement no. 885107), by project TAILOR, funded by EU Horizon 2020 (grant agreement no. 952215), and by the Knut and Alice Wallenberg Foundation. Hector Geffner is a Wallenberg Guest Professor at Linkoping University, Sweden. We used compute resources from the Swedish National Infrastructure for Computing (SNIC), partially funded by the Swedish Research Council through grant agreement no. 2018-05973.
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects

  • Segovia-Aguas, Javier
  • Jiménez, Sergio
  • Jonsson, Anders, 1973-
Planning as heuristic search is one of the most successful approaches to classical planning but unfortunately, it does not trivially extend to Generalized Planning (GP); GP aims to compute algorithmic solutions that are valid for a set of classical planning instances from a given domain, even if these instances differ in their number of objects, the initial and goal configuration of these objects and hence, in the number (and possible values) of the state variables. State-space search, as it is implemented by heuristic planners, becomes then impractical for GP. In this paper we adapt the planning as heuristic search paradigm to the generalization requirements of GP, and present the first native heuristic search approach to GP. First, the paper introduces a new pointer-based solution space for GP that is independent of the number of classical planning instances in a GP problem and the size of those instances (i.e. the number of objects, state variables and their domain sizes). Second, the paper defines an upgraded version of our GP algorithm, called Best-First Generalized Planning (BFGP), that implements a best-first search in our pointer-based solution space for GP. Lastly, the paper defines a set of evaluation and heuristic functions for BFGP that assess the structural complexity of the candidate GP solutions, as well as their fitness to a given input set of classical planning instances. The computation of these evaluation and heuristic functions does not require grounding states or actions in advance. Therefore our GP as heuristic search approach can handle large sets of state variables with large numerical domains, e.g. integers., This work has been co-funded by MCIN/AEI /10.13039/501100011033 under the Maria de Maeztu Units of Excellence Programme (CEX2021-001195-M), TAILOR (H2020 #952215) and AIPlan4EU (H2020 #101016442) projects. Javier Segovia-Aguas is also supported by AGAUR SGR and the Spanish grant PID2019-108141 GB-I00. Sergio Jiménez is supported by the Spanish MINECO project PID2021-127647NB-C22. Anders Jonsson is partially supported by Spanish grant PID2019-108141 GB-I00.
Repositorio Digital de la UPF
Publication Contribución de congreso (ConferenceOutput)

Learning first-order representations for planning from black box states: new results

  • Rodriguez, Ivan D.
  • Bonet, Blai
  • Romero, Javier
  • Geffner, Héctor
Comunicació presentada a 18th International Conference on Principles of Knowledge Representation and Reasoning (KR2021), celebrat del 3 al 12 de novembre de 2021 de manera virtual., Recently Bonet and Geffner have shown that first-order representations for planning domains can be learned from the structure of the state space without any prior knowledge about the action schemas or domain predicates. For this, the learning problem is formulated as the search for a simplest first-order domain description D that along with information about instances I_i (number of objects and initial state) determine state space graphs G(P_i) that match the observed state graphs G_i where P_i = (D, I_i). The search is cast and solved approximately by means of a SAT solver that is called over a large family of propositional theories that differ just in the parameters encoding the possible number of action schemas and domain predicates, their arities, and the number of objects. In this work, we push the limits of these learners by moving to an answer set programming (ASP) encoding using the CLINGO system. The new encodings are more transparent and concise, extending the range of possible models while facilitating their exploration. We show that the domains introduced by Bonet and Geffner can be solved more efficiently in the new approach, often optimally, and furthermore, that the approach can be easily extended to handle partial information about the state graphs as well as noise that prevents some states from being distinguished., The work is partially supported by an ERC Advanced Grant (No 885107), by project TAILOR, funded by an EU Horizon 2020 Grant (No 952215), and by the Knut and Alice Wallenberg (KAW) Foundation under the WASP program.
Repositorio Digital de la UPF
Publication Contribución de congreso (ConferenceOutput)

State representation learning for goal-conditioned reinforcement learning

  • Steccanella, Lorenzo
  • Jonsson, Anders, 1973-
Comunicació presentada a European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2022), celebrat del 19 al 23 de setembre de 2022 a Grenoble, França., This paper presents a novel state representation for reward-free Markov decision processes. The idea is to learn, in a self-supervised manner, an embedding space where distances between pairs of embedded states correspond to the minimum number of actions needed to transition between them. Compared to previous methods, our approach does not require any domain knowledge, learning from offline and unlabeled data. We show how this representation can be leveraged to learn goal-conditioned policies, providing a notion of similarity between states and goals and a useful heuristic distance to guide planning and reinforcement learning algorithms. Finally, we empirically validate our method in classic control domains and multi-goal environments, demonstrating that our method can successfully learn representations in large and/or continuous domains., Anders Jonsson is partially funded by the Spanish grant PID2019-108141GB-I00 and the European project TAILOR (H2020, GA 952215).
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

FOND planning with explicit fairness assumptions

  • Rodriguez, Ivan D.
  • Bonet, Blai
  • Sardina, Sebastian
  • Geffner, Héctor
We consider the problem of reaching a propositional goal condition in fully-observable nondeterministic (FOND) planning under a general class of fairness assumptions that are given explicitly. The fairness assumptions are of the form A/B and say that state trajectories that contain infinite occurrences of an action a from A in a state s and finite occurrence of actions from B, must also contain infinite occurrences of action a in s followed by each one of its possible outcomes. The infinite trajectories that violate this condition are deemed as unfair, and the solutions are policies for which all the fair trajectories reach a goal state. We show that strong and strong-cyclic FOND planning, as well as QNP planning, a planning model introduced recently for generalized planning, are all special cases of FOND planning with fairness assumptions of this form which can also be combined. FOND+ planning, as this form of planning is called, combines the syntax of FOND planning with some of the versatility of LTL for expressing fairness constraints. A sound and complete FOND+ planner is implemented by reducing FOND+ planning to answer set programs, and its performance is evaluated in comparison with FOND and QNP planners, and LTL synthesis tools. Two other FOND+ planners are introduced as well which are more scalable but are not complete., The work is partially supported by an ERC Advanced Grant (No 885107), the project TAILOR, funded by an EU Horizon 2020 Grant (No 952215), and by the Knut and Alice Wallenberg (KAW) Foundation under the WASP program.
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Flexible FOND planning with explicit fairness assumptions

  • Rodriguez, Ivan D.
  • Bonet, Blai
  • Sardina, Sebastian
  • Geffner, Héctor
We consider the problem of reaching a propositional goal condition in fully-observable non-deterministic (FOND) planning under a general class of fairness assumptions that are given explicitly. The fairness assumptions are of the form A/B and say that state trajectories that contain infinite occurrences of an action a from A in a state s and finite occurrence of actions from B, must also contain infinite occurrences of action a in s followed by each one of its possible outcomes. The infinite trajectories that violate this condition are deemed as unfair, and the solutions are policies for which all the fair trajectories reach a goal state. We show that strong and strong-cyclic FOND planning, as well as QNP planning, a planning model introduced recently for generalized planning, are all special cases of FOND planning with fairness assumptions of this form which can also be combined. FOND+ planning, as this form of planning is called, combines the syntax of FOND planning with some of the versatility of LTL for expressing fairness constraints. A new planner is implemented by reducing FOND+ planning to answer set programs, and the performance of the planner is evaluated in comparison with FOND and QNP planners, and LTL synthesis tools., The work is partially supported by an ERC Advanced Grant (No 885107), the project TAILOR, funded by an EU Horizon 2020 Grant (No 952215), and by the Knut and Al-ice Wallenberg (KAW) Foundation under the WASP pro-gram. Hector Geffner is a Wallenberg Guest Professor at Linköping University, Sweden.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

General scales unlock AI evaluation with explanatory and predictive power

  • Zhou, Lexin
  • Pacchiardi, Lorenzo
  • Collins, Katherine M.
  • Zhang, Seraphina
  • Zhao, Qinlin
  • Huang, Yitian
  • Sun, Luning
  • Prunty, Jonathan E.
  • Li, Zongqian
  • Sanchez-Garcia, Pablo
  • Casares, Pablo A. M.
  • Zu, Jiyun
  • Martínez-Plumed, Fernando|||0000-0003-2902-6477
  • Moros-Daval, Yael
  • Jiang-Chen, Ke-Xin
  • Burden, John
  • Mehrbakhsh, Behzad|||0000-0001-9017-989X
  • Stillwell, David
  • Cebrian, Manuel
  • Wang, Jindong
  • Henderson, Peter
  • Wu, Sherry Tongshuang
  • Kyllonen, Patrick C.
  • Cheke, Lucy
  • Xie, Xing
  • Hernández-Orallo, José|||0000-0001-9746-7632
[EN] Ensuring safe and effective use of artificial intelligence (AI) requires understanding and anticipating its performance on new tasks, from advanced scientific challenges to transformed workplace activities1, 2-3. So far, benchmarking has guided progress in AI but has offered limited explanatory and predictive power for general-purpose AI systems4, 5, 6, 7-8, attributed to limited transferability across specific tasks9, 10-11. Here we introduce general scales for AI evaluation that elicit demand profiles explaining what capabilities common AI benchmarks truly measure, extract ability profiles quantifying the general strengths and limits of AI systems and robustly predict AI performance for new task instances. Our fully automated methodology builds on 18 rubrics, capturing a broad range of cognitive and intellectual demands, which place different task instances on the same general scales, illustrated on 15 large language models (LLMs) and 63 tasks. Both the demand and the ability profiles on these scales bring new insights such as construct validity through benchmark sensitivity and specificity and explain conflicting claims about whether AI has reasoning capabilities. Ultimately, high predictive power at the instance level becomes possible using the general scales, providing superior estimates over strong black-box baseline predictors, especially in out-of-distribution settings (new tasks and benchmarks). The scales, rubrics, battery, techniques and results presented here constitute a solid foundation for a science of AI evaluation, underpinning the reliable deployment of AI in the years ahead., We thank the POLARIS Lab and the Computational Cognitive Science Lab at Princeton University, the European AI Office, the UK AISI, the Future of Life Institute, the OECD Future of Skills team, S. Chang, M. Zilka, J. Lian, R. Burnell, W. Schellaert, A. Gomez, M. Tesic, C. Li and P. Romero for their valuable help and feedback at certain stages of the project. We thank OpenAI for granting us research access to several LLMs to conduct the experiments in this paper and DeepSeek and Meta for giving us access to the weights of their models. We acknowledge support from the following institutions: Microsoft Accelerate Foundation Models Research (AFMR) grant programme, Long-Term Future Scholarship financed by Coefficient Giving (formerly Open Philanthropy) and the Spanish Government's Knowledge Generation Projects (PID2023-150271NB-C21). This work was also supported by CIPROM/2022/6 (FASSLOW), IDIFEDER/2021/05 (CLUSTERIA), CIACIF/2023/276, financed by Generalitat Valenciana, the EC H2020-EU grant agreement no. 952215 (TAILOR), Spanish grants PID2021-122830OB-C42 (SFERA), PID2023-150271NB-C21 and PID2024-162030OB-100 (ROBIN) financed by MCIN/AEI/10.13039/501100011033 and 'ERDF A way of making Europe', Catedra ENIA-UPV in Sustainable AI Development, TSI-100930-2023-9, INCIBE's Chair financed by the EU's NextGenerationEU, EUR2024-153548 (PREDAIT) 'Towards Predictable AI' from 'Spanish Europe Excelencia' 2024, Spanish National Research Council (CSIC) Special Intramural Projects programme and the Cambridge Trust. M.C. declares support from Google.org through the Silicon Valley Community Foundation by means of a grant to Fundacion General CSIC. The research of J.H.-O. is supported by OpenAI's grant to the 'AI Progress through the Lens of Predictable AI Ecosystems' programme, which is based at the Leverhulme Centre for the Future of Intelligence at the University of Cambridge.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

From Simultaneous to Streaming Machine Translation by Leveraging Streaming History

  • Iranzo-Sánchez, Javier
  • Civera Saiz, Jorge|||0000-0002-0963-0143
  • Juan, Alfons|||0000-0002-9984-4072
[EN] Simultaneous Machine Translation is the task of incrementally translating an input sentence before it is fully available. Currently, simultaneous translation is carried out by translating each sentence independently of the previously translated text. More generally, Streaming MT can be understood as an extension of Simultaneous MT to the incremental translation of a continuous input text stream. In this work, a state-of-the-art simultaneous sentencelevel MT system is extended to the streaming setup by leveraging the streaming history. Extensive empirical results are reported on IWSLT Translation Tasks, showing that leveraging the streaming history leads to significant quality gains. In particular, the proposed system proves to compare favorably to the best performing systems., The research leading to these results has received funding from the European Union¿s Horizon 2020 research and innovation programme under grant agreements no. 761758 (X5Gon) and 952215 (TAILOR), and Erasmus+ Education programme under grant agreement no. 20-226-093604-SCH (EXPERT); the Government of Spain¿s grant RTI2018-094879-B-I00 (Multisub) funded by MCIN/AEI/10.13039/501100011033 & ¿ERDF A way of making Europe¿, and FPU scholarships FPU18/04135; and the Generalitat Valenciana¿s research project Classroom Activity Recognition (ref. PROMETEO/2019/111). The authors gratefully acknowledge the computer resources at Artemisa, funded by the European Union ERDF and Comunitat Valenciana as well as the technical support provided by the Instituto de Física Corpuscular, IFIC (CSIC-UV).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

An Efficient Canonical Narrowing Implementation with Irreducibility and SMT Constraints for Generic Symbolic Protocol Analysis

  • López-Rueda, Raúl|||0000-0002-2550-8041
  • Escobar Román, Santiago|||0000-0002-3550-4781
  • Sapiña-Sanchis, Julia|||0000-0003-2994-6986
[EN] Narrowing and unification are very useful tools for symbolic analysis of rewrite theories, and thus for any model that can be specified in that way. A very clear example of their application is the field of formal cryptographic protocol analysis, which is why narrowing and unification are used in tools such as Maude-NPA, Tamarin and Akiss. In this work we present the implementation of a canonical narrowing algorithm, which improves the standard narrowing algorithm, extended to be able to process rewrite theories with conditional rules. The conditions of the rules will contain SMT constraints, which will be carried throughout the execution of the algorithm to determine if the solutions have associated satisfiable or unsatisfiable constraints, and in the latter case, discard them., This work has been partially supported by the EC H2020-EU grant agreement No. 952215 (TAILOR) , by the grant PID2021-122830OB-C42 funded by MCIN/AEI/10.13039/501100011033 and ERDF A way of making Europe, by the grant CIPROM/2022/6 funded by Generalitat Valenciana, and by the grant PCI2020-120708-2 funded by MICIN/AEI/10.13039/501100011033 and by the European Union NextGenerationEU/PRTR. Raul Lopez has been supported by the grant FPI-2022- S2-49802 funded by Universitat Politecnica de Valencia.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

On the Languages Accepted by Watson-Crick Finite Automata with Delays

  • Sempere Luna, José María|||0000-0003-2393-9224
[EN] In this work, we analyze the computational power of Watson-Crick finite automata (WKFA) if some restrictions over the transition function in the model are imposed. We consider that the restrictions imposed refer to the maximum length difference between the two input strands which is called the delay. We prove that the language class accepted by WKFA with such restrictions is a proper subclass of the languages accepted by arbitrary WKFA in general. In addition, we initiate the study of the language classes characterized by WKFAs with bounded delays. We prove some of the results by means of various relationships between WKFA and sticker systems., This work has been developed with the financial support of the European Union's Horizon 2020 research and innovation programme under grant agreement No. 952215 corresponding to the TAILOR project.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Semantic Categories: Uncertainty and Similarity

  • Fabregat-Hernandez, Ares
  • Palanca Cámara, Javier|||0000-0002-6209-9603
  • Botti V.|||0000-0002-6507-2756
[EN] This paper addresses understanding and categorizing language by using Markov categories to establish a mathematical framework for semantic concepts. This framework enables us to measure the semantic similarity between linguistic expressions within a given text. Furthermore, this approach enables the measurement and control of uncertainty in language categorization and the creation of metrics for evaluating semantic similarity. We provide use cases to demonstrate how the proposed methods can be applied and computed, focusing on their interpretability and the universality of categorical constructions. This work contributes to the field by offering a novel perspective on semantic similarity and uncertainty metrics in language processing, generating criteria to automate their computation., This work is partially supported by the TAILOR project, a project funded by the EU Horizon 2020 research and innovation programme under GA No 952215, and by the GUARDIA project, a project funded by Generalitat Valenciana GVA-CEICE project PROMETEO/2018/002.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Unveiling the robustness of machine learning families

  • Fabra-Boluda, Raúl
  • Ferri, C.
  • Ramírez Quintana, María José|||0000-0002-0559-3568
  • Martínez-Plumed, Fernando|||0000-0003-2902-6477
[EN] The evaluation of machine learning systems has typically been limited to performance measures on clean and curated datasets, which may not accurately reflect their robustness in real-world situations where data distribution can vary from learning to deployment, and where truthfully predict some instances could be more difficult than others. Therefore, a key aspect in understanding robustness is instance difficulty, which refers to the level of unexpectedness of system failure on a specific instance. We present a framework that evaluates the robustness of different ML models using item response theory-based estimates of instance difficulty for supervised tasks. This framework evaluates performance deviations by applying perturbation methods that simulate noise and variability in deployment conditions. Our findings result in the development of a comprehensive taxonomy of ML techniques, based on both the robustness of the models and the difficulty of the instances, providing a deeper understanding of the strengths and limitations of specific families of ML models. This study is a significant step towards exposing vulnerabilities of particular families of ML models., This work was funded by the Norwegian Research Council Grant 329745 Machine Teaching for Explainable AI, the MIT-Spain-INDITEX Sustainability Seed Fund under Project COST-OMIZE, CIPROM/2022/6 (FASSLOW) funded by Generalitat Valenciana, the EC H2020-EU Grant Agreement No. 952215 (TAILOR), and Spanish Grant PID2021-122830OB-C42 (SFERA) funded by MCIN/AEI/10.13039/501100011033 and 'ERDF A way of making Europe'. RFB is supported by predoctoral Grant PRE2019-090892.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Detection of microfibres in wastewater sludge with deep learning

  • Martí-Pérez, Félix
  • Domínguez-Rodríguez, Ana|||0009-0003-6175-2361
  • C. Monserrat|||0000-0003-1790-8085
  • Ferri Ramírez, César|||0000-0002-8975-1120
  • Lujan Facundo, Maria Jose|||0000-0001-6871-0584
  • Ferrer-Polonio, Eva|||0000-0001-6412-3825
  • Bes-Piá, M.A.|||0000-0001-8005-7450
  • Mendoza Roca, José Antonio
[EN] The proliferation of microplastics, especially microfibres (MFi), represents a significant environmental concern due to their persistence and potential health risks. In particular, wastewater treatment plants are among the primary contributors to the release of MFi into ecosystems, making it crucial to detect and quantify these pollutants, mainly in sewage sludge. Effective monitoring not only helps assess the extent of pollution but also identifies key sources. Traditional detection methods are labour-intensive and lack the scalability necessary for effective monitoring. This study presents a novel approach utilising advanced deep learning techniques to enhance the detection of MFi in sewage sludge samples using two different filtration support (fibreglass and cellulose acetate). By leveraging convolutional neural networks (CNNs), we developed a robust system for accurately identifying and localising microfibres. Our deep learning framework, implemented using Mask R-CNN architecture, demonstrates superior performance in detecting MFi, achieving a mean average precision (mAP) of 72% for the glass dataset and 68% for the cellulose acetate dataset. This approach significantly reduces manual effort and processing time. However, further improvements are still possible, as our model shows weaker performance for smaller fibres and those that resemble fibrous morphology (particularly on cellulose acetate filters). Future work could address these issues by expanding the presented datasets to address the identified shortcomings., This work was supported by the project CIPROM/2022/6 (FASSLOW) funded by Generalitat Valenciana, the EC H2020-EU grant agreement No.952215 (TAILOR), and Spanish grant PID2021-122830OB-C42 (SFERA) funded by MCIN/AEI/10.13039/501100011033 and ``ERDF A way of making Europe''. Authors thank Grant PID2021-127468OBI00 funded by MICIU/AEI/10.13039/501100011033 and by ERDF/EU. The authors also thank Business Chair FACSA-FOVASA from Universitat Politècnica de València.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Optimal Teaching Curricula with Compositional Simplicity Priors

  • García-Piqueras, Manuel
  • Hernández-Orallo, José|||0000-0001-9746-7632
[EN] Machine teaching under strong simplicity priors can teach any concept in universal languages. Remarkably, recent experiments suggest that the teaching sets are shorter than the concept description itself. This raises many important questions about the complexity of concepts and their teaching size, especially when concepts are taught incrementally. In this paper we put a bound to these surprising experimental findings and reconnect teaching size and concept complexity: complex concepts do require large teaching sets. Also, we analyse teaching curricula, and find a new interposition phenomenon: the teaching size of a concept can increase because examples are captured by simpler concepts built on previously acquired knowledge. We provide a procedure that not only avoids interposition but builds an optimal curriculum. These results indicate novel curriculum design strategies for humans and machines., This work was funded by the EU (FEDER) and Spanish MINECO under RTI2018-094403-B-C32, G. Valenciana under PROMETEO/2019/098 and EU's Horizon 2020 research and innovation programme under grant 952215 (TAILOR).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Tesis doctoral (DoctoralThesis)

Streaming Neural Speech Translation

  • Iranzo Sánchez, Javier
[ES] Gracias a avances significativos en aprendizaje profundo, la traducción del habla (ST) se ha convertido en un campo consolidado, lo que permite la utilización de la tecnología ST en soluciones para entornos de producción. Como consecuencia del aumento constante del número de horas de contenido audiovisual generado cada año, así como una mayor sensibilización sobre la importancia de la accesibilidad, la ST está preparada para convertirse en un elemento clave para la producción de contenidos audiovisuales, tanto de ocio como educativos. A pesar de que se ha progresado significativamente en ST, la mayor parte de la investigación se ha centrado en el escenario en diferido (offline), en el cual todo el audio de entrada está disponible. En cambio, la ST en directo (online) es una temática en la que falta mucho por investigar. En concreto, existe un caso de traducción en directo, la traducción continua (streaming), que traduce un flujo continuo de palabras en tiempo real y bajo unas estrictas condiciones de latencia. Este es un problema mucho más realista, que es necesario resolver para que sea posible aplicar la ST a una variedad de tareas de la vida real. Esta tesis está centrada en investigar y desarrollar las técnicas claves que son necesarias para una solución de ST continua. En primer lugar, de cara a permitir el desarrollo y la evaluación de sistemas de ST, se ha recopilado un nuevo conjunto de datos para ST multilingüe, que expande significativamente el número de horas disponibles para ST. A continuación se ha desarrollado un segmentador preparado para la condición continua, que se utiliza para segmentar las transcripciones intermedias de nuestra solución por etapas, que consiste en un sistema de reconocimiento automático del habla (ASR), seguido de un sistema de traducción automática (MT) encargado de traducir las transcripciones intermedias al idioma de destino elegido. Diversas investigaciones han concluido que la calidad de la segmentación es un factor muy influyente es la calidad del sistema MT, por lo que el desarrollo de un segmentador efectivo es un paso fundamental en el proceso de ST continua. Este segmentador se ha integrado en la solución por etapas, y estas se optimizan de manera conjunta para alcanzar el equilibrio óptimo entre calidad y latencia. La ST continua tiene unas restricciones de latencia mucho más estrictas que la ST en directo, ya que el nivel deseado de latencia tiene que mantenerse durante todo el proceso de traducción. Por tanto, es crucial ser capaz de medir de manera precisa esta latencia, pero las métricas estándar de ST en directo no se adaptan bien a esta tarea. Como consecuencia de esto, se proponen nuevos métodos para la evaluación de ST continua, que garantizan unos resultados precisos a la vez que interpretables. Por último, se presenta un nuevo método para mejorar la calidad de la traducción continua mediante el uso de información contextual. Mientras que los sistemas tradicionales de ST en directo traducen audios de manera aislada, existe abundante información contextual que está disponible para mejorar los sistemas de ST continua. Nuestra propuesta introduce el concepto de historia continua, que consiste en el almacenamiento de la información más reciente del proceso de traducción, que se utiliza más adelante por el modelo para mejorar la calidad de la traducción., [CA] Gràcies a avanços significatius en aprenentatge profund, la traducció de la parla (ST) s'ha convertit en un camp consolidat, la qual cosa permet la utilització de la tecnologia ST en solucions per a entorns de producció. A conseqüència de l'augment constant del nombre d'hores de contingut audiovisual generat cada any, així com una major sensibilització sobre la importància de l'accessibilitat, la ST està preparada per a convertir-se en un element clau per a la producció de continguts audiovisuals, tant d'oci com educatius. A pesar que s'ha progressat significativament en ST, la major part de la recerca s'ha centrat en l'escenari en diferit, en el qual tot l'àudio d'entrada està disponible. En canvi, la ST en directe és una temàtica en la qual falta molt per investigar. En concret, existeix un cas de traducció en directe, la traducció contínua, que tradueix un flux continu de paraules en temps real i sota unes estrictes condicions de latència. Aquest és un problema molt més realista, que és necessari resoldre perquè sigui possible aplicar la ST a una varietat de tasques de la vida real. Aquesta tesi està centrada en investigar i desenvolupar les tècniques claus que són necessàries per a una solució de ST contínua. En primer lloc, de cara a permetre el desenvolupament i l'avaluació de sistemes de ST, s'ha recopilat un nou conjunt de dades per a ST multilingüe, que expandeix significativament la quantitat de dades disponibles per a ST. A continuació s'ha desenvolupat un segmentador preparat per a la condició contínua, que s'utilitza per a segmentar les transcripcions intermèdies de la nostra solució per etapes, que consisteix en un sistema de reconeixement automàtic de la parla (ASR), seguit d'un sistema de traducció automàtica (MT) encarregat de traduir les transcripcions intermèdies a l'idioma de destí triat. Diveros treballs de recerca han conclòs que la qualitat de la segmentació és un factor molt important en la qualitat del sistema MT, per la qual cosa el desenvolupament d'un segmentador efectiu és un pas fonamental en el procés de ST contínua. Aquest segmentador s'ha integrat en la solució per etapes, i aquestes s'optimitzen de manera conjunta per a aconseguir l'equilibri òptim entre qualitat i latència. La ST contínua té unes restriccions de latència molt més estrictes que la ST en directe, ja que el nivell desitjat de latència ha de mantindre's durant tot el procés de traducció. Per tant, és crucial ser capaç de mesurar de manera precisa aquesta latència, però les mètriques estàndard de ST en directe no s'adapten bé a aquesta tasca. A conseqüència d'això, es proposen nous mètodes per a l'avaluació de ST contínua, que garanteixen uns resultats precisos alhora que interpretables. Finalment, es presenta un nou mètode per a millorar la qualitat de la traducció contínua mitjançant l'ús d'informació contextual. Mentre que els sistemes tradicionals de ST en directe tradueixen àudios de manera aïllada, existeix abundant informació contextual que està disponible per a millorar els sistemes de ST contínua. La nostra proposta introdueix el concepte d'història contínua, que consisteix en l'emmagatzematge de la informació més recent del procés de traducció, que s'utilitza més endavant pel model per a millorar la qualitat de la traducció., [EN] Thanks to significant advances in Deep Learning, Speech Translation (ST) has become a mature field that enables the use of ST technology in production-ready solutions. Due to the ever-increasing hours of audio-visual content produced each year, as well as higher awareness of the importance of media accessibility, ST is poised to become a key element for the production of entertainment and educational media. Although significant advances have been made in ST, most research has focused on the offline scenario, where the entire input audio is available. In contrast, online ST remains an under-researched topic. A special case of online ST, streaming ST, translates an unbounded input stream in a real-time fashion under strict latency constraints. This is a much more realistic problem that needs to be solved in order to apply ST to a variety of real-life tasks. The focus of this thesis is on researching and developing key techniques necessary for a successful streaming ST solution. First, in order to enable ST system development and evaluation, a new multilingual ST dataset is collected, which significantly expands the amount of hours available for ST. Then, a streaming-ready segmenter component is developed to segment the intermediate transcriptions of our proposed cascade solution, which consists in an Automatic Speech Recognition (ASR) system that transcribes the audio, followed by a Machine Translation (MT) system that translates the intermediate transcriptions into the desired language. Research has shown that segmentation quality plays a significant role in downstream MT performance, so the development of an effective streaming segmenter is a critical step in the streaming ST process. This segmenter is then integrated and the components of the cascade are jointly optimized to achieve an appropriate quality-latency trade-off. Streaming ST has much more strict latency constraints than standard online ST, as the desired latency level must be maintained during the whole translation process. Therefore, it is crucial to be able to accurately measure this latency, but the standard online ST metrics are not well suited for this task. As a consequence, new evaluation methods are proposed for streaming ST evaluation, which ensure realistic, yet interpretable results. Lastly, a novel method is presented for improving translation quality through the use of contextual information. Whereas standard online ST systems translate audios in isolation, there is a wealth of contextual information available for improving streaming ST systems. Our approach introduces the concept of streaming history by storing the most recent information of the translation process, which is then used by the model in order to improve translation quality., The research leading to these results has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreements no. 761758 (X5Gon) and 952215 (TAILOR), and Erasmus+ Educa- tion programme under grant agreement no. 20-226-093604-SCH (EXPERT); the Government of Spain’s grant RTI2018-094879-B-I00 (Multisub) funded by MCIN/AEI/10.13039/501100011033 & “ERDF A way of making Europe”, and FPU scholarships FPU18/04135; and the Generalitat Valenciana’s research project Classroom Activity Recognition (ref. PROMETEO/2019/111) and predoctoral research scholarship ACIF/2017/055.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Missing the missing values: The ugly duckling of fairness in machine learning

  • Martínez-Plumed, Fernando|||0000-0003-2902-6477
  • Ferri Ramírez, César|||0000-0002-8975-1120
  • Hernández-Orallo, José|||0000-0001-9746-7632
  • Nieves, David
[EN] Nowadays, there is an increasing concern in machine learning about the causes underlying unfair decision making, that is, algorithmic decisions discriminating some groups over others, especially with groups that are defined over protected attributes, such as gender, race and nationality. Missing values are one frequent manifestation of all these latent causes: protected groups are more reluctant to give information that could be used against them, sensitive information for some groups can be erased by human operators, or data acquisition may simply be less complete and systematic for minority groups. However, most recent techniques, libraries and experimental results dealing with fairness in machine learning have simply ignored missing data. In this paper, we present the first comprehensive analysis of the relation between missing values and algorithmic fairness for machine learning: (1) we analyse the sources of missing data and bias, mapping the common causes, (2) we find that rows containing missing values are usually fairer than the rest, which should discourage the consideration of missing values as the uncomfortable ugly data that different techniques and libraries for handling algorithmic bias get rid of at the first occasion, (3) we study the trade-off between performance and fairness when the rows with missing values are used (either because the technique deals with them directly or by imputation methods), and (4) we show that the sensitivity of six different machine-learning techniques to missing values is usually low, which reinforces the view that the rows with missing data contribute more to fairness through the other, nonmissing, attributes. We end the paper with a series of recommended procedures about what to do with missing data when aiming for fair decision making., Ministerio de Economia, Industria y Competitividad, Gobierno de Espana (ES), Grant/Award Number: RTI2018-094403-B-C3; Generalitat Valenciana, Grant/Award Number: PROMETEO/2019/09; Future of Life Institute, Grant/Award Number: RFP2-15; European Commission, Grant/Award Number: DG JRC - HUMAINT project
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

When AI Difficulty is Easy: The Explanatory Power of Predicting IRT Difficulty

  • Martínez-Plumed, Fernando|||0000-0003-2902-6477
  • C. Monserrat|||0000-0003-1790-8085
  • Hernández-Orallo, José|||0000-0001-9746-7632
  • Castellano, David
[EN] One of challenges of artificial intelligence as a whole is robustness. Many issues such as adversarial examples, out of distribution performance, Clever Hans phenomena, and the wider areas of AI evaluation and explainable AI, have to do with the following question: Did the system fail because it is a hard instance or because something else? In this paper we address this question with a generic method for estimating IRT-based instance difficulty for a wide range of AI domains covering several areas, from supervised feature-based clas- sification to automated reasoning. We show how to estimate difficulty systematically using off-the-shelf machine learning regression models. We illustrate the usefulness of this estima- tion for a range of applications., This work has been partially supported by the EU (FEDER) and Spanish MINECO grant RTI2018-094403-B-C32 funded by MCIN/AEI/10.13039/501100011033 and by ERDF A way of making Europe , Generalitat Valenciana under grant PROMETEO/2019/098, EU s Horizon 2020 research and innovation programme under grant agreement No. 952215 (TAILOR), the Future of Life Institute, FLI, under grant RFP2-152, US DARPA HR00112120007 (RECoG-AI), the AI-Watch and HUMAINT projects by DG CONNECT and DG JRC of the European Commission, and INNEST/2021/317 (Project cofunded by the European Union with the Programa Operativo del Fondo Europeo de Desarrollo Regional (FEDER) de la Comunitat Valenciana 2014-2020).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Larger and more instructable language models become less reliable

  • Zhou, Lexin
  • Schellaert, Wout Willy M.
  • Martínez-Plumed, Fernando|||0000-0003-2902-6477
  • Moros-Daval, Yael
  • Ferri Ramírez, César|||0000-0002-8975-1120
  • Hernández-Orallo, José|||0000-0001-9746-7632
[EN] The prevailing methods to make large language models more powerful and amenable have been based on continuous scaling up (that is, increasing their size, data volume and computational resources1 ) and bespoke shaping up (including post-fltering2,3 , fne tuning or use of human feedback4,5 ). However, larger and more instructable large language models may have become less reliable. By studying the relationship between difculty concordance, task avoidance and prompting stability of several language model families, here we show that easy instances for human participants are also easy for the models, but scaled-up, shaped-up models do not secure areas of low difculty in which either the model does not err or human supervision can spot the errors. We also fnd that early models often avoid user questions but scaled-up, shaped-up models tend to give an apparently sensible yet wrong answer much more often, including errors on difcult questions that human supervisors frequently overlook. Moreover, we observe that stability to diferent natural phrasings of the same question is improved by scaling-up and shaping-up interventions, but pockets of variability persist across difculty levels. These fndings highlight the need for a fundamental shift in the design and development of general-purpose artifcial intelligence, particularly in high-stakes areas for which a predictable distribution of errors is paramount., We acknowledge support from the following institutions: Long-Term Future Scholarship funded by Open Philanthropy; Grant for Master Studies funded by ValgrAI Valencian Graduate School and Research Network for Artificial Intelligence and Generalitat Valenciana; FISCALTICS (I+D+i PID2022-140110OA-I00), funded by MICIU/AEI/10.13039/501100011033 and by ERDF, EU; CIPROM/2022/6 (FASSLOW) and IDIFEDER/2021/05 (CLUSTERIA) funded by Generalitat Valenciana; the EC H2020-EU grant agreement no. 952215 (TAILOR); US DARPA HR00112120007 (RECoG-AI) and Spanish grant PID2021-122830OB-C42 (SFERA) funded by MCIN/AEI/10.13039/501100011033 and ERDF A way of making Europe ; and the Vic. Inv. of the Universitat Politècnica de Valencia under DOCEMPR21, DOCEMPR22 and DOCEMPR23.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

From Affect Theoretical Foundations to Computational Models of Intelligent Affective Agents

  • Alfonso, Bexy
  • Taverner-Aparicio, Joaquín José|||0000-0002-5163-5335
  • Vivancos, Emilio|||0000-0002-0213-0234
  • Botti V.|||0000-0002-6507-2756
[EN] The links between emotions and rationality have been extensively studied and discussed. Several computational approaches have also been proposed to model these links. However, is it possible to build generic computational approaches and languages so that they can be "adapted " when a specific affective phenomenon is being modeled? Would these approaches be sufficiently and properly grounded? In this work, we want to provide the means for the development of these generic approaches and languages by making a horizontal analysis inspired by philosophical and psychological theories of the main affective phenomena that are traditionally studied. Unfortunately, not all the affective theories can be adapted to be used in computational models; therefore, it is necessary to perform an analysis of the most suitable theories. In this analysis, we identify and classify the main processes and concepts which can be used in a generic affective computational model, and we propose a theoretical framework that includes all these processes and concepts that a model of an affective agent with practical reasoning could use. Our generic theoretical framework supports incremental research whereby future proposals can improve previous ones. This framework also supports the evaluation of the coverage of current computational approaches according to the processes that are modeled and according to the integration of practical reasoning and affect-related issues. This framework is being used in the development of the GenIA(3) architecture., This work is partially supported by the Spanish Government projects PID2020-113416RB-I00, GVA-CEICE project PROMETEO/2018/002, and TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Aggregating Value Systems for Decision Support

  • Lera-Leri, Roger X.
  • Liscio, Enrico
  • Bistaffa, Filippo
  • Jonker, Catholijn M.
  • Lopez-Sanchez, Maite
  • Murukannaiah, Pradeep K.
  • Rodriguez-Aguilar, Juan A.
  • Salas-Molina, Francisco|||0000-0002-1168-7931
[EN] We adopt an emerging and prominent vision of human -centred Artificial Intelligence that requires building trustworthy intelligent systems. Such systems should be capable of dealing with the challenges of an interconnected, globalised world by handling plurality and by abiding by human values. Within this vision, pluralistic value alignment is a core problem for AI- that is, the challenge of creating AI systems that align with a set of diverse individual value systems. So far, most literature on value alignment has considered alignment to a single value system. To address this research gap, we propose a novel method for estimating and aggregating multiple individual value systems. We rely on recent results in the social choice literature and formalise the value system aggregation problem as an optimisation problem. We then cast this problem as an l(p)-regression problem. Doing so provides a principled and general theoretical framework to model and solve the aggregation problem. Our aggregation method allows us to consider a range of ethical principles, from utilitarian (maximum utility) to egalitarian (maximum fairness). We illustrate the aggregation of value systems by considering real -world data from two case studies: the Participatory Value Evaluation process and the European Values Study. Our experimental evaluation shows how different consensus value systems can be obtained depending on the ethical principle of choice, leading to practical insights for a decision -maker on how to perform value system aggregation., The authors were supported by the research projects ACISUD (PID2022-136787NB-I00) , VAE (TED2021-131295B-C31) , VALAWAI (HE-101070930) , Fairtrans (PID2021-124361OB-C33) , Yoma OR (OPE02570) , TAILOR (952215) , and the Hybrid Intelligence Center, a 10-year programme funded by the Dutch Ministry of Education, Culture and Science through the Netherlands Organisation for Scientific Research. Maite Lopez-Sanchez belongs to the WAI research group (University of Barcelona) , an associated unit to CSIC through the IIIA.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

When Redundancy Matters: Machine Teaching of Representations

  • Ferri Ramírez, César|||0000-0002-8975-1120
  • Hernández-Orallo, José|||0000-0001-9746-7632
  • Garigliotti, Dario
  • Havardstun, Brigt
  • Telle, Jan Arne
[EN] In traditional machine teaching, a teacher needs to teach a concept to a learner by means of a finite set of examples, the witness set. But concepts can have many equivalent representations. This redundancy strongly affects the search space, to the extent that teacher and learner may not be able to easily determine the equivalence class of each representation. In this common situation, instead of teaching concepts, we explore the idea of teaching representations. We work with several teaching schemas that exploit representation and witness size (Eager, Greedy and Optimal) and analyze the gains in teaching effectiveness, both theoretically, and also experimentally for languages where redundancy can vary (DNF expressions and Turing-complete P3 programs). Our theoretical and experimental results indicate that there are various types of redundancy, related, e.g,. to the spread of the redundant representations, handled better by the new Greedy schema introduced here than by the Eager schema. For P3 programs witness sets found by Greedy are usually smaller than the programs they identify, corroborating previous results that conveying information efficiently is a leitmotif of machine teaching., Open access funding provided by University of Bergen (incl Haukeland University Hospital). This work was funded by the Norwegian Research Council grant 329745 Machine Teaching for Explainable AI, CIPROM/2022/6 (FASSLOW) funded by Generalitat Valenciana, the EC H2020-EU grant agreement No. 952215 (TAILOR), and Spanish grant PID2021-122830OB-C42 (SFERA) funded by MCIN / AEI / 10.13039/501100011033 and ERDF A way of making Europe.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Supportive consensus

  • Palomares Chust, Alberto|||0000-0002-4583-467X
  • Rebollo Pedruelo, Miguel|||0000-0002-5115-8751
  • Carrascosa Casamayor, Carlos|||0000-0003-3649-6530
[EN] The paper is concerned with the consensus problem in a multi-agent system such that each agent has boundary constraints. Classical Olfati-Saber's consensus algorithm converges to the same value of the consensus variable, and all the agents reach the same value. These algorithms find an equality solution. However, what happens when this equality solution is out of the range of some of the agents? In this case, this solution is not adequate for the proposed problem. In this paper, we propose a new kind of algorithms called supportive consensus where some agents of the network can compensate for the lack of capacity of other agents to reach the average value, and so obtain an acceptable solution for the proposed problem. Supportive consensus finds an equity solution. In the rest of the paper, we define the supportive consensus, analyze and demonstrate the network's capacity to compensate out of boundaries agents, propose different supportive consensus algorithms, and finally, provide some simulations to show the performance of the proposed algorithms., The author(s) received specific funding for this work from the Valencian Research Institute for Artificial Intelligence (VRAIN) where the authors are currently working. This work is partially supported by the Spanish Government project RTI2018-095390-B-C31, GVA-CEICE project PROMETEO/2018/002, and TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Optimization of Rewrite Theories by Equational Partial Evaluation

  • Alpuente Frasnedo, María|||0000-0002-9268-1178
  • Escobar Román, Santiago|||0000-0002-3550-4781
  • Sapiña-Sanchis, Julia|||0000-0003-2994-6986
  • Ballis, D.
[EN] In this paper, we develop an automated optimization framework for rewrite theories that supports sorts, subsort overloading, equations and algebraic axioms with free/nonfree constructors, and rewrite rules modeling concurrent system transitions whose state structure is defined by means of the equations. The main idea of the framework is to make the system computations more efficient by partially evaluating the equations to the specific calls that are required by the transition rules. This can be particularly useful for automatically optimizing rewrite theories that contain overly general equational theories which perform unnecessary and costly computations involving pattern matching and/or unification modulo equations and axioms. The transformation is based on a suitable unfolding operator parameter that relies on the symbolic operational engine of Maude's equational theories, called folding variant narrowing, together with a generic abstraction operator. Depending on the properties of the rewrite theory, the unfolding and abstraction operators must be fine-tuned to achieve the biggest optimization possible while ensuring termination and total correctness of the transformation. We formalize two instances of our scheme for the case when the rewrite theory either has an infinite number of most general variants or a finite number of most general variants. Finally, we discuss some experimental results which demonstrate that the proposed optimization technique pays off in practice.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Team formation through an assessor: choosing MARL agents in pursuit evasion games

  • Zhao, Yue
  • Ju, Lushan
  • Hernández-Orallo, José|||0000-0001-9746-7632
[EN] Team formation in multi-agent systems usually assumes the capabilities of each team member are known, and the best formation can be derived from that information. As AI agents become more sophisticated, this characterisation is becoming more elusive and less predictive about the performance of a team in cooperative or competitive situations. In this paper, we introduce a general and flexible way of anticipating the outcome of a game for any lineups (the agents, sociality regimes and any other hyperparameters for the team). To this purpose, we simply train an assessor using an appropriate team representation and standard machine learning techniques. We illustrate how we can interrogate the assessor to find the best formations in a pursuit-evasion game for several scenarios: offline team formation, where teams have to be decided before the game and not changed afterwards, and online team formation, where teams can see the lineups of the other teams and can be changed at any time., This work was funded by CIPROM/2022/6 (FASSLOW) and IDIFEDER/2021/05 (CLUSTERIA) funded by Generalitat Valenciana, the EC H2020-EU grant agreement No. 952215 (TAILOR), and Spanish grant PID2021-122830OB-C42 (SFERA) funded by MCIN/AEI/10.13039/501100011033 and ERDF A way of making Europe
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Generating networks of genetic processors

  • Campos Frances, Marcelino
  • Sempere Luna, José María|||0000-0003-2393-9224
[EN] The Networks of Genetic Processors (NGPs) are non-conventional models of computation based on genetic operations over strings, namely mutation and crossover operations as it was established in genetic algorithms. Initially, they have been proposed as acceptor machines which are decision problem solvers. In that case, it has been shown that they are universal computing models equivalent to Turing machines. In this work, we propose NGPs as enumeration devices and we analyze their computational power. First, we define the model and we propose its definition as parallel genetic algorithms. Once the correspondence between the two formalisms has been established, we carry out a study of the generation capacity of the NGPs under the research framework of the theory of formal languages. We investigate the relationships between the number of processors of the model and its generative power. Our results show that the number of processors is important to increase the generative capability of the model up to an upper bound, and that NGPs are universal models of computation if they are formulated as generation devices. This allows us to affirm that parallel genetic algorithms working under certain restrictions can be considered equivalent to Turing machines and, therefore, they are universal models of computation., This research was partially supported by TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Maximal and minimal dynamic Petri net slicing

  • Llorens Agost, María Luisa|||0000-0002-2790-0055
  • Oliver Villarroya, Javier|||0000-0002-1169-1260
  • Silva, Josep|||0000-0001-5096-0008
  • Tamarit, S.
[EN] Context: Petri net slicing is a technique to reduce the size of a Petri net to ease the analysis or understanding of the original Petri net. Objective: Presenting two new Petri net slicing algorithms to isolate those places and transitions of a Petri net (the slice) that may contribute tokens to one or more places given (the slicing criterion). Method: The two algorithms proposed are formalized. The maximality of the first algorithm and the minimality of the second algorithm are formally proven. Both algorithms together with three other state-of-the-art algorithms have been implemented and integrated into a single tool so that we have been able to carry out a fair empirical evaluation. Results: Besides the two new Petri net slicing algorithms, a public, free, and open-source implementation of five algorithms is reported. The results of an empirical evaluation of the new algorithms and the slices they produce are also presented. Conclusions: The first algorithm collects all places and transitions that may contribute tokens (in any computation) to the slicing criterion, while the second algorithm collects the places and transitions needed to fire the shortest transition sequence that contributes tokens to some place in the slicing criterion. Therefore, the net computed by the first algorithm can reproduce any computation that contributes tokens to any place of interest. In contrast, the second algorithm loses this possibility, but it often produces a much more reduced subnet (which still can reproduce some computations that contribute tokens to some places of interest). The first algorithm is proven maximal, and the second one is proven minimal., This work has been partially supported by the EU (FEDER) and the Spanish MCI/AEI under grant PID2019-104735RB-C41 and by the European Union's Horizon 2020 research and innovation programme under grant agreement No 952215 (Tailor).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Research community dynamics behind popular AI benchmarks

  • Martínez-Plumed, Fernando|||0000-0003-2902-6477
  • Hernández-Orallo, José|||0000-0001-9746-7632
  • Barredo, Pablo
  • Ó HÉigeartaigh, Seán
[EN] The widespread use of experimental benchmarks in AI research has created competition and collaboration dynamics that are still poorly understood. Here we provide an innovative methodology to explore these dynamics and analyse the way different entrants in these challenges, from academia to tech giants, behave and react depending on their own or others' achievements. We perform an analysis of 25 popular benchmarks in AI from Papers With Code, with around 2,000 result entries overall, connected with their underlying research papers. We identify links between researchers and institutions (that is, communities) beyond the standard co-authorship relations, and we explore a series of hypotheses about their behaviour as well as some aggregated results in terms of activity, performance jumps and efficiency. We characterize the dynamics of research communities at different levels of abstraction, including organization, affiliation, trajectories, results and activity. We find that hybrid, multi-institution and persevering communities are more likely to improve state-of-the-art performance, which becomes a watershed for many community members. Although the results cannot be extrapolated beyond our selection of popular machine learning benchmarks, the methodology can be extended to other areas of artificial intelligence or robotics, and combined with bibliometric studies., F.M.-P. acknowledges funding from the AI-Watch project by DG CONNECT and DG JRC of the European Commission. J.H.-O. and S.O.h. were funded by the Future of Life Institute, FLI, under grant RFP2-152. J.H.-O. was supported by the EU (FEDER) and Spanish MINECO under RTI2018-094403-B-C32, Generalitat Valenciana under PROMETEO/2019/098 and European Union's Horizon 2020 grant no. 952215 (TAILOR).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A Comprehensive Framework for Learning Declarative Action Models

  • Aineto, Diego
  • Jiménez-Celorrio, Sergio|||0000-0003-0561-4880
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
[EN] A declarative action model is a compact representation of the state transitions of dynamic systems that generalizes over world objects. The specification of declarative action models is often a complex hand-crafted task. In this paper we formulate declarative action models via state constraints, and present the learning of such models as a combinatorial search. The comprehensive framework presented here allows us to connect the learning of declarative action models to well-known problem solving tasks. In addition, our framework allows us to characterize the existing work in the literature according to four dimensions: (1) the target action models, in terms of the state transitions they define; (2) the available learning examples; (3) the functions used to guide the learning process, and to evaluate the quality of the learned action models; (4) the learning algorithm. Last, the paper lists relevant successful applications of the learning of declarative actions models and discusses some open challenges with the aim of encouraging future research work., This work is supported by the Spanish MINECO project TIN2017-88476-C2-1-R and partially supported by the EU ICT-48 2020 project TAILOR (No. 952215). D. Aineto is partially supported by the FPU16/03184 and S. Jimenez by the RYC15/18009.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Persuasion-enhanced computational argumentative reasoning through argumentation-based persuasive frameworks

  • Ruiz-Dolz, Ramon
  • Taverner-Aparicio, Joaquín José|||0000-0002-5163-5335
  • Heras, Stella|||0000-0001-6212-9377
  • García-Fornes, A|||0000-0003-4482-8793
[EN] One of the greatest challenges of computational argumentation research consists of creating persuasive strategies that can effectively influence the behaviour of a human user. From the human perspective, argumentation represents one of the most effective ways to reason and to persuade other parties. Furthermore, it is very common that humans adapt their discourse depending on the audience in order to be more persuasive. Thus, it is of utmost importance to take into account user modelling features for personalising the interactions with human users. Through computational argumentation, we can not only devise the optimal solution, but also provide the rationale for it. However, synergies between computational argumentative reasoning and computational persuasion have not been researched in depth. In this paper, we propose a new formal framework aimed at improving the persuasiveness of arguments resulting from the computational argumentative reasoning process. For that purpose, our approach relies on an underlying abstract argumentation framework to implement this reasoning and extends it with persuasive features. Thus, we combine a set of user modelling and linguistic features through the use of a persuasive function in order to instantiate abstract arguments following a user-specific persuasive policy. From the results observed in our experiments, we can conclude that the framework proposed in this work improves the persuasiveness of argument-based computational systems. Furthermore, we have also been able to determine that human users place a high level of trust in decision support systems when they are persuaded using arguments and when the reasons behind the suggestion to modify their behaviour are provided., This work is partially supported by the Spanish Government projects PID2020-113416RB-I00, the Generalitat Valenciana project CIPROM/2021/077, and TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Abstract Contract Synthesis and Verification in the Symbolic K Framework

  • Alpuente Frasnedo, María|||0000-0002-9268-1178
  • Villanueva, Alicia|||0000-0003-1090-5009
  • Pardo, Daniel
[EN] In this article, we propose a symbolic technique that can be used for automatically inferring software contracts from programs that are written in a non-trivial fragment of C, called KERNELC, that supports pointer-based structures and heap manipulation. Starting from the semantic definition of KERNELC in the K semantic framework, we enrich the symbolic execution facilities recently provided by K with novel capabilities for contract synthesis that are based on abstract subsumption. Roughly speaking, we define an abstract symbolic technique that axiomatically explains the execution of any (modifier) C function by using other (observer) routines in the same program. We implemented our technique in the automated tool KINDSPEC 2.1, which generates logical axioms that express pre- and post-condition assertions which define the precise input/output behavior of the C routines. Thanks to the integrated support for symbolic execution and deductive verification provided by K, some synthesized axioms that cannot be guaranteed to be correct by construction due to abstraction can finally be verified in our setting with little effort., This work has been partially supported by the EC H2020-EU grant agreement No. 952215 (TAILOR), the EU (FEDER) and the Spanish MCIU under grant RTI2018-094403-B-C32, by Generalitat Valenciana under grant PROMETEO/2019/098.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Page-Level Main Content Extraction from Heterogeneous Webpages

  • Alarte-Aleixandre, Julián
  • Silva, Josep|||0000-0001-5096-0008
[EN] The main content of a webpage is often surrounded by other boilerplate elements related to the template, such as menus, advertisements, copyright notices, and comments. For crawlers and indexers, isolating the main content from the template and other noisy information is an essential task, because processing and storing noisy information produce a waste of resources such as bandwidth, storage space, and computing time. Besides, the detection and extraction of the main content is useful in different areas, such as data mining, web summarization, and content adaptation to low resolutions. This work introduces a new technique for main content extraction. In contrast to most techniques, this technique not only extracts text, but also other types of content, such as images, and animations. It is a Document Object Model-based page-level technique, thus it only needs to load one single webpage to extract the main content. As a consequence, it is efficient enough as to be used online (in real-time). We have empirically evaluated the technique using a suite of real heterogeneous benchmarks producing very good results compared with other well-known content extraction techniques., This work has been partially supported by the EU (FEDER) and the Spanish MCI/AEI under grants TIN2016-76843-C4-1-R and PID2019-104735RB-C41, by the Generalitat Valenciana under grant Prometeo/2019/098 (DeepTrust), and by TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

MLLP-VRAIN Spanish ASR Systems for the Albayzín-RTVE 2020 Speech-to-Text Challenge: Extension

  • Baquero-Arnal, Pau
  • Iranzo-Sánchez, Javier
  • Pérez-González de Martos, Alejandro Manuel
  • Jorge-Cano, Javier|||0000-0002-9279-6768
  • Giménez Pastor, Adrián
  • Garcés Díaz-Munío, Gonçal|||0000-0002-2594-5858
  • Silvestre Cerdà, Joan Albert|||0000-0003-2291-8296
  • Civera Saiz, Jorge|||0000-0002-0963-0143
  • Sanchis Navarro, José Alberto|||0000-0002-2943-0990
  • Juan, Alfons|||0000-0002-9984-4072
[EN] This paper describes the automatic speech recognition (ASR) systems built by the MLLP-VRAIN research group of Universitat Politècnica de València for the Albayzín-RTVE 2020 Speech-to-Text Challenge, and includes an extension of the work consisting of building and evaluating equivalent systems under the closed data conditions from the 2018 challenge. The primary system (p-streaming_1500ms_nlt) was a hybrid ASR system using streaming one-pass decoding with a context window of 1.5 seconds. This system achieved 16.0% WER on the test-2020 set. We also submitted three contrastive systems. From these, we highlight the system c2-streaming_600ms_t which, following a similar configuration as the primary system with a smaller context window of 0.6 s, scored 16.9% WER points on the same test set, with a measured empirical latency of 0.81 ± 0.09 s (mean ± stdev). That is, we obtained state-of-the-art latencies for high-quality automatic live captioning with a small WER degradation of 6% relative. As an extension, the equivalent closed-condition systems obtained 23.3% WER and 23.5% WER, respectively. When evaluated with an unconstrained language model, we obtained 19.9% WER and 20.4% WER; i.e., not far behind the top-performing systems with only 5% of the full acoustic data and with the extra ability of being streaming-capable. Indeed, all of these streaming systems could be put into production environments for automatic captioning of live media streams., The research leading to these results has received funding from the European Union's Horizon 2020 research and innovation programme under grant agreements no. 761758 (X5Gon) and 952215 (TAILOR), and Erasmus+ Education programme under grant agreement no. 20-226-093604-SCH (EXPERT); the Government of Spain's grant RTI2018-094879-B-I00 (Multisub) funded by MCIN/AEI/10.13039/501100011033 & "ERDF A way of making Europe", and FPU scholarships FPU14/03981 and FPU18/04135; the Generalitat Valenciana's research project Classroom Activity Recognition (ref. PROMETEO/2019/111), and predoctoral research scholarship ACIF/2017/055; and the Universitat Politecnica de Valencia's PAID-01-17 R&D support programme.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

P systems in the time of COVID-19

  • Baquero, Fernando
  • Llorens, Carlos
  • Campos Frances, Marcelino
  • Sempere Luna, José María|||0000-0003-2393-9224
[EN] In this paper, we present LOIMOS, which is an epidemiological scenario simulator developed in the context of the fight against the pandemic caused by coronavirus SARS-CoV-2 on a global scale. LOIMOS has been fully developed under the paradigm of membrane computing using transition P systems with communication rules, active membranes and a stochastic simulator engine. In this paper we detail the main components of the system and we report some examples of epidemiological scenarios evaluated with LOIMOS., This work has been developed with the financial support of the Ministerio de Ciencia e Innovacion and Instituto de Salud Carlos III, Grant COV20_00067, and the European Union's Horizon 2020 research and innovation programme under Grant agreement no. 952215 corresponding to the TAILOR project.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

MLLP-VRAIN UPV systems for the IWSLT 2022 Simultaneous Speech Translation and Speech-to-Speech Translation tasks

  • Iranzo-Sánchez, Javier
  • Pérez-González de Martos, Alejandro
  • Baquero-Arnal, Pau
  • Jorge-Cano, Javier|||0000-0002-9279-6768
  • Giménez Pastor, Adrián
  • Garcés Díaz-Munío, Gonçal|||0000-0002-2594-5858
  • Silvestre Cerdà, Joan Albert|||0000-0003-2291-8296
  • Civera Saiz, Jorge|||0000-0002-0963-0143
  • Sanchis Navarro, José Alberto|||0000-0002-2943-0990
  • Juan, Alfons|||0000-0002-9984-4072
[EN] This work describes the participation of the MLLP-VRAIN research group in the two shared tasks of the IWSLT 2022 conference: Simultaneous Speech Translation and Speech-to-Speech Translation. We present our streaming-ready ASR, MT and TTS systems for Speech Translation and Synthesis from English into German. Our submission combines these systems by means of a cascade approach paying special attention to data preparation and decoding for streaming inference., The research leading to these results has received funding from the European Union's Horizon 2020 research and innovation programme under grant agreements no. 761758 (X5Gon) and 952215 (TAILOR), and Erasmus+ Education programme under grant agreement no. 20- 226-093604-SCH (EXPERT); the Government of Spain¿s grant RTI2018-094879-B-I00 (Multisub) funded by MCIN/AEI/10.13039/501100011033 & ERDF A way of making Europe, and FPU scholarships FPU18/04135; and the Generalitat Valenciana¿s research project Classroom Activity Recognition (ref. PROMETEO/2019/111).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Trends in AI inference energy consumption: Beyond the performance-vs-parameter laws of deep learning

  • Desislavov, Radosvet
  • Martínez-Plumed, Fernando|||0000-0003-2902-6477
  • Hernández-Orallo, José|||0000-0001-9746-7632
[EN] The progress of some AI paradigms such as deep learning is said to be linked to an exponential growth in the number of parameters. There are many studies corroborating these trends, but does this translate into an exponential increase in energy consumption? In order to answer this question we focus on inference costs rather than training costs, as the former account for most of the computing effort, solely because of the multiplicative factors. Also, apart from algorithmic innovations, we account for more specific and powerful hardware (leading to higher FLOPS) that is usually accompanied with important energy efficiency optimisations. We also move the focus from the first implementation of a breakthrough paper towards the consolidated version of the techniques one or two year later. Under this distinctive and comprehensive perspective, we analyse relevant models in the areas of computer vision and natural language processing: for a sustained increase in performance we see a much softer growth in energy consumption than previously anticipated. The only caveat is, yet again, the multiplicative factor, as future AI increases penetration and becomes more pervasive., We thank the reviewers for their insightful remarks, which have helped improve the paper significantly. This work has been partially supported by the MIT-Spain-INDITEX Sustainability Seed Fund under project COST-OMIZE, the grant PID2021-122830OB-C42 funded by MCIN/AEI/10.13039/501100011033 and "ERDF A way of making Europe", Generalitat Valenciana under INNEST/2021/317 and PROMETEO/2019/098, EU's Horizon 2020 research and innovation programme under grant agreement No. 952215 (TAILOR) , the Future of Life Institute, FLI, under grant RFP2-152, US DARPA HR00112120007 (RECoG-AI).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Exploring explainable AI: category theory insights into machine learning algorithms

  • Fabregat-Hernandez, Ares
  • Palanca Cámara, Javier|||0000-0002-6209-9603
  • Botti V.|||0000-0002-6507-2756
[EN] Explainable artificial intelligence (XAI) is a growing field that aims to increase the transparency and interpretability of machine learning (ML) models. The aim of this work is to use the categorical properties of learning algorithms in conjunction with the categorical perspective of the information in the datasets to give a framework for explainability. In order to achieve this, we are going to define the enriched categories, with decorated morphisms, LearnLearn , ParaPara and MNetMNet of learners, parameterized functions, and neural networks over metric spaces respectively. The main idea is to encode information from the dataset via categorical methods, see how it propagates, and lastly, interpret the results thanks again to categorical (metric) information. This means that we can attach numerical (computable) information via enrichment to the structural information of the category. With this, we can translate theoretical information into parameters that are easily understandable. We will make use of different categories of enrichment to keep track of different kinds of information. That is, to see how differences in attributes of the data are modified by the algorithm to result in differences in the output to achieve better separation. In that way, the categorical framework gives us an algorithm to interpret what the learning algorithm is doing. Furthermore, since it is designed with generality in mind, it should be applicable in various different contexts. There are three main properties of category theory that help with the interpretability of ML models: formality, the existence of universal properties, and compositionality. The last property offers a way to combine smaller, simpler models that are easily understood to build larger ones. This is achieved by formally representing the structure of ML algorithms and information contained in the model. Finally, universal properties are a cornerstone of category theory. They help us characterize an object, not by its attributes, but by how it interacts with other objects. Thus, we can formally characterize an algorithm by how it interacts with the data. The main advantage of the framework is that it can unify under the same language different techniques used in XAI. Thus, using the same language and concepts we can describe a myriad of techniques and properties of ML algorithms, streamlining their explanation and making them easier to generalize and extrapolate., This work is partially supported by the TAILOR project, a project funded by the EU Horizon 2020 research and innovation programme under GA No. 952215, and by the GUARDIA project, a project funded by Generalitat Valenciana GVA-CEICE Project PROMETEO/2018/002.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Slicing unconditional jumps with unnecessary control dependencies

  • Galindo, Carlos|||0000-0002-3569-6218
  • Silva, Josep|||0000-0001-5096-0008
  • Pérez-Rubio, Sergio
[EN] Program slicing is an analysis technique that has a wide range of applications, ranging from compilers to clone detection software, and that has been applied to practically all programming languages. Most program slicing techniques are based on a widely extended program representation, the System Dependence Graph (SDG). However, in the presence of unconditional jumps, there exist some situations where most SDG-based slicing techniques are not as accurate as possible, including more code than strictly necessary. In this paper, we identify one of these scenarios, pointing out the cause of the inaccuracy, and describing the initial solution to the problem proposed in the literature, together with an extension, which solves the problem completely. These solutions modify both the SDG generation and the slicing algorithm. Additionally, we propose an alternative solution, that solves the problem by modifying only the SDG generation, leaving the slicing algorithm untouched., This work has been partially supported by the EU (FEDER) and the Spanish MCI/AEI under grants TIN2016-76843-C4-1-R and PID2019-104735RB-C41, by the Generalitat Valenciana under grant Prometeo/2019/098 (DeepTrust), and by TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Distilling the Effects of Language Model Contamination

  • Mehrbakhsh, Behzad|||0000-0001-9017-989X
  • Martínez-Plumed, Fernando|||0000-0003-2902-6477
  • Hernández-Orallo, José|||0000-0001-9746-7632
[EN] The proportion of AI-generated content permeating the well of knowledge is increasing significantly. Large language models (LLMs) contribute to that contamination but they also suffer from it. However, it is yet to be clarified the effect of different sources of error, be it human-generated or LLM-generated. Controlling for the percentage of error, we explore the impact on LLM fine-tuning when errors come from humans, from other language models or are generated randomly using an aleatoric or epistemic source. In this paper, we compare these different types of error for in-distribution and out-of-distribution experimental settings. By analysing the levels of errors and their distribution, we find a nuanced view: while in-distribution human-generated noise seems more benign than the LLM-generated counterpart, in the out-of-distribution case the model-generated noise may not be necessarily worse., We thank the anonymous reviewers for their comments and Dr. Peter Clark for providing us with the extended version of the OpenBookQA dataset. This work was funded by valgrAI, the Future of Life Institute, FLI, under grant RFP2-152, the EU (FEDER) and Spanish grant RTI2018-094403-B-C32 funded by MCIN/AEI/10.13039/501100011033 and by CIPROM/2022/6 funded by Generalitat Valenciana, EU s Horizon 2020 research and innovation programme under grant agreement No. 952215 (TAILOR), and Spanish grant PID2021-122830OB-C42 (SFERA) funded by MCIN/AEI/10.13039/501100011033 and "ERDF A way of making Europe"
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A multidimensional culturally adapted representation of emotions for affective computational simulation and recognition

  • Taverner-Aparicio, Joaquín José|||0000-0002-5163-5335
  • Vivancos, Emilio|||0000-0002-0213-0234
  • Botti V.|||0000-0002-6507-2756
[EN] One of the main challenges in affective computing is the development of models to represent the information that is inherent to emotions. It is necessary to consider that the terms used by humans to name emotions depend on the culture and language used. This article presents an experiment-based method to represent and adapt emotion terms to different cultural environments. We propose using circular boxplots to analyze the distribution of emotions in the Pleasure-Arousal space. From the results of this analysis, we define a new cross-cultural representation model of emotions in which each emotion term is assigned to an area in the Pleasure-Arousal space. An emotion is represented by a vector in which the direction indicates the type, and the module indicates the intensity of the emotion. We propose two methods based on fuzzy logic to represent and express emotions: the emotion representation process in which the term associated with the recognized emotion is defuzzified and projected as a vector in the Pleasure-Arousal space; and the emotion expression process in which a fuzzification of the vector is produced, generating a fuzzy emotion term that is adapted to the culture and language in which the emotion will be used., This work was supported in part by the Spanish Government project TIN2017-89156-R, Generalitat Valenciana, and European Social Fund by the FPI Grant ACIF/2017/085, in part GVA-CEICE project PROMETEO/2018/002, and TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A general supply-inspect cost framework to regulate the reliability-usability trade-offs for few-shot inference

  • Martínez-Plumed, Fernando|||0000-0003-2902-6477
  • Ramírez Quintana, María José|||0000-0002-0559-3568
  • Hernández-Orallo, José|||0000-0001-9746-7632
  • Jaimovitch-López, Gonzalo Eduardo
  • Ferri, C.
[EN] Language models and other recent machine learning paradigms blur the distinction between generative and discriminative tasks, in a continuum that is regulated by the degree of pre- and post-supervision that is required from users, as well as the tolerated level of error. In few-shot inference, we need to find a trade-off between the number and cost of the solved examples that have to be supplied, those that have to be inspected (some of them accurate but others needing correction) and those that are wrong but pass undetected. In this paper, we define a new Supply-Inspect Cost Framework, associated graphical representations and comprehensive metrics that consider all these elements. To optimise few-shot inference under specific operating conditions, we introduce novel algorithms that go beyond the concept of rejection rules in both static and dynamic contexts. We illustrate the effectiveness of all these elements for a transformative domain, data wrangling, for which language models can have a huge impact if we are able to properly regulate the reliability-usability trade-off, as we do in this paper., The funding has been received from ValgrAI - Valencian Graduate School and Research Network for Artificial Intelligence; the Norwegian Research Council with Grant no. 329745 (Machine Teaching for Explainable AI); Generalitat Valenciana with Grant nos. CIPROM/2022/6 (FASSLOW) and IDIFEDER/2021/05 (CLUSTERIA); the European Commission under H2020-EU with Grant no. 952215 (TAILOR); US DARPA with Grant no. HR00112120007 (RECoG-AI); the Future of Life Institute with Grant no. RFP2-152; the Spanish Ministry of Science and Innovation (MCIN/AEI/10.13039/ 501100011033) with Grant no. PID2021-122830OB-C42 (SFERA) and ERDF A way of making Europe ; and the Spanish Ministry of Universities with Grant no. PID2022-140110OA-I00 (FISCALTICS) funded by MICIU/AEI/10.13039/501100011033 and by ERDF, EU.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Semiautomatic generation and assessment of Java exercises in engineering education

  • Insa Cabrera, David
  • Pérez-Rubio, Sergio
  • Tamarit Muñoz, Salvador
  • Silva, Josep|||0000-0001-5096-0008
[EN] Continuous assessment is essential in education. It should be an integral part of education that provides immediate feedback to students. Unfortunately, the assessment of programming source code is still a hand-operated and error-prone task, and can take weeks before the student gets feedback. This study presents a semiautomatic code assessment method able to automatically apply black-box assessment (which relies on the comparison of input-output pairs) and white-box assessment (which relies on checking different source code properties). The method proposed is a general-purpose assessment system that was originally designated to be used in engineering education, but that can be used in other educational contexts to assist the assessment of any Java programming assignments or exams. The main advantage of this system is that the assessment made is quicker, exhaustive, and objective; and it does not produce false positives. After the application of this method over two years in several real university courses, we have released a public and free implementation. An empirical evaluation of this system estimates that the amount of assessment work automatically done by the tool is over 48%. Additionally, the system has been used to measure the average subjective influence (i.e., assessment errors) introduced by teachers when they assess exams manually., MINECO/AEI/FEDER (EU), Grant/Award Number: TIN2016-76843-C4-1-R; Universitat Politecnica de Valencia, Grant/Award Number: FPI Grant PAID-01-18; Generalitat Valenciana, Grant/Award Number: Prometeo/2019/098 (DeepTrust); TAILOR, EU Horizon 2020, Grant/Award Number: GA No 952215
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Computational Affective Knowledge Representation for Agents Located in a Multicultural Environment

  • Taverner-Aparicio, Joaquín José|||0000-0002-5163-5335
  • Vivancos, Emilio|||0000-0002-0213-0234
  • Botti V.|||0000-0002-6507-2756
  • Brännström, Andreas
  • Durães, Dalila
  • Novais, Paulo
  • Nieves, Juan Carlos
[EN] In this paper, we propose a new computational model for affective knowledge representation that will be used for affective agents located in a multicultural environment. To this end, we present the results of two experiments, the first of which determines the most appropriate labels to define the pleasure-arousal dimensions in the culture and language of the agent¿s location. As an example, we use the Portuguese and Swedish languages. The second experiment identifies the most suitable values of pleasure-arousal dimensions for each emotion expressed in these example languages. The results obtained are compared with a previous model developed for agents interacting with European Spanish-speaking people. Results show significant differences in the values of pleasure and arousal associated with emotions across languages and cultures. The results also show no significant differences in gender or age when associating levels of pleasure-arousal to emotions. We propose two applications of these representation models, such as a model of an agent capable of adapting its affective behavior to different cultural environments and a human-aware planning scenario in which the agent uses this dimensional representation to recognize the user¿s affective state and select the best strategy to redirect that affective state to the target state., This work is partially supported by the Spanish Government project PID2020-113416RB-I00 and TAILOR, a project funded by EU Horizon 2020 under GA No 952215.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Solving the tourist trip design problem with time windows and variable profit using incremental local search

  • Marzal Calatayud, Eliseo Jorge|||0000-0003-0658-1953
  • Sebastiá Tarín, Laura|||0000-0001-8505-9471
[EN] The Team Orienteering Problem with Time Windows and Variable Profits (TOPTWVP) is a variant of the Orienteering Problem where each node has a predefined time window in which the service must start (in case this node is visited), and the vehicle may spend an amount of time given by a predefined interval so that the profit collected at this node depends on the time spent. Our previous work introduced an incremental local search procedure to solve this problem. Although the results were satisfying in terms of score, this algorithm required more time to obtain solutions due to the added complexity of working with service time intervals. To address this issue, this paper introduces several improvements to our previous implementation aimed at reducing the execution time and maintaining or increasing the quality of the solutions. Specifically, we designed a new procedure for obtaining the initial solution, which is faster and generates higher -quality solutions than the previous approach. Moreover, two new moves have been developed within the local search procedure to account for variable profits. The experiments will show that these new procedures outperform our previous implementations. Finally, we define different types of trips depending on the travel -style preferences of a tourist, and we build some scenarios to show how our TOPTWVP can be adapted to obtain routes that fulfil these preferences., This work is partially supported by the Spanish Research Agency project PID2021-127647NB-C22, the Valencian Innovation Agency project INNEST/2021/233 and the EU ICT-48 2020 project TAILOR (No. 952215) .
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Training Data Scientists Through Project-Based Learning

  • Martínez-Plumed, Fernando|||0000-0003-2902-6477
  • Hernández-Orallo, José|||0000-0001-9746-7632
[EN] The concepts of innovation, creativity, problem solving, effective communication, autonomy and critical thinking are at the core of becoming a good data scientist. Adapting to new technological resources and tools is also an important skill, which also builds on the curious and inquisitive nature associated with data science, and is fuelled by rapidly changing data science ecosystems in industry. In this regard, Project-based learning (PBL) has clear benefits for engaging students in data science courses. However, the exploratory character of data science projects, which do not start with a clear specification of what to do, but some data to analyse, pose some challenges to the application of PBL. Our aim is to improve students' data science learning experiences and outcomes through the use of PBL. In this paper, we share our experiences with PBL and present an assessment rubric that focuses on value, innovation and narrative, which can be used as a scaffolding structure for data science courses. Our analysis of a PBL data science course at MSc level, together with data from student surveys, shows how the methodology and rubric align well with the exploratory nature of data science and the proactive, curious, and inquisitive skills required of data scientists., Thiswork was supported in part by valgrAI, the Norwegian Research Council Grant 329745 Machine Teaching for Explainable AI, the Future of LifeInstitute (FLI), under Grant RFP2-152, the EU (FEDER), and Spanish Grant RTI2018-094403-B-C32 through MCIN/AEI/10.13039/501100011033 and in part by CIPROM/2022/6 through Generalitat Valenciana, EU's Horizon 2020 Research and Innovation Programme under Grant 952215 (TAILOR), U.S. DARPA HR00112120007 (RECoG-AI), and Spanish Grant PID2021-122830OB-C42 (SFERA) through MCIN/AEI/10.13039/501100011033 and "ERDF a Way of Making Europe."
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A multidimensional review of the cash management problem

  • Salas-Molina, Francisco|||0000-0002-1168-7931
  • Rodriguez-Aguilar, Juan A
  • Guillen, Montserrat
[EN] In this paper, we summarize and analyze the relevant research on the cash management problem appearing in the literature. First, we identify the main dimensions of the cash management problem. Next, we review the most relevant contributions in this field and present a multidimensional analysis of these contributions, according to the dimensions of the problem. From this analysis, several open research questions are highlighted., Research supported by projects: Crowd4SDG (H2020872944); CISUSTAIN (PID 2019104156GBI00); TAILOR (H2020952215); TED2021131295BC31; TED2021130187BI00; PID2019105986GBC21 (funded by MCIN/AEI /10.13039/501100011033 and by the European Union NextGeneration EU/PRTR ); VALAWAI (funded by the European Commission under Grant 101070930); 2021 SGR 00299; 2021 SGR 00754.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Can language models automate data wrangling?

  • Jaimovitch-López, Gonzalo
  • Ferri Ramírez, César|||0000-0002-8975-1120
  • Hernández-Orallo, José|||0000-0001-9746-7632
  • Martínez-Plumed, Fernando|||0000-0003-2902-6477
  • Ramírez Quintana, María José|||0000-0002-0559-3568
[EN] The automation of data science and other data manipulation processes depend on the integration and formatting of 'messy' data. Data wrangling is an umbrella term for these tedious and time-consuming tasks. Tasks such as transforming dates, units or names expressed in different formats have been challenging for machine learning because (1) users expect to solve them with short cues or few examples, and (2) the problems depend heavily on domain knowledge. Interestingly, large language models today (1) can infer from very few examples or even a short clue in natural language, and (2) can integrate vast amounts of domain knowledge. It is then an important research question to analyse whether language models are a promising approach for data wrangling, especially as their capabilities continue growing. In this paper we apply different variants of the language model Generative Pre-trained Transformer (GPT) to five batteries covering a wide range of data wrangling problems. We compare the effect of prompts and few-shot regimes on their results and how they compare with specialised data wrangling systems and other tools. Our major finding is that they appear as a powerful tool for a wide range of data wrangling tasks. We provide some guidelines about how they can be integrated into data processing pipelines, provided the users can take advantage of their flexibility and the diversity of tasks to be addressed. However, reliability is still an important issue to overcome., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work was funded by the Future of Life Institute, FLI, under grant RFP2-152, the MIT-Spain - INDITEX Sustainability Seed Fund under project COST-OMIZE, the EU (FEDER) and Spanish MINECO under RTI2018-094403-B-C32 and PID2021-122830OB-C42, Generalitat Valenciana under PROMETEO/2019/098 and INNEST/2021/317, EU's Horizon 2020 research and innovation programme under grant agreement No. 952215 (TAILOR) and US DARPA HR00112120007 ReCOG-AI. AcknowledgementsWe thank Lidia Contreras for her help with the Data Wrangling Dataset Repository. We thank the anonymous reviewers from ECMLPKDD Workshop on Automating Data Science (ADS2021) and the anonymous reviewers of this special issue for their comments.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Streaming cascade-based speech translation leveraged by a direct segmentation model

  • Iranzo-Sánchez, Javier
  • Baquero-Arnal, Pau
  • Jorge-Cano, Javier|||0000-0002-9279-6768
  • Silvestre Cerdà, Joan Albert|||0000-0003-2291-8296
  • Giménez Pastor, Adrián
  • Civera Saiz, Jorge|||0000-0002-0963-0143
  • Sanchis Navarro, José Alberto|||0000-0002-2943-0990
  • Juan, Alfons|||0000-0002-9984-4072
[EN] The cascade approach to Speech Translation (ST) is based on a pipeline that concatenates an Automatic Speech Recognition (ASR) system followed by a Machine Translation (MT) system. Nowadays, state-of-the-art ST systems are populated with deep neural networks that are conceived to work in an offline setup in which the audio input to be translated is fully available in advance. However, a streaming setup defines a completely different picture, in which an unbounded audio input gradually becomes available and at the same time the translation needs to be generated under real-time constraints. In this work, we present a state-of-the-art streaming ST system in which neural-based models integrated in the ASR and MT components are carefully adapted in terms of their training and decoding procedures in order to run under a streaming setup. In addition, a direct segmentation model that adapts the continuous ASR output to the capacity of simultaneous MT systems trained at the sentence level is introduced to guarantee low latency while preserving the translation quality of the complete ST system. The resulting ST system is thoroughly evaluated on the real-life streaming Europarl-ST benchmark to gauge the trade-off between quality and latency for each component individually as well as for the complete ST system., The research leading to these results has received funding from the European Union's Horizon 2020 research and innovation program under grant agreement no. 761758 (X5Gon) and 952215 (TAILOR); the Government of Spain's research project Multisub, ref. RTI2018-094879-B-I00 (MCIU/AEI/FEDER,EU) and FPU scholarships FPU14/03981 and FPU18/04135; and the Generalitat Valenciana's research project Classroom Activity Recognition, ref. PROMETEO/2019/111 and predoctoral research scholarship ACIF/2017/055.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Order-sorted Homeomorphic Embedding modulo Combinations of Associativity and/or Commutativity Axioms

  • Alpuente Frasnedo, María|||0000-0002-9268-1178
  • Escobar Román, Santiago|||0000-0002-3550-4781
  • Cuenca-Ortega, Angel
  • Meseguer, José
[EN] The Homeomorphic Embedding relation has been amply used for defining termination criteria of symbolic methods for program analysis, transformation, and verification. However, homeomorphic embedding has never been investigated in the context of order-sorted rewrite theories that support symbolic execution methods modulo equational axioms. This paper generalizes the symbolic homeomorphic embedding relation to order-sorted rewrite theories that may contain various combinations of associativity and/or commutativity axioms for different binary operators. We systematically measure the performance of different, increasingly efficient formulations of the homeomorphic embedding relation modulo axioms that we implement in Maude. Our experimental results show that the most efficient version indeed pays off in practice., M. Alpuente and S. Escobar have been partially supported by the EU (FEDER) and the Spanish MCIU under grant RTI2018-094403-B-C32, by the Spanish Generalitat Valenciana under grant PROMETEO/2019/098, and by the European Union's Horizon 2020 research and innovation programme under grant agreement No. 952215 (TAILOR). J. Meseguer has been supported by NRL under contract number N00173-17-1-G002. A. Cuenca-Ortega has been supported by the SENESCYT, Ecuador (scholarship program 2013).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Europarl-ASR: A Large Corpus of Parliamentary Debates for Streaming ASR Benchmarking and Speech Data Filtering/Verbatimization

  • Garcés Díaz-Munío, Gonçal|||0000-0002-2594-5858
  • Silvestre Cerdà, Joan Albert|||0000-0003-2291-8296
  • Jorge-Cano, Javier|||0000-0002-9279-6768
  • Giménez Pastor, Adrián
  • Civera Saiz, Jorge|||0000-0002-0963-0143
  • Sanchis Navarro, José Alberto|||0000-0002-2943-0990
  • Juan, Alfons|||0000-0002-9984-4072
  • Iranzo-Sánchez, Javier
  • Baquero-Arnal, Pau
  • Roselló, Nahuel
  • Pérez-González de Martos, Alejandro Manuel
[EN] We introduce Europarl-ASR, a large speech and text corpus of parliamentary debates including 1300 hours of transcribed speeches and 70 million tokens of text in English extracted from European Parliament sessions. The training set is labelled with the Parliament¿s non-fully-verbatim official transcripts, time-aligned. As verbatimness is critical for acoustic model training, we also provide automatically noise-filtered and automatically verbatimized transcripts of all speeches based on speech data filtering and verbatimization techniques. Additionally, 18 hours of transcribed speeches were manually verbatimized to build reliable speaker-dependent and speaker-independent development/test sets for streaming ASR benchmarking. The availability of manual non-verbatim and verbatim transcripts for dev/test speeches makes this corpus useful for the assessment of automatic filtering and verbatimization techniques. This paper describes the corpus and its creation, and provides off-line and streaming ASR baselines for both the speaker-dependent and speaker-independent tasks using the three training transcription sets. The corpus is publicly released under an open licence., [CA] "Europarl-ASR: Un extens corpus parlamentari de referència per a reconeixement de la parla i filtratge/literalització de transcripcions": Presentem Europarl-ASR, un extens corpus de veu i text de debats parlamentaris amb 1300 hores d'intervencions transcrites i 70 milions de paraules de text en anglés extrets de sessions del Parlament Europeu. Les transcripcions oficials del Parlament Europeu, no literals, s'han sincronitzat per a tot el conjunt d'entrenament. Com que l'entrenament de models acústics requereix transcripcions com més literals millor, també s'han inclòs transcripcions filtrades i transcripcions literalitzades de totes les intervencions, basades en tècniques de filtratge i literalització automàtics. A més, s'han inclòs 18 hores de transcripcions literals revisades manualment per definir dos conjunts de validació i avaluació de referència per a reconeixement automàtic de la parla en temps real, amb oradors coneguts i amb oradors desconeguts. Pel fet de disposar de transcripcions literals i no literals, aquest corpus és també ideal per a l'anàlisi de tècniques de filtratge i de literalització. En aquest article, es descriu la creació del corpus i es proporcionen mesures de referència de reconeixement automàtic de la parla en temps real i en diferit, amb oradors coneguts i amb oradors desconeguts, usant els tres conjunts de transcripcions d'entrenament. El corpus es fa públic amb una llicència oberta., This work has received funding from the EU's H2020 research and innovation programme under grant agreements 761758 (X5gon) and 952215 (TAILOR); the Government of Spain's research project Multisub (RTI2018-094879-B-I00, MCIU/AEI/FEDER,EU) and FPU scholarships FPU14/03981 and FPU18/04135; the Generalitat Valenciana's research project Classroom Activity Recognition (PROMETEO/2019/111) and predoctoral research scholarship ACIF/2017/055; and the Universitat Politecnica de València's ` PAID-01-17 R&D support programme.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Program slicing with exception handling

  • Galindo, Carlos|||0000-0002-3569-6218
  • Silva, Josep|||0000-0001-5096-0008
  • Pérez-Rubio, Sergio
[EN] Program slicing is a technique for program analysis and transformation with many different applications such as program debugging, program specialization, and parallelization. The system dependence graph (SDG) is the most commonly used data structure for program slicing. In this paper, we show that the presence of exception-handling constructs can make the SDG produce incorrect and sometimes even incomplete slices. We showcase the instances of incorrectness and incompleteness and we propose a framework for correctly handling exception-related instructions, which includes representation of all possible exception throwing and catching mechanisms, and a new kind of control dependence: conditional control dependence; which produces more precise slices in the presence of catch statements., This work is partially supported by the EU (FEDER) and the Spanish MCI/AEI under Grant No.: TIN2016-76843-C4-1-R and PID2019-104735RB-C41, and by the Generalitat Valenciana under grant Prometeo/2019/098 (DeepTrust). Sergio Pérez was partially supported by Universitat Politècnica de València under FPI grant PAID-01-18.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A Partial Evaluation Methodology for Optimizing Rewrite Theories Incrementally

  • Alpuente Frasnedo, María|||0000-0002-9268-1178
  • Escobar Román, Santiago|||0000-0002-3550-4781
  • Sapiña-Sanchis, Julia|||0000-0003-2994-6986
  • Ballis, Demis
  • Galán-Pascual, Daniel
[EN] Partial evaluation (PE) is a branch of computer science that achieves code optimization via specialization. This article describes a PE methodology for optimizing rewrite theories that encode concurrent as well as nondeterministic systems by means of the Maude language. The main advantages of the proposed methodology can be summarized as follows: An automatic program optimization technique for rewrite theories featuring several PE criteria that support the specialization of a broad class of rewrite theories. An incremental partial evaluation modality that allows the key specialization components to be encapsulated at the desired granularity level to facilitate progressive refinements of the specialization. All executability theory requirements are preserved by the PE transformation. Also the transformation ensures the semantic equivalence between the original rewrite theory and the specialized theory under rather mild conditions., This work was partially supported by TAILOR, a project funded by the EU Horizon 2020 research and innovation programme under GA No 952215, grant PID2021-122830OB-C42 funded by MCIN/AEI/10.13039/501100011033 and by "ERDF A way of making Europe", and by the Generalitat Valenciana under grant PROMETEO/2019/098.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Stream-level Latency Evaluation for Simultaneous Machine Translation

  • Iranzo-Sánchez, Javier
  • Civera Saiz, Jorge|||0000-0002-0963-0143
  • Juan, Alfons|||0000-0002-9984-4072
[EN] Simultaneous machine translation has recently gained traction thanks to significant quality improvements and the advent of streaming applications. Simultaneous translation systems need to find a trade-off between translation quality and response time, and with this purpose multiple latency measures have been proposed. However, latency evaluations for simultaneous translation are estimated at the sentence level, not taking into account the sequential nature of a streaming scenario. Indeed, these sentence-level latency measures are not well suited for continuous stream translation, resulting in figures that are not coherent with the simultaneous translation policy of the system being assessed. This work proposes a stream-level adaptation of the current latency measures based on a re-segmentation approach applied to the output translation, that is successfully evaluated on streaming conditions for a reference IWSLT task., The research leading to these results has received funding from the European Union's Horizon 2020 research and innovation program under grant agreement no. 761758 (X5Gon) and 952215 (TAILOR) and Erasmus+ Education program under grant agreement no. 20-226-093604-SCH; the Government of Spain's research project Multisub, ref. RTI2018-094879-B-I00 (MCIU/AEI/FEDER,EU) and FPU scholarships FPU18/04135; and the Generalitat Valenciana's research project Classroom Activity Recognition, ref. PROMETEO/2019/111.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Generalized planning as heuristic search: A new planning search-space that leverages pointers over objects

  • Segovia-Aguas, Javier
  • Jonsson, Anders
  • Jiménez-Celorrio, Sergio|||0000-0003-0561-4880
[EN] Planning as heuristic search is one of the most successful approaches to classical planning but unfortunately, it does not trivially extend to Generalized Planning (GP); GP aims to compute algorithmic solutions that are valid for a set of classical planning instances from a given domain, even if these instances differ in their number of objects, the initial and goal configuration of these objects and hence, in the number (and possible values) of the state variables. State -space search, as it is implemented by heuristic planners, becomes then impractical for GP. In this paper we adapt the planning as heuristic search paradigm to the generalization requirements of GP, and present the first native heuristic search approach to GP. First, the paper introduces a new pointerbased solution space for GP that is independent of the number of classical planning instances in a GP problem and the size of those instances (i.e. the number of objects, state variables and their domain sizes). Second, the paper defines an upgraded version of our GP algorithm, called Best -First Generalized Planning (BFGP), that implements a best -first search in our pointer -based solution space for GP. Lastly, the paper defines a set of evaluation and heuristic functions for BFGP that assess the structural complexity of the candidate GP solutions, as well as their fitness to a given input set of classical planning instances. The computation of these evaluation and heuristic functions does not require grounding states or actions in advance. Therefore our GP as heuristic search approach can handle large sets of state variables with large numerical domains, e.g. integers., This work has been co-funded by MCIN/AEI/10.13039/501100011033 under the Maria de Maeztu Units of Excellence Programme (CEX2021-001195-M) , TAILOR (H2020 #952215) and AIPLAN4EU (H2020 #101016442) projects. Javier Segovia-Aguas is also supported by AGAUR SGR and the Spanish grant PID2019-108141 GB-I00. Sergio Jimenez is supported by the Spanish MINECO project PID2021-127647NB-C22. Anders Jonsson is partially supported by Spanish grant PID2019-108141 GB-I00.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

testar - scriptless testing through graphical user interface

  • Vos, Tanja Ernestina|||0000-0002-6003-9113
  • Pastor-Ricós, Fernando|||0000-0002-5790-193X
  • Aho, Pekka
  • Rodríguez-Valdés, Olivia
  • Mulders, Ad
[EN] Covering all the possible paths of the graphical user interface (GUI) with test scripts would take too much effort and result in serious maintenance issues. We propose complementing scripted testing with scriptless test automation using the open-source TESTAR tool. This paper gives a comprehensive overview of TESTAR and its latest extensions together with the ongoing and future research. With this paper, we hope we can help and encourage other researchers to use TESTAR for their GUI testing-related research and pave the way for an international research agenda in GUI testing built upon stable and open-source infrastructure. © 2021 The Authors. Software Testing, Verification & Reliability published by John Wiley & Sons Ltd., This work has been funded by the following projects: FITTEST (FP7 Information and Communication Technologies, 257574), SHIP (EACEA/A2/UHB/CL 554187), PERTEST (TIN2013-46928-C3-1-R), TESTOMAT (ITEA3, 16032), DECODER (H2020, 824231), iv4XR (H2020, 856716), TAILOR (H2020, 952215) and IVVES (ITEA3, 18022)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Safety Enforcement via Programmable Strategies in Maude

  • Alpuente Frasnedo, María|||0000-0002-9268-1178
  • Escobar Román, Santiago|||0000-0002-3550-4781
  • Sapiña-Sanchis, Julia|||0000-0003-2994-6986
  • Ballis, Demis
  • Galán-Pascual, Daniel
[EN] This work aims to provide a general mechanism for safety enforcement in rewriting logic computations. Our technique relies on an assertion-guided model transformation that leverages the newly defined Maude strategy language for ensuring rich safety policies in non-deterministic programs. The transformed system is guaranteed to comply with user -defined invariants that are expressed in a strategy-based, pattern-matching logic, thus preventing the concurrent system to reach any unsafe states. The performance and scal-ability of the technique is empirically evaluated and benchmarked on a set of realistic programs., This work was partially supported by TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215, grant PID2021-122830OB-C42 funded by MCIN/AEI/10.13039/501100011033 and by ?ERDF A way of making Europe?, and by Generalitat Valenciana under grant PROMETEO/2019/098.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

General intelligence disentangled via a generality metric for natural and artificial intelligence

  • Hernández-Orallo, José|||0000-0001-9746-7632
  • Martínez-Plumed, Fernando|||0000-0003-2902-6477
  • Loe, Bao Sheng
  • Cheke, Lucy
  • Heigeartaigh, Sean O.
[EN] Success in all sorts of situations is the most classical interpretation of general intelligence. Under limited resources, however, the capability of an agent must necessarily be limited too, and generality needs to be understood as comprehensive performance up to a level of difficulty. The degree of generality then refers to the way an agent's capability is distributed as a function of task difficulty. This dissects the notion of general intelligence into two non-populational measures, generality and capability, which we apply to individuals and groups of humans, other animals and AI systems, on several cognitive and perceptual tests. Our results indicate that generality and capability can decouple at the individual level: very specialised agents can show high capability and vice versa. The metrics also decouple at the population level, and we rarely see diminishing returns in generality for those groups of high capability. We relate the individual measure of generality to traditional notions of general intelligence and cognitive efficiency in humans, collectives, non-human animals and machines. The choice of the difficulty function now plays a prominent role in this new conception of generality, which brings a quantitative tool for shedding light on long-standing questions about the evolution of general intelligence and the evaluation of progress in Artificial General Intelligence., We are grateful to Jim DiCarlo and his lab (http://dicarlolab.mit.edu/, MIT), Judith Burkart, Laura Damerius and Carel van Schaik (Universitat Zurich), and Katherine Bruce and Mark Galizio (UNC Wilmington), for their data and the very helpful discussions. We thank David Stillwell for suggesting the relation between person-fit metrics and an early version of generality, and Heinrich Peters for pointing out Guttman's model. JHO has been partially supported by the EU (FEDER) and Spanish MINECO grant RTI2018-094403-B-C32 funded by MCIN/AEI/10.13039/501100011033 and by "ERDF A way of making Europe", Generalitat Valenciana under grant PROMETEO/2019/098 and EU's Horizon 2020 research and innovation programme under grant agreement No. 952215 (TAILOR). JHO and SOH are funded by the Future of Life Institute, FLI, under grant RFP2-152. JHO and LC are funded by US DARPA HR00112120007 (RECoG-AI). LC and SOH are funded by the Leverhulme Trust through a grant for the Leverhulme Centre for the Future of Intelligence. FMP is funded by the AI-Watch and HUMAINT projects by DG CONNECT and DG JRC of the European Commission. All authors declare no competing interests. We thank John Burden, Richard Evans and the anonymous reviewers for their insightful comments and corrections. Code and data are available for reproducibility at http://github.com/jorallo/gener ality as explained in G.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

The impact of sociality regimes on heterogeneous cooperative-competitive multi-agent reinforcement learning: a study with the predator-prey game

  • Zhao, Yue
  • Hernández-Orallo, José|||0000-0001-9746-7632
[EN] The performance in multi-agent reinforcement learning (MARL) scenarios has usually been analysed in homogeneous teams with a few choices for the sociality regime (selfish, egalitarian, or altruistic). In this paper we analyse both homogeneous and heterogeneous teams in a variation of sociality regimes in the predator-prey game, using a novel normalisation of the weights so that the sum of all rewards is independent of the sociality regime. We find that the selfish regime is advantageous for both predator and prey teams, and for both homogeneous and heterogeneous teams. In particular, rewards are about 100% higher for the predator team when switching from the egalitarian to selfish regime and more than 400% higher from the altruistic regime. For the prey, the increase is around 40% and 100% respectively. The results are similar for homogeneous and heterogeneous situations. The takeaway message is that any study of homogeneous and heterogeneous cooperative-competitive multi-agent reinforcement learning teams should also take into account the sociality regimes before making conclusions on the preference of any algorithm., This work was funded by the EU (FEDER) and Spanish grant RTI2018-094403-B-C32 funded by MCIN/AEI/10.13039/501100011033 and by 'ERDF A way of making Europe', Generalitat Valenciana under CIPROM/2022/6 (FASSLOW) and IDIFEDER/2021/05 (CLUSTERIA), EU's Horizon 2020 research and innovation programme under grant agreement No. 952215 (TAILOR) and Spanish grant PID2021-122830OB-C42 (SFERA) funded by MCIN/AEI/10.13039/501100011033 and 'ERDF A way of making Europe' and China Scholarship Council (CSC) scholarship (No. 202006290201).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Tesis doctoral (DoctoralThesis)

Contamination Problems in AI Evaluation

  • Mehrbakhsh, Behzad|||0000-0001-9017-989X
[ES] La evaluación de la Inteligencia Artificial se basa fundamentalmente en los benchmarks: conjuntos de datos y tareas estandarizadas que se utilizan para medir las capacidades de los modelos y orientar el progreso de la investigación. Sin embargo, la integridad de estas evaluaciones está cada vez más amenazada por la contaminación: distorsiones sutiles que comprometen la validez y la fiabilidad de las métricas de rendimiento. Esta tesis ofrece una investigación exhaustiva sobre la contaminación en la evaluación de sistemas de IA, analizando cómo surge, cómo afecta a los resultados reportados y cómo puede detectarse y mitigarse. Introducimos un marco teórico unificado que caracteriza la contaminación mediante ratios de densidad vecinal, cuantificando tanto la dirección como la magnitud del sesgo evaluativo. Dentro de este marco, identificamos y analizamos tres formas principales de contaminación, cada una con características e impactos distintos: La contaminación por benchmarks adversariales se produce cuando los conjuntos de evaluación se enriquecen deliberadamente con ejemplos difíciles. Aunque esta práctica es útil para pruebas de estrés y para revelar vulnerabilidades, desplaza sistemáticamente la distribución de dificultad respecto a las tareas del mundo real. Demostramos que las métricas de rendimiento agregadas confunden dos efectos distintos: el desplazamiento hacia ejemplos más difíciles y los cambios genuinos de capacidad. Mediante la descomposición del rendimiento a través de curvas características condicionadas por la dificultad, mostramos que el rendimiento sobre la distribución original puede recuperarse sin una medición directa, siempre que la probabilidad condicional respecto a la dificultad permanezca inalterada. La contaminación de datos surge cuando ejemplos del test o sus variantes cercanas aparecen en los datos de entrenamiento, inflando artificialmente el rendimiento mediante memorización en lugar de aprendizaje genuino. Replanteamos este fenómeno como un problema de asignación de recursos, introduciendo el concepto de presupuesto de contaminación para examinar los compromisos entre amplitud (número de ejemplos), profundidad (repeticiones por ejemplo) y dificultad (priorizar instancias más fáciles o más difíciles). A través de experimentos controlados con múltiples familias de modelos de lenguaje y benchmarks diversos, observamos que la magnitud de la contaminación no determina por sí sola la inflación del rendimiento: la estrategia de asignación es igualmente crítica. La contaminación generada por IA surge a medida que los modelos generativos pueblan Internet con contenido sintético que se vuelve indistinguible del material producido por humanos. Esta forma de contaminación es especialmente insidiosa porque se infiltra en los corpus de entrenamiento y en los benchmarks de evaluación mediante técnicas de web scraping. Nuestros experimentos controlados muestran que los errores generados por IA presentan características fundamentalmente distintas a los errores humanos: menor entropía, sesgos más sistemáticos y patrones de error diferenciados. Esta tesis avanza tanto la comprensión teórica como la detección práctica de la contaminación en la evaluación de sistemas de IA. Al hacer visible, cuantificable e interpretable la contaminación mediante herramientas como los ratios de densidad vecinal y las curvas características, proporcionamos una base para restaurar la confianza en la evaluación de la IA. A medida que avanzamos hacia sistemas cada vez más capaces, la integridad de nuestros métodos de evaluación nunca ha sido tan crítica. Este trabajo representa un paso hacia garantizar que el progreso reportado refleje avances genuinos y no artefactos de medición, permitiendo evaluaciones más fiables de las capacidades de la IA y decisiones de despliegue más seguras., [EN] Artificial Intelligence evaluation relies fundamentally on benchmarks; standardised datasets and tasks used to measure model capabilities and guide research progress. However, the integrity of these evaluations is increasingly threatened by contamination: subtle distortions that compromise the validity and reliability of performance assessments. This thesis provides a comprehensive investigation of contamination in AI evaluation, examining how it arises, how it affects reported performance, and how it can be detected and mitigated. We introduce a unified theoretical framework that characterises contamination through neighbourhood density ratios, quantifying both the direction and magnitude of evaluation bias. Within this framework, we identify and analyse three primary forms of contamination, each with distinct characteristics and impacts: Adversarial Benchmark Contamination occurs when evaluation sets are deliberately enriched with difficult examples. Although valuable for stress-testing and exposing weaknesses, this practice systematically shifts the difficulty distribution away from real-world tasks. We demonstrate that aggregate performance metrics confound two distinct effects: the shift toward harder examples and genuine capability changes. By decomposing performance through system characteristic curves conditioned on difficulty, we show that performance on the original distribution can be recovered without direct measurement, provided the conditional probability on difficulty remains unchanged. Data Contamination arises when test examples or their close variants appear in training data, artificially inflating performance through memorisation rather than genuine learning. We reframe this as a resource allocation problem, introducing the concept of a contamination budget to examine trade-offs between breadth (number of examples), depth (repetitions per example) and difficulty (prioritising easier or harder instances). Through controlled experiments across multiple language model families and diverse benchmarks, we find that contamination magnitude alone does not determine performance inflation, but the allocation strategy is equally critical. AI-Generated Contamination emerges as generative models increasingly populate the internet with synthetic content that becomes indistinguishable from human-authored material. This contamination is particularly insidious because it infiltrates both training corpora and evaluation benchmarks through web scraping. Our controlled experiments demonstrate that AI-generated errors exhibit fundamentally different characteristics than human errors: lower entropy, more systematic biases, and distinct error patterns. This thesis advances both the theoretical understanding and practical detection of evaluation contamination in AI systems. By making contamination visible, quantifiable, and interpretable through tools such as neighbourhood density ratios and characteristic curves, we provide a foundation for restoring trust in AI evaluation. As we advance toward increasingly capable AI systems, the integrity of our evaluation methods has never been more critical. This work represents a step toward ensuring that reported progress reflects genuine advances rather than measurement artefacts, enabling more reliable assessment of AI capabilities and safer deployment decisions., [CA] L'avaluació de la Intel·ligència Artificial es basa fonamentalment en els benchmarks: conjunts de dades i tasques estandarditzades que s'utilitzen per mesurar les capacitats dels models i orientar el progrés de la investigació. No obstant això, la integritat d'estes avaluacions està cada vegada més amenaçada per la contaminació: distorsions subtils que comprometen la validesa i la fiabilitat de les mètriques de rendiment. Esta tesi oferix una investigació exhaustiva sobre la contaminació en l'avaluació de sistemes d'IA, analitzant com apareix, com afecta els resultats reportats i com pot detectar-se i mitigar-se. Introduïm un marc teòric unificat que caracteritza la contaminació mitjançant ràtios de densitat veïnal, quantificant tant la direcció com la magnitud del biaix avaluatiu. Dins d'este marc, identifiquem i analitzem tres formes principals de contaminació, cadascuna amb característiques i impactes diferents: La contaminació per benchmarks adversarials es produïx quan els conjunts d'avaluació s'enriquixen deliberadament amb exemples difícils. Tot i que esta pràctica és útil per fer proves d'estrés i descobrir vulnerabilitats, desplaça sistemàticament la distribució de dificultat respecte a les tasques del món real. Demostrem que les mètriques de rendiment agregades confonen dos efectes diferents: el desplaçament cap a exemples més difícils i els canvis genuïns de capacitat. Mitjançant la descomposició del rendiment a través de corbes característiques condicionades per la dificultat, mostrem que el rendiment sobre la distribució original pot recuperar-se sense una mesura directa, sempre que la probabilitat condicional respecte a la dificultat es mantinga inalterada. La contaminació de dades sorgix quan exemples del test o variants pròximes apareixen en les dades d'entrenament, inflant artificialment el rendiment mitjançant memorització en lloc d'aprenentatge genuí. Replantegem este fenomen com un problema d'assignació de recursos, introduint el concepte de pressupost de contaminació per examinar els compromisos entre amplitud (nombre d'exemples), profunditat (repeticions per exemple) i dificultat (prioritzar instàncies més fàcils o més difícils). A través d'experiments controlats amb múltiples famílies de models de llenguatge i benchmarks diversos, observem que la magnitud de la contaminació no determina per si mateixa la inflació del rendiment: l'estratègia d'assignació és igualment crítica. La contaminació generada per IA apareix a mesura que els models generatius omplin Internet amb contingut sintètic que es torna indistinguible del material produït per humans. Esta forma de contaminació és especialment insidiosa perquè s'infiltra tant en els corpus d'entrenament com en els benchmarks d'avaluació mitjançant tècniques de web scraping. Els nostres experiments controlats mostren que els errors generats per IA presenten característiques fonamentalment diferents dels errors humans: menor entropia, biaixos més sistemàtics i patrons d'error diferenciats. Esta tesi avança tant la comprensió teòrica com la detecció pràctica de la contaminació en l'avaluació de sistemes d'IA. En fer visible, quantificable i interpretable la contaminació mitjançant eines com els ràtios de densitat veïnal i les corbes característiques, proporcionem una base per restaurar la confiança en l'avaluació de la IA. A mesura que avancem cap a sistemes cada vegada més capaços, la integritat dels nostres mètodes d'avaluació mai no ha sigut tan crítica. Este treball representa un pas cap a garantir que el progrés reportat reflectisca avanços genuïns i no artefactes de mesura, permetent avaluacions més fiables de les capacitats de la IA i decisions de desplegament més segures., This work was supported by several institutions and research projects. I gratefully acknowledge ValgrAI – Valencian Graduate School and Research Network for Artificial Intelligence and Generalitat Valenciana for providing predoctoral support. I also acknowledge funding from the EU’s Horizon 2020 research and innovation programme under grant agreement No. 952215 (TAILOR), which supported my research stay. This research was supported by the Spanish project PID2021-122830OB-C42 (SFERA), funded by MCIN/AEI/10.13039/501100011033 and ERDF “A way of making Europe”, and by the project CIPROM/2022/6 (FASSLOW), funded by Generalitat Valenciana – Programa Prometeo and ERDF, EU.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Segmentation-Free Streaming Machine Translation

  • Iranzo-Sánchez, Javier
  • Giménez, Adria
  • Iranzo-Sánchez, Jorge
  • Civera Saiz, Jorge|||0000-0002-0963-0143
  • Juan, Alfons|||0000-0002-9984-4072
[EN] Streaming Machine Translation (MT) is the task of translating an unbounded input text stream in real-time. The traditional cascade approach, which combines an Automatic Speech Recognition (ASR) and an MT system, relies on an intermediate segmentation step which splits the transcription stream into sentence-like units. However, the incorporation of a hard segmentation constrains the MT system and is a source of errors. This paper proposes a Segmentation-Free framework that enables the model to translate an unsegmented source stream by delaying the segmentation decision until after the translation has been generated. Extensive experiments show how the proposed Segmentation-Free framework has better quality-latency trade-off than competing approaches that use an independent segmentation model.1, We thank our action editor and the anonymous reviewers for their helpful and constructive comments on the paper. The research leading to these results has received funding from European Union's Horizon 2020 research and innovation program under grant agreement no. 952215 and EU4Health Programme 2021-2027 as part of Europe's Beating Cancer Plan under grant agreements nos. 101056995 and 101129375; and from the Government of Spain's grant PID2021-122443OB-I00 funded by MCIN/AEI/10.13039/501100011033 and by ''ERDF A way of making Europe'', grant PDC2022-133049-I00 funded by MCIN/AEI/10.13039/501100011033 and by the ''European Union NextGenerationEU/PRTR'' and FPU scholarship FPU18/04135. The authors gratefully acknowledge the financial support of the Generalitat Valenciana under project IDIFEDER/2021/059.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Live Streaming Speech Recognition Using Deep Bidirectional LSTM Acoustic Models and Interpolated Language Models

  • Jorge-Cano, Javier|||0000-0002-9279-6768
  • Giménez Pastor, Adrián
  • Silvestre Cerdà, Joan Albert|||0000-0003-2291-8296
  • Civera Saiz, Jorge|||0000-0002-0963-0143
  • Sanchis Navarro, José Alberto|||0000-0002-2943-0990
  • Juan, Alfons|||0000-0002-9984-4072
[EN] Although Long-Short Term Memory (LSTM) networks and deep Transformers are now extensively used in offline ASR, it is unclear how best offline systems can be adapted to work with them under the streaming setup. After gaining considerable experience on this regard in recent years, in this paper we show how an optimized, low-latency streaming decoder can be built in which bidirectional LSTM acoustic models, together with general interpolated language models, can be nicely integrated with minimal performance degradation. In brief, our streaming decoder consists of a one-pass, real-time search engine relying on a limited-duration window sliding over time and a number of ad hoc acoustic and language model pruning techniques. Extensive empirical assessment is provided on truly streaming tasks derived from the well-known LibriSpeech and TED talks datasets, as well as from TV shows on a main Spanish broadcasting station., This work was supported in part by European Union's Horizon 2020 Research and Innovation Programme under Grant 761758 (X5gon), and 952215 (TAILOR) and Erasmus+ Education Program under Grant Agreement 20-226-093604-SCH, in part by MCIN/AEI/10.13039/501100011033 ERDF A way of making Europe under Grant RTI2018-094879-B-I00, and in part by Generalitat Valenciana's Research Project Classroom Activity Recognition under Grant PROMETEO/2019/111. Funding for open access charge: CRUE-Universitat Politecnica de Valencia. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Lei Xie.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Improvement of Contact Tracing with Citizen&apos, s Distributed Risk Maps

  • Rebollo Pedruelo, Miguel|||0000-0002-5115-8751
  • Benito, Rosa María
  • Losada, Juan Carlos
  • Galeano, Javier
[EN] The rapid spread of COVID-19 has demonstrated the need for accurate information to contain its diffusion. Technological solutions are a complement that can help citizens to be informed about the risk in their environment. Although measures such as contact traceability have been successful in some countries, their use raises society's resistance. This paper proposes a variation of the consensus processes in directed networks to create a risk map of a determined area. The process shares information with trusted contacts: people we would notify in the case of being infected. When the process converges, each participant would have obtained the risk map for the selected zone. The results are compared with the pilot project's impact testing of the Spanish contact tracing app (RadarCOVID). The paper also depicts the results combining both strategies: contact tracing to detect potential infections and risk maps to avoid movements into conflictive areas. Although some works affirm that contact tracing apps need 60% of users to control the propagation, our results indicate that a 40% could be enough. On the other hand, the elaboration of risk maps could work with only 20% of active installations, but the effect is to delay the propagation instead of reducing the contagion. With both active strategies, this methodology is able to significantly reduce infected people with fewer participants., This research was supported by TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215, and by the Spanish Ministry of Science, Innovation and Universities (MICIU) under Contract No. PGC2018-093854-B-I00b and RTI2018-095390-B-C32.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Program slicing of Java programs

  • Galindo, Carlos|||0000-0002-3569-6218
  • Silva, Josep|||0000-0001-5096-0008
  • Pérez, Sergio
[EN] Program slicing is a technique to extract the part of the program that can affect the values computed at a given program point (known as the slicing criterion). To represent programs, program slicing uses the System Dependence Graph (SDG), for which several extensions like the Java System Dependence Graph (JSysDG) or the Sub-Statement Linear Dependence Graph (SSLDG) exist to deal with Java object-oriented programs. In this paper, we present an incompleteness result proving that these graphs do not produce complete slices in all cases, and specifically when some object variables are selected as the slicing criterion. We first identify the source of the problem: the representation of dependences between partial definitions of objects is ill-defined in these approaches, leading to a loss of completeness in many cases. To solve this limitation, we extend these representations with the addition of a specific flow dependence for object type variables called object-flow dependence. This extension provides a more accurate flow representation between object variables and its data members and it allows us to obtain complete slices when an object variable is selected as the slicing criterion.(c) 2022 The Authors. Published by Elsevier Inc. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)., This work has been partially supported by grant PID2019-104735RB-C41 funded by Spanish MCI/AEI/10.13039/501100011033, by the Generalitat Valenciana under grant Prometeo/2019/098 (DeepTrust), and by TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215. Carlos Galindo was partially supported by the Spanish Ministerio de Universidades under grant FPU20/03861. Sergio Perez was partially supported by Universitat Politecnica de Valencia under FPI grant PAID-01-18.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Symbolic Specialization of Rewriting Logic Theories with Presto

  • Alpuente Frasnedo, María|||0000-0002-9268-1178
  • Escobar Román, Santiago|||0000-0002-3550-4781
  • Sapiña-Sanchis, Julia|||0000-0003-2994-6986
  • Ballis, Demis
[EN] This paper introduces Presto, a symbolic partial evaluator for Maude's rewriting logic theories that can improve system analysis and verification. In Presto, the automated optimization of a conditional rewrite theory R (whose rules define the concurrent transitions of a system) is achieved by partially evaluating, with respect to the rules of R, an underlying, companion equational logic theory E that specifies the algebraic structure of the system states of R. This can be particularly useful for specializing an overly general equational theory E whose operators may obey complex combinations of associativity, commutativity, and/or identity axioms, when being plugged into a host rewrite theory R as happens, for instance, in protocol analysis, where sophisticated equational theories for cryptography are used. Presto implements different unfolding operators that are based on folding variant narrowing (the symbolic engine of Maude's equational theories). When combined with an appropriate abstraction algorithm, they allow the specialization to be adapted to the theory termination behavior and bring significant improvement while ensuring strong correctness and termination of the specialization. We demonstrate the effectiveness of Presto in several examples of protocol analysis where it achieves a significant speed-up. Actually, the transformation provided by Presto may cut down an infinite folding variant narrowing space to a finite one, and moreover, some of the costly algebraic axioms and rule conditions may be eliminated as well. As far as we know, this is the first partial evaluator for Maude that respects the semantics of functional, logic, concurrent, and object-oriented computations., This research was partially supported by TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215, grant RTI2018-094403-B-C32 funded by MCIN/AEI/10.13039/501100011033 and by "ERDF A way of making Europe", and by Generalitat Valenciana under grant PROMETEO/2019/098. Julia Sapiña has been supported by the Generalitat Valenciana APOSTD/2019/127 grant.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Gramian angular fields for leveraging pretrained computer vision models with anomalous diffusion trajectories

  • Garibo-i-Orts, Óscar
  • Firbas, Nicolás
  • Sebastiá Tarín, Laura|||0000-0001-8505-9471
  • Conejero, J. Alberto|||0000-0003-3681-7533
[EN] Anomalous diffusion is present at all scales, from atomic to large ones. Some exemplary systems are ultracold atoms, telomeres in the nucleus of cells, moisture transport in cement-based materials, arthropods' free movement, and birds' migration patterns. The characterization of the diffusion gives critical information about the dynamics of these systems and provides an interdisciplinary framework with which to study diffusive transport. Thus, the problem of identifying underlying diffusive regimes and inferring the anomalous diffu-sion exponent alpha with high confidence is critical to physics, chemistry, biology, and ecology. Classification and analysis of raw trajectories combining machine learning techniques with statistics extracted from them have widely been studied in the Anomalous Diffusion Challenge [Munoz-Gil et al. , Nat. Commun. 12 , 6253 (2021)]. Here we present a new data-driven method for working with diffusive trajectories. This method utilizes Gramian angular fields (GAF) to encode one-dimensional trajectories as images (Gramian matrices), while preserving their spatiotemporal structure for input to computer-vision models. This allows us to leverage two well-established pretrained computer-vision models, ResNet and MobileNet, to characterize the underlying diffusive regime and infer the anomalous diffusion exponent alpha. Short raw trajectories of lengths between 10 and 50 are commonly encountered in single-particle tracking experiments and are the most difficult ones to characterize. We show that GAF images can outperform the current state-of-the-art while increasing accessibility to machine learning methods in an applied setting., We thank M. A. Garcia-March for helpful comments and discussions on the topic. N.F. is supported by the National University of Singapore through the Singapore International Graduate Student Award (SINGA) program. O.G.O. and L.S. also acknolwedges support from European Comission, project EU ICT-48 2020 project TAILOR (No. 952215) funding from MINECO project, Grant No. TIN2017-88476-C2-1-R. J.A.C. acknowledges funding from Grant No. PID2021-124618NB-C21 funded by MCIN/AEI/10.13039/501100011033 and by "ERDF A way of making Europe," by the "European Union."
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

NLAS-multi: A multilingual corpus of automatically generated Natural Language Argumentation Schemes

  • Ruiz-Dolz, Ramon
  • Lawrence, John
  • Reed, Chris
  • Taverner-Aparicio, Joaquín José|||0000-0002-5163-5335
[EN] Some of the major limitations identified in the areas of argument mining, argument generation, and natural language argument analysis are related to the complexity of annotating argumentatively rich data, the limited size of these corpora, and the constraints that represent the different languages and domains in which these data is annotated. To address these limitations, in this paper we present the following two contributions: an effective methodology for the automatic generation of natural language arguments in different topics and languages, and the largest publicly available corpus of Natural Language Argumentation Schemes available to date., Work partially supported by Generalitat Valenciana CIPROM/2021/077, Spanish Government projects PID2020-113416RB-I0 0 and TED2021-131295B-C32 ; TAILOR project funded by EU Hori-zon 2020 under GA No 952215. This work was also partially supported by the 'AI for Citizen Intelligence Coaching against Disinformation (TITAN) ' project, funded by the EU Horizon 2020 Research and Innovation Programme under Grant Agreement 101070658 , and by UK Research and Innovation under the UK Governments Horizon funding guarantee Grant No's. 10040483 and 10055990.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Order-sorted Equational Generalization Algorithm Revisited

  • Alpuente Frasnedo, María|||0000-0002-9268-1178
  • Escobar Román, Santiago|||0000-0002-3550-4781
  • Sapiña-Sanchis, Julia|||0000-0003-2994-6986
  • Meseguer, José
[EN] Generalization, also called anti-unification, is the dual of unification. A generalizer of two terms t and t' is a term t '' of which t and t' are substitution instances. The dual of most general equational unifiers is that of least general equational generalizers, i.e., most specific anti-instances modulo equations. In a previous work, we extended the classical untyped generalization algorithm to: (1) an order-sorted typed setting with sorts, subsorts, and subtype polymorphism; (2) work modulo equational theories, where function symbols can obey any combination of associativity, commutativity, and identity axioms (including the empty set of such axioms); and (3) the combination of both, which results in a modular, order-sorted equational generalization algorithm. However, Cerna and Kutsia showed that our algorithm is generally incomplete for the case of identity axioms and a counterexample was given. Furthermore, they proved that, in theories with two identity elements or more, generalization with identity axioms is generally nullary, yet it is finitary for both the linear and one-unital fragments, i.e., either solutions with repeated variables are disregarded or the considered theories are restricted to having just one function symbol with an identity or unit element. In this work, we show how we can easily extend our original inference system to cope with the non-linear fragment and identify a more general class than one-unit theories where generalization with identity axioms is finitary.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A general approach for computing a consensus in group decision making that integrates multiple ethical principles

  • Salas-Molina, Francisco|||0000-0002-1168-7931
  • Bistaffa, Filippo
  • Rodríguez-Aguilar, Juan A.
[EN] We tackle the problem of computing a consensus according to multiple ethical principles - which can include, for example, the principle of maximum freedom associated with the Benthamite doctrine and the principle of maximum fairness associated with the Rawlsian principles - among the preferences of different individuals in the context of Group Decision-Making (GDM). More formally, we put forward a novel formalisation of the above-mentioned problem based on a multi-lp-norm approximation problem that aims at minimising multiple p-metric distance functions, where each parameter p represents a given ethical principle. Our contribution incurs obvious benefits from a social-choice perspective. Firstly, our approach significantly generalises stateof-the-art approaches that were limited to only two ethical principles (p = 1, for maximum freedom, and p = & INFIN;, for maximum fairness). Secondly, our experimental results considering an established test case demonstrate that our approach is capable, thanks to a novel re-weighting scheme, to compute a multi-norm consensus that takes into account each ethical principle in a balanced way, in contrast with state-of-the-art approaches that were heavily biased towards the p =1 ethical principle., Research supported by projects: CI-SUSTAIN, Spain (PID2019-104156GB-I00) ; TAILOR, Spain (H2020-952215) ; 2021 SGR 00754 funded by Generalitat de Catalunya, Spain; VAE TED2021-131295B-C31, funded by MCIN/AEI, Spain/10.13 039/501100011033 and NextGenerationEU/PRTR, Spain; and VALAWAI, Spain (Horizon Europe #101070930) . Funding for open access charge: CRUE-Universitat Politecnica de Valencia.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A hybrid approach for expressive numeric and temporal planning with control parameters

  • Sapena Vercher, Oscar|||0000-0003-0533-5603
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
  • Marzal Calatayud, Eliseo Jorge|||0000-0003-0658-1953
[EN] Since the release of PDDL 2.1, many planners accepted the challenge of addressing more complicated domains and problems, including both temporal and numeric features for scheduling and resources management. However, very few planners can handle a significant subset of the features that the language allows for modeling. To handle a level of expressiveness sufficient to work with more realistic problems, we have designed NextFLAP (Numeric EXpressions in TFLAP). The planner follows a hybrid approach, which combines a forward partial-order planner with a numeric constraint solver/optimizer. Additionally, we include a new feature, the control parameters, which are relevant for direct modeling numerical quantities and physical properties of objects in the actions, such as ¿partially charging of a battery¿ or ¿obtaining a certain amount of resources¿. This feature overcomes a limitation of the PDDL language, which is that the parameters of the actions must be objects (finite domain values) and, in no case, numeric variables. In this paper we illustrate the advantages of using these temporal and numeric modelling features and then describe our planning system, NextFLAP, that can handle these domains. We show that NextFLAP is competitive with other state-of-the-art planners and that it generates good-quality plans., This work is supported by the Spanish AEI PID2021-127647NB-C22 project and EU ICT-48 2020 project TAILOR (No. 952215) and EU-H2020 project AIPlan4EU (101016442).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Language Task Difficulty Prediction through LLM-Annotated Meta-Features

  • Moros-Daval, Yael
  • Martínez-Plumed, Fernando|||0000-0003-2902-6477
  • Hernández-Orallo, José|||0000-0001-9746-7632
[EN] Assessing the capabilities of large language models (LLMs) is increasingly challenging due to their generality and uneven task performance. Often, we do not know how much of the success or failure on a particular task is due to the `loading¿ of the language elements in the task, such as narrative understanding, or some other intrinsic (non-linguistic) components, such as domain-specific common sense or reasoning capabilities. Understanding what tasks are most loaded on language and determine the predictability of LLMs on these tasks is crucial for improving benchmarks, designing better LLMs, and ensuring their safe deployment. We present an innovative methodology that uses LLMs to annotate linguistic metafeatures , allowing us to predict task difficulty and understand linguistic loadings more accurately than traditional readability scores. Using GPT-4 for automated annotation, we show strong predictability for a variety of tasks and language models (e.g., MMLU with R2 from 0.68 to 0.83), but observe limited predictability for other tasks (e.g., LSAT with R2 of -0.07)., We acknowledge support from: Grant for Master Studies funded by ValgrAI Valencian Graduate School and Research Network for Artificial Intelligence and Generalitat Valenciana; FISCALTICS (I+D+i PID2022-140110OA-I00), granted by MICIU/AEI/10.13039/ 501100011033 and by ERDF, EU; CIPROM/2022/6 (FASSLOW) and IDIFEDER/2021/05 (CLUSTERIA) funded by Generalitat Valenciana; the EC H2020-EU grant agreement No. 952215 (TAILOR); US DARPA HR00112120007 (RECoG-AI) and Spanish grant PID2021-122830OB-C42 (SFERA) funded by MCIN/AEI/10.13039/501100011033 and ERDF.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Automating data science

  • De Bie, Tijl
  • De Raedt, Luc
  • Hoos, Holger H.
  • Smyth, Padhraic
  • Williams, Christopher K. I.
  • Hernández-Orallo, José|||0000-0001-9746-7632
[EN] Given the complexity of data science projects and related demand for human expertise, automation has the potential to transform the data science process., TDB: The European Research Council under the European Union's Seventh Framework Programme (FP7/20072013)/ERC Grant Agreement no. 615517. The Flemish Government under the "Onderzoeksprogramma Artificiele Intelligentie Vlaanderen" programme. The Fund for Scientific Research-Flanders (FWO-Vlaanderen), project no. G091017N, G0F9816N, 3G042220. LDR: The research reported in this work was supported by the European Research Council under the European Union's Horizon 2020 research and innovation programme (grant agreement No [694980] SYNTH: Synthesising Inductive Data Models), the EU H2020 ICT48 project "TAILOR" contract #952215; the Flemish Government's "Onderzoeksprogramma Artificiele Intelligentie Vlaanderen" programme and the Wallenberg AI, Autonomous Systems and Software Program funded by the Knut and Alice Wallenberg Foundation. JHO: EU (FEDER) and the Spanish MINECO, Grant: RTI2018-094403-B-C3. Generalitat Valenciana, Grant: PROMETEO/2019/098. FLI, Grant RFP2-152. MIT-Spain INDITEX Sustainability Seed Fund. Grant: FC200944. EU H2020. Grant: ICT48 project "TAILOR" contract #952215. HHH: The research reported in this work was partially supported by the EU H2020 ICT48 project "TAILOR" contract #952215; by the EU project H2020FETFLAG-2018-01, "HumanE AI," contract #820437, and by start-up funding from Leiden University. PS: This material is based on work supported by the US National Science Foundation under awards DGE-1633631, IIS-1900644, IIS-1927245, DMS1839336, CNS-1927541, CNS-1730158, DUE-1535300; by the US National Institutes of Health under award 1U01TR001801-01; by NASA award NNX15AQ06A. CKIW: This work is supported in part by grant EP/N510129/1 from the UK Engineering and Physical Sciences Research Council (EPSRC) to the Alan Turing Institute. He thanks the Artificial Intelligence for Data Analytics team at the Turing Institute for many helpful conversations.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Reversible CSP Computations

  • Galindo, Carlos|||0000-0002-3569-6218
  • Silva, Josep|||0000-0001-5096-0008
  • Nishida, Naoki
  • Tamarit, Salvador
[EN] Reversibility enables a program to be executed both forwards and backwards. This ability allows programmers to backtrack the execution to a previous state. This is essential if the computation is not deterministic because re-running the program forwards may not lead to that state of interest. Reversibility of sequential programs has been well studied and a strong theoretical basis exists. Contrarily, reversibility of concurrent programs is still very young, especially in the practical side. For instance, in the particular case of the Communicating Sequential Processes (CSP) language, reversibility is practically missing. In this article, we present a new technique, including its formal definition and its implementation, to reverse CSP computations. Most of the ideas presented can be directly applied to other concurrent specification languages such as Promela or CCS, but we center the discussion and the implementation on CSP. The technique proposes different forms of reversibility, including strict reversibility and causal-consistent reversibility. On the practical side, we provide an implementation of a system to reverse CSP computations that is able to highlight the source code that is being executed in each forwards/backwards computation step, and that has been optimized to be scalable to real systems., A preliminary version of this work was presented at the 12th Conference on Reversible Computation [31]. The authors would like to thank the anonymous reviewers for their useful comments and constructive feedback that helped them to improve this work. This work was supported in part by the EU (FEDER) and the Spanish MCI/AEI under Grant TIN2016-76843-C4-1-R and Grant PID2019-104735RB-C41, in part by the Generalitat Valenciana under Grant Prometeo/2019/098 (DeepTrust), in part by JSPS KAKENHI under Grant JP17H01722, and in part by TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA 952215.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Conversational complexity for assessing risk in large language models

  • Burden, John
  • Cebrian, Manuel
  • Hernández-Orallo, José|||0000-0001-9746-7632
[EN] Large Language Models (LLMs) present a dual-use dilemma: they enable beneficial applications while harboring potential for harm, particularly through conversational interactions. Despite various safeguards, advanced LLMs remain vulnerable. A watersed case in early 2023 involved journalist Kevin Roose's extended dialogue with Bing, an LLM-powered search engine, which revealed harmful outputs after probing questions, highlighting vulnerabilities in the model's safeguards. This contrasts with simpler early jailbreaks, like the "Grandma Jailbreak," where users framed requests as innocent help for a grandmother, easily eliciting similar content. This raises the question: How much conversational effort is needed to elicit harmful information from LLMs? We propose two measures: Conversational Length (CL), which quantifies the conversation length used to obtain a specific response, and Conversational Complexity (CC), defined as the Kolmogorov complexity of the user's instruction sequence leading to the response. To address the incomputability of Kolmogorov complexity, we approximate CC using a reference LLM to estimate the compressibility of user instructions. Applying this approach to a large red-teaming dataset, we perform a quantitative analysis examining the statistical distribution of harmful and harmless conversational lengths and complexities. Our empirical findings suggest that this distributional analysis and the minimisation of CC serve as valuable tools for understanding AI safety, offering insights into the accessibility of harmful information. This work establishes a foundation for a new perspective on LLM safety, centered around the algorithmic complexity of pathways to harm., JB acknowledges support from Effective Ventures Foundation Long Term Future Fund Grant ID: a3rAJ000000017iYAA and US DARPA HR00112120007 (RECoG-AI) MC acknowledges support from multiple grants: PID2023-150271NB-C21 funded by the Ministerio de Ciencia, Innovación y Universidades, Agencia Estatal de Investigación; project PID2022-137243OB-I00 financed by MCIN/AEI/10.13039/501100011033 and ERDF A way of making Europe ; and project TSI-100922-2023-0001 under the Convocatoria Cátedras ENIA 2022. Additional funding was provided by Google.org through the Silicon Valley Community Foundation via a grant to the Fundación General CSIC. Google.org had no role in the study design, data collection and analysis, decision to publish, or preparation of the manuscript. JHO thanks CIPROM/2022/6 (FASSLOW) and IDIFEDER/2021/05 (CLUSTERIA) funded by Generalitat Valenciana, the EC H2020-EU grant agreement No. 952215 (TAILOR), US DARPA HR00112120007 (RECoG-AI) and Spanish grant PID2021-122830OB-C42 (SFERA) funded by MCIN/AEI/10.13039/501100011033 and ERDF A way of making Europe .
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Towards an Affective Intelligent Agent Model for Extrinsic Emotion Regulation

  • Picó-Pascual, Aarón|||0000-0002-5612-8033
  • Taverner-Aparicio, Joaquín José|||0000-0002-5163-5335
  • Vivancos, Emilio|||0000-0002-0213-0234
  • Botti V.|||0000-0002-6507-2756
  • García-Fornes, A|||0000-0003-4482-8793
[EN] Emotion regulation is the human ability to modulate one¿s or other emotions to maintain emotional well-being. Despite its importance, only a few computational models have been proposed for facilitating emotion regulation. None of them prepare a plan of all the actions necessary for emotion regulation customized to the needs of a specific individual. To address this gap, we propose a computational model for an intelligent agent which, grounded in a multidimensional emotion representation, facilitates emotion regulation in individuals. This computational model is based on J. Gross¿s theoretical framework of emotion regulation. An intelligent agent selects the most appropriate regulation strategy to maintain an individual¿s emotional equilibrium considering the individual¿s personality traits. A dynamic planner prepares a plan of emotion regulation actions which is dynamically adapted according to the emotional changes observed in the individual after applying the previous emotion regulation actions. This refinement of the initial regulatory action plan allows the proposed emotion regulation agent to adapt the plan to the specific characteristics of the individual, facilitating the individual to improve their emotion regulation capabilities and improve their emotional health., This research was funded by Generalitat Valenciana CIPROM/2021/077; Spanish Government by projects PID2020-113416RB-I00 and VAE-VADEM TED2021-131295B-C32 (included in project MCIN/AEI/10.13039/501100011033) and the European Union NextGenerationEU/PRTR; and TAILOR, a project funded by EU Horizon 2020, under GA No 952215.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Tesis doctoral (DoctoralThesis)

Automatic Speech Recognition and Machine Translation with Deep Neural Networks for Open Educational Resources, Parliamentary Contents and Broadcast Media

  • Garcés Díaz-Munío, Gonçal|||0000-0002-2594-5858
[ES] En la última década, el reconocimiento automático del habla (RAH) y la traducción automática (TA) han mejorado enormemente mediante el uso de modelos de redes neuronales profundas (RNP) en constante evolución. Si a principios de los 2010 los sistemas de RAH y TA previos a las RNP llegaron a afrontar con éxito algunas aplicaciones reales como la transcripción y traducción de vídeos docentes pregrabados, ahora en los 2020 son abordables aplicaciones que suponen un reto mucho mayor, como la subtitulación de retransmisiones audiovisuales en directo. En este mismo período, se están invirtiendo cada vez mayores esfuerzos en la accesibilidad a los medios audiovisuales para todos, incluidas las personas sordas. El RAH y la TA, en su estado actual, son grandes herramientas para aumentar la disponibilidad de medidas de accesibilidad como subtítulos, transcripciones y traducciones, y también para proporcionar acceso multilingüe a todo tipo de contenidos. En esta tesis doctoral presentamos resultados de investigación sobre RAH y TA basadas en RNP en tres campos muy activos: los recursos educativos abiertos, los contenidos parlamentarios y los medios audiovisuales. En el área de los recursos educativos abiertos (REA), presentamos primeramente trabajos sobre la evaluación y postedición de RAH y TA con métodos de interacción inteligente, en el marco del proyecto de investigación europeo "transLectures: Transcripción y Traducción de Vídeos Docentes". Los resultados obtenidos confirman que la interacción inteligente puede reducir aún más el esfuerzo de postedición de transcripciones y traducciones automáticas. Seguidamente, en el contexto del posterior proyecto europeo X5gon, presentamos una investigación sobre el desarrollo de sistemas de TA neuronal basados en RNP, y sobre sacar el máximo partido de corpus de TA masivos mediante filtrado automático de datos. Este trabajo dio como resultado sistemas de TA neuronal clasificados entre los mejores en una competición internacional de TA, y mostramos cómo estos nuevos sistemas mejoraron la calidad de los subtítulos multilingües en casos reales de REA. En el ámbito también en crecimiento de las tecnologías del lenguaje para contenidos parlamentarios, describimos una investigación sobre técnicas de filtrado de datos de habla para el RAH en tiempo real en el contexto de debates del Parlamento Europeo. Esta investigación permitió la publicación de Europarl-ASR, un nuevo y amplio corpus de habla para entrenamiento y evaluación de sistemas de RAH en continuo, así como para la evaluación comparativa de técnicas de filtrado de datos de habla. Finalmente, presentamos un trabajo en un ámbito en la vanguardia tecnológica del RAH y de la TA: la subtitulación de retransmisiones audiovisuales en directo, en el marco del Convenio de colaboración I+D+i 2020-2023 entre la radiotelevisión pública valenciana À Punt y la Universitat Politècnica de València para la subtitulación asistida por ordenador de contenidos audiovisuales en tiempo real. Esta investigación ha resultado en la implantación de sistemas de RAH en tiempo real, de alta precisión y baja latencia, para una lengua no mayoritaria en el mundo (el catalán) y una de las lenguas más habladas del mundo (el castellano) en un medio audiovisual real., [CA] En l'última dècada, el reconeixement automàtic de la parla (RAP) i la traducció automàtica (TA) han millorat enormement mitjançant l'ús de models de xarxes neuronals profundes (XNP) en constant evolució. Si a principis dels 2010 els sistemes de RAP i TA previs a les XNP van arribar a afrontar amb èxit algunes aplicacions reals com la transcripció i traducció de vídeos docents pregravats, ara en els 2020 són abordables aplicacions que suposen un repte molt major, com la subtitulació de retransmissions audiovisuals en directe. En aquest mateix període, s'estan invertint cada vegada majors esforços en l'accessibilitat als mitjans audiovisuals per a tots, incloses les persones sordes. El RAP i la TA, en el seu estat actual, són grans eines per a incrementar la disponibilitat de mesures d'accessibilitat com subtítols, transcripcions i traduccions, també com una manera de proporcionar accés multilingüe a tota classe de continguts. En aquesta tesi doctoral presentem resultats d'investigació sobre RAP i TA basades en XNP en tres camps molt actius: els recursos educatius oberts, els continguts parlamentaris i els mitjans audiovisuals. En l'àrea dels recursos educatius oberts (REO), presentem primerament treballs sobre l'avaluació i postedició de RAP i TA amb mètodes d'interacció intel·ligent, en el marc del projecte d'investigació europeu "transLectures: Transcripció i traducció de vídeos docents". Els resultats obtinguts confirmen que la interacció intel·ligent pot reduir encara més l'esforç de postedició de transcripcions i traduccions automàtiques. Seguidament, en el context del posterior projecte europeu X5gon, presentem una investigació sobre el desenvolupament de sistemes de TA neuronal basats en XNP, i sobre traure el màxim partit de corpus de TA massius mitjançant filtratge automàtic de dades. Aquest treball va donar com a resultat sistemes de TA neuronal classificats entre els millors en una competició internacional de TA, i mostrem com aquests nous sistemes milloren la qualitat dels subtítols multilingües en casos reals de REO. En l'àmbit també en creixement de les tecnologies del llenguatge per a continguts parlamentaris, descrivim una investigació sobre tècniques de filtratge de dades de parla per al RAP en temps real en el context de debats del Parlament Europeu. Aquesta investigació va permetre la publicació d'Europarl-ASR, un corpus de parla nou i ampli per a l'entrenament i l'avaluació de sistemes de RAP en continu, així com per a l'avaluació comparativa de tècniques de filtratge de dades de parla. Finalment, presentem un treball en un àmbit en l'avantguarda tecnològica del RAP i de la TA: la subtitulació de retransmissions audiovisuals en directe, en el context del Conveni de col·laboració R+D+i 2020-2023 entre la radiotelevisió pública valenciana À Punt i la Universitat Politècnica de València per a la subtitulació assistida per ordinador de continguts audiovisuals en temps real. Aquesta investigació ha donat com a resultat la implantació de sistemes de RAP en temps real, amb alta precisió i baixa latència, per a una llengua no majoritària en el món (el català) i una de les llengües més parlades del món (el castellà) en un mitjà audiovisual real., [EN] In the last decade, automatic speech recognition (ASR) and machine translation (MT) have improved enormously through the use of constantly evolving deep neural network (DNN) models. If at the beginning of the 2010s the then pre-DNN ASR and MT systems were ready to tackle with success some real-life applications such as offline video lecture transcription and translation, now in the 2020s much more challenging applications are within grasp, such as live broadcast media subtitling. At the same time in this period, media accessibility for everyone, including deaf and hard-of-hearing people, is being given more and more importance. ASR and MT, in their current state, are powerful tools to increase the coverage of accessibility measures such as subtitles, transcriptions and translations, also as a way of providing multilingual access to all types of content. In this PhD thesis, we present research results on automatic speech recognition and machine translation based on deep neural networks in three very active domains: open educational resources, parliamentary contents and broadcast media. Regarding open educational resources (OER), we first present work on the evaluation and post-editing of ASR and MT with intelligent interaction approaches, as carried out in the framework of EU project transLectures: Transcription and Translation of Video Lectures. The results obtained confirm that the intelligent interaction approach can make post-editing automatic transcriptions and translations even more cost-effective. Then, in the context of subsequent EU project X5gon, we present research on developing DNN-based neural MT systems, and making the most of larger MT corpora through automatic data filtering. This work resulted in a first-rank classification in an international evaluation campaign on MT, and we show how these new NMT systems improved the quality of multilingual subtitles in real OER scenarios. In the also growing domain of language technologies for parliamentary contents, we describe research on speech data curation techniques for streaming ASR in the context of European Parliament debates. This research resulted in the release of Europarl-ASR, a new, large speech corpus for streaming ASR system training and evaluation, as well as for the benchmarking of speech data curation techniques. Finally, we present work in a domain on the edge of the state of the art for ASR and MT: the live subtitling of broadcast media, in the context of the 2020-2023 R&D collaboration agreement between the Valencian public broadcaster À Punt and the Universitat Politècnica de València for real-time computer assisted subtitling of media contents. This research has resulted in the deployment of high-quality, low-latency, real-time streaming ASR systems for a less-spoken language (Catalan) and a widely spoken language (Spanish) in a real broadcast use case., The research leading to these results has received funding from the European Union’s Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 287755 (transLectures), Competitiveness and Innovation Framework Programme (CIP) under grant agreement no. 621030 (EMMA), Horizon 2020 research and innovation programme under grant agreements no. 761758 (X5gon) and no. 952215 (TAILOR), and EU4Health Programme 2021–2027 as part of Europe’s Beating Cancer Plan under grant agreements no. 101056995 (INTERACT-EUROPE) and no. 101129375 (INTERACT-EUROPE 100); from the Government of Spain’s research projects iTrans2 (ref. TIN2009-14511, MICINN/ERDF EU), MORE (ref. TIN2015-68326-R,MINECO/ERDF EU), Multisub (ref. RTI2018-094879-B-I00, MCIN/AEI/10.13039/501100011033 ERDF “A way of making Europe”), and XLinDub (ref. PID2021-122443OB-I00, MCIN/AEI/10.13039/501100011033 ERDF “A way of making Europe”); from the Generalitat Valenciana’s “R&D collaboration agreement between the Corporació Valenciana de Mitjans de Comunicació (À Punt Mèdia) and the Universitat Politècnica de València (UPV) for real-time computer assisted subtitling of audiovisual contents based on artificial intelligence”, and research project Classroom Activity Recognition (PROMETEO/2019/111); and from the Universitat Politècnica de València’s PAID-01-17 R&D support programme. This work uses data from the RTVE 2018 and 2020 Databases. This set of data has been provided by RTVE Corporation to help develop Spanish-language speech technologies.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Human or Machine: A Novel Deep Learning Framework for Autonomous Driver Identification Based on Vehicle Trajectories

  • Laverde-Marin, Andres Felipe
  • Mattas, Konstantinos
  • Fontaras, Georgios
  • Kouvelas, Anastasios
  • Makridis, Michail A.
  • Martínez-Plumed, Fernando|||0000-0003-2902-6477
  • Ramírez Quintana, María José|||0000-0002-0559-3568
[EN] Monitoring traffic streams through vehicle trajectories offers valuable insights into traffic flow characteristics. In recent years, there has been a surge in the availability of vehicle trajectory datasets. At the same time, the number of autonomously-driven vehicles on the road is increasing, largely due to the adoption of systems like adaptive cruise control. However, distinguishing system-controlled vehicles from human-driven vehicles remains challenging, despite its potential to enable valuable applications and informed policy-making. The differences between the driving behavior of human-driven (HDs) and automated (ADs) vehicles in the longitudinal direction are highlighted in the literature and hold promise for novel methodologies that exploit them to identify the type of driver. Here, we propose a novel online-offline framework with three key contributions. First, a feature design component performs feature disentanglement to increase the performance of downstream deep learning models. Second, a bidirectional LSTM (bLSTM) architecture demonstrates excellent accuracy in differentiating between HD and AD vehicles. Third, a data drift detection component identifies changes in data distributions, enabling the framework to generalize effectively to unseen datasets with minimal new labeled observations., This work was supported in part by the Generalitat Valenciana under Grant CIPROM/2022/6 (FASSLOW) and Grant IDIFEDER/2021/05(CLUSTERIA), in part by European Commission (EC) H2020-European Union (EU) under Agreement 952215 (TAILOR), in part by Spanish funded by Ministerio de Ciencia e Innovacion (MCIN)/Agencia Estatal de Investigacion (AEI)/10.13039/501100011033 under Grant PID2021-122830OB-C42(SFERA), and in part by "European Regional Development Fund (ERDF) aWay of Making Europe."
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A distribution semantics for probabilistic term rewriting

  • Vidal, Germán|||0000-0002-1857-6951
[EN] Probabilistic programming is becoming increasingly popular thanks to its ability to specify problems with a certain degree of uncertainty. In this work, we focus on term rewriting, a wellknown computational formalism. In particular, we consider systems that combine traditional rewriting rules with probabilities. Then, we define a novel "distribution semantics" for such systems that can be used to model the probability of reducing a term to some value. We also show how to compute a set of "explanations" for a given reduction, which can be used to compute its probability in a more efficient way. Finally, we illustrate our approach with several examples and outline a couple of extensions that may prove useful to improve the expressive power of probabilistic rewrite systems., This work has been partially supported by grant PID2019-104735RB-C41 funded by MICIU/AEI/10.13039/501100011033, by the Generalitat Valenciana under grant CIPROM/2022/6 (FassLow) , and by TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Data Dependence for Object-Oriented Programs

  • Galindo, Carlos|||0000-0002-3569-6218
  • Silva, Josep|||0000-0001-5096-0008
  • Pérez-Rubio, Sergio
[EN] The System Dependence Graph (SDG) is a program representation used in several static analyses. In particular, it is the basis of program slicing, a technique that extracts the part of the program that may directly or indirectly affect the values computed at a given program point (known as the slicing criterion). Several approaches have enhanced the SDG representation to deal with object-oriented situations like inheritance, polymorphism, or dynamic bindings. Currently, the most advanced approach is the Java System Dependence Graph (JSysDG), which subsumes previous approaches and that is able to represent all those situations. In this paper, we show that even the JSysDG does not produce complete slices in all cases when some object variables are selected as the slicing criterion. To solve this limitation, we first identify the source of the problem: the representation of dependences between partial definitions of objects is insufficient in the JSysDG, leading to a loss of completeness in many cases. Then, we extend the JSysDG with the addition of a specific flow dependence for object type variables called object-flow dependence. This extension provides a more accurate flow representation between object variables and its data members and allows us to obtain complete slices when an object variable is considered as slicing criterion., This work has been partially supported by the EU (FEDER) and the Spanish MCI/AEI under grants TIN2016-76843-C4-1- R and PID2019-104735RB-C41, by the Generalitat Valenciana under grant Prometeo/2019/098 (DeepTrust), and by TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215. Sergio Pérez was partially supported by Universitat Politècnica de València under FPI grant PAID-01-18.
Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

Delegation to artificial agents fosters prosocial behaviors in the collective risk dilemma

  • Fernández Domingos, Elias
  • Terrucha, Inês
  • Suchon, Rémi
  • Grujić, Jelena
  • Burguillo Rial, Juan Carlos
  • Santos, Francisco C.
  • Lenaerts, Tom
Home assistant chat-bots, self-driving cars, drones or automated negotiation systems are some of the several examples of autonomous (artificial) agents that have pervaded our society. These agents enable the automation of multiple tasks, saving time and (human) effort. However, their presence in social settings raises the need for a better understanding of their effect on social interactions and how they may be used to enhance cooperation towards the public good, instead of hindering it. To this end, we present an experimental study of human delegation to autonomous agents and hybrid human-agent interactions centered on a non-linear public goods dilemma with uncertain returns in which participants face a collective risk. Our aim is to understand experimentally whether the presence of autonomous agents has a positive or negative impact on social behaviour, equality and cooperation in such a dilemma. Our results show that cooperation and group success increases when participants delegate their actions to an artificial agent that plays on their behalf. Yet, this positive effect is less pronounced when humans interact in hybrid human-agent groups, where we mostly observe that humans in successful hybrid groups make higher contributions earlier in the game. Also, we show that participants wrongly believe that artificial agents will contribute less to the collective effort. In general, our results suggest that delegation to autonomous agents has the potential to work as commitment devices, which prevent both the temptation to deviate to an alternate (less collectively good) course of action, as well as limiting responses based on betrayal aversion., Fonds Wetenschappelijk Onderzoek | Ref. G.1S639.17N, Fonds Wetenschappelijk Onderzoek | Ref. G054919N, Fonds De La Recherche Scientifique - FNRS | Ref. 31257234, FCT-Portugal | Ref. UIDB/50021/2020, EU Horizon 2020 - TAILOR | Ref. 952215, Service Public de Wallonie Recherche | Ref. 2010235–ariac, FLAG-ERA JCT 2016 | Ref. FuturICT2.0, Fonds De La Recherche Scientifique - FNRS | Ref. 40005955, Fonds Wetenschappelijk Onderzoek | Ref. G.0391.13N, FCT-Portugal | Ref. PTDC/CCI-INF/7366/2020, FCT-Portugal | Ref. PTDC/MAT-APL/6804/2020
Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

Timing uncertainty in collective risk dilemmas encourages group reciprocation and polarization

  • Domingos, Elias Fernández
  • Grujić, Jelena
  • Burguillo Rial, Juan Carlos
  • Kirchsteiger, Georg
  • Santos González, Francisco José
  • Lenaerts, Tom
Social dilemmas are often shaped by actions involving uncertain returns only achievable in the future, such as climate action or voluntary vaccination. In this context, uncertainty may produce non-trivial effects. Here, we assess experimentally — through a collective risk dilemma — the effect of timing uncertainty, i.e. how uncertainty about when a target needs to be reached affects the participants' behaviors. We show that timing uncertainty prompts not only early generosity but also polarized outcomes, where participants' total contributions are distributed unevenly. Furthermore, analyzing participants' behavior under timing uncertainty reveals an increase in reciprocal strategies. A data-driven game-theoretical model captures the self-organizing dynamics underpinning these behavioral patterns. Timing uncertainty thus casts a shadow on the future that leads participants to respond early, whereas reciprocal strategies appear to be important for group success. Yet, the same uncertainty also leads to inequity and polarization, requiring the inclusion of new incentives handling these societal issues., Xunta de Galicia, Fundação para a Ciência e a Tecnologia | Ref. PTDC/CCI-INF/7366/2020, Fundação para a Ciência e a Tecnologia | Ref. PTDC/MAT/STA/3358/2014, Fundação para a Ciência e a Tecnologia | Ref. UIDB/50021/2020
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Encoding Ethics to Compute Value-Aligned Norms

  • Serramia, Marc
  • Rodriguez Soto, Manel
  • López Sánchez, Maite
  • Rodriguez Aguilar, Juan A.
  • Bistaffa, Filippo
  • Boddington, Paula
  • Wooldridge, Michael
  • Ansótegui Gil, Carlos José
Norms have been widely enacted in human and agent societies to regulate individuals’ actions. However, although legislators may have ethics in mind when establishing norms, moral values are only sometimes explicitly considered. This paper advances the state of the art by providing a method for selecting the norms to enact within a society that best aligns with the moral values of such a society. Our approach to aligning norms and values is grounded in the ethics literature. Specifically, from the literature’s study of the relations between norms, actions, and values, we formally define how actions and values relate through the so-called value judgment function and how norms and values relate through the so-called norm promotion function. We show that both functions provide the means to compute value alignment for a set of norms. Moreover, we detail how to cast our decision-making problem as an optimisation problem: finding the norms that maximise value alignment. We also show how to solve our problem using off-the-shelf optimisation tools. Finally, we illustrate our approach with a specific case study on the European Value Study., This work has been funded by projects VAE (TED2021-131295B-C31), VALAWAI (HE101070930), LOGISTAR (H2020-769142), AI4EU (H2020-825619), Crowd4SDG (H2020-872944), ACISUD (PID2022-136787NB-I00), COREDEM (H2020-785907), Fairtrans (PID2021-124361OBC33), AUTODEMO (SR21-00329), TAILOR (H2020-952215), assist-Decidim (23S02974-001), 2021 SGR 00313, and 2021 SGR 00754. F. Bistafa was supported by the H2020-MSCAIF- 2016 HPA4CF project. The authors have no competing interests to declare that are relevant to the content of this article. Maite Lopez-Sanchez belongs to the WAI research group (University of Barcelona) an associated unit to CSIC through the IIIA.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Online action recognition

  • Suárez Hernández, Alejandro
  • Segovia-Aguas, Javier
  • Torras, Carme
  • Alenyà, Guillem
Trabajo presentado en 35th AAAI Conference on Artificial Intelligence, celebrada de forma virtual del 2 al 9 de febrero de 2021, Recognition in planning seeks to find agent intentions, goals or activities given a set of observations and a knowledge library (e.g. goal states, plans or domain theories). In this work we introduce the problem of Online Action Recognition. It consists in recognizing, in an open world, the planning action that best explains a partially observable state transition from a knowledge library of first-order STRIPS actions, which is initially empty. We frame this as an optimization problem, and propose two algorithms to address it: Action Unification (AU) and Online Action Recognition through Unification (OARU). The former builds on logic unification and generalizes two input actions using weighted partial MaxSAT. The latter looks for an action within the library that explains an observed transition. If there is such action, it generalizes it making use of AU, building in this way an AU hierarchy. Otherwise, OARU inserts a Trivial Grounded Action (TGA) in the library that explains just that transition. We report results on benchmarks from the International Planning Competition and PDDLGym, where OARU recognizes actions accurately with respect to expert knowledge, and shows real-time performance., The research leading to these results has received funding from the EU H2020 research and innovation programme under grant agreement no.731761, IMAGINE; the Hu- MoUR project TIN2017-90086-R (AEI/FEDER, UE); and AEI through the María de Maeztu Seal of Excellence to IRI (MDM-2016-0656). Javier Segovia-Aguas was also partially supported by TAILOR, a project funded by EU H2020 research and innovation programme no. 952215, an ERC Advanced Grant no. 885107, and grant TIN-2015-67959-P from MINECO, Spain., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Automatic learning of cognitive exercises for socially assistive robotics

  • Suárez Hernández, Alejandro
  • Andriella, Antonio
  • Taranović, Aleksandar
  • Segovia-Aguas, Javier
  • Torras, Carme
  • Alenyà, Guillem
Trabajo presentado en el 30th IEEE International Conference on Robot and Human Interactive Communication (RO-MAN), celebrada de forma virtual del 8 al 12 de agosto de 2021, In this paper, we present a learning approach to facilitate the teaching of new board exercises to assistive robotic systems. We formulate the problem as the learning of action models using Boolean predicates, disjunctive preconditions, and existential quantifiers from demonstrations of successful exercise executions. To be able to cope with exercises whose rules depend on a set of features that are initialized at the beginning of each play-out, we introduce the concept of dynamic context. Furthermore, we show how the learnt knowledge can be represented intuitively in a graphical interface that helps the caregiver understand what the system has learnt. As validation, we conducted a user study in which we evaluated whether and to which extent different types of feedback can affect the subjects¿ performance while teaching three types of exercises: (1) sorting numbers; (2) arranging letters; and (3) reproducing shapes sequences in reversed order. The results suggest that textual and graphical feedback are beneficial., A. Andriella, C. Torras and A. Suarez-Hernandez were partially funded ´ by the European Union´s Horizon 2020 under ERC Advanced Grant CLOTHILDE (no. 741930), G. Alenya by the EU H2020 research and ` innovation programme IMAGINE (no. 731761) and J. Segovia-Aguas by the programme TAILOR (no. 952215). The work was partially supported by the Spanish State Research Agency through the Mar´ıa de Maeztu Seal of Excellence to IRI (MDM-2016-0656).
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Aggregating value systems for decision support

  • Lera-Leri, Roger X.
  • Liscio, Enrico
  • Bistaffa, Filippo
  • Jonker, Catholijn M.
  • López-Sánchez, Maite
  • Murukannaiah, Pradeep K.
  • Rodríguez-Aguilar, Juan Antonio
  • Salas-Molina, Francisco
We adopt an emerging and prominent vision of human-centred Artificial Intelligence that requires building trustworthy intelligent systems. Such systems should be capable of dealing with the challenges of an interconnected, globalised world by handling plurality and by abiding by human values. Within this vision, pluralistic value alignment is a core problem for AI– that is, the challenge of creating AI systems that align with a set of diverse individual value systems. So far, most literature on value alignment has considered alignment to a single value system. To address this research gap, we propose a novel method for estimating and aggregating multiple individual value systems. We rely on recent results in the social choice literature and formalise the value system aggregation problem as an optimisation problem. We then cast this problem as an ℓp-regression problem. Doing so provides a principled and general theoretical framework to model and solve the aggregation problem. Our aggregation method allows us to consider a range of ethical principles, from utilitarian (maximum utility) to egalitarian (maximum fairness). We illustrate the aggregation of value systems by considering real-world data from two case studies: the Participatory Value Evaluation process and the European Values Study. Our experimental evaluation shows how different consensus value systems can be obtained depending on the ethical principle of choice, leading to practical insights for a decision-maker on how to perform value system aggregation., The authors were supported by the research projects ACISUD (PID2022-136787NB-I00), VAE (TED2021-131295B-C31), VALAWAI (HE-101070930), Fairtrans (PID2021-124361OB-C33), Yoma OR (OPE02570), TAILOR (952215), and the Hybrid Intelligence Center, a 10-year programme funded by the Dutch Ministry of Education, Culture and Science through the Netherlands Organisation for Scientific Research ., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Multi-constructor CMSA for the maximum disjoint dominating sets problem

  • Rosati, Roberto Maria
  • Bouamama, Salim
  • Blum, Christian
We propose the Multi-Constructor CMSA, a Construct, Merge, Solve and Adapt (CMSA) algorithm that employs multiple heuristic procedures, respectively solution constructors, for the Maximum Disjoint Dominating Sets Problem (MDDSP). At every iteration of the search procedure, the solution components built by the constructors are merged into a sub-instance, which is subsequently solved by an exact solver and then adapted to keep only beneficial solution components. In our CMSA the solution constructors are chosen at random according to their relative probabilities, which are adapted during the search, through a mechanism based on reinforcement learning. We test two variants of the new Multi-Constructor CMSA that employ, respectively, two and six solution constructors, on a new set of 3600 problem instances, encompassing random graphs, Watts–Strogatz networks and Barabási-Albert networks, generated through a Hammersley sampling procedure on the instance space. We compare our algorithm against six heuristics from the literature, as well as with the standard version of CMSA. Furthermore, we employ an integer linear programming (ILP) model that is able to achieve a good performance for small, sparse graphs. Overall, the experimental results show that all versions of CMSA outperform by a large margin the previous state of the art and that, among the variants of CMSA, the novel version that combines two constructors provides slightly better results than the other ones, more prominently on larger graphs., Additionally, the authors acknowledge TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215, for the support provided for this research. Furthermore, this work was supported by grant PID2022-136787NB-I00 funded by MCIN/AEI/10.13039/501100011033. Finally, the support provided by CINECA through grant ISCRA C IA4EVRP HP10CE285L is gratefully acknowledged by the authors., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

A General Approach for Computing a Consensus in Group Decision Making That Integrates Multiple Ethical Principles

  • Salas-Molina, Francisco
  • Bistaffa, Filippo
  • Rodríguez-Aguilar, Juan Antonio
20 pages, 1 table, 1 figure, We tackle the problem of computing a consensus according to multiple ethical principles – which can include, for example, the principle of maximum freedom associated with the Benthamite doctrine and the principle of maximum fairness associated with the Rawlsian principles – among the preferences of different individuals in the context of Group Decision-Making (GDM). More formally, we put forward a novel formalisation of the above-mentioned problem based on a multi- -norm approximation problem that aims at minimising multiple -metric distance functions, where each parameter represents a given ethical principle. Our contribution incurs obvious benefits from a social-choice perspective. Firstly, our approach significantly generalises state-of-the-art approaches that were limited to only two ethical principles ( , for maximum freedom, and , for maximum fairness). Secondly, our experimental results considering an established test case demonstrate that our approach is capable, thanks to a novel re-weighting scheme, to compute a multi-norm consensus that takes into account each ethical principle in a balanced way, in contrast with state-of-the-art approaches that were heavily biased towards the ethical principle., Research supported by projects: CI-SUSTAIN, Spain (PID2019-104156GB-I00); TAILOR, Spain (H2020-952215); 2021 SGR 00754 funded by Generalitat de Catalunya, Spain; VAE TED2021-131295B-C31, funded by MCIN/AEI, Spain/10.13 039/501100011033 and NextGenerationEU/ PRTR, Spain; and VALAWAI, Spain (Horizon Europe #101070930). Funding for open access charge: CRUE-Universitat Politècnica de València., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

A multidimensional review of the cash management problem

  • Salas-Molina, Francisco
  • Rodríguez-Aguilar, Juan Antonio
  • Guillén, Montserrat
In this paper, we summarize and analyze the relevant research on the cash management problem appearing in the literature. First, we identify the main dimensions of the cash management problem. Next, we review the most relevant contributions in this field and present a multidimensional analysis of these contributions, according to the dimensions of the problem. From this analysis, several open research questions are highlighted., Research supported by projects: Crowd4SDG (H2020-872944); CI-SUSTAIN (PID 2019-104156GB-I00); TAILOR (H2020-952215); TED2021-131295B-C31; TED2021-130187B-I00; PID2019-105986GB-C21 (funded by MCIN/AEI /10.13039/501100011033 and by the “European Union NextGeneration EU/PRTR”); VALAWAI (funded by the European Commission under Grant 101070930); 2021 SGR 00299; 2021 SGR 00754., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Building rankings encompassing multiple criteria to support qualitative decision-making

  • Serramia, Marc
  • López-Sánchez, Maite
  • Moretti, Stefano
  • Rodríguez-Aguilar, Juan Antonio
Decision makers are commonly challenged with comparing, and ultimately ranking, elements with regards to the degree to which they satisfy multiple criteria and in terms of their own preferences. This calls for a new decision making framework, which we formally present here. Within such a framework, we present multi-criteria lex-cel: a new method for ranking single elements. Furthermore, we formally establish that our contributions generalise recent results in the social choice literature. We also illustrate our contributions through a case study that poses an ethical decision-making problem., Research supported by projects: COREDEM (H2020-785907); Crowd4SDG (H2020-872944); CI-SUSTAIN (PID2019-104156GB-I00); TAILOR (H2020-952215); COMRDI18-1-0010-02; 2021 SGR 00754; 2021 SGR 000313; THEMIS (ANR-20-CE23-0018); “FairTransNLP-Language: Analysing toxicity and stereotypes in language for unbiased, fair and transparent systems” (PID2021-124361OB-C33) funded by MCIN/AEI/10.13039/501100011033/FEDER,UE; “AUTODEMO: The stealth side of participatory democracy: process preferences towards automated decision-making” code SR21-00329; “VAE: Value-Awareness Engineering” TED2021-131295B-C31 funded by MCIN/AEI/10.13039/501100011033 and by the European Union NextGenerationEU/PRTR; and VALAWAI project, funded by the European Commission under Grant #101070930., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Combining theory of mind and abductive reasoning in agent-oriented programming

  • Montes, Nieves
  • Luck, Michael
  • Osman, Nardine
  • Rodrigues, Odinaldo
  • Sierra, Carles
[Availability of data and materials] All the code accompanying this work can be freely accessed https://github.com/nmontesg/tomabd. All the simulation data generated is freely available https://drive.google.com/file/d/1W66eZD-t-5YeQ4M4SHmdBuX60wRu1e0k/view?usp=sharing., This paper presents a novel model, called TomAbd, that endows autonomous agents with Theory of Mind capabilities. TomAbd agents are able to simulate the perspective of the world that their peers have and reason from their perspective. Furthermore, TomAbd agents can reason from the perspective of others down to an arbitrary level of recursion, using Theory of Mind of order. By combining the previous capability with abductive reasoning, TomAbd agents can infer the beliefs that others were relying upon to select their actions, hence putting them in a more informed position when it comes to their own decision-making. We have tested the TomAbd model in the challenging domain of Hanabi, a game characterised by cooperation and imperfect information. Our results show that the abilities granted by the TomAbd model boost the performance of the team along a variety of metrics, including final score, efficiency of communication, and uncertainty reduction., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. N. Montes, N. Osmain and C. Sierra acknowledge funding from the Spanish funded VAE project (#TED2021-131295B-C31), the EU VALAWAI project (HORIZON #101070930), and the EU TAILOR project (H2020 #952215)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

The AI4Citizen pilot: Pipelining AI-based technologies to support school-work alternation programmes

  • Georgara, Athina
  • Kazhamiakin, Raman
  • Mich, Ornella
  • Palmero Aprosio, Alessio
  • Pazzaglia, Jean Christoph
  • Rodríguez-Aguilar, Juan Antonio
  • Sierra, Carles
[Data availability] The data used in the experiment Section 7.3.2 is available from the corresponding author upon request. The students’ data we use in the rest of the experiments cannot be disclosed due to GDPR issues., The School-Work Alternation (SWA) programme was developed (under a European Commission call) to bridge the gaps and establish a well-tuned partnership between education and the job market. This work details the development of the AI4Citizen pilot, an AI software suite designed to support the SWA programme. The AI4Citizen pilot, developed within the H2020 AI4EU project, offers AI tools to automate and enhance the current SWA process. At the same time, the AI4Citizen pilot offers novel tools to support the complex problem of allocating student teams to internship programs, promoting collaborative learning and teamwork skills acquisition. Notably, the AI4Citizen pilot corresponds to a pipeline of AI tools, integrating existing and novel technologies. Our exhaustive empirical analysis confirms that the AI4Citizen pilot can alleviate the difficulties of current processes in the SWA, and therefore it is ready for real-world deployment., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. The research leading to these results received funding from project AI4EU (H2020-825619). Athina Georgara has received funding from Generalitat de Catalunya under Grant 2019DI17; and has received research support from company Enzyme Advising Group. Furthermore, partial financial support was received from projects: CI-SUSTAIN (PID2019-104156GB-I00); Crowd4SDG (H2020-872944); TAILOR (H2020-952215); VAE (TED2021-131295B-C31), funded by MCIN/AEI /10.13039/501100011033 and by the “European Union NextGenerationEU/PRTR; VALAWAI (Horizon Europe #101070930); and 2021 SGR 00754., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Encoding Ethics to Compute Value-Aligned Norms

  • Serramia, Marc
  • Rodríguez-Soto, Manel
  • López-Sánchez, Maite
  • Rodríguez-Aguilar, Juan Antonio
  • Bistaffa, Filippo
  • Boddington, Paula
  • Wooldridge, Michael
  • Ansotegui, Carlos
Norms have been widely enacted in human and agent societies to regulate individuals’ actions. However, although legislators may have ethics in mind when establishing norms, moral values are only sometimes explicitly considered. This paper advances the state of the art by providing a method for selecting the norms to enact within a society that best aligns with the moral values of such a society. Our approach to aligning norms and values is grounded in the ethics literature. Specifically, from the literature’s study of the relations between norms, actions, and values, we formally define how actions and values relate through the so-called value judgment function and how norms and values relate through the so-called norm promotion function. We show that both functions provide the means to compute value alignment for a set of norms. Moreover, we detail how to cast our decision-making problem as an optimisation problem: finding the norms that maximise value alignment. We also show how to solve our problem using off-the-shelf optimisation tools. Finally, we illustrate our approach with a specific case study on the European Value Study., This work has been funded by projects VAE (TED2021-131295B-C31), VALAWAI (HE-101070930), LOGISTAR (H2020-769142), AI4EU (H2020-825619), Crowd4SDG (H2020-872944), ACISUD (PID2022-136787NB-I00), COREDEM (H2020-785907), Fairtrans (PID2021-124361OB-C33), AUTODEMO (SR21-00329), TAILOR (H2020-952215), assist-Decidim (23S02974-001), 2021 SGR 00313, and 2021 SGR 00754. F. Bistaffa was supported by the H2020-MSCAIF- 2016 HPA4CF project. The authors have no competing interests to declare that are relevant to the content of this article. Maite Lopez-Sanchez belongs to the WAI research group (University of Barcelona) an associated unit to CSIC through the IIIA., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Multi-objective reinforcement learning for designing ethical multi-agent environments

  • Rodríguez-Soto, Manel
  • López-Sánchez, Maite
  • Rodríguez-Aguilar, Juan Antonio
[Data availability] Source code of the environment and algorithms generated and analysed during the current study are available in the following link: https://github.com/Lenmaz/Ethical-Gathering., This paper tackles the open problem of value alignment in multi-agent systems. In particular, we propose an approach to build an ethical environment that guarantees that agents in the system learn a joint ethically-aligned behaviour while pursuing their respective individual objectives. Our contributions are founded in the framework of Multi-Objective Multi-Agent Reinforcement Learning. Firstly, we characterise a family of Multi-Objective Markov Games (MOMGs), the so-called ethical MOMGs, for which we can formally guarantee the learning of ethical behaviours. Secondly, based on our characterisation we specify the process for building single-objective ethical environments that simplify the learning in the multi-agent system. We illustrate our process with an ethical variation of the Gathering Game, where agents manage to compensate social inequalities by learning to behave in alignment with the moral value of beneficence., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature., Work funded by projects VALAWAI (HE-101070930), Crowd4SDG (H2020-872944), TAILOR (H2020-952215), COREDEM (H2020-785907), and 22S01386-001 from Barcelona City Council through the Fundació Solidaritat de la UB. Financial support was also received from grant PID2019-104156GB-I00 funded by MCIN/AEI/10.13039/501100011033. Manel Rodriguez-Soto was funded by the Spanish Government with an FPU grant (ref. FPU18/03387)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Multi-objective reinforcement learning for provably incentivising alignment with value systems

  • Rodríguez-Soto, Manel
  • Rădulescu, Roxana
  • Bistaffa, Filippo
  • Ricart, Oriol
  • Mayoral-Macau, Arnau
  • López-Sánchez, Maite
  • Rodríguez-Aguilar, Juan Antonio
  • Nowé, Ann
This paper addresses the problem of ensuring that autonomous learning agents align with multiple moral values. Specifically, we present the theoretical principles and algorithmic tools necessary for creating an environment where we ensure that the agent learns a behaviour aligned with multiple moral values while striving to achieve its individual objective. To address this value alignment problem, we adopt the Multi-Objective Reinforcement Learning framework and propose a novel algorithm that combines techniques from Multi-Objective Reinforcement Learning and Linear Programming. In addition, we illustrate our value alignment process with an example involving an autonomous vehicle. Here, we demonstrate that the agent learns to behave in alignment with the ethical values of safety, achievement, and comfort, with achievement representing the agent’s individual objective. Such ethical behaviour differs depending on the ordering between values. We also use a synthetic multi-objective environment to evaluate the computational costs of guaranteeing ethical learning as the number of values increases., This research project was made possible through the access granted by the Galician Supercomputing Center (CESGA) to its supercomputing infrastructure. The supercomputer FinisTerrae III and its permanent data storage system have been funded by the Spanish Ministry of Science and Innovation, the Galician Government, and the European Regional Development Fund (ERDF). Funding sources The research presented in this paper was supported by the EU-funded VALAWAI (# 101070930) project, the Spanish-funded EVASAI (# PID2024-158227NB-C31), ANNOTATE-SenSIT (# PID2024-156022OB-C33), VAE (# TED2021-131295B-C31), EMOROBCARE (# IASOMMA2024) and Rhymas (# PID2020-113594RB-100) projects. This work was supported by grant PID2022-136787NB-I00 funded by MCIN/AEI/10.13039/501100011033. It was also funded by GUARDEN (101060693), Fairtrans (PID2021-124361OB-C33), AUTODEMO (SR21-00329), TAILOR (H2020-952215), PrepParticip2.0 ( 24S03545-001), grants 2021 SGR 00313 and 2021 SGR 00754. Maite Lopez-Sanchez belongs to the WAI research group (University of Barcelona) associated unit to CSIC by IIIA. Roxana Rădulescu was partly supported by the Research Foundation Flanders (FWO), grant number 1286223N. This research was partially supported by funding from the Flemish Government under the “Onderzoeksprogramma Artificiële Intelligentie (AI) Vlaanderen” program and by the FWO, grant number G062819N., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Evaluating Perceptual Distance Models by Fitting Binomial Distributions to Two-Alternative Forced Choice Data

  • Hepburn, Alex
  • Santos-Rodríguez, Raúl
  • Portilla, Javier
19 pages, 10 figures, 8 tables, The Two-Alternative Forced-Choice (2AFC) paradigm offers advantages over the Mean Opinion Score (MOS) paradigm in psychophysics (PF), such as simplicity and robustness. However, when evaluating perceptual distance models, MOS enables direct correlation between model predictions and PF data. In contrast, 2AFC only allows pairwise comparisons to be converted into a quality ranking similar to MOS when comparisons include shared images. In large datasets, like BAPPS, where image patches and distortions are combined randomly, deriving rankings from 2AFC PF data becomes infeasible, as distorted images included in each comparison are independent. To address this, instead of relying on MOS correlation, researchers have trained ad-hoc neural networks to reproduce 2AFC PF data based on pairs of model distances -- a black-box approach with conceptual and operational limitations. This paper introduces a more robust distance-model evaluation method using a pure probabilistic approach, applying maximum likelihood estimation to a binomial decision model. Our method demonstrates superior simplicity, interpretability, flexibility, and computational efficiency, as shown through evaluations of various visual distance models on two 2AFC PF datasets., This work was funded by UKRI Turing AI Fellowship EP/V024817/1, TAILOR, a project funded by the EU Horizon 2020 research and innovation programme under grant agreement no. 952215, by the Spanish Government grants PID2020-118071GB-I00 and PID2020 113596GB-I00, the VIS4NN project- Programa Fundamentos de la Fundación BBVA 2022, and by the TEC-2024/COM-322 (IDEAL-CV-CM) project from the Comunidad de Madrid.
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

State representation learning for goal-conditioned reinforcement learning

  • Steccanella, Lorenzo
  • Jonsson, Anders, 1973-
Comunicació presentada a European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2022), celebrat del 19 al 23 de setembre de 2022 a Grenoble, França., This paper presents a novel state representation for reward-free Markov decision processes. The idea is to learn, in a self-supervised manner, an embedding space where distances between pairs of embedded states correspond to the minimum number of actions needed to transition between them. Compared to previous methods, our approach does not require any domain knowledge, learning from offline and unlabeled data. We show how this representation can be leveraged to learn goal-conditioned policies, providing a notion of similarity between states and goals and a useful heuristic distance to guide planning and reinforcement learning algorithms. Finally, we empirically validate our method in classic control domains and multi-goal environments, demonstrating that our method can successfully learn representations in large and/or continuous domains., Anders Jonsson is partially funded by the Spanish grant PID2019-108141GB-I00 and the European project TAILOR (H2020, GA 952215).
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Flexible FOND planning with explicit fairness assumptions

  • Rodriguez, Ivan D.
  • Bonet, Blai
  • Sardina, Sebastian
  • Geffner, Héctor
We consider the problem of reaching a propositional goal condition in fully-observable non-deterministic (FOND) planning under a general class of fairness assumptions that are given explicitly. The fairness assumptions are of the form A/B and say that state trajectories that contain infinite occurrences of an action a from A in a state s and finite occurrence of actions from B, must also contain infinite occurrences of action a in s followed by each one of its possible outcomes. The infinite trajectories that violate this condition are deemed as unfair, and the solutions are policies for which all the fair trajectories reach a goal state. We show that strong and strong-cyclic FOND planning, as well as QNP planning, a planning model introduced recently for generalized planning, are all special cases of FOND planning with fairness assumptions of this form which can also be combined. FOND+ planning, as this form of planning is called, combines the syntax of FOND planning with some of the versatility of LTL for expressing fairness constraints. A new planner is implemented by reducing FOND+ planning to answer set programs, and the performance of the planner is evaluated in comparison with FOND and QNP planners, and LTL synthesis tools., The work is partially supported by an ERC Advanced Grant (No 885107), the project TAILOR, funded by an EU Horizon 2020 Grant (No 952215), and by the Knut and Al-ice Wallenberg (KAW) Foundation under the WASP pro-gram. Hector Geffner is a Wallenberg Guest Professor at Linköping University, Sweden.