Query-decision Regression between Shortest Path and Minimum Steiner Tree

TL;DR

This paper studies a prototype problem called query-decision regression with task shifts, focusing on the shortest path problem and the minimum Steiner tree problem, and provides theoretical insights regarding the design of realizable hypothesis spaces for building scoring models and presents two principled learning frameworks.

Abstract

Considering a graph with unknown weights, can we find the shortest path for a pair of nodes if we know the minimal Steiner trees associated with some subset of nodes? That is, with respect to a fixed latent decision-making system (e.g., a weighted graph), we seek to solve one optimization problem (e.g., the shortest path problem) by leveraging information associated with another optimization problem (e.g., the minimal Steiner tree problem). In this paper, we study such a prototype problem called \textit{query-decision regression with task shifts}, focusing on the shortest path problem and the minimum Steiner tree problem. We provide theoretical insights regarding the design of realizable hypothesis spaces for building scoring models, and present two principled learning frameworks. Our experimental studies show that such problems can be solved to a decent extent with statistical significance.