TY - CHAP A1 - Wäldchen, Stephan A1 - Sharma, Kartikey A1 - Zimmer, Max A1 - Turan, Berkant A1 - Pokutta, Sebastian T1 - Merlin-Arthur classifiers T2 - Proceedings of International Conference on Artificial Intelligence and Statistics Y1 - 2024 ER - TY - CHAP A1 - Zimmer, Max A1 - Spiegel, Christoph A1 - Pokutta, Sebastian T1 - Sparse Model Soups T2 - Proceedings of International Conference on Learning Representations Y1 - 2024 ER - TY - CHAP A1 - Sharma, Kartikey A1 - Hendrych, Deborah A1 - Besançon, Mathieu A1 - Pokutta, Sebastian T1 - Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe T2 - Proceedings of INFORMS Optimization Society Conference Y1 - 2024 ER - TY - JOUR A1 - Designolle, Sébastien A1 - Vértesi, Tamás A1 - Pokutta, Sebastian T1 - Symmetric multipartite Bell inequalities via Frank-Wolfe algorithms JF - Physics Review A N2 - In multipartite Bell scenarios, we study the nonlocality robustness of the Greenberger-Horne-Zeilinger (GHZ) state. When each party performs planar measurements forming a regular polygon, we exploit the symmetry of the resulting correlation tensor to drastically accelerate the computation of (i) a Bell inequality via Frank-Wolfe algorithms and (ii) the corresponding local bound. The Bell inequalities obtained are facets of the symmetrized local polytope and they give the best-known upper bounds on the nonlocality robustness of the GHZ state for three to ten parties. Moreover, for four measurements per party, we generalize our facets and hence show, for any number of parties, an improvement on Mermin's inequality in terms of noise robustness. We also compute the detection efficiency of our inequalities and show that some give rise to the activation of nonlocality in star networks, a property that was only shown with an infinite number of measurements. Y1 - 2024 U6 - https://doi.org/10.1103/PhysRevA.109.022205 VL - 109 IS - 2 ER - TY - JOUR A1 - Deza, Antoine A1 - Pokutta, Sebastian A1 - Pournin, Lionel T1 - The complexity of geometric scaling JF - Operations Research Letters Y1 - 2024 U6 - https://doi.org/10.1016/j.orl.2023.11.010 VL - 52 SP - 107057 ER - TY - JOUR A1 - Braun, Gábor A1 - Guzmán, Cristóbal A1 - Pokutta, Sebastian T1 - Corrigendum in “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory” JF - IEEE Transactions on Information Theory Y1 - 2024 U6 - https://doi.org/10.1109/TIT.2024.3357200 ER -