LSP : Acceleration and Regularization of Graph Neural Networks via Locality Sensitive Pruning of Graphs

no code implementations • 10 Nov 2021 • Eitan Kosman, Joel Oren, Dotan Di Castro

In this paper, we take a further step towards demystifying this phenomenon and propose a systematic method called Locality-Sensitive Pruning (LSP) for graph pruning based on Locality-Sensitive Hashing.

SOLO: Search Online, Learn Offline for Combinatorial Optimization Problems

no code implementations • 4 Apr 2021 • Joel Oren, Chana Ross, Maksym Lefarov, Felix Richter, Ayal Taitler, Zohar Feldman, Christian Daniel, Dotan Di Castro

This method can equally be applied to both the offline, as well as online, variants of the combinatorial problem, in which the problem components (e. g., jobs in scheduling problems) are not known in advance, but rather arrive during the decision-making process.

Combinatorial Optimization Decision Making +3

Practical Risk Measures in Reinforcement Learning

no code implementations • 22 Aug 2019 • Dotan Di Castro, Joel Oren, Shie Mannor

Practical application of Reinforcement Learning (RL) often involves risk considerations.

reinforcement-learning Reinforcement Learning (RL)