42 karma · joined March 24, 2019
For example, there are results for other binary problems that show a relationship between fixed points of message passing and optimal dual points to the relaxed linear programming problem (see below for an example with maximum weighted independent sets).
Back in the day I spent a long time trying to directly relate the affinity propagation messages to a coordinate-descent type of algorithm on the dual for k-medoids but despite the similarity in structure I could never make it work.
I'm curious if you're familiar with this class of algorithms and how they compare (both practically and theoretically) to the work you've presented here? Thanks for sharing!
References: - https://www.science.org/doi/10.1126/science.1136800 - https://arxiv.org/abs/0807.5091
I'm Chris from the Prefect team. We're hiring senior software engineers on the open source and platform teams, as well as solutions engineers on our go to market team and would love for you to join us!
Ideal candidates will be familiar with the data ecosystem, and more specifically with Python, Kubernetes, and working with large open source communities.
We have an engaging remote-first culture and a variety of excellent benefits including competitive salary, free lunch every day, $300 per month in remote work expenses, $1k in education expenses per year, 401(k), health insurance, and much more.