English
Related papers

Related papers: Universal Adversarial Suffixes Using Calibrated Gu…

200 papers

Adversarial examples are perturbed inputs designed to fool machine learning models. Adversarial training injects such examples into training data to increase robustness. To scale this technique to large datasets, perturbations are crafted…

Machine Learning · Statistics 2020-04-28 Florian Tramèr , Alexey Kurakin , Nicolas Papernot , Ian Goodfellow , Dan Boneh , Patrick McDaniel

Fine-tuning LLMs for classification typically maps inputs directly to labels. We ask whether attaching brief explanations to each label during fine-tuning yields better models. We evaluate conversational response quality along three axes:…

Machine Learning · Computer Science 2026-03-03 Vivswan Shah , Randy Cogill , Hanwei Yue , Gopinath Chennupati , Rinat Khaziev

Padding tokens are widely used in large language models (LLMs) to equalize sequence lengths during batched inference. While they should be fully masked, implementation errors can cause them to influence computation, and the extent of this…

Computation and Language · Computer Science 2025-10-07 Rom Himelstein , Amit LeVi , Yonatan Belinkov , Avi Mendelson

The usage of machine learning models has grown substantially and is spreading into several application domains. A common need in using machine learning models is collecting the data required to train these models. In some cases, labeling a…

Machine Learning · Computer Science 2019-09-19 Chidubem Arachie , Bert Huang

The Softmax function is used in the final layer of nearly all existing sequence-to-sequence models for language generation. However, it is usually the slowest layer to compute which limits the vocabulary size to a subset of most frequent…

Computation and Language · Computer Science 2019-03-25 Sachin Kumar , Yulia Tsvetkov

We investigate how agents built on pretrained large language models (LLMs) can learn target classification functions from labeled examples without parameter updates. While conventional approaches like fine-tuning are often costly,…

Computation and Language · Computer Science 2026-05-06 Jackson Hassell , Dan Zhang , Hannah Kim , Tom Mitchell , Estevam Hruschka

Generative Adversarial Networks (GAN) have limitations when the goal is to generate sequences of discrete elements. The reason for this is that samples from a distribution on discrete objects such as the multinomial are not differentiable…

Machine Learning · Statistics 2016-11-16 Matt J. Kusner , José Miguel Hernández-Lobato

Discovering the existence of universal adversarial perturbations had large theoretical and practical impacts on the field of adversarial learning. In the text domain, most universal studies focused on adversarial prefixes which are added to…

Machine Learning · Computer Science 2022-06-22 Gallil Maimon , Lior Rokach

Neural networks lack adversarial robustness, i.e., they are vulnerable to adversarial examples that through small perturbations to inputs cause incorrect predictions. Further, trust is undermined when models give miscalibrated predictions,…

Machine Learning · Computer Science 2021-12-15 Yao Qin , Xuezhi Wang , Alex Beutel , Ed H. Chi

Structured latent variables allow incorporating meaningful prior knowledge into deep learning models. However, learning with such variables remains challenging because of their discrete nature. Nowadays, the standard learning approach is to…

Machine Learning · Computer Science 2021-10-29 Kirill Struminsky , Artyom Gadetsky , Denis Rakitin , Danil Karpushkin , Dmitry Vetrov

Large Language Models (LLMs) are increasingly embedded in autonomous systems and public-facing environments, yet they remain susceptible to jailbreak vulnerabilities that may undermine their security and trustworthiness. Adversarial…

Machine Learning · Computer Science 2025-05-15 David Khachaturov , Robert Mullins

Recent studies have revealed the vulnerability of large language models to adversarial attacks, where adversaries craft specific input sequences to induce harmful, violent, private, or incorrect outputs. In this work, we study their…

Machine Learning · Computer Science 2025-10-09 Huanran Chen , Yinpeng Dong , Zeming Wei , Hang Su , Jun Zhu

The Softmax loss is one of the most widely employed surrogate objectives for classification and ranking tasks. To elucidate its theoretical properties, the Fenchel-Young framework situates it as a canonical instance within a broad family of…

Machine Learning · Computer Science 2026-02-02 Yuanhao Pu , Defu Lian , Enhong Chen

Learning to construct text representations in end-to-end systems can be difficult, as natural languages are highly compositional and task-specific annotated datasets are often limited in size. Methods for directly supervising language…

Computation and Language · Computer Science 2018-11-15 Marek Rei , Anders Søgaard

We propose a new strategy for applying large pre-trained language models to novel tasks when labeled training data is limited. Rather than apply the model in a typical zero-shot or few-shot fashion, we treat the model as the basis for…

Machine Learning · Computer Science 2022-05-06 Ryan Smith , Jason A. Fries , Braden Hancock , Stephen H. Bach

In this work, we explore "prompt tuning", a simple yet effective mechanism for learning "soft prompts" to condition frozen language models to perform specific downstream tasks. Unlike the discrete text prompts used by GPT-3, soft prompts…

Computation and Language · Computer Science 2021-09-03 Brian Lester , Rami Al-Rfou , Noah Constant

In Federated Learning, a global model is learned by aggregating model updates computed at a set of independent client nodes, to reduce communication costs multiple gradient steps are performed at each node prior to aggregation. A key…

Machine Learning · Computer Science 2023-04-12 Gwen Legate , Lucas Caccia , Eugene Belilovsky

Generative models are increasingly used in recommender systems, both for modeling user behavior as event sequences and for integrating large language models into recommendation pipelines. A key challenge in this setting is the extremely…

Information Retrieval · Computer Science 2026-02-19 Kirill Khrylchenko

We are concerned with learning models that generalize well to different \emph{unseen} domains. We consider a worst-case formulation over data distributions that are near the source domain in the feature space. Only using training data from…

Computer Vision and Pattern Recognition · Computer Science 2018-11-07 Riccardo Volpi , Hongseok Namkoong , Ozan Sener , John Duchi , Vittorio Murino , Silvio Savarese

We introduce a typology-aware diagnostic for multilingual masked language models that tests reliance on word order versus inflectional form. Using Universal Dependencies, we apply inference-time perturbations: full token scrambling,…

Computation and Language · Computer Science 2026-03-03 Anna Feldman , Libby Barak , Jing Peng
‹ Prev 1 4 5 6 7 8 10 Next ›