4 citations · 14 across the 8 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.LG2021
LSP : Acceleration and Regularization of Graph Neural Networks via Locality Sensitive Pruning of Graphs
Eitan Kosman, Joel Oren, Dotan Di Castro
Graph Neural Networks (GNNs) have emerged as highly successful tools for graph-related tasks. However, real-world problems involve very large graphs, and the compute resources need…
cs.SI2021★ 1 cited
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…
cs.LG2021
SOLO: Search Online, Learn Offline for Combinatorial Optimization Problems
Joel Oren, Chana Ross, Maksym Lefarov +5
We study combinatorial problems with real world applications such as machine scheduling, routing, and assignment. We propose a method that combines Reinforcement Learning (RL) and…