◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Roy Schwartz

4 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author2
  • last author1

Across the 3 of 4 papers where every author was matched, so the position is known.

fields
  • cs.CL3
  • cs.DS1
same name
  • Roy Schwartz — 20 papers
  • Roy Schwartz — 9 papers, h 18
  • Roy Schwartz — 9 papers, h 12
  • Roy Schwartz — 5 papers
  • Roy Schwartz — 1 paper
  • Roy Schwartz — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

most citedContext Length Alone Hurts LLM Performance Despite Perfect Retrieval

3 citations · 3 across the 1 of their papers we have counts for

collaborators

4 papers

cs.CL2025★ 3 cited

Context Length Alone Hurts LLM Performance Despite Perfect Retrieval

Yufeng Du, Minyang Tian, Srikanth Ronanki +7

Large language models (LLMs) often fail to scale their performance on long-context tasks performance in line with the context lengths they support. This gap is commonly attributed…

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

Accelerating LLM Inference with Lossless Speculative Decoding Algorithms for Heterogeneous Vocabularies

Nadav Timor, Jonathan Mamou, Daniel Korat +5

Accelerating the inference of large language models (LLMs) is a critical challenge in generative AI. Speculative decoding (SD) methods offer substantial efficiency gains by generat…

cs.DS2024

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint

Yuval Filmus, Roy Schwartz, Alexander V. Smal

We consider two classic problems: maximum coverage and monotone submodular maximization subject to a cardinality constraint. [Nemhauser--Wolsey--Fisher '78] proved that the greedy…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.