activity
20142025
most citedGemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities

49 citations · 67 across the 12 of their papers we have counts for

collaborators

13 papers

cs.CL2025★ 49 cited

Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities

Gheorghe Comanici, Eric Bieber, Mike Schaekermann +3431

In this report, we introduce the Gemini 2.X model family: Gemini 2.5 Pro and Gemini 2.5 Flash, as well as our earlier Gemini 2.0 Flash and Flash-Lite models. Gemini 2.5 Pro is our…

cs.CL2023

SEMQA: Semi-Extractive Multi-Source Question Answering

Tal Schuster, Adam D. Lelkes, Haitian Sun +4

Recently proposed long-form question answering (QA) systems, supported by large language models (LLMs), have shown promising capabilities. Yet, attributing and verifying their gene…

cs.CL2023

SDOH-NLI: a Dataset for Inferring Social Determinants of Health from Clinical Notes

Adam D. Lelkes, Eric Loreaux, Tal Schuster +2

Social and behavioral determinants of health (SDOH) play a significant role in shaping health outcomes, and extracting these determinants from clinical notes is a first step to hel…

cs.IR2023★ 3 cited

How Does Generative Retrieval Scale to Millions of Passages?

Ronak Pradeep, Kai Hui, Jai Gupta +5

Popularized by the Differentiable Search Index, the emerging paradigm of generative retrieval re-frames the classic information retrieval problem into a sequence-to-sequence modeli…

cs.LG2022★ 1 cited

Instability in clinical risk stratification models using deep learning

Daniel Lopez-Martinez, Alex Yakubovich, Martin Seneviratne +9

While it has been well known in the ML community that deep learning models suffer from instability, the consequences for healthcare deployments are under characterised. We study th…

cs.CL2022

All Birds with One Stone: Multi-task Text Classification for Efficient Inference with One Forward Pass

Jiaxin Huang, Tianqi Liu, Jialu Liu +3

Multi-Task Learning (MTL) models have shown their robustness, effectiveness, and efficiency for transferring learned knowledge across tasks. In real industrial applications such as…

cs.CL2021★ 1 cited

AgreeSum: Agreement-Oriented Multi-Document Summarization

Richard Yuanzhe Pang, Adam D. Lelkes, Vinh Q. Tran +1

We aim to renew interest in a particular multi-document summarization (MDS) task which we call AgreeSum: agreement-oriented multi-document summarization. Given a cluster of article…

cs.CL2021

Quiz-Style Question Generation for News Stories

Adam D. Lelkes, Vinh Q. Tran, Cong Yu

A large majority of American adults get at least some of their news from the Internet. Even though many online news products have the goal of informing their users about the news,…

cs.IR2018★ 11 cited

Investigating Rumor News Using Agreement-Aware Search

Jingbo Shang, Tianhang Sun, Jiaming Shen +6

Recent years have witnessed a widespread increase of rumor news generated by humans and machines. Therefore, tools for investigating rumor news have become an urgent necessity. One…

cs.LG2016

A Confidence-Based Approach for Balancing Fairness and Accuracy

Benjamin Fish, Jeremy Kun, Ádám D. Lelkes

We study three classical machine learning algorithms in the context of algorithmic fairness: adaptive boosting, support vector machines, and logistic regression. Our goal is to mai…

cs.DM2014★ 1 cited

Network installation and recovery: approximation lower bounds and faster exact formulations

Alexander Gutfraind, Jeremy Kun, Ádám D. Lelkes +1

We study the Neighbor Aided Network Installation Problem (NANIP) introduced previously which asks for a minimal cost ordering of the vertices of a graph, where the cost of visiting…

cs.CC2014★ 1 cited

On the Computational Complexity of MapReduce

Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes +2

In this paper we study MapReduce computations from a complexity-theoretic perspective. First, we formulate a uniform version of the MRC model of Karloff et al. (2010). We then show…

cs.FL2014

Biclique coverings, rectifier networks and the cost of -removal

Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György +2

We relate two complexity notions of bipartite graphs: the minimal weight biclique covering number and the minimal rectifier network size of a b…