5,422,003 AI resources indexedWorking toward the world’s largest AI resource index.

Browse resources 13 sections
PDF

Research papers

Publications about AI methods and applications.

How to use the library

Resources

Search results
Search stays within research papers.
Research paper

2 OLMo 2 Furious

Research paper by Team OLMo and collaborators. arXiv record dated 2025-10-08. Research area: Language technology.

Team OLMo, Pete Walsh, Luca Soldaini, Dirk Groeneveld, Kyle Lo, Shane Arora, Akshita Bhagia, Yuling Gu, Shengyi Huang, Matt Jordan, Nathan Lambert, Dustin Schwenk, Oyvind Tafjord, Taira Anderson, David Atkinson, Faeze Brahman, Christopher Clark, Pradeep Dasigi, Nouha Dziri, Allyson Ettinger, Michal Guerquin, David Heineman, Hamish Ivison, Pang Wei Koh, Jiacheng Liu, Saumya Malik, William Merrill, Lester James V. Miranda, Jacob Morrison, Tyler Murray, Crystal Nam, Jake Poznanski, Valentina Pyatkin, Aman Rangapur, Michael Schmitz, Sam Skjonsberg, David Wadden, Christopher Wilhelm, Michael Wilson, Luke Zettlemoyer, Ali Farhadi, Noah A. Smith, Hannaneh Hajishirzi
CC BY 4.0View resource
Research paper

Data Augmentation at the LHC through Analysis-specific Fast Simulation with Deep Learning

We present a fast simulation application based on a Deep Neural Network, designed to create large analysis-specific datasets. Taking as an example the generation of W+jet events produced in sqrt(s)= 13 TeV proton-proton collisions, we train a neural network to model detector resolution effects as a transfer function acting on an analysis-specific set of relevant features, computed at generation level, i.e., in absence of detector effects. Based on this model, we propose a novel fast-simulation workflow that starts from a large amount of generator-level events to deliver large analysis-specific samples. The adoption of this approach would resu

Chen, Cheng, Cerri, Olmo, Nguyen, Thong Q., Vlimant, Jean-Roch, Pierini, Maurizio
arXiv.org perpetual, non-exclusive licenseView resource
Research paper

Detecting Training Data of Large Language Models via Expectation Maximization

Membership inference attacks (MIAs) aim to determine whether a specific example was used to train a given language model. While prior work has explored prompt-based attacks such as ReCALL, these methods rely heavily on the assumption that using known non-members as prompts reliably suppresses the model's responses to non-member queries. We propose EM-MIA, a new membership inference approach that iteratively refines prefix effectiveness and membership scores using an expectation-maximization strategy without requiring labeled non-member examples. To support controlled evaluation, we introduce OLMoMIA, a benchmark that enables analysis of MIA r

Kim, Gyuwan, Li, Yang, Spiliopoulou, Evangelia, Ma, Jie, Wang, William Yang
arXiv.org perpetual, non-exclusive licenseView resource

Platform labels describe intended use. Read each resource's author credits, requirements and available access methods.