Pasar al contenido principal

CARACTERIZACION DE LOS PERFILES Y RELACIONES CEREBRO-INTESTINO MEDIANTE LA ACTIVIDAD EEG EN REPOSO Y LA MICROBIOTA INTESTINAL, BRAINT-BRAIN

PID2023-150271NB-C21

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2023
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario AGENCIA ESTATAL CONSEJO SUPERIOR DE INVESTIGACIONES CIENTIFICAS (CSIC)

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación 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
Publicación 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 .
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Conversational complexity for assessing risk in large language models

  • Burden, John
  • Cebrian, Manuel
  • Hernandez-Orallo, Jose
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”., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Incentivized network dynamics in digital job recruitment

  • Kolic, Blas
  • Cebrian, Manuel
  • Ucar, Inaki
  • Lillo, Rosa E.
Recruiting passive candidates, i.e. individuals not actively seeking jobs but open to compelling opportunities, remains one of the hardest challenges in digital recruitment. Motivated by a real collaboration with an industry partner, we introduce the Independent Halting Cascade (IHC) model: a simple but rich agent-based framework that couples network diffusion with the possibility of halting through job applications. Agents can either recommend vacancies to peers or apply themselves, and incentives increase the likelihood of recommendation, mobilizing otherwise passive candidates. The IHC bridges research on social network diffusion, coordinated task completion, and labor economics by modeling heterogeneous skills, job specificities, and network structures, including homophily. We derive analytical boundaries that characterize diffusion and failure regimes, and we show through simulations that the IHC reproduces the empirical chain-length distributions of Travers and Milgram and Dodds with only coarse calibration. Across synthetic (ER, BA, homophilic) and real networks (SMS, e-mail, Twitter), the IHC achieves comparable or higher success rates than direct-recommendation baselines, while requiring fewer applicants. Our findings suggest that the IHC captures core mechanisms of coordinated task completion, offering both a theoretical contribution and a practical foundation for recruitment systems designed to reach and engage passive candidates., This paper has been carried out within the framework of the Recovery, Transformation and Resilience Plan funds, f inanced by the European Union (Next Generation). Through the grant «Cátedras ENIA 2022 para la creación de cátedras universidad-empresa en IA»- AImpulsa: Cátedra UC3M-Universia de Economía del Dato y la Inteligencia Artificial Responsable aplicada a la Creación Exponencial de Valor. Manuel Cebrian acknowledges additional support from projects PID2022-137243OB-I00 and PID2023-150271NB-C21, financed by MCIN/AEI/10.13039/501100011033 and ERDF“Awayofmaking Europe,” as well as project TSI100922-2023-0001 under the Convocatoria Cátedras ENIA 2022. He also appreciates the support from the “Convocatoria de la Universidad Carlos III de Madrid de Ayudas para la recualificación del sistema universitario español para 2021-2023.”, No