6 citations · 8 across the 4 of their papers we have counts for
4 papers
Divide-and-Denoise: A Game-Theoretic Method for Fairly Composing Diffusion Models
Abhi Gupta, Polina Barabanshchikova, Vikas Garg +2
The abundance of pre-trained diffusion models provides an opportunity for composition. Combining several models, however, runs the risk of one model dominating or models disagreein…
Tight colorful no-dimensional Tverberg theorem
Polina Barabanshchikova, Grigory Ivanov, Alexander Polyanskii
We study colorful no-dimensional Tverberg-type problems and obtain several optimal results. A colorful no-dimensional Tverberg-type theorem provides a bound on a radius such th…
Intersecting diametral balls induced by a geometric graph II
Polina Barabanshchikova, Alexandr Polyanskii
For a graph whose vertices are points in , consider the closed balls with diameters induced by its edges. The graph is called a Tverberg graph if these closed balls in…
Intersecting ellipses induced by a max-sum matching
Polina Barabanshchikova, Alexandr Polyanskii
For an even set of points in the plane, choose a max-sum matching, that is, a perfect matching maximizing the sum of Euclidean distances of its edges. For each edge of the max-sum…