activity
20132023
most citedDynamic Planning in Open-Ended Dialogue using Reinforcement Learning

7 citations · 11 across the 6 of their papers we have counts for

collaborators

6 papers

cs.CL2023★ 4 cited

Factually Consistent Summarization via Reinforcement Learning with Textual Entailment Feedback

Paul Roit, Johan Ferret, Lior Shani +16

Despite the seeming success of contemporary grounded text generation systems, they often tend to generate factually inconsistent text with respect to their input. This phenomenon i…

cs.CL2022★ 7 cited

Dynamic Planning in Open-Ended Dialogue using Reinforcement Learning

Deborah Cohen, Moonkyung Ryu, Yinlam Chow +8

Despite recent advances in natural language understanding and generation, and decades of research on the development of conversational bots, building automated agents that can carr…

cs.CL2022

On the Robustness of Dialogue History Representation in Conversational Question Answering: A Comprehensive Study and a New Prompt-based Method

Zorik Gekhman, Nadav Oved, Orgad Keller +2

Most works on modeling the conversation history in Conversational Question Answering (CQA) report a single main result on a common CQA benchmark. While existing models show impress…

cs.CL2020

Semantically Driven Sentence Fusion: Modeling and Evaluation

Eyal Ben-David, Orgad Keller, Eric Malmi +2

Sentence fusion is the task of joining related sentences into coherent text. Current training and evaluation schemes for this task are based on single reference ground-truths and d…

cs.DS2017

New Approximations for Coalitional Manipulation in General Scoring Rules

Orgad Keller, Avinatan Hassidim, Noam Hazon

We study the problem of coalitional manipulation---where manipulators try to manipulate an election on candidates---under general scoring rules, with a focus on the Borda p…

cs.DS2013

Finding the Minimum-Weight k-Path

Avinatan Hassidim, Orgad Keller, Moshe Lewenstein +1

Given a weighted -vertex graph with integer edge-weights taken from a range , we show that the minimum-weight simple path visiting vertices can be found in time…