23 citations · 39 across the 15 of their papers we have counts for
6 papers · 1 filter
Sampling Multiple Nodes in Large Networks: Beyond Random Walks
Omri Ben-Eliezer, Talya Eden, Joel Oren +1
Sampling random nodes is a fundamental algorithmic primitive in the analysis of massive networks, with many modern graph mining algorithms critically relying on it. We consider the…
What is Learned in Knowledge Graph Embeddings?
Michael R. Douglas, Michael Simkin, Omri Ben-Eliezer +4
A knowledge graph (KG) is a data structure which represents entities and relations as the vertices and edges of a directed graph with edge types. KGs are an important primitive in…
Adversarially Robust Streaming via Dense--Sparse Trade-offs
Omri Ben-Eliezer, Talya Eden, Krzysztof Onak
A streaming algorithm is adversarially robust if it is guaranteed to perform correctly even in the presence of an adaptive adversary. Recently, several sophisticated frameworks for…
Information Spread with Error Correction
Omri Ben-Eliezer, Elchanan Mossel, Madhu Sudan
We study the process of information dispersal in a network with communication errors and local error-correction. Specifically we consider a simple model where a single bit of infor…
Learning Multimodal Affinities for Textual Editing in Images
Or Perel, Oron Anschel, Omri Ben-Eliezer +2
Nowadays, as cameras are rapidly adopted in our daily routine, images of documents are becoming both abundant and prevalent. Unlike natural images that capture physical objects, do…
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification
Noga Alon, Omri Ben-Eliezer, Yuval Dagan +3
Laws of large numbers guarantee that given a large enough sample from some population, the measure of any fixed sub-population is well-estimated by its frequency in the sample. We…