Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Enric Boix-Adserà"'
Autor:
Jason M. Altschuler, Enric Boix-Adserà
Publikováno v:
SIAM Journal on Mathematics of Data Science. 4:179-203
Computing Wasserstein barycenters (a.k.a. Optimal Transport barycenters) is a fundamental problem in geometry which has recently attracted considerable attention due to many applications in data science. While there exist polynomial-time algorithms i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f63ef149e665bb752e0fa0f800fe5eb1
https://doi.org/10.1137/21m1390062
https://doi.org/10.1137/21m1390062
Autor:
Jason M. Altschuler, Enric Boix-Adserà
Multimarginal Optimal Transport (MOT) has attracted significant interest due to applications in machine learning, statistics, and the sciences. However, in most applications, the success of MOT is severely limited by a lack of efficient algorithms. I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ae22f02f2e0f77d3e1b2abe6425afbb
http://arxiv.org/abs/2008.03006
http://arxiv.org/abs/2008.03006
Publikováno v:
EC
We initiate the study of the natural multiplayer generalization of the classic continuous Colonel Blotto game. The two-player Blotto game, introduced by Borel as a model of resource competition across $n$ simultaneous fronts, has been studied extensi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc5a2f74c2ce30ddc398f1f6a9d38fd7
https://doi.org/10.1145/3391403.3399555
https://doi.org/10.1145/3391403.3399555
Autor:
Enric Boix-Adserà, Jason M. Altschuler
Publikováno v:
Discrete Optimization. 42:100669
Multimarginal Optimal Transport (MOT) is the problem of linear programming over joint probability distributions with fixed marginals. A key issue in many applications is the complexity of solving MOT: the linear program has exponential size in the nu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f27dfbbaa8a8405c20306a9ebc1a043
https://doi.org/10.1016/j.disopt.2021.100669
https://doi.org/10.1016/j.disopt.2021.100669
Publikováno v:
PODC
We consider the disjoint set union problem in the asynchronous shared memory multiprocessor computation model. We design a randomized algorithm that performs at most O(log n) work per operation (with high probability), and performs at most O(m #8226;
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d5ae7299fc98ceb1f523b817695e237
https://doi.org/10.1145/3293611.3331593
https://doi.org/10.1145/3293611.3331593
Publikováno v:
FOCS
arXiv
arXiv
We consider the problem of counting $k$-cliques in $s$-uniform Erdos-Renyi hypergraphs $G(n,c,s)$ with edge density $c$, and show that its fine-grained average-case complexity can be based on its worst-case complexity. We prove the following: 1. Dens
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae1ed4e32fb06b1e27af995056353f4e
http://arxiv.org/abs/1903.08247
http://arxiv.org/abs/1903.08247
Autor:
Enric Boix-Adserà, Emmanuel Abbe
Publikováno v:
Ann. Appl. Probab. 30, no. 3 (2020), 1066-1090
This paper considers the problem of reconstructing $n$ independent uniform spins $X_1,\dots,X_n$ living on the vertices of an $n$-vertex graph $G$, by observing their interactions on the edges of the graph. This captures instances of models such as (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8dfc3e6138a4878465a5f86eced5ef9
Autor:
Altschuler, Jason M.1 (AUTHOR) jasonalt@mit.edu, Parrilo, Pablo A.1 (AUTHOR)
Publikováno v:
Mathematical Programming. Mar2023, Vol. 198 Issue 1, p363-397. 35p.
Spectral algorithms, such as principal component analysis and spectral clustering, typically require careful data transformations to be effective: upon observing a matrix $A$, one may look at the spectrum of $\psi(A)$ for a properly chosen $\psi$. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::430f4f3269f5e2cbe6478387fb27752d
https://infoscience.epfl.ch/record/286077
https://infoscience.epfl.ch/record/286077
Publikováno v:
EC: Economics & Computation; 2020, p47-48, 2p