activity
20212026
most citedEfficient Methods for Natural Language Processing: A Survey

11 citations · 26 across the 16 of their papers we have counts for

collaborators

17 papers

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.CL2026

Post-training is (Massive) Supervised Learning

Michael Hassid, Yossi Adi, Roy Schwartz

The prevailing paradigm for training LLMs has evolved to rely on a massive post-training phase consisting of SFT and RL. In this position paper, we argue that this methodology effe…

cs.CL2026

Self-Execution Simulation Improves Coding Models

Gallil Maimon, Ori Yoran, Felix Kreuk +4

A promising research direction in enabling LLMs to generate consistently correct code involves addressing their inability to properly estimate program execution, particularly for c…

cs.CL2026

Linguistically Informed Evaluation of Multilingual ASR for African Languages

Fei-Yueh Chen, Lateef Adeleke, C. M. Downey

Word Error Rate (WER) mischaracterizes ASR models' performance for African languages by combining phonological, tone, and other linguistic errors into a single lexical error. By co…

cs.SE2025

CWM: An Open-Weights LLM for Research on Code Generation with World Models

FAIR CodeGen team, Jade Copet, Quentin Carbonneaux +48

We release Code World Model (CWM), a 32-billion-parameter open-weights LLM, to advance research on code generation with world models. To improve code understanding beyond what can…

cs.CL2025

Don't Overthink it. Preferring Shorter Thinking Chains for Improved LLM Reasoning

Michael Hassid, Gabriel Synnaeve, Yossi Adi +1

Reasoning large language models (LLMs) heavily rely on scaling test-time compute to perform complex reasoning tasks by generating extensive "thinking" chains. While demonstrating i…

cs.CL2025

Scaling Analysis of Interleaved Speech-Text Language Models

Gallil Maimon, Michael Hassid, Amit Roth +1

Existing Speech Language Model (SLM) scaling analysis paints a bleak picture. It predicts that SLMs require much more compute and data compared to text, leading some to question th…

cs.CL2025

More Documents, Same Length: Isolating the Challenge of Multiple Documents in RAG

Shahar Levy, Nir Mazor, Lihi Shalmon +2

Retrieval-Augmented Generation (RAG) enhances the accuracy of Large Language Model (LLM) responses by leveraging relevant external documents during generation. Although previous st…

cs.CL2025

On Pruning State-Space LLMs

Tamer Ghattas, Michael Hassid, Roy Schwartz

Recent work proposed state-space models (SSMs) as an efficient alternative to transformer-based LLMs. Can these models be pruned to further reduce their computation costs? We adapt…

cs.SE2024★ 5 cited

The Larger the Better? Improved LLM Code-Generation via Budget Reallocation

Michael Hassid, Tal Remez, Jonas Gehring +2

It is a common belief that large language models (LLMs) are better than smaller-sized ones. However, larger models also require significantly more time and compute during inference…

cs.CL2024★ 1 cited

Transformers are Multi-State RNNs

Matanel Oren, Michael Hassid, Nir Yarden +2

Transformers are considered conceptually different from the previous generation of state-of-the-art NLP models - recurrent neural networks (RNNs). In this work, we demonstrate that…

cs.CL2023

EXPRESSO: A Benchmark and Analysis of Discrete Expressive Speech Resynthesis

Tu Anh Nguyen, Wei-Ning Hsu, Antony D'Avirro +10

Recent work has shown that it is possible to resynthesize high-quality speech based, not on text, but on low bitrate discrete units that have been learned in a self-supervised fash…

cs.CL2023

Finding the SWEET Spot: Analysis and Improvement of Adaptive Inference in Low Resource Settings

Daniel Rotem, Michael Hassid, Jonathan Mamou +1

Adaptive inference is a simple method for reducing inference costs. The method works by maintaining multiple classifiers of different capacities, and allocating resources to each t…

cs.CL2023★ 7 cited

Textually Pretrained Speech Language Models

Michael Hassid, Tal Remez, Tu Anh Nguyen +9

Speech language models (SpeechLMs) process and generate acoustic data only, without textual supervision. In this work, we propose TWIST, a method for training SpeechLMs using a war…

cs.CL2022★ 2 cited

How Much Does Attention Actually Attend? Questioning the Importance of Attention in Pretrained Transformers

Michael Hassid, Hao Peng, Daniel Rotem +4

The attention mechanism is considered the backbone of the widely-used Transformer architecture. It contextualizes the input by computing input-specific attention matrices. We find…

cs.CL2022★ 11 cited

Efficient Methods for Natural Language Processing: A Survey

Marcos Treviso, Ji-Ung Lee, Tianchu Ji +19

Recent work in natural language processing (NLP) has yielded appealing results from scaling model parameters and training data; however, using only scale to improve performance mea…

cs.CV2021

More than Words: In-the-Wild Visually-Driven Prosody for Text-to-Speech

Michael Hassid, Michelle Tadmor Ramanovich, Brendan Shillingford +3

In this paper we present VDTTS, a Visually-Driven Text-to-Speech model. Motivated by dubbing, VDTTS takes advantage of video frames as an additional input alongside text, and gener…