Skip to content
VuFind
  • Login
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
Advanced
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Save to List
  • Permanent link
Cover Image

Saved in:
Bibliographic Details
Main Authors: Kandpal, Nikhil, Lester, Brian, Raffel, Colin, Majstorovic, Sebastian, Biderman, Stella, Abbasi, Baber, Soldaini, Luca, Shippole, Enrico, Cooper, A. Feder, Skowron, Aviya, Kirchenbauer, John, Longpre, Shayne, Sutawika, Lintang, Albalak, Alon, Xu, Zhenlin, Penedo, Guilherme, Allal, Loubna Ben, Bakouch, Elie, Pressman, John David, Fan, Honglu, Stander, Dashiell, Song, Guangyu, Gokaslan, Aaron, Goldstein, Tom, Bartoldson, Brian R., Kailkhura, Bhavya, Murray, Tyler
Format: Preprint
Published: 2025
Subjects:
Computation and Language
Machine Learning
Online Access:https://arxiv.org/abs/2506.05209
Tags: Add Tag
No Tags, Be the first to tag this record!
  • Holdings
  • Description
  • Table of Contents
  • Comments
  • Similar Items
  • Staff View

Internet

https://arxiv.org/abs/2506.05209

Similar Items

  • Grokking Group Multiplication with Cosets
    by: Stander, Dashiell, et al.
    Published: (2023)
  • Double Visual Defense: Adversarial Pre-training and Instruction Tuning for Improving Vision-Language Model Robustness
    by: Wang, Zeyu, et al.
    Published: (2025)
  • Adversarial Robustness Limits via Scaling-Law and Human-Alignment Studies
    by: Bartoldson, Brian R., et al.
    Published: (2024)
  • Scaling Laws and Compute-Optimal Training Beyond Fixed Training Durations
    by: Hägele, Alexander, et al.
    Published: (2024)
  • Position: The Most Expensive Part of an LLM should be its Training Data
    by: Kandpal, Nikhil, et al.
    Published: (2025)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs