PHEW: Paths with higher edge-weights give "winning tickets" without training data.

Shreyas Malakarjun Patil Constantine Dovrolis

Published in: CoRR (2020)

Keyphrases

edge weights
training data
shortest path
weighted graph
directed graph
bipartite graph
learning algorithm
training set
decision trees
spanning tree
satisfy the triangle inequality
supervised learning
data sets
higher order
random walk
denoising
training examples
undirected graph