Skip to main content

Query-Decision Regression Between Shortest Path and Minimum Steiner Tree

  • Conference paper
  • First Online:
Advances in Knowledge Discovery and Data Mining (PAKDD 2024)

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 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://github.com/cdslabamotong/QRTS.

References

  1. BarabĂ¡si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

    Google Scholar 

  2. Bengio, Y.: Using a financial training criterion rather than a prediction criterion. Int. J. Neural Syst. 8(04), 433–443 (1997)

    Article  Google Scholar 

  3. Bertsimas, D., Kallus, N.: From predictive to prescriptive analytics. Manage. Sci. 66(3), 1025–1044 (2020)

    Article  Google Scholar 

  4. Chen, C., Seff, A., Kornhauser, A., Xiao, J.: Deepdriving: learning affordance for direct perception in autonomous driving. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 2722–2730 (2015)

    Google Scholar 

  5. Demetrescu, C., Goldberg, A.V., Johnson, D.S.: Implementation challenge for shortest paths. Encyclopedia Algorithms 15, 54 (2008)

    Google Scholar 

  6. Edwards, W.: The theory of decision making. Psychol. Bull. 51(4), 380 (1954)

    Article  Google Scholar 

  7. Ford, B., Nguyen, T., Tambe, M., Sintov, N., Fave, F.D.: Beware the soothsayer: from attack prediction accuracy to predictive reliability in security games. In: Khouzani, M.H.R., Panaousis, E., Theodorakopoulos, G. (eds.) GameSec 2015. LNCS, vol. 9406, pp. 35–56. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25594-1_3

    Chapter  Google Scholar 

  8. Hofmann, T., Schölkopf, B., Smola, A.J.: Kernel methods in machine learning (2008)

    Google Scholar 

  9. Hwang, F.K., Richards, D.S.: Steiner tree problems. Networks 22(1), 55–89 (1992)

    Article  MathSciNet  Google Scholar 

  10. Joachims, T., Finley, T., Yu, C.N.J.: Cutting-plane training of structural svms. Mach. Learn. 77(1), 27–59 (2009)

    Article  Google Scholar 

  11. Kochenderfer, M.J.: Decision making under uncertainty: theory and application. MIT press (2015)

    Google Scholar 

  12. Lai, C., Murthy, D., Xie, M.: Weibull distributions. Wiley Interdisciplinary Reviews: Computational Statistics 3(3), 282–287 (2011)

    Article  Google Scholar 

  13. Lehmann, E.L., Casella, G.: Theory of point estimation. Springer Science & Business Media (2006)

    Google Scholar 

  14. Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., Ghahramani, Z.: Kronecker graphs: an approach to modeling networks. J. Mach. Learn. Res. 11(2) (2010)

    Google Scholar 

  15. Lucchi, A., Li, Y., Fua, P.: Learning for structured prediction using approximate subgradient descent with working sets. In: Proceedings of the CVPR (2013)

    Google Scholar 

  16. Murphy, K.P.: Machine learning: a probabilistic perspective. MIT press (2012)

    Google Scholar 

  17. Provost, F., Fawcett, T.: Data science and its relationship to big data and data-driven decision making. Big Data 1(1), 51–59 (2013)

    Article  Google Scholar 

  18. Rajkumar, A., Agarwal, S.: Online decision-making in general combinatorial spaces. Advances in Neural Information Processing Systems 27 (2014)

    Google Scholar 

  19. Suthaharan, S., Suthaharan, S.: Support vector machine. Machine learning models and algorithms for big data classification: thinking with examples for effective learning, pp. 207–235 (2016)

    Google Scholar 

  20. Tokdar, S.T., Kass, R.E.: Importance sampling: a review. Wiley Interdisciplinary Reviews: Computational Statistics 2(1), 54–60 (2010)

    Article  Google Scholar 

  21. Tong, G.: Usco-solver: solving undetermined stochastic combinatorial optimization problems. NeurIPS 34, 1646–1659 (2021)

    Google Scholar 

  22. Vazirani, V.V.: Approximation algorithms, vol. 1. Springer (2001)

    Google Scholar 

  23. Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440–442 (1998)

    Google Scholar 

Download references

Acknowledgement

This project is supported in part by National Science Foundation under Award Career IIS-2144285.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Guangmo Tong .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tong, G., Zhao, P., Samizadeh, M. (2024). Query-Decision Regression Between Shortest Path and Minimum Steiner Tree. In: Yang, DN., Xie, X., Tseng, V.S., Pei, J., Huang, JW., Lin, J.CW. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2024. Lecture Notes in Computer Science(), vol 14646. Springer, Singapore. https://doi.org/10.1007/978-981-97-2253-2_25

Download citation

  • DOI: https://doi.org/10.1007/978-981-97-2253-2_25

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-97-2252-5

  • Online ISBN: 978-981-97-2253-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics