@inproceedings{WaeldchenSharmaZimmeretal., author = {W{\"a}ldchen, Stephan and Sharma, Kartikey and Zimmer, Max and Turan, Berkant and Pokutta, Sebastian}, title = {Merlin-Arthur classifiers}, series = {Proceedings of International Conference on Artificial Intelligence and Statistics}, booktitle = {Proceedings of International Conference on Artificial Intelligence and Statistics}, language = {en} } @inproceedings{ZimmerSpiegelPokutta, author = {Zimmer, Max and Spiegel, Christoph and Pokutta, Sebastian}, title = {Sparse Model Soups}, series = {Proceedings of International Conference on Learning Representations}, booktitle = {Proceedings of International Conference on Learning Representations}, language = {en} } @inproceedings{SharmaHendrychBesanconetal., author = {Sharma, Kartikey and Hendrych, Deborah and Besan{\c{c}}on, Mathieu and Pokutta, Sebastian}, title = {Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe}, series = {Proceedings of INFORMS Optimization Society Conference}, booktitle = {Proceedings of INFORMS Optimization Society Conference}, language = {en} } @article{DesignolleVertesiPokutta, author = {Designolle, S{\´e}bastien and V{\´e}rtesi, Tam{\´a}s and Pokutta, Sebastian}, title = {Symmetric multipartite Bell inequalities via Frank-Wolfe algorithms}, series = {Physics Review A}, volume = {109}, journal = {Physics Review A}, number = {2}, doi = {10.1103/PhysRevA.109.022205}, abstract = {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.}, language = {en} } @article{DezaPokuttaPournin, author = {Deza, Antoine and Pokutta, Sebastian and Pournin, Lionel}, title = {The complexity of geometric scaling}, series = {Operations Research Letters}, volume = {52}, journal = {Operations Research Letters}, doi = {10.1016/j.orl.2023.11.010}, pages = {107057}, language = {en} } @article{BraunGuzmanPokutta, author = {Braun, G{\´a}bor and Guzm{\´a}n, Crist{\´o}bal and Pokutta, Sebastian}, title = {Corrigendum in "Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory"}, series = {IEEE Transactions on Information Theory}, journal = {IEEE Transactions on Information Theory}, doi = {10.1109/TIT.2024.3357200}, language = {en} }