activity
20162026
most citedReevaluating Adversarial Examples in Natural Language

96 citations · 351 across the 28 of their papers we have counts for

collaborators
Showing cs.CLShow all

12 papers · 1 filter

cs.CL2026

Muse Glimmer 30B: An On-Device Agentic Model

Arash Ebrahim Abtahizadeh, Muna Aghamelu, Adil Ahmed +327

We introduce Muse Glimmer, an open-source 30B parameter causal language model with perception encoder, purpose-built for autonomous agentic tasks on consumer hardware. Muse Glimmer…

cs.CL2025

SPICE: Self-Play In Corpus Environments Improves Reasoning

Bo Liu, Chuanyang Jin, Seungone Kim +7

Self-improving systems require environmental interaction for continuous adaptation. We introduce SPICE (Self-Play In Corpus Environments), a reinforcement learning framework where…

cs.CL2025★ 1 cited

Jointly Reinforcing Diversity and Quality in Language Model Generations

Tianjian Li, Yiming Zhang, Ping Yu +5

Post-training of Large Language Models (LMs) often prioritizes accuracy and helpfulness at the expense of diversity. This creates a tension: while post-training improves response q…

cs.CL2025

Task-Dependent Evaluation of LLM Output Homogenization: A Taxonomy-Guided Framework

Shomik Jain, Jack Lanchantin, Maximilian Nickel +4

Large language models often generate homogeneous outputs, but whether this is problematic depends on the specific task. For objective math tasks, responses may vary in terms of pro…

cs.CL2025★ 1 cited

OptimalThinkingBench: Evaluating Over and Underthinking in LLMs

Pranjal Aggarwal, Seungone Kim, Jack Lanchantin +4

Thinking LLMs solve complex tasks at the expense of increased compute and overthinking on simpler problems, while non-thinking LLMs are faster and cheaper but underthink on harder…

cs.CL2025

NaturalThoughts: Selecting and Distilling Reasoning Traces for General Reasoning Tasks

Yang Li, Youssef Emad, Karthik Padthe +8

Recent work has shown that distilling reasoning traces from a larger teacher model via supervised finetuning outperforms reinforcement learning with the smaller student model alone…

cs.CL2025

Bridging Offline and Online Reinforcement Learning for LLMs

Jack Lanchantin, Angelica Chen, Janice Lan +9

We investigate the effectiveness of reinforcement learning methods for finetuning large language models when transitioning from offline to semi-online to fully online regimes for b…

cs.CL2025★ 1 cited

Diverse Preference Optimization

Jack Lanchantin, Angelica Chen, Shehzaad Dhuliawala +4

Post-training of language models, either through reinforcement learning, preference optimization or supervised finetuning, tends to sharpen the output probability distribution and…

cs.CL2024★ 1 cited

Adaptive Decoding via Latent Preference Optimization

Shehzaad Dhuliawala, Ilia Kulikov, Ping Yu +4

During language model decoding, it is known that using higher temperature sampling gives more creative responses, while lower temperatures are more factually accurate. However, suc…

cs.CL2024

TOOLVERIFIER: Generalization to New Tools via Self-Verification

Dheeraj Mekala, Jason Weston, Jack Lanchantin +4

Teaching language models to use tools is an important milestone towards building general assistants, but remains an open problem. While there has been significant progress on learn…

cs.CL2020★ 96 cited

Reevaluating Adversarial Examples in Natural Language

John X. Morris, Eli Lifland, Jack Lanchantin +2

State-of-the-art attacks on NLP models lack a shared definition of a what constitutes a successful attack. We distill ideas from past work into a unified framework: a successful na…

cs.CL2018★ 56 cited

Black-box Generation of Adversarial Text Sequences to Evade Deep Learning Classifiers

Ji Gao, Jack Lanchantin, Mary Lou Soffa +1

Although various techniques have been proposed to generate adversarial samples for white-box attacks on text, little attention has been paid to black-box attacks, which are more re…