Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices
By F. Dufossé, Bora Uçar. 2016
82 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Electrical and Electronic Engineering
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Peilin Zhao
- Thorsten Joachims
- Kunlun He
- Chenkai Yu
- Zongren Li
- Geoffrey J. Gordon
- Wendi Wu
- Yawei Zhao
In Computer Networks and Communications
- Peilin Zhao
- Thorsten Joachims
- Kunlun He
- Chenkai Yu
- Zongren Li
- Geoffrey J. Gordon
- Wendi Wu
- Yawei Zhao
In Electrical and Electronic Engineering
Citations in the corpus
- Decentralized Online Learning: Take Benefits from Others’ Data without Sharing Your Own to Track Global Trend (2019, methodology): “According to Birkhoff-von Neumann theorem [Dufossé and Uccar, 2016], W is a convex combination of some, e.”
- Efficient Multitask Feature and Relationship Learning (2017, methodology): “However, as we will show shortly, we can find a closed form optimal solution to this problem, using tools from the theory of doubly stochastic matrices [Dufossé and Uçar, 2016] and perfect bipartite graph matching.”
- Fairness of Exposure in Rankings (2018, methodology): “Such a decomposition can be computed efficiently in polynomial time using several algorithms [8, 9].”