204 citations · 401 across the 28 of their papers we have counts for
28 papers
Optimistic Gradient Learning with Hessian Corrections for High-Dimensional Black-Box Optimization
Yedidya Kfir, Elad Sarafian, Sarit Kraus +1
Black-box algorithms are designed to optimize functions without relying on their underlying analytical structure or gradient information, making them essential when gradients are i…
Data-driven Coreference-based Ontology Building
Shir Ashury-Tahan, Amir David Nissan Cohen, Nadav Cohen +2
While coreference resolution is traditionally used as a component in individual document understanding, in this work we take a more global view and explore what can we learn about…
IRMA: Iterative Repair for graph MAtching
Barak Babayov, Yoram Louzoun
The alignment of two similar graphs from different domains is a well-studied problem. In many practical usages, there is no reliable information or labels over the vertices or edge…
BFS based distributed algorithm for parallel local directed sub-graph enumeration
Itay Levinas, Roy Scherz, Yoram Louzoun
Estimating the frequency of sub-graphs is of importance for many tasks, including sub-graph isomorphism, kernel-based anomaly detection, and network structure analysis. While multi…
Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning
Itay Levinas, Yoram Louzoun
Multiple methods of finding the vertices belonging to a planted dense subgraph in a random dense graph have been proposed, with an emphasis on planted cliques. Such metho…
Exploring individual differences through network topology
Yuval Samoilov-Katz, Yoram Louzoun, Lev Muchnik +1
Social animals, including humans, have a broad range of personality traits, which can be used to predict individual behavioral responses and decisions. Current methods to quantify…