Sebastian Pokutta

Preprints and reports

1. Sharma, U., Goel, K., Dua, A., Pokutta, S., and Woodstock, Z. (2025). A note on asynchronous projective splitting in Julia. [URL]
   [BibTeX]

   @misc{2025_SharmaGoelDuaPokuttaWoodstock_AsyncProx,
     year = {2025},
     month = apr,
     url = {https://zevwoodstock.github.io/media/publications/asyncprox.pdf},
     author = {Sharma, Utkarsh and Goel, Kashish and Dua, Aryan and Pokutta, Sebastian and Woodstock, Zev},
     title = {A note on asynchronous projective splitting in Julia}
   }

2. Lee, D., and Pokutta, S. (2015). Toward a Science of Autonomy for Physical Systems: Transportation [White paper]. Computing Research Association. [URL] [arXiv]
   [BibTeX]

   @techreport{2015_LeePokutta_TowardScienceAutonomy,
     year = {2015},
     institution = {Computing Research Association},
     type = {White paper},
     url = {https://cra.org/ccc/files/docs/white-papers/AutonomousSystems/Transportation%20v3.pdf},
     archiveprefix = {arXiv},
     eprint = {1609.05821},
     arxiv = {arXiv:1609.05821},
     primaryclass = {cs.CY},
     author = {Lee, D. and Pokutta, Sebastian},
     title = {Toward a Science of Autonomy for Physical Systems: Transportation}
   }

3. Pokutta, S., Schmaltz, C., and Stiller, S. (2011). Measuring Systemic Risk and Contagion in Financial Networks. DOI: 10.2139/ssrn.1773089 [URL]
   [BibTeX]

   @misc{2011_PokuttaSchmaltzStiller_MeasuringSystemicRisk,
     year = {2011},
     doi = {10.2139/ssrn.1773089},
     url = {https://papers.ssrn.com/sol3/papers.cfm?abstract_id=1773089},
     author = {Pokutta, Sebastian and Schmaltz, C. and Stiller, S.},
     title = {Measuring Systemic Risk and Contagion in Financial Networks}
   }

4. Pokutta, S. (2011). Lower bounds for Chvátal-Gomory style operators. [URL]
   [BibTeX]

   @misc{2011_Pokutta_LowerBoundsChvatalGomory,
     year = {2011},
     url = {https://optimization-online.org/?p=2011/09/3151},
     author = {Pokutta, Sebastian},
     title = {Lower bounds for Chvátal-Gomory style operators}
   }

5. Pokutta, S., and Schulz, A. S. (2009). On the connection of the Sherali-Adams closure and border bases. [URL]
   [BibTeX]

   @misc{2009_PokuttaSchulz_SheraliAdamsBorderBases,
     year = {2009},
     url = {https://optimization-online.org/?p=2009/08/2378},
     author = {Pokutta, Sebastian and Schulz, A.S.},
     title = {On the connection of the Sherali-Adams closure and border bases}
   }

6. Xu, L., Liu, Y.-C., and Pokutta, S. (2025). Convex semidefinite tensor optimization and quantum entanglement. [arXiv]
   [BibTeX]

   @misc{2025_XuLiuPokutta_Semidefinitetensors_2511-05258,
     month = nov,
     archiveprefix = {arXiv},
     eprint = {2511.05258},
     arxiv = {arXiv:2511.05258},
     primaryclass = {math.OC},
     author = {Xu, Liding and Liu, Ye-Chao and Pokutta, Sebastian},
     title = {Convex semidefinite tensor optimization and quantum entanglement},
     date = {2025-11-07}
   }

7. Braun, G., and Pokutta, S. (2009). A polyhedral approach to computing border bases. [arXiv]
   [BibTeX]

   @misc{2010_BraunPokutta_PolyhedralApproach,
     archiveprefix = {arXiv},
     eprint = {0911.0859},
     arxiv = {arXiv:0911.0859},
     primaryclass = {math.AC},
     author = {Braun, Gábor and Pokutta, Sebastian},
     title = {A polyhedral approach to computing border bases},
     date = {2009-11-04}
   }

8. Pokutta, S., and Schmaltz, C. A Network Model for Bank Lending Capacity. DOI: 10.2139/ssrn.1773964 [URL]
   [BibTeX]

   @misc{2011_PokuttaSchmaltz_NetworkModel,
     doi = {10.2139/ssrn.1773964},
     url = {https://papers.ssrn.com/sol3/papers.cfm?abstract_id=1773964},
     author = {Pokutta, Sebastian and Schmaltz, Christian},
     title = {A Network Model for Bank Lending Capacity}
   }

9. Braun, G., and Pokutta, S. (2015). An information diffusion Fano inequality. [arXiv]
   [BibTeX]

   @misc{2015_BraunPokutta_Informationdiffusionfano,
     archiveprefix = {arXiv},
     eprint = {1504.05492},
     arxiv = {arXiv:1504.05492},
     primaryclass = {cs.IT},
     author = {Braun, Gábor and Pokutta, Sebastian},
     title = {An information diffusion Fano inequality},
     date = {2015-04-21}
   }

10. Braun, G., and Pokutta, S. (2016). An efficient high-probability algorithm for Linear Bandits. [arXiv]
    [BibTeX]

    @misc{2016_BraunPokutta_Highprobabilitylinearbandits,
      archiveprefix = {arXiv},
      eprint = {1610.02072},
      arxiv = {arXiv:1610.02072},
      primaryclass = {cs.DS},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {An efficient high-probability algorithm for Linear Bandits},
      date = {2016-10-06}
    }

11. Pokutta, S., Singh, M., and Torrico, A. (2018). Efficient algorithms for robust submodular maximization under matroid constraints. [arXiv]
    [BibTeX]

    @misc{2018_PokuttaSinghTorrico_EfficientAlgorithms,
      archiveprefix = {arXiv},
      eprint = {1807.09405},
      arxiv = {arXiv:1807.09405},
      primaryclass = {cs.DS},
      author = {Pokutta, Sebastian and Singh, Mohit and Torrico, Alfredo},
      title = {Efficient algorithms for robust submodular maximization under matroid constraints},
      date = {2018-07-25}
    }

12. Combettes, C., Spiegel, C., and Pokutta, S. (2020). Projection-Free Adaptive Gradients for Large-Scale Optimization. [arXiv] [summary] [code]
    [BibTeX]

    @misc{2020_CombettesSpiegelPokutta_Projectionfreeadaptivegradients,
      archiveprefix = {arXiv},
      eprint = {2009.14114},
      arxiv = {arXiv:2009.14114},
      primaryclass = {math.OC},
      author = {Combettes, Cyrille and Spiegel, Christoph and Pokutta, Sebastian},
      title = {Projection-Free Adaptive Gradients for Large-Scale Optimization},
      code = {https://github.com/ZIB-IOL/StochasticFrankWolfe},
      summary = {https://pokutta.com/blog/research/2020/10/21/adasfw.html},
      date = {2020-09-29}
    }

13. Pokutta, S., Spiegel, C., and Zimmer, M. (2020). Deep Neural Network Training with Frank-Wolfe. [arXiv] [summary] [code]
    [BibTeX]

    @misc{2020_PokuttaSpiegelZimmer_Frankwolfeneuralnetworks,
      archiveprefix = {arXiv},
      eprint = {2010.07243},
      arxiv = {arXiv:2010.07243},
      primaryclass = {cs.LG},
      author = {Pokutta, Sebastian and Spiegel, Christoph and Zimmer, Max},
      title = {Deep Neural Network Training with Frank-Wolfe},
      code = {https://github.com/ZIB-IOL/StochasticFrankWolfe},
      summary = {https://pokutta.com/blog/research/2020/11/11/NNFW.html},
      date = {2020-10-14}
    }

14. Braun, G., and Pokutta, S. (2021). Dual Prices for Frank–Wolfe Algorithms. [arXiv]
    [BibTeX]

    @misc{2021_BraunPokutta_DualpricesFrankwolfe,
      archiveprefix = {arXiv},
      eprint = {2101.02087},
      arxiv = {arXiv:2101.02087},
      primaryclass = {math.OC},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Dual Prices for Frank--Wolfe Algorithms},
      date = {2021-01-06}
    }

15. Pokutta, S., and Xu, H. (2021). Adversaries in Online Learning Revisited: with applications in Robust Optimization and Adversarial training. [arXiv]
    [BibTeX]

    @misc{2021_PokuttaXu_AdversariesOnlineLearning,
      archiveprefix = {arXiv},
      eprint = {2101.11443},
      arxiv = {arXiv:2101.11443},
      primaryclass = {cs.LG},
      author = {Pokutta, Sebastian and Xu, Huan},
      title = {Adversaries in Online Learning Revisited: with applications in Robust Optimization and Adversarial training},
      date = {2021-01-27}
    }

16. Roux, C., Wirth, E., Pokutta, S., and Kerdreux, T. (2021). Efficient Online-Bandit Strategies for Minimax Learning Problems. [arXiv]
    [BibTeX]

    @misc{2021_RouxWirthPokuttaKerdreux_Onlinebanditminimax,
      archiveprefix = {arXiv},
      eprint = {2105.13939},
      arxiv = {arXiv:2105.13939},
      primaryclass = {cs.LG},
      author = {Roux, Christophe and Wirth, Elias and Pokutta, Sebastian and Kerdreux, Thomas},
      title = {Efficient Online-Bandit Strategies for Minimax Learning Problems},
      date = {2021-05-28}
    }

17. Braun, G., Pokutta, S., and Weismantel, R. (2022). Alternating Linear Minimization: Revisiting von Neumann’s alternating projections. [arXiv] [slides] [video]
    [BibTeX]

    @misc{2022_BraunPokuttaWeismantel_Alternatingminimization,
      archiveprefix = {arXiv},
      eprint = {2212.02933},
      arxiv = {arXiv:2212.02933},
      primaryclass = {math.OC},
      author = {Braun, Gábor and Pokutta, Sebastian and Weismantel, Robert},
      title = {Alternating Linear Minimization: Revisiting von Neumann's alternating projections},
      slides = {https://pokutta.com/slides/20230327-icerm.pdf},
      video = {https://icerm.brown.edu/programs/sp-s23/w2/#schedule-item-4945},
      date = {2022-12-06}
    }

18. Gelß, P., Klus, S., Knebel, S., Shakibaei, Z., and Pokutta, S. (2022). Low-rank tensor decompositions of quantum circuits. [arXiv]
    [BibTeX]

    @misc{2022_GelssKlusShakibaeiPokutta_Lowranktensordecompositions,
      archiveprefix = {arXiv},
      eprint = {2205.09882},
      arxiv = {arXiv:2205.09882},
      primaryclass = {quant-ph},
      author = {Gelß, Patrick and Klus, Stefan and Knebel, Sebastian and Shakibaei, Zarin and Pokutta, Sebastian},
      title = {Low-rank tensor decompositions of quantum circuits},
      date = {2022-05-19}
    }

19. Scieur, D., Martínez-Rubio, D., Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2023). Strong Convexity of Sets in Riemannian Manifolds. [arXiv]
    [BibTeX]

    @misc{2023_KerdreuxScieurDaspremontPokutta_StrongconvexityRiemannianmanifolds,
      archiveprefix = {arXiv},
      eprint = {2312.03583},
      arxiv = {arXiv:2312.03583},
      primaryclass = {math.OC},
      author = {Scieur, Damien and Martínez-Rubio, David and Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Strong Convexity of Sets in Riemannian Manifolds},
      date = {2023-12-06}
    }

20. Zimmer, M., Andoni, M., Spiegel, C., and Pokutta, S. (2023). PERP: Rethinking the Prune-Retrain Paradigm in the Era of LLMs. [arXiv] [code]
    [BibTeX]

    @misc{2023_ZimmerAndoniSpiegelPokutta_PerpPruneRetrain,
      archiveprefix = {arXiv},
      eprint = {2312.15230},
      arxiv = {arXiv:2312.15230},
      primaryclass = {cs.LG},
      author = {Zimmer, Max and Andoni, Megi and Spiegel, Christoph and Pokutta, Sebastian},
      title = {PERP: Rethinking the Prune-Retrain Paradigm in the Era of LLMs},
      code = {https://github.com/ZIB-IOL/PERP},
      date = {2023-12-23}
    }

21. Mundinger, K., Zimmer, M., and Pokutta, S. (2024). Neural Parameter Regression for Explicit Representations of PDE Solution Operators. [arXiv]
    [BibTeX]

    @misc{2024_MundingerZimmerPokutta_Neuralparameterregression,
      archiveprefix = {arXiv},
      eprint = {2403.12764},
      arxiv = {arXiv:2403.12764},
      primaryclass = {cs.LG},
      author = {Mundinger, Konrad and Zimmer, Max and Pokutta, Sebastian},
      title = {Neural Parameter Regression for Explicit Representations of PDE Solution Operators},
      date = {2024-03-19}
    }

22. Sharma, K., Hendrych, D., Besançon, M., and Pokutta, S. (2024). Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe. [arXiv]
    [BibTeX]

    @misc{2024_SharmaHendrychBesanconPokutta_NetworkdesignMicoFrankwolfe,
      archiveprefix = {arXiv},
      eprint = {2402.00166},
      arxiv = {arXiv:2402.00166},
      primaryclass = {math.OC},
      author = {Sharma, Kartikey and Hendrych, Deborah and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe},
      date = {2024-01-31}
    }

23. Hojny, C., Besançon, M., Bestuzheva, K., Borst, S., Dionísio, J., Ehls, J., Eifler, L., Ghannam, M., Gleixner, A., Göß, A., Hoen, A., von Holly-Ponientzietz, J., van der Hulst, R., Kamp, D., Koch, T., Kofler, K., Lentz, J., Lübbecke, M., Maher, S. J., … Xu, L. (2025). The SCIP Optimization Suite 10.0. [arXiv]
    [BibTeX]

    @misc{2025_ChristopherEtAl_Scip10_2511-18580,
      archiveprefix = {arXiv},
      eprint = {2511.18580},
      arxiv = {arXiv:2511.18580},
      primaryclass = {math.OC},
      author = {Hojny, Christopher and Besançon, Mathieu and Bestuzheva, Ksenia and Borst, Sander and Dionísio, João and Ehls, Johannes and Eifler, Leon and Ghannam, Mohammed and Gleixner, Ambros and Göß, Adrian and Hoen, Alexander and von Holly-Ponientzietz, Jacob and van der Hulst, Rolf and Kamp, Dominik and Koch, Thorsten and Kofler, Kevin and Lentz, Jurgen and Lübbecke, Marco and Maher, Stephen J. and Meinhold, Paul Matti and Mexi, Gioni and Mohr, Til and Mühmer, Erik and Patel, Krunal Kishor and Pfetsch, Marc and Pokutta, Sebastian and Reinartz Groba, Chantal and Serrano, Felipe and Shinano, Yuji and Turner, Mark and Vigerske, Stefan and Walter, Matthias and Weninger, Dieter and Xu, Liding},
      title = {The SCIP Optimization Suite 10.0},
      date = {2025-11-23}
    }

24. Haase, J., Klessascheck, F., Mendling, J., and Pokutta, S. (2025). Sustainability via LLM Right-sizing. [arXiv]
    [BibTeX]

    @misc{2025_HaaseFinnJanPokutta_Sustainabilityllm,
      archiveprefix = {arXiv},
      eprint = {2504.13217},
      arxiv = {arXiv:2504.13217},
      primaryclass = {cs.CL},
      author = {Haase, Jennifer and Klessascheck, Finn and Mendling, Jan and Pokutta, Sebastian},
      title = {Sustainability via LLM Right-sizing},
      date = {2025-04-17}
    }

25. Aigner, K.-M., Denzler, S., Liers, F., Pokutta, S., and Sharma, K. (2025). Scenario Reduction for Distributionally Robust Optimization. [arXiv]
    [BibTeX]

    @misc{2025_Kevin-martinEtAl_ScenarioreductionDro,
      archiveprefix = {arXiv},
      eprint = {2503.11484},
      arxiv = {arXiv:2503.11484},
      primaryclass = {math.OC},
      author = {Aigner, Kevin-Martin and Denzler, Sebastian and Liers, Frauke and Pokutta, Sebastian and Sharma, Kartikey},
      title = {Scenario Reduction for Distributionally Robust Optimization},
      date = {2025-03-14}
    }

26. Kuzinowicz, D., Lichocki, P., Mexi, G., Pfetsch, M., Pokutta, S., and Zimmer, M. (2025). Objective Coefficient Rounding and Almost Symmetries in Binary Programs. [arXiv]
    [BibTeX]

    @misc{2025_KuzinowiczEtAl_ObjectiveroundingSymmetries_2512-10507,
      archiveprefix = {arXiv},
      eprint = {2512.10507},
      arxiv = {arXiv:2512.10507},
      primaryclass = {math.OC},
      author = {Kuzinowicz, Dominik and Lichocki, Paweł and Mexi, Gioni and Pfetsch, Marc and Pokutta, Sebastian and Zimmer, Max},
      title = {Objective Coefficient Rounding and Almost Symmetries in Binary Programs},
      date = {2025-12-11}
    }

27. Martínez-Rubio, D., and Pokutta, S. (2025). Beyond Short Steps in Frank-Wolfe Algorithms. [arXiv]
    [BibTeX]

    @misc{2025_MartinezrubioPokutta_FrankwolfeEnhancements,
      archiveprefix = {arXiv},
      eprint = {2501.18773},
      arxiv = {arXiv:2501.18773},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Pokutta, Sebastian},
      title = {Beyond Short Steps in Frank-Wolfe Algorithms},
      date = {2025-01-30}
    }

28. Mexi, G., Kamp, D., Shinano, Y., Pu, S., Hoen, A., Bestuzheva, K., Hojny, C., Walter, M., Pfetsch, M., Pokutta, S., and Koch, T. (2025). State-of-the-art Methods for Pseudo-Boolean Solving with SCIP. [arXiv]
    [BibTeX]

    @misc{2025_MexiEtAl_Pseudobooleanscip,
      archiveprefix = {arXiv},
      eprint = {2501.03390},
      arxiv = {arXiv:2501.03390},
      primaryclass = {math.OC},
      author = {Mexi, Gioni and Kamp, Dominik and Shinano, Yuji and Pu, Shanwen and Hoen, Alexander and Bestuzheva, Ksenia and Hojny, Christopher and Walter, Matthias and Pfetsch, Marc and Pokutta, Sebastian and Koch, Thorsten},
      title = {State-of-the-art Methods for Pseudo-Boolean Solving with SCIP},
      date = {2025-01-06}
    }

29. Pokutta, S. (2025). Scalable DC Optimization via Adaptive Frank-Wolfe Algorithms. [arXiv]
    [BibTeX]

    @misc{2025_Pokutta_DcoptimizationFrankwolfe_2507-17545,
      archiveprefix = {arXiv},
      eprint = {2507.17545},
      arxiv = {arXiv:2507.17545},
      primaryclass = {math.OC},
      author = {Pokutta, Sebastian},
      title = {Scalable DC Optimization via Adaptive Frank-Wolfe Algorithms},
      date = {2025-07-23}
    }

30. Roux, C., Zimmer, M., d’Aspremont, A., and Pokutta, S. (2025). Don’t Be Greedy, Just Relax! Pruning LLMs via Frank-Wolfe. [arXiv]
    [BibTeX]

    @misc{2025_RouxZimmerDaspremontPokutta_Pruningfrankwolfe_2510-13713,
      archiveprefix = {arXiv},
      eprint = {2510.13713},
      arxiv = {arXiv:2510.13713},
      primaryclass = {cs.LG},
      author = {Roux, Christophe and Zimmer, Max and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Don't Be Greedy, Just Relax! Pruning LLMs via Frank-Wolfe},
      date = {2025-10-15}
    }

31. Sadiku, S., Chitranshi, K., Kera, H., and Pokutta, S. (2025). Training on Plausible Counterfactuals Removes Spurious Correlations. [arXiv]
    [BibTeX]

    @misc{2025_SadikuChitranshiKeraPokutta_Plausiblecounterfactuals,
      archiveprefix = {arXiv},
      eprint = {2505.16583},
      arxiv = {arXiv:2505.16583},
      primaryclass = {cs.LG},
      author = {Sadiku, Shpresim and Chitranshi, Kartikeya and Kera, Hiroshi and Pokutta, Sebastian},
      title = {Training on Plausible Counterfactuals Removes Spurious Correlations},
      date = {2025-05-22}
    }

32. Takahashi, S., Pokutta, S., and Takeda, A. (2025). Fast Frank–Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions. [arXiv]
    [BibTeX]

    @misc{2025_ShotaPokuttaAkiko_Frankwolfebregman,
      archiveprefix = {arXiv},
      eprint = {2504.04330},
      arxiv = {arXiv:2504.04330},
      primaryclass = {math.OC},
      author = {Takahashi, Shota and Pokutta, Sebastian and Takeda, Akiko},
      title = {Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions},
      date = {2025-04-06}
    }

33. Xiao, W., Hendrych, D., Besançon, M., and Pokutta, S. (2025). Boscia.jl: A review and tutorial. [arXiv]
    [BibTeX]

    @misc{2025_XiaoHendrychBesanconPokutta_Bosciaminlp_2511-01479,
      archiveprefix = {arXiv},
      eprint = {2511.01479},
      arxiv = {arXiv:2511.01479},
      primaryclass = {math.OC},
      author = {Xiao, Wenjie and Hendrych, Deborah and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Boscia.jl: A review and tutorial},
      date = {2025-11-03}
    }

34. Zimmer, M., Roux, C., Wagner, M., Hendrych, D., and Pokutta, S. (2025). SparseSwaps: Tractable LLM Pruning Mask Refinement at Scale. [arXiv]
    [BibTeX]

    @misc{2025_ZimmerEtAl_Sparseswapspruning_2512-10922,
      archiveprefix = {arXiv},
      eprint = {2512.10922},
      arxiv = {arXiv:2512.10922},
      primaryclass = {cs.LG},
      author = {Zimmer, Max and Roux, Christophe and Wagner, Moritz and Hendrych, Deborah and Pokutta, Sebastian},
      title = {SparseSwaps: Tractable LLM Pruning Mask Refinement at Scale},
      date = {2025-12-11}
    }

35. Berthold, T., Kamp, D., Mexi, G., Pokutta, S., and Pólik, I. (2026). Out-of-the-Box Global Optimization for Packing Problems: New Models and Improved Solutions. [arXiv]
    [BibTeX]

    @misc{2026_BertholdEtAl_Globalpackingoptimization_2605-04850,
      archiveprefix = {arXiv},
      eprint = {2605.04850},
      arxiv = {arXiv:2605.04850},
      primaryclass = {math.OC},
      author = {Berthold, Timo and Kamp, Dominik and Mexi, Gioni and Pokutta, Sebastian and Pólik, Imre},
      title = {Out-of-the-Box Global Optimization for Packing Problems: New Models and Improved Solutions},
      date = {2026-05-06}
    }

36. Deza, A., Gerard, Y., Ma, Y., and Pokutta, S. (2026). Bounded-Support Additive Latin Transversals. [arXiv]
    [BibTeX]

    @misc{2026_DezaGerardMaPokutta_Boundedsupportadditivetransversals_2607-11241,
      archiveprefix = {arXiv},
      eprint = {2607.11241},
      arxiv = {arXiv:2607.11241},
      primaryclass = {cs.DS},
      author = {Deza, Antoine and Gerard, Yan and Ma, Yijun and Pokutta, Sebastian},
      title = {Bounded-Support Additive Latin Transversals},
      date = {2026-07-13}
    }

37. Tjusila, G., Hoen, A., Kempke, N.-C., Mexi, G., Berthold, T., Gleixner, A., Koch, T., and Pokutta, S. (2026). CHAP: A Hybrid GPU-CPU Heuristic for MIP. [arXiv]
    [BibTeX]

    @misc{2026_GennesaretEtAl_Hybridheuristicmip_2605-05086,
      archiveprefix = {arXiv},
      eprint = {2605.05086},
      arxiv = {arXiv:2605.05086},
      primaryclass = {math.OC},
      author = {Tjusila, Gennesaret and Hoen, Alexander and Kempke, Nils-Christian and Mexi, Gioni and Berthold, Timo and Gleixner, Ambros and Koch, Thorsten and Pokutta, Sebastian},
      title = {CHAP: A Hybrid GPU-CPU Heuristic for MIP},
      date = {2026-05-06}
    }

38. Gonnermann-Müller, J., Haase, J., Leins, N., Kosch, T., and Pokutta, S. (2026). LLM-Based Educational Simulation: Evaluating Temporal Student Persona Stability Across ADHD Profiles. [arXiv]
    [BibTeX]

    @misc{2026_GonnermannmuellerEtAl_Llmstudentsimulation_2605-06307,
      archiveprefix = {arXiv},
      eprint = {2605.06307},
      arxiv = {arXiv:2605.06307},
      primaryclass = {cs.HC},
      author = {Gonnermann-Müller, Jana and Haase, Jennifer and Leins, Nicolas and Kosch, Thomas and Pokutta, Sebastian},
      title = {LLM-Based Educational Simulation: Evaluating Temporal Student Persona Stability Across ADHD Profiles},
      date = {2026-05-07}
    }

39. Haase, J., Gonnermann-Müller, J., Yim, S. H., Leins, N., Mendling, J., and Pokutta, S. (2026). Simulating Eating Disorder Patients with LLMs: Evaluating Psychological Persona Stability in Multi-Turn Conversations. [arXiv]
    [BibTeX]

    @misc{2026_HaaseEtAl_Llmstability_2606-26109,
      archiveprefix = {arXiv},
      eprint = {2606.26109},
      arxiv = {arXiv:2606.26109},
      primaryclass = {cs.CY},
      author = {Haase, Jennifer and Gonnermann-Müller, Jana and Yim, See Heng and Leins, Nicolas and Mendling, Jan and Pokutta, Sebastian},
      title = {Simulating Eating Disorder Patients with LLMs: Evaluating Psychological Persona Stability in Multi-Turn Conversations},
      date = {2026-05-12}
    }

40. Hendrych, D., Besançon, M., and Pokutta, S. (2026). Discrete eigenvalue optimization from entropic smoothing and first-order methods. [arXiv] [code]
    [BibTeX]

    @misc{2026_HendrychBesanconPokutta_DiscreteEigenvalueOptimization_2608-27024,
      archiveprefix = {arXiv},
      eprint = {2608.27024},
      arxiv = {arXiv:2608.27024},
      primaryclass = {math.OC},
      author = {Hendrych, Deborah and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Discrete eigenvalue optimization from entropic smoothing and first-order methods},
      code = {https://github.com/ZIB-IOL/OptimalDesignWithBoscia},
      date = {2026-08-27}
    }

41. Pauls, J., Schrödter, K., Ligensa, S., Schwartz, M., Turan, B., Zimmer, M., Saatchi, S., Pokutta, S., Ciais, P., and Gieseke, F. (2026). ECHOSAT: Estimating Canopy Height Over Space And Time. [arXiv]
    [BibTeX]

    @misc{2026_JanEtAl_EchosatCanopyheight_2602-21421,
      archiveprefix = {arXiv},
      eprint = {2602.21421},
      arxiv = {arXiv:2602.21421},
      primaryclass = {cs.CV},
      author = {Pauls, Jan and Schrödter, Karsten and Ligensa, Sven and Schwartz, Martin and Turan, Berkant and Zimmer, Max and Saatchi, Sassan and Pokutta, Sebastian and Ciais, Philippe and Gieseke, Fabian},
      title = {ECHOSAT: Estimating Canopy Height Over Space And Time},
      date = {2026-02-24}
    }

42. Kaibel, V., and Pokutta, S. (2026). A Counterexample to Ziegler’s Cross-Polytope Conjecture for Simplicial 0/1-Polytopes. [arXiv]
    [BibTeX]

    @misc{2026_KaibelPokutta_Counterexampleziegler_2606-31640,
      archiveprefix = {arXiv},
      eprint = {2606.31640},
      arxiv = {arXiv:2606.31640},
      primaryclass = {math.CO},
      author = {Kaibel, Volker and Pokutta, Sebastian},
      title = {A Counterexample to Ziegler's Cross-Polytope Conjecture for Simplicial 0/1-Polytopes},
      date = {2026-06-30}
    }

43. Khoruzhii, K., Gelß, P., and Pokutta, S. (2026). Classification of Boolean Cubic Forms in Ten Variables. [arXiv]
    [BibTeX]

    @misc{2026_KhoruzhiiGelssPokutta_Booleancubicforms_2606-28473,
      archiveprefix = {arXiv},
      eprint = {2606.28473},
      arxiv = {arXiv:2606.28473},
      primaryclass = {math.NT},
      author = {Khoruzhii, Kirill and Gelß, Patrick and Pokutta, Sebastian},
      title = {Classification of Boolean Cubic Forms in Ten Variables},
      date = {2026-06-26}
    }

44. Khoruzhii, K., Gelß, P., and Pokutta, S. (2026). Tensor Decomposition for Non-Clifford Gate Minimization. [arXiv]
    [BibTeX]

    @misc{2026_KhoruzhiiGelssPokutta_TensordecompositionToffoliminimization_2602-15285,
      archiveprefix = {arXiv},
      eprint = {2602.15285},
      arxiv = {arXiv:2602.15285},
      primaryclass = {quant-ph},
      author = {Khoruzhii, Kirill and Gelß, Patrick and Pokutta, Sebastian},
      title = {Tensor Decomposition for Non-Clifford Gate Minimization},
      date = {2026-02-17}
    }

45. Khoruzhii, K., Gelß, P., and Pokutta, S. (2026). The Weight Distribution of the Third-Order Reed-Muller Code of Length 2048. [arXiv]
    [BibTeX]

    @misc{2026_KhoruzhiiGelssPokutta_Weightdistributionrm3_2607-02365,
      archiveprefix = {arXiv},
      eprint = {2607.02365},
      arxiv = {arXiv:2607.02365},
      primaryclass = {cs.IT},
      author = {Khoruzhii, Kirill and Gelß, Patrick and Pokutta, Sebastian},
      title = {The Weight Distribution of the Third-Order Reed-Muller Code of Length 2048},
      date = {2026-07-02}
    }

46. Leins, N., Haase, J., Geronimus, V., Gonnermann-Müller, J., and Pokutta, S. (2026). Prompting Against Persona Drift: Comparing Intervention Timing and Content in LLM-Simulated Conversations. [arXiv]
    [BibTeX]

    @misc{2026_LeinsEtAl_PersonaDriftIntervention_2609-24532,
      archiveprefix = {arXiv},
      eprint = {2609.24532},
      arxiv = {arXiv:2609.24532},
      primaryclass = {cs.HC},
      author = {Leins, Nicolas and Haase, Jennifer and Geronimus, Varvara and Gonnermann-Müller, Jana and Pokutta, Sebastian},
      title = {Prompting Against Persona Drift: Comparing Intervention Timing and Content in LLM-Simulated Conversations},
      date = {2026-09-21}
    }

47. Leins, N., Fischer, M., Teichmann, M., Gonnermann-Müller, J., and Pokutta, S. (2026). Robot Programming with Augmented Reality: The Role of Spatial Ability. [arXiv]
    [BibTeX]

    @misc{2026_LeinsGonnermannmuellerTeichmannPokutta_Spatialabilityar_2602-03544,
      archiveprefix = {arXiv},
      eprint = {2602.03544},
      arxiv = {arXiv:2602.03544},
      primaryclass = {cs.RO},
      author = {Leins, Nicolas and Fischer, Muriel and Teichmann, Malte and Gonnermann-Müller, Jana and Pokutta, Sebastian},
      title = {Robot Programming with Augmented Reality: The Role of Spatial Ability},
      date = {2026-02-03}
    }

48. Leins, N., Pelleriti, N., Gonnermann-Müller, J., and Pokutta, S. (2026). When Does LLM Orchestration Pay Off? A Controlled Evaluation of Accuracy, Cost, and Task Difficulty. [arXiv]
    [BibTeX]

    @misc{2026_LeinsPelleritiGonnermannmuellerPokutta_Llmorchestration_2608-00685,
      archiveprefix = {arXiv},
      eprint = {2608.00685},
      arxiv = {arXiv:2608.00685},
      primaryclass = {cs.AI},
      author = {Leins, Nicolas and Pelleriti, Nico and Gonnermann-Müller, Jana and Pokutta, Sebastian},
      title = {When Does LLM Orchestration Pay Off? A Controlled Evaluation of Accuracy, Cost, and Task Difficulty},
      date = {2026-08-01}
    }

49. Pelleriti, N., Nelaturu, S. H., Zhou, Z., Li, Z., Zimmer, M., Han, B., and Pokutta, S. (2026). What Do Evolutionary Coding Agents Evolve? [arXiv]
    [BibTeX]

    @misc{2026_PelleritiEtAl_Evotrace_2605-20086,
      archiveprefix = {arXiv},
      eprint = {2605.20086},
      arxiv = {arXiv:2605.20086},
      primaryclass = {cs.NE},
      author = {Pelleriti, Nico and Nelaturu, Sree Harsha and Zhou, Zhanke and Li, Zongze and Zimmer, Max and Han, Bo and Pokutta, Sebastian},
      title = {What Do Evolutionary Coding Agents Evolve?},
      date = {2026-05-19}
    }

50. Pelleriti, N., Shiran, M., Martínez-Rubio, D., Zimmer, M., and Pokutta, S. (2026). Optimal Gradient-Norm Minimization in Non-Euclidean Hölder-Smooth Convex Optimization. [arXiv]
    [BibTeX]

    @misc{2026_PelleritiEtAl_GradientNormNonEuclidean_2609-01122,
      archiveprefix = {arXiv},
      eprint = {2609.01122},
      arxiv = {arXiv:2609.01122},
      primaryclass = {math.OC},
      author = {Pelleriti, Nico and Shiran, Maryam and Martínez-Rubio, David and Zimmer, Max and Pokutta, Sebastian},
      title = {Optimal Gradient-Norm Minimization in Non-Euclidean Hölder-Smooth Convex Optimization},
      date = {2026-09-01}
    }

51. Poirion, P.-L., Pokutta, S., and Takeda, A. (2026). Random-Subspace Frank–Wolfe over Strongly Convex Sets. [arXiv]
    [BibTeX]

    @misc{2026_PoirionPokuttaTakeda_Randomsubspacefrankwolfe_2605-24819,
      archiveprefix = {arXiv},
      eprint = {2605.24819},
      arxiv = {arXiv:2605.24819},
      primaryclass = {math.OC},
      author = {Poirion, Pierre-Louis and Pokutta, Sebastian and Takeda, Akiko},
      title = {Random-Subspace Frank--Wolfe over Strongly Convex Sets},
      date = {2026-05-24}
    }

52. Pokutta, S., and Stellato, B. (2026). The exact worst-case asymptotic rate of Nesterov acceleration for strongly convex optimization. [arXiv]
    [BibTeX]

    @misc{2026_PokuttaStellato_NesterovWorstCaseRate_2610-15125,
      archiveprefix = {arXiv},
      eprint = {2610.15125},
      arxiv = {arXiv:2610.15125},
      primaryclass = {math.OC},
      author = {Pokutta, Sebastian and Stellato, Bartolomeo},
      title = {The exact worst-case asymptotic rate of Nesterov acceleration for strongly convex optimization},
      date = {2026-10-10}
    }

53. Pokutta, S. (2026). Lower Bounds for Randomized Linear-Oracle Optimization over Strongly Convex Sets. [arXiv]
    [BibTeX]

    @misc{2026_Pokutta_RandomizedLinearOracle_2610-13590,
      archiveprefix = {arXiv},
      eprint = {2610.13590},
      arxiv = {arXiv:2610.13590},
      primaryclass = {math.OC},
      author = {Pokutta, Sebastian},
      title = {Lower Bounds for Randomized Linear-Oracle Optimization over Strongly Convex Sets},
      date = {2026-10-09}
    }

54. Pokutta, S. (2026). (Approximate) Symmetric Extension Complexity of the Spanning Tree Polytope. [arXiv]
    [BibTeX]

    @misc{2026_Pokutta_Symmetricextensioncomplexity_2606-17017,
      archiveprefix = {arXiv},
      eprint = {2606.17017},
      arxiv = {arXiv:2606.17017},
      primaryclass = {math.CO},
      author = {Pokutta, Sebastian},
      title = {(Approximate) Symmetric Extension Complexity of the Spanning Tree Polytope},
      date = {2026-06-15}
    }

55. Ramos Ramos, A., Fröhlich, M., Sander, A., Wille, R., Eigel, M., Gelß, P., and Pokutta, S. (2026). Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation. [arXiv]
    [BibTeX]

    @misc{2026_RamosramosEtAl_LindbladNoiseLearning_2608-24668,
      archiveprefix = {arXiv},
      eprint = {2608.24668},
      arxiv = {arXiv:2608.24668},
      primaryclass = {quant-ph},
      author = {Ramos Ramos, Alejandro and Fröhlich, Maximilian and Sander, Aaron and Wille, Robert and Eigel, Martin and Gelß, Patrick and Pokutta, Sebastian},
      title = {Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation},
      date = {2026-08-25}
    }

56. Schiekiera, L., Zimmer, M., Roux, C., Arnold, M., Pokutta, S., and Günther, F. (2026). LinearPFN: Amortized Variable Selection for Linear Models with Interactions. [arXiv]
    [BibTeX]

    @misc{2026_SchiekieraEtAl_LinearPFNVariableSelection_2610-06580,
      archiveprefix = {arXiv},
      eprint = {2610.06580},
      arxiv = {arXiv:2610.06580},
      primaryclass = {cs.LG},
      author = {Schiekiera, Louis and Zimmer, Max and Roux, Christophe and Arnold, Manuel and Pokutta, Sebastian and Günther, Fritz},
      title = {LinearPFN: Amortized Variable Selection for Linear Models with Interactions},
      date = {2026-10-05}
    }

57. Tadinada, S. H., Pokutta, S., and Walther, A. (2026). Abs-Smooth Frank-Wolfe Method: Primal-Dual Analysis, Heavy Ball Momentum, and Inexact Oracles. [arXiv]
    [BibTeX]

    @misc{2026_TadinadaPokuttaWalther_Abssmoothfrankwolfe_2605-19828,
      archiveprefix = {arXiv},
      eprint = {2605.19828},
      arxiv = {arXiv:2605.19828},
      primaryclass = {math.OC},
      author = {Tadinada, Sri Harshitha and Pokutta, Sebastian and Walther, Andrea},
      title = {Abs-Smooth Frank-Wolfe Method: Primal-Dual Analysis, Heavy Ball Momentum, and Inexact Oracles},
      date = {2026-05-19}
    }

58. Urbano, A., Romero, D. W., Zimmer, M., and Pokutta, S. (2026). Neural Field Tokenizations with Hierarchy and Spatial Locality Priors. [arXiv]
    [BibTeX]

    @misc{2026_UrbanoRomeroZimmerPokutta_Neuralfieldtokenization_2606-08204,
      archiveprefix = {arXiv},
      eprint = {2606.08204},
      arxiv = {arXiv:2606.08204},
      primaryclass = {cs.LG},
      author = {Urbano, Alonso and Romero, David W. and Zimmer, Max and Pokutta, Sebastian},
      title = {Neural Field Tokenizations with Hierarchy and Spatial Locality Priors},
      date = {2026-06-06}
    }

59. Wagner, M., Roux, C., Zimmer, M., and Pokutta, S. (2026). The KV-Surgeon: Compensation-Aware Offline KV-Cache Compaction. [arXiv]
    [BibTeX]

    @misc{2026_WagnerRouxZimmerPokutta_KVCacheCompaction_2610-25933,
      archiveprefix = {arXiv},
      eprint = {2610.25933},
      arxiv = {arXiv:2610.25933},
      primaryclass = {cs.LG},
      author = {Wagner, Moritz and Roux, Christophe and Zimmer, Max and Pokutta, Sebastian},
      title = {The KV-Surgeon: Compensation-Aware Offline KV-Cache Compaction},
      date = {2026-10-19}
    }

60. Xu, L., and Pokutta, S. (2026). Joint-Range Inequalities for Nonconvex QCQPs. [arXiv]
    [BibTeX]

    @misc{2026_XuPokutta_Jointrangeinequalities_2608-03318,
      archiveprefix = {arXiv},
      eprint = {2608.03318},
      arxiv = {arXiv:2608.03318},
      primaryclass = {math.OC},
      author = {Xu, Liding and Pokutta, Sebastian},
      title = {Joint-Range Inequalities for Nonconvex QCQPs},
      date = {2026-08-04}
    }

61. Xu, L., Zhou, Y., and Pokutta, S. (2026). Agentic MIP Research: Accelerated Constraint Handler Generation. [arXiv]
    [BibTeX]

    @misc{2026_XuZhouPokutta_Agenticmip_2605-09186,
      archiveprefix = {arXiv},
      eprint = {2605.09186},
      arxiv = {arXiv:2605.09186},
      primaryclass = {cs.AI},
      author = {Xu, Liding and Zhou, Yugeng and Pokutta, Sebastian},
      title = {Agentic MIP Research: Accelerated Constraint Handler Generation},
      date = {2026-05-09}
    }

62. Zhou, Z., Li, Z., Huang, W., Li, X., Cao, C., Feng, X., Lu, X., Hu, J., Xie, Y., Pelleriti, N., Liu, S., Lu, M., Zimmer, M., Miranda, B., Yao, J., Liu, B., Koyejo, S., Pokutta, S., and Han, B. (2026). AlphaDiana: A Measurement System for Agents in Verifiable Reasoning Tasks. [arXiv]
    [BibTeX]

    @misc{2026_ZhouEtAl_AlphaDianaVerifiableReasoning_2610-20675,
      archiveprefix = {arXiv},
      eprint = {2610.20675},
      arxiv = {arXiv:2610.20675},
      primaryclass = {cs.AI},
      author = {Zhou, Zhanke and Li, Zongze and Huang, Weikai and Li, Xuan and Cao, Chentao and Feng, Xiao and Lu, Xiangyu and Hu, Jinbo and Xie, Yi and Pelleriti, Nico and Liu, Shiyang and Lu, Menghan and Zimmer, Max and Miranda, Brando and Yao, Jiangchao and Liu, Bo and Koyejo, Sanmi and Pokutta, Sebastian and Han, Bo},
      title = {AlphaDiana: A Measurement System for Agents in Verifiable Reasoning Tasks},
      date = {2026-10-14}
    }

63. Zimmer, M., Pelleriti, N., Roux, C., and Pokutta, S. (2026). The Agentic Researcher: A Practical Guide to AI-Assisted Research in Mathematics and Machine Learning. [arXiv]
    [BibTeX]

    @misc{2026_ZimmerPelleritiRouxPokutta_Airesearchframework_2603-15914,
      archiveprefix = {arXiv},
      eprint = {2603.15914},
      arxiv = {arXiv:2603.15914},
      primaryclass = {cs.LG},
      author = {Zimmer, Max and Pelleriti, Nico and Roux, Christophe and Pokutta, Sebastian},
      title = {The Agentic Researcher: A Practical Guide to AI-Assisted Research in Mathematics and Machine Learning},
      date = {2026-03-16}
    }

64. Geiselmann, Z., Joswig, M., Kastner, L., Mundinger, K., Pokutta, S., Spiegel, C., Wack, M., and Zimmer, M. (2026). Limits of combinatorial patchworking. [arXiv]
    [BibTeX]

    @misc{2026_ZoeEtAl_Patchworkedcurves_2602-06888,
      archiveprefix = {arXiv},
      eprint = {2602.06888},
      arxiv = {arXiv:2602.06888},
      primaryclass = {math.AG},
      author = {Geiselmann, Zoe and Joswig, Michael and Kastner, Lars and Mundinger, Konrad and Pokutta, Sebastian and Spiegel, Christoph and Wack, Marcel and Zimmer, Max},
      title = {Limits of combinatorial patchworking},
      date = {2026-02-06}
    }

Conference contributions

1. Wagner, M., Roux, C., Zimmer, M., and Pokutta, S. A Free Lunch in LLM Compression: Revisiting Retraining after Pruning. Advances in Neural Information Processing Systems, 39. To appear. Associated with NeurIPS 2026. [arXiv]
   [BibTeX]

   @inproceedings{2025_WagnerRouxZimmerPokutta_Llmpruningretraining_2510-14444,
     booktitle = {Advances in Neural Information Processing Systems},
     series = {Advances in Neural Information Processing Systems},
     volume = {39},
     publisher = {Curran Associates},
     note = {To appear},
     archiveprefix = {arXiv},
     eprint = {2510.14444},
     arxiv = {arXiv:2510.14444},
     primaryclass = {cs.LG},
     author = {Wagner, Moritz and Roux, Christophe and Zimmer, Max and Pokutta, Sebastian},
     title = {A Free Lunch in LLM Compression: Revisiting Retraining after Pruning}
   }

2. Haase, J., Gonnermann-Müller, J., Hanel, P. H. P., Leins, N., Kosch, T., Mendling, J., and Pokutta, S. Within-Model vs Between-Prompt Variability in Large Language Models for Creative Tasks. Advances in Neural Information Processing Systems, 39. To appear. Associated with NeurIPS 2026. [arXiv]
   [BibTeX]

   @inproceedings{2026_HaaseEtAl_Promptvariability_2601-21339:1,
     booktitle = {Advances in Neural Information Processing Systems},
     series = {Advances in Neural Information Processing Systems},
     volume = {39},
     publisher = {Curran Associates},
     note = {To appear},
     archiveprefix = {arXiv},
     eprint = {2601.21339},
     arxiv = {arXiv:2601.21339},
     primaryclass = {cs.AI},
     author = {Haase, Jennifer and Gonnermann-Müller, Jana and Hanel, Paul H. P. and Leins, Nicolas and Kosch, Thomas and Mendling, Jan and Pokutta, Sebastian},
     title = {Within-Model vs Between-Prompt Variability in Large Language Models for Creative Tasks}
   }

3. Halbey, J., Roux, C., and Pokutta, S. Curvature-Dependent Lower Bounds for Frank-Wolfe. Advances in Neural Information Processing Systems, 39. To appear. Associated with NeurIPS 2026. [arXiv]
   [BibTeX]

   @inproceedings{2026_HalbeyRouxPokutta_Curvaturelowerbounds_2605-10595,
     booktitle = {Advances in Neural Information Processing Systems},
     series = {Advances in Neural Information Processing Systems},
     volume = {39},
     publisher = {Curran Associates},
     note = {To appear},
     archiveprefix = {arXiv},
     eprint = {2605.10595},
     arxiv = {arXiv:2605.10595},
     primaryclass = {math.OC},
     author = {Halbey, Jannis and Roux, Christophe and Pokutta, Sebastian},
     title = {Curvature-Dependent Lower Bounds for Frank-Wolfe}
   }

4. Koshizuka, T., Blessing, D., Zimmer, M., Pokutta, S., and Richter, L. A Trust Region Approach for Learning Schrödinger Bridges. Advances in Neural Information Processing Systems, 39. To appear. Associated with NeurIPS 2026.
   [BibTeX]

   @inproceedings{2026_KoshizukaEtAl_TrustregionSchrodingerbridges,
     booktitle = {Advances in Neural Information Processing Systems},
     series = {Advances in Neural Information Processing Systems},
     volume = {39},
     publisher = {Curran Associates},
     note = {To appear},
     author = {Koshizuka, Takeshi and Blessing, Denis and Zimmer, Max and Pokutta, Sebastian and Richter, Lorenz},
     title = {A Trust Region Approach for Learning Schrödinger Bridges}
   }

5. Pokutta, S. Frank-Wolfe Beyond 1/t Convergence. Advances in Neural Information Processing Systems, 39. To appear. Associated with NeurIPS 2026. [arXiv]
   [BibTeX]

   @inproceedings{2026_Pokutta_Localdualsharpness_2604-28006,
     booktitle = {Advances in Neural Information Processing Systems},
     series = {Advances in Neural Information Processing Systems},
     volume = {39},
     publisher = {Curran Associates},
     note = {To appear},
     archiveprefix = {arXiv},
     eprint = {2604.28006},
     arxiv = {arXiv:2604.28006},
     primaryclass = {math.OC},
     author = {Pokutta, Sebastian},
     title = {Frank-Wolfe Beyond 1/t Convergence}
   }

6. Berthold, T., Kamp, D., Mexi, G., Pokutta, S., and Pólik, I. (2027). Global Optimization for Combinatorial Geometry Problems Revisited in the Era of LLMs. Combinatorial Optimization, 16613, 121–135. Associated with ISCO 2026. DOI: 10.1007/978-3-032-34519-6_10 [arXiv]
   [BibTeX]

   @inproceedings{2026_BertholdEtAl_Globaloptimization_2601-05943,
     year = {2027},
     booktitle = {Combinatorial Optimization},
     series = {Lecture Notes in Computer Science},
     volume = {16613},
     publisher = {Springer Science+Business Media},
     pages = {121--135},
     doi = {10.1007/978-3-032-34519-6_10},
     archiveprefix = {arXiv},
     eprint = {2601.05943},
     arxiv = {arXiv:2601.05943},
     primaryclass = {math.OC},
     author = {Berthold, Timo and Kamp, Dominik and Mexi, Gioni and Pokutta, Sebastian and Pólik, Imre},
     title = {Global Optimization for Combinatorial Geometry Problems Revisited in the Era of LLMs}
   }

7. Geiselmann, Z., Joswig, M., Kastner, L., Mundinger, K., Pokutta, S., Spiegel, C., Wack, M., and Zimmer, M. (2027). Fast Isotopy Computation for T-Curves. Mathematical Software – ICMS 2026, 16677. To appear. Associated with ICMS 2026. [URL] [arXiv]
   [BibTeX]

   @inproceedings{2026_ZoeEtAl_Isotopytcurves_2604-09221,
     year = {2027},
     booktitle = {Mathematical Software – ICMS 2026},
     series = {Lecture Notes in Computer Science},
     volume = {16677},
     publisher = {Springer Science+Business Media},
     note = {To appear},
     url = {https://icms-conference.org/2026/papers/paper32/main.pdf},
     archiveprefix = {arXiv},
     eprint = {2604.09221},
     arxiv = {arXiv:2604.09221},
     primaryclass = {math.AG},
     author = {Geiselmann, Zoe and Joswig, Michael and Kastner, Lars and Mundinger, Konrad and Pokutta, Sebastian and Spiegel, Christoph and Wack, Marcel and Zimmer, Max},
     title = {Fast Isotopy Computation for T-Curves}
   }

8. Turan, B., Asadulla, S., Steinmann, D., Kersting, K., Stammer, W., and Pokutta, S. (2026). Neural Concept Verifier: Scaling Prover-Verifier Games via Concept Encodings. Proceedings of the 43rd International Conference on Machine Learning, 306. Associated with ICML 2026. [arXiv]
   [BibTeX]

   @inproceedings{2025_TuranEtAl_Neuralconceptverifier_2507-07532,
     year = {2026},
     booktitle = {Proceedings of the 43rd International Conference on Machine Learning},
     series = {Proceedings of Machine Learning Research},
     volume = {306},
     month = jul,
     archiveprefix = {arXiv},
     eprint = {2507.07532},
     arxiv = {arXiv:2507.07532},
     primaryclass = {cs.LG},
     author = {Turan, Berkant and Asadulla, Suhrab and Steinmann, David and Kersting, Kristian and Stammer, Wolfgang and Pokutta, Sebastian},
     title = {Neural Concept Verifier: Scaling Prover-Verifier Games via Concept Encodings}
   }

9. Muhtar, D., Song, X., Pokutta, S., Zimmer, M., Pelleriti, N., Hofmann, T., and Liu, S. (2026). When Does Sparsity Mitigate the Curse of Depth in LLMs. Proceedings of the 43rd International Conference on Machine Learning, 306. Associated with ICML 2026. [arXiv]
   [BibTeX]

   @inproceedings{2026_DilxatEtAl_Sparsitydepthllms_2603-15389,
     year = {2026},
     booktitle = {Proceedings of the 43rd International Conference on Machine Learning},
     series = {Proceedings of Machine Learning Research},
     volume = {306},
     month = jul,
     archiveprefix = {arXiv},
     eprint = {2603.15389},
     arxiv = {arXiv:2603.15389},
     primaryclass = {cs.CL},
     author = {Muhtar, Dilxat and Song, Xinyuan and Pokutta, Sebastian and Zimmer, Max and Pelleriti, Nico and Hofmann, Thomas and Liu, Shiwei},
     title = {When Does Sparsity Mitigate the Curse of Depth in LLMs}
   }

10. Halbey, J., Deza, D., Zimmer, M., Roux, C., Stellato, B., and Pokutta, S. (2026). Lower Bounds for Frank-Wolfe on Strongly Convex Sets. Proceedings of the 43rd International Conference on Machine Learning, 306. Associated with ICML 2026. [arXiv]
    [BibTeX]

    @inproceedings{2026_HalbeyEtAl_Lowerboundsfrankwolfe_2602-04378,
      year = {2026},
      booktitle = {Proceedings of the 43rd International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {306},
      month = jul,
      archiveprefix = {arXiv},
      eprint = {2602.04378},
      arxiv = {arXiv:2602.04378},
      primaryclass = {math.OC},
      author = {Halbey, Jannis and Deza, Daniel and Zimmer, Max and Roux, Christophe and Stellato, Bartolomeo and Pokutta, Sebastian},
      title = {Lower Bounds for Frank-Wolfe on Strongly Convex Sets}
    }

11. Schiekiera, L., Zimmer, M., Roux, C., Pokutta, S., and Günther, F. (2026). From Associations to Activations: Comparing Behavioral and Hidden-State Semantic Geometry in LLMs. Proceedings of the 43rd International Conference on Machine Learning, 306. Associated with ICML 2026. [arXiv]
    [BibTeX]

    @inproceedings{2026_LouisEtAl_Behavioralgeometry_2602-00628,
      year = {2026},
      booktitle = {Proceedings of the 43rd International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {306},
      month = jul,
      archiveprefix = {arXiv},
      eprint = {2602.00628},
      arxiv = {arXiv:2602.00628},
      primaryclass = {cs.LG},
      author = {Schiekiera, Louis and Zimmer, Max and Roux, Christophe and Pokutta, Sebastian and Günther, Fritz},
      title = {From Associations to Activations: Comparing Behavioral and Hidden-State Semantic Geometry in LLMs}
    }

12. Leins, N., Gonnermann-Müller, J., Teichmann, M., and Pokutta, S. (2026). Beyond Static Instruction: A Multi-agent AI Framework for Adaptive Augmented Reality Robot Training. Companion Proceedings of the 21st ACM/IEEE International Conference on Human-Robot Interaction, 989–993. Associated with HRI 2026: Late-Breaking Reports. DOI: 10.1145/3776734.3794542 [URL] [arXiv]
    [BibTeX]

    @inproceedings{2026_LeinsGonnermannmuellerTeichmannPokutta_Multiagentar_2603-00016,
      year = {2026},
      date = {2026-03-04},
      booktitle = {Companion Proceedings of the 21st ACM/IEEE International Conference on Human-Robot Interaction},
      publisher = {Association for Computing Machinery},
      month = mar,
      pages = {989--993},
      doi = {10.1145/3776734.3794542},
      url = {https://dl.acm.org/doi/10.1145/3776734.3794542},
      archiveprefix = {arXiv},
      eprint = {2603.00016},
      arxiv = {arXiv:2603.00016},
      primaryclass = {cs.RO},
      author = {Leins, Nicolas and Gonnermann-Müller, Jana and Teichmann, Malte and Pokutta, Sebastian},
      title = {Beyond Static Instruction: A Multi-agent AI Framework for Adaptive Augmented Reality Robot Training}
    }

13. Urbano, A., Romero, D. W., Zimmer, M., and Pokutta, S. (2026, January). RECON: Robust symmetry discovery via Explicit Canonical Orientation Normalization. International Conference on Learning Representations 2026. Associated with ICLR 2026. [arXiv]
    [BibTeX]

    @inproceedings{2025_UrbanoWZimmerPokutta_Reconsymmetrydiscovery,
      year = {2026},
      booktitle = {International Conference on Learning Representations 2026},
      publisher = {ICLR (OpenReview)},
      month = jan,
      archiveprefix = {arXiv},
      eprint = {2505.13289},
      arxiv = {arXiv:2505.13289},
      primaryclass = {cs.LG},
      author = {Urbano, Alonso and Romero, David W. and Zimmer, Max and Pokutta, Sebastian},
      title = {RECON: Robust symmetry discovery via Explicit Canonical Orientation Normalization}
    }

14. Tadinada, S., Siebert, T., Fuhrmann, J., Pokutta, S., and Walther, A. (2026). An AD-enabled Frank-Wolfe Method for Non-smooth Optimization. Proceedings of the 2024 International Conference on Algorithmic Differentiation (AD), 90–106. Associated with AD 2024. DOI: 10.1137/1.9781611979039.7 [URL]
    [BibTeX]

    @inproceedings{2024_TadinadaEtAl_ADenabledFrankWolfe,
      year = {2026},
      booktitle = {Proceedings of the 2024 International Conference on Algorithmic Differentiation (AD)},
      publisher = {Society for Industrial and Applied Mathematics},
      pages = {90--106},
      doi = {10.1137/1.9781611979039.7},
      url = {https://epubs.siam.org/doi/10.1137/1.9781611979039.7},
      author = {Tadinada, Sri and Siebert, Tim and Fuhrmann, Jürgen and Pokutta, Sebastian and Walther, Andrea},
      title = {An AD-enabled Frank-Wolfe Method for Non-smooth Optimization}
    }

15. Iommazzo, G., Martínez-Rubio, D., Criado, F., Wirth, E., and Pokutta, S. (2026). Linear Convergence of the Frank-Wolfe Algorithm over Product Polytopes. Proceedings of The 29th International Conference on Artificial Intelligence and Statistics, 300. Associated with AISTATS 2026. [arXiv]
    [BibTeX]

    @inproceedings{2025_IommazzoEtAl_Frankwolfeconvergence,
      year = {2026},
      booktitle = {Proceedings of The 29th International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {300},
      archiveprefix = {arXiv},
      eprint = {2505.11259},
      arxiv = {arXiv:2505.11259},
      primaryclass = {math.OC},
      author = {Iommazzo, Gabriele and Martínez-Rubio, David and Criado, Francisco and Wirth, Elias and Pokutta, Sebastian},
      title = {Linear Convergence of the Frank-Wolfe Algorithm over Product Polytopes}
    }

16. Pelleriti, N., Spiegel, C., Liu, S., Martínez-Rubio, D., Zimmer, M., and Pokutta, S. (2026). Neural Sum-of-Squares: Certifying the Nonnegativity of Polynomials with Transformers. International Conference on Learning Representations 2026. Associated with ICLR 2026. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2025_PelleritiEtAl_Neuralsos_2510-13444,
      year = {2026},
      booktitle = {International Conference on Learning Representations 2026},
      publisher = {ICLR (OpenReview)},
      url = {https://proceedings.iclr.cc/paper_files/paper/2026/hash/1cfb3b066461f1c542be5242a622ce4b-Abstract-Conference.html},
      archiveprefix = {arXiv},
      eprint = {2510.13444},
      arxiv = {arXiv:2510.13444},
      primaryclass = {cs.LG},
      author = {Pelleriti, Nico and Spiegel, Christoph and Liu, Shiwei and Martínez-Rubio, David and Zimmer, Max and Pokutta, Sebastian},
      title = {Neural Sum-of-Squares: Certifying the Nonnegativity of Polynomials with Transformers}
    }

17. Xiao, W., Besançon, M., Gelß, P., Hendrych, D., Klus, S., and Pokutta, S. (2026). Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods. Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 16595, 614–630. Associated with CPAIOR 2026. DOI: 10.1007/978-3-032-27242-3_36 [arXiv]
    [BibTeX]

    @inproceedings{2025_XiaoEtAl_GraphisomorphismOptimization_2512-17417,
      year = {2026},
      booktitle = {Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
      series = {Lecture Notes in Computer Science},
      volume = {16595},
      publisher = {Springer Science+Business Media},
      pages = {614--630},
      doi = {10.1007/978-3-032-27242-3_36},
      archiveprefix = {arXiv},
      eprint = {2512.17417},
      arxiv = {arXiv:2512.17417},
      primaryclass = {math.OC},
      author = {Xiao, Wenjie and Besançon, Mathieu and Gelß, Patrick and Hendrych, Deborah and Klus, Stefan and Pokutta, Sebastian},
      title = {Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods}
    }

18. Djurdjevac Conrad, N., Pokutta, S., and Schütte, C. (2026). Measuring Model-Specific Alignment Drift in LLM-Based Opinion Dynamics. Accepted at Second Workshop on Large Language Models for Social Reasoning and Simulation @ NeurIPS 2026.
    [BibTeX]

    @misc{2026_DjurdjevacConradPokuttaSchuette_Alignmentdrift,
      howpublished = {Accepted at Second Workshop on Large Language Models for Social Reasoning and Simulation @ NeurIPS 2026},
      year = {2026},
      author = {Djurdjevac Conrad, Nataša and Pokutta, Sebastian and Schütte, Christof},
      title = {Measuring Model-Specific Alignment Drift in LLM-Based Opinion Dynamics}
    }

19. Gonnermann-Müller, J., Haase, J., Leins, N., Igel, M., Fackeldey, K., and Pokutta, S. (2026). FACET: Multi-Agent AI Supporting Teachers in Scaling Differentiated Learning for Diverse Students. Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence. Associated with IJCAI 2026. [arXiv]
    [BibTeX]

    @inproceedings{2026_GonnermannmuellerEtAl_Facetmultiagent_2601-22788,
      year = {2026},
      booktitle = {Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence},
      publisher = {International Joint Conferences on Artificial Intelligence Organization},
      archiveprefix = {arXiv},
      eprint = {2601.22788},
      arxiv = {arXiv:2601.22788},
      primaryclass = {cs.HC},
      author = {Gonnermann-Müller, Jana and Haase, Jennifer and Leins, Nicolas and Igel, Moritz and Fackeldey, Konstantin and Pokutta, Sebastian},
      title = {FACET: Multi-Agent AI Supporting Teachers in Scaling Differentiated Learning for Diverse Students}
    }

20. Gonnermann-Müller, J., Haase, J., Leins, N., Kosch, T., and Pokutta, S. (2026). Maintaining Stable Personas? Examining Temporal Stability in LLM-Based Human Simulation. Proceedings of the Extended Abstracts of the 2026 CHI Conference on Human Factors in Computing Systems, 1–6. Associated with CHI EA 2026. DOI: 10.1145/3772363.3799334 [arXiv]
    [BibTeX]

    @inproceedings{2026_GonnermannmuellerEtAl_Stablepersonas_2601-22812,
      year = {2026},
      booktitle = {Proceedings of the Extended Abstracts of the 2026 CHI Conference on Human Factors in Computing Systems},
      publisher = {Association for Computing Machinery},
      pages = {1--6},
      doi = {10.1145/3772363.3799334},
      archiveprefix = {arXiv},
      eprint = {2601.22812},
      arxiv = {arXiv:2601.22812},
      primaryclass = {cs.HC},
      author = {Gonnermann-Müller, Jana and Haase, Jennifer and Leins, Nicolas and Kosch, Thomas and Pokutta, Sebastian},
      title = {Maintaining Stable Personas? Examining Temporal Stability in LLM-Based Human Simulation}
    }

21. Haase, J., Gonnermann-Müller, J., Hanel, P. H. P., Leins, N., Kosch, T., Mendling, J., and Pokutta, S. (2026). It’s Not Just the Prompt: Model Choice Dominates LLM Creative Output. Proceedings of the Extended Abstracts of the 2026 CHI Conference on Human Factors in Computing Systems, 1–5. Associated with CHI EA 2026. DOI: 10.1145/3772363.3799284 [arXiv]
    [BibTeX]

    @inproceedings{2026_HaaseEtAl_Promptvariability_2601-21339,
      year = {2026},
      booktitle = {Proceedings of the Extended Abstracts of the 2026 CHI Conference on Human Factors in Computing Systems},
      publisher = {Association for Computing Machinery},
      pages = {1--5},
      doi = {10.1145/3772363.3799284},
      archiveprefix = {arXiv},
      eprint = {2601.21339},
      arxiv = {arXiv:2601.21339},
      primaryclass = {cs.AI},
      author = {Haase, Jennifer and Gonnermann-Müller, Jana and Hanel, Paul H. P. and Leins, Nicolas and Kosch, Thomas and Mendling, Jan and Pokutta, Sebastian},
      title = {It's Not Just the Prompt: Model Choice Dominates LLM Creative Output}
    }

22. Haase, J., and Pokutta, S. (2026). Structured Creativity Methods for Multi-Agent LLMs: Brainwriting Outperforms Disney and Double Diamond. Accepted at ICML 2026 Workshop on Human-AI Co-Creativity (GenAICreativity).
    [BibTeX]

    @misc{2026_HaasePokutta_BrainwritingCreativity,
      howpublished = {Accepted at ICML 2026 Workshop on Human-AI Co-Creativity (GenAICreativity)},
      year = {2026},
      author = {Haase, Jennifer and Pokutta, Sebastian},
      title = {Structured Creativity Methods for Multi-Agent LLMs: Brainwriting Outperforms Disney and Double Diamond}
    }

23. Haase, J., and Pokutta, S. (2026). The Missing Drive: Functional Analogs of Intrinsic Motivation in Large Language Models for Creative Tasks. Accepted at ICML 2026 Workshop on Human-AI Co-Creativity (GenAICreativity).
    [BibTeX]

    @misc{2026_HaasePokutta_MissingDrive,
      howpublished = {Accepted at ICML 2026 Workshop on Human-AI Co-Creativity (GenAICreativity)},
      year = {2026},
      author = {Haase, Jennifer and Pokutta, Sebastian},
      title = {The Missing Drive: Functional Analogs of Intrinsic Motivation in Large Language Models for Creative Tasks}
    }

24. Khoruzhii, K., Gelß, P., and Pokutta, S. (2026). Faster Algorithms for Structured Matrix Multiplication via Flip Graph Search. Proceedings of the 2026 International Symposium on Symbolic and Algebraic Computation, 227–236. Associated with ISSAC 2026. DOI: 10.1145/3815436.3815455 [arXiv]
    [BibTeX]

    @inproceedings{2026_KhoruzhiiGelssPokutta_Flipgraphsearch_2511-10786,
      year = {2026},
      booktitle = {Proceedings of the 2026 International Symposium on Symbolic and Algebraic Computation},
      publisher = {Association for Computing Machinery},
      pages = {227--236},
      doi = {10.1145/3815436.3815455},
      archiveprefix = {arXiv},
      eprint = {2511.10786},
      arxiv = {arXiv:2511.10786},
      primaryclass = {cs.SC},
      author = {Khoruzhii, Kirill and Gelß, Patrick and Pokutta, Sebastian},
      title = {Faster Algorithms for Structured Matrix Multiplication via Flip Graph Search}
    }

25. Leins, N., Pelleriti, N., Gonnermann-Müller, J., and Pokutta, S. (2026). When Does LLM Orchestration Pay Off? A Controlled Evaluation of Accuracy, Resources, and Task Difficulty. Accepted at NeurIPS 2026 Workshop on Resource-Aware Agentic AI. [arXiv]
    [BibTeX]

    @misc{2026_LeinsPelleritiGonnermannmuellerPokutta_Llmorchestration_2608-00685:1,
      howpublished = {Accepted at NeurIPS 2026 Workshop on Resource-Aware Agentic AI},
      year = {2026},
      archiveprefix = {arXiv},
      eprint = {2608.00685},
      arxiv = {arXiv:2608.00685},
      primaryclass = {cs.AI},
      author = {Leins, Nicolas and Pelleriti, Nico and Gonnermann-Müller, Jana and Pokutta, Sebastian},
      title = {When Does LLM Orchestration Pay Off? A Controlled Evaluation of Accuracy, Resources, and Task Difficulty}
    }

26. Pelleriti, N., Nelaturu, S. H., Zhou, Z., Li, Z., Zimmer, M., Han, B., and Pokutta, S. (2026). What Do Evolutionary Coding Agents Evolve? Accepted at NeurIPS 2026 Workshop on Self-Evolving Diversity-Driven Search for Robust AI Systems. [arXiv]
    [BibTeX]

    @misc{2026_PelleritiEtAl_Evotrace_2605-20086:1,
      howpublished = {Accepted at NeurIPS 2026 Workshop on Self-Evolving Diversity-Driven Search for Robust AI Systems},
      year = {2026},
      archiveprefix = {arXiv},
      eprint = {2605.20086},
      arxiv = {arXiv:2605.20086},
      primaryclass = {cs.NE},
      author = {Pelleriti, Nico and Nelaturu, Sree Harsha and Zhou, Zhanke and Li, Zongze and Zimmer, Max and Han, Bo and Pokutta, Sebastian},
      title = {What Do Evolutionary Coding Agents Evolve?}
    }

27. Pelleriti, N., Kraus, N., May, A., and Pokutta, S. (2026). CryptHarness: A Harness for Agent-Assisted Cryptanalytic Research. Accepted at NeurIPS 2026 Workshop on SaTQuML: Secure and Trustworthy Quantum Machine Learning.
    [BibTeX]

    @misc{2026_PelleritiKrausMayPokutta_CryptHarness,
      howpublished = {Accepted at NeurIPS 2026 Workshop on SaTQuML: Secure and Trustworthy Quantum Machine Learning},
      year = {2026},
      author = {Pelleriti, Nico and Kraus, Nicolai and May, Alexander and Pokutta, Sebastian},
      title = {CryptHarness: A Harness for Agent-Assisted Cryptanalytic Research}
    }

28. Pelleriti, N., Kraus, N., May, A., and Pokutta, S. (2026). CryptHarness: A Harness for Agent-Assisted Cryptanalytic Research. Accepted at Third Workshop on Agents in the Wild: Safety, Security, and Beyond @ NeurIPS 2026.
    [BibTeX]

    @misc{2026_PelleritiKrausMayPokutta_CryptHarness:1,
      howpublished = {Accepted at Third Workshop on Agents in the Wild: Safety, Security, and Beyond @ NeurIPS 2026},
      year = {2026},
      author = {Pelleriti, Nico and Kraus, Nicolai and May, Alexander and Pokutta, Sebastian},
      title = {CryptHarness: A Harness for Agent-Assisted Cryptanalytic Research}
    }

29. Pelleriti, N., Mundinger, K., Zimmer, M., and Pokutta, S. (2026). Zero: A Meta-Agent for Mathematical Research. Accepted at The Sixth Workshop on Mathematical Reasoning and AI @ NeurIPS 2026.
    [BibTeX]

    @misc{2026_PelleritiMundingerZimmerPokutta_Zero,
      howpublished = {Accepted at The Sixth Workshop on Mathematical Reasoning and AI @ NeurIPS 2026},
      year = {2026},
      author = {Pelleriti, Nico and Mundinger, Konrad and Zimmer, Max and Pokutta, Sebastian},
      title = {Zero: A Meta-Agent for Mathematical Research}
    }

30. Pelleriti, N., Mundinger, K., Zimmer, M., and Pokutta, S. (2026). Zero: A Meta-Agent for Mathematical Research. Accepted at First Workshop on Meta Agents: Managing Agents That Manage Agents @ NeurIPS 2026.
    [BibTeX]

    @misc{2026_PelleritiMundingerZimmerPokutta_Zero:1,
      howpublished = {Accepted at First Workshop on Meta Agents: Managing Agents That Manage Agents @ NeurIPS 2026},
      year = {2026},
      author = {Pelleriti, Nico and Mundinger, Konrad and Zimmer, Max and Pokutta, Sebastian},
      title = {Zero: A Meta-Agent for Mathematical Research}
    }

31. Petit-Tichanné, U., Pelleriti, N., Zimmer, M., and Pokutta, S. (2026). Learning the Coefficients of the Standard Volatility Forecaster. Accepted at NeurIPS 2026 Workshop TS-LIMITS: Generalization for Time Series in Tight Settings: Latency, Inference, Memory, PrIvacy and SusTainability.
    [BibTeX]

    @misc{2026_PetitTichannePelleritiZimmerPokutta_Volatilityforecaster,
      howpublished = {Accepted at NeurIPS 2026 Workshop TS-LIMITS: Generalization for Time Series in Tight Settings: Latency, Inference, Memory, PrIvacy and SusTainability},
      year = {2026},
      author = {Petit-Tichanné, Ulysse and Pelleriti, Nico and Zimmer, Max and Pokutta, Sebastian},
      title = {Learning the Coefficients of the Standard Volatility Forecaster}
    }

32. Zhou, Z., Li, Z., Huang, W., Li, X., Cao, C., Feng, X., Lu, X., Hu, J., Lu, M., Xie, Y., Pelleriti, N., Liu, S., Zimmer, M., Miranda, B., Yao, J., Liu, B., Koyejo, S., Pokutta, S., and Han, B. (2026). Reasoning Is More Than the Model: Harness-Aware Evaluation of Agents on Verifiable Reasoning Tasks. Accepted at ICML 2026 Workshop on AI As a Tool for Mathematics, Computer Science, and Machine Learning. [arXiv]
    [BibTeX]

    @misc{2026_ZhouEtAl_AlphaDianaVerifiableReasoning_2610-20675:1,
      howpublished = {Accepted at ICML 2026 Workshop on AI As a Tool for Mathematics, Computer Science, and Machine Learning},
      year = {2026},
      archiveprefix = {arXiv},
      eprint = {2610.20675},
      arxiv = {arXiv:2610.20675},
      primaryclass = {cs.AI},
      author = {Zhou, Zhanke and Li, Zongze and Huang, Weikai and Li, Xuan and Cao, Chentao and Feng, Xiao and Lu, Xiangyu and Hu, Jinbo and Lu, Menghan and Xie, Yi and Pelleriti, Nico and Liu, Shiyang and Zimmer, Max and Miranda, Brando and Yao, Jiangchao and Liu, Bo and Koyejo, Sanmi and Pokutta, Sebastian and Han, Bo},
      title = {Reasoning Is More Than the Model: Harness-Aware Evaluation of Agents on Verifiable Reasoning Tasks}
    }

33. Zhou, Z., Li, Z., Huang, W., Li, X., Cao, C., Feng, X., Lu, X., Hu, J., Lu, M., Xie, Y., Pelleriti, N., Liu, S., Zimmer, M., Miranda, B., Yao, J., Liu, B., Koyejo, S., Pokutta, S., and Han, B. (2026). Reasoning Is More Than the Model: Harness-Aware Evaluation of Agents on Verifiable Reasoning Tasks. Accepted at 3rd AI for Math Workshop: Toward Self-Evolving Scientific Agents @ ICML 2026. [arXiv]
    [BibTeX]

    @misc{2026_ZhouEtAl_AlphaDianaVerifiableReasoning_2610-20675:2,
      howpublished = {Accepted at 3rd AI for Math Workshop: Toward Self-Evolving Scientific Agents @ ICML 2026},
      year = {2026},
      archiveprefix = {arXiv},
      eprint = {2610.20675},
      arxiv = {arXiv:2610.20675},
      primaryclass = {cs.AI},
      author = {Zhou, Zhanke and Li, Zongze and Huang, Weikai and Li, Xuan and Cao, Chentao and Feng, Xiao and Lu, Xiangyu and Hu, Jinbo and Lu, Menghan and Xie, Yi and Pelleriti, Nico and Liu, Shiyang and Zimmer, Max and Miranda, Brando and Yao, Jiangchao and Liu, Bo and Koyejo, Sanmi and Pokutta, Sebastian and Han, Bo},
      title = {Reasoning Is More Than the Model: Harness-Aware Evaluation of Agents on Verifiable Reasoning Tasks}
    }

34. Zhou, Z., Li, Z., Huang, W., Li, X., Cao, C., Feng, X., Lu, X., Hu, J., Lu, M., Xie, Y., Pelleriti, N., Liu, S., Zimmer, M., Miranda, B., Yao, J., Liu, B., Koyejo, S., Pokutta, S., and Han, B. (2026). AlphaDiana: A System for Evaluating Reasoning Agents. Accepted at NeurIPS 2026 Workshop on Towards Test-Time Continual Learning Agents. [arXiv]
    [BibTeX]

    @misc{2026_ZhouEtAl_AlphaDianaVerifiableReasoning_2610-20675:3,
      howpublished = {Accepted at NeurIPS 2026 Workshop on Towards Test-Time Continual Learning Agents},
      year = {2026},
      archiveprefix = {arXiv},
      eprint = {2610.20675},
      arxiv = {arXiv:2610.20675},
      primaryclass = {cs.AI},
      author = {Zhou, Zhanke and Li, Zongze and Huang, Weikai and Li, Xuan and Cao, Chentao and Feng, Xiao and Lu, Xiangyu and Hu, Jinbo and Lu, Menghan and Xie, Yi and Pelleriti, Nico and Liu, Shiyang and Zimmer, Max and Miranda, Brando and Yao, Jiangchao and Liu, Bo and Koyejo, Sanmi and Pokutta, Sebastian and Han, Bo},
      title = {AlphaDiana: A System for Evaluating Reasoning Agents}
    }

35. Zhou, Z., Li, Z., Huang, W., Li, X., Cao, C., Feng, X., Lu, X., Hu, J., Lu, M., Xie, Y., Pelleriti, N., Liu, S., Zimmer, M., Miranda, B., Yao, J., Liu, B., Koyejo, S., Pokutta, S., and Han, B. (2026). AlphaDiana: A System for Evaluating Reasoning Agents. Accepted at The Sixth Workshop on Mathematical Reasoning and AI @ NeurIPS 2026. [arXiv]
    [BibTeX]

    @misc{2026_ZhouEtAl_AlphaDianaVerifiableReasoning_2610-20675:4,
      howpublished = {Accepted at The Sixth Workshop on Mathematical Reasoning and AI @ NeurIPS 2026},
      year = {2026},
      archiveprefix = {arXiv},
      eprint = {2610.20675},
      arxiv = {arXiv:2610.20675},
      primaryclass = {cs.AI},
      author = {Zhou, Zhanke and Li, Zongze and Huang, Weikai and Li, Xuan and Cao, Chentao and Feng, Xiao and Lu, Xiangyu and Hu, Jinbo and Lu, Menghan and Xie, Yi and Pelleriti, Nico and Liu, Shiyang and Zimmer, Max and Miranda, Brando and Yao, Jiangchao and Liu, Bo and Koyejo, Sanmi and Pokutta, Sebastian and Han, Bo},
      title = {AlphaDiana: A System for Evaluating Reasoning Agents}
    }

36. Głuch, G., Turan, B., Nagarajan, S. G., and Pokutta, S. (2025). The Good, the Bad and the Ugly: Meta-Analysis of Watermarks, Transferable Attacks and Adversarial Defenses. Advances in Neural Information Processing Systems, 38. Associated with NeurIPS 2025. [arXiv]
    [BibTeX]

    @inproceedings{2024_GrzegorzTuranNagarajanPokutta_Watermarksadversarialdefenses,
      year = {2025},
      booktitle = {Advances in Neural Information Processing Systems},
      series = {Advances in Neural Information Processing Systems},
      volume = {38},
      publisher = {Curran Associates},
      month = sep,
      archiveprefix = {arXiv},
      eprint = {2410.08864},
      arxiv = {arXiv:2410.08864},
      primaryclass = {cs.LG},
      author = {Głuch, Grzegorz and Turan, Berkant and Nagarajan, Sai Ganesh and Pokutta, Sebastian},
      title = {The Good, the Bad and the Ugly: Meta-Analysis of Watermarks, Transferable Attacks and Adversarial Defenses}
    }

37. Halbey, J., Rakotomandimby, S., Besançon, M., Designolle, S., and Pokutta, S. (2025). Efficient Quadratic Corrections for Frank-Wolfe Algorithms. Advances in Neural Information Processing Systems, 38. Associated with NeurIPS 2025. [arXiv]
    [BibTeX]

    @inproceedings{2025_HalbeyRakotomandimbyBesanconDesignollePokutta_Quadraticcorrections_2506-02635,
      year = {2025},
      booktitle = {Advances in Neural Information Processing Systems},
      series = {Advances in Neural Information Processing Systems},
      volume = {38},
      publisher = {Curran Associates},
      month = sep,
      archiveprefix = {arXiv},
      eprint = {2506.02635},
      arxiv = {arXiv:2506.02635},
      primaryclass = {math.OC},
      author = {Halbey, Jannis and Rakotomandimby, Seta and Besançon, Mathieu and Designolle, Sébastien and Pokutta, Sebastian},
      title = {Efficient Quadratic Corrections for Frank-Wolfe Algorithms}
    }

38. Kera, H., Pelleriti, N., Ishihara, Y., Zimmer, M., and Pokutta, S. (2025). Computational Algebra with Attention: Transformer Oracles for Border Basis Algorithms. Advances in Neural Information Processing Systems, 38. Associated with NeurIPS 2025. [arXiv]
    [BibTeX]

    @inproceedings{2025_KeraEtAl_Transformeroracles_2505-23696,
      year = {2025},
      booktitle = {Advances in Neural Information Processing Systems},
      series = {Advances in Neural Information Processing Systems},
      volume = {38},
      publisher = {Curran Associates},
      month = sep,
      archiveprefix = {arXiv},
      eprint = {2505.23696},
      arxiv = {arXiv:2505.23696},
      primaryclass = {cs.LG},
      author = {Kera, Hiroshi and Pelleriti, Nico and Ishihara, Yuki and Zimmer, Max and Pokutta, Sebastian},
      title = {Computational Algebra with Attention: Transformer Oracles for Border Basis Algorithms}
    }

39. Haase, J., Hanel, P. H. P., and Pokutta, S. (2025). S-DAT: A Multilingual, GenAI-Driven Framework for Automated Divergent Thinking Assessment. Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society, 8(2), 1194–1205. Associated with AIES 2025. [URL] [arXiv]
    [BibTeX]

    @article{2025_HaasePPokutta_SdatDivergentthinking:1,
      year = {2025},
      journal = {Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society},
      volume = {8},
      number = {2},
      month = jul,
      pages = {1194--1205},
      url = {https://arxiv.org/pdf/2505.09068},
      archiveprefix = {arXiv},
      eprint = {2505.09068},
      arxiv = {arXiv:2505.09068},
      primaryclass = {cs.CL},
      author = {Haase, Jennifer and Hanel, Paul H. P. and Pokutta, Sebastian},
      title = {S-DAT: A Multilingual, GenAI-Driven Framework for Automated Divergent Thinking Assessment}
    }

40. Mundinger, K., Zimmer, M., Kiem, A., Spiegel, C., and Pokutta, S. (2025). Neural Discovery in Mathematics: Do Machines Dream of Colored Planes? Proceedings of the 42nd International Conference on Machine Learning, 267, 45236–45255. Associated with ICML 2025. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2025_MundingerZimmerKiemSpiegelPokutta_NeuralDiscovery,
      year = {2025},
      booktitle = {Proceedings of the 42nd International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {267},
      month = jul,
      pages = {45236--45255},
      url = {https://proceedings.mlr.press/v267/mundinger25a.html},
      archiveprefix = {arXiv},
      eprint = {2501.18527},
      arxiv = {arXiv:2501.18527},
      primaryclass = {cs.LG},
      author = {Mundinger, Konrad and Zimmer, Max and Kiem, Aldo and Spiegel, Christoph and Pokutta, Sebastian},
      title = {Neural Discovery in Mathematics: Do Machines Dream of Colored Planes?}
    }

41. Turan, B., Asadulla, S., Steinmann, D., Kersting, K., Stammer, W., and Pokutta, S. (2025). Neural Concept Verifier: Scaling Prover-Verifier Games via Concept Encodings. Accepted at Actionable Interpretability Workshop at ICML 2025. [arXiv]
    [BibTeX]

    @misc{2025_TuranEtAl_Neuralconceptverifier_2507-07532:1,
      howpublished = {Accepted at Actionable Interpretability Workshop at ICML 2025},
      year = {2025},
      month = jul,
      archiveprefix = {arXiv},
      eprint = {2507.07532},
      arxiv = {arXiv:2507.07532},
      primaryclass = {cs.LG},
      author = {Turan, Berkant and Asadulla, Suhrab and Steinmann, David and Kersting, Kristian and Stammer, Wolfgang and Pokutta, Sebastian},
      title = {Neural Concept Verifier: Scaling Prover-Verifier Games via Concept Encodings}
    }

42. Hendrych, D., Besançon, M., Martínez-Rubio, D., and Pokutta, S. (2025). Secant Line Search for Frank-Wolfe Algorithms. Proceedings of the 42nd International Conference on Machine Learning, 267. Associated with ICML 2025. [arXiv]
    [BibTeX]

    @inproceedings{2025_HendrychBesanconMartinezrubioPokutta_Secantfrankwolfe,
      year = {2025},
      booktitle = {Proceedings of the 42nd International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {267},
      month = may,
      archiveprefix = {arXiv},
      eprint = {2501.18775},
      arxiv = {arXiv:2501.18775},
      primaryclass = {math.OC},
      author = {Hendrych, Deborah and Besançon, Mathieu and Martínez-Rubio, David and Pokutta, Sebastian},
      title = {Secant Line Search for Frank-Wolfe Algorithms}
    }

43. Pauls, J., Zimmer, M., Turan, B., Saatchi, S., Ciais, P., Pokutta, S., and Gieseke, F. (2025). Capturing Temporal Dynamics in Large-Scale Canopy Tree Height Estimation. Proceedings of the 42nd International Conference on Machine Learning, 267. Associated with ICML 2025. [arXiv]
    [BibTeX]

    @inproceedings{2025_JanEtAl_Temporalcanopyheight,
      year = {2025},
      booktitle = {Proceedings of the 42nd International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {267},
      month = may,
      archiveprefix = {arXiv},
      eprint = {2501.19328},
      arxiv = {arXiv:2501.19328},
      primaryclass = {cs.LG},
      author = {Pauls, Jan and Zimmer, Max and Turan, Berkant and Saatchi, Sassan and Ciais, Philippe and Pokutta, Sebastian and Gieseke, Fabian},
      title = {Capturing Temporal Dynamics in Large-Scale Canopy Tree Height Estimation}
    }

44. Pelleriti, N., Zimmer, M., Wirth, E., and Pokutta, S. (2025). Approximating Latent Manifolds in Neural Networks via Vanishing Ideals. Proceedings of the 42nd International Conference on Machine Learning, 267. Associated with ICML 2025. [arXiv]
    [BibTeX]

    @inproceedings{2025_PelleritiZimmerWirthPokutta_Latentmanifolds,
      year = {2025},
      booktitle = {Proceedings of the 42nd International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {267},
      month = may,
      archiveprefix = {arXiv},
      eprint = {2502.15051},
      arxiv = {arXiv:2502.15051},
      primaryclass = {cs.LG},
      author = {Pelleriti, Nico and Zimmer, Max and Wirth, Elias and Pokutta, Sebastian},
      title = {Approximating Latent Manifolds in Neural Networks via Vanishing Ideals}
    }

45. Roux, C., Martínez-Rubio, D., and Pokutta, S. (2025). Implicit Riemannian Optimism with Applications to Min-Max Problems. Proceedings of the 42nd International Conference on Machine Learning, 267, 52139–52172. Associated with ICML 2025. [arXiv]
    [BibTeX]

    @inproceedings{2025_RouxMartinezrubioPokutta_ImplicitRiemannian,
      year = {2025},
      booktitle = {Proceedings of the 42nd International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {267},
      month = may,
      pages = {52139--52172},
      archiveprefix = {arXiv},
      eprint = {2501.18381},
      arxiv = {arXiv:2501.18381},
      primaryclass = {math.OC},
      author = {Roux, Christophe and Martínez-Rubio, David and Pokutta, Sebastian},
      title = {Implicit Riemannian Optimism with Applications to Min-Max Problems}
    }

46. Zimmer, M., Spiegel, C., and Pokutta, S. (2025). Compression-aware training of neural networks using Frank–Wolfe. Mathematical Optimization for Machine Learning, 137–168. DOI: 10.1515/9783111376776-010 [arXiv]
    [BibTeX]

    @inproceedings{2022_ZimmerSpiegelPokutta_Compressionawaretraining,
      year = {2025},
      date = {2025-04-22},
      booktitle = {Mathematical Optimization for Machine Learning},
      series = {De Gruyter Proceedings in Mathematics},
      publisher = {Walter de Gruyter},
      month = apr,
      pages = {137--168},
      doi = {10.1515/9783111376776-010},
      archiveprefix = {arXiv},
      eprint = {2205.11921},
      arxiv = {arXiv:2205.11921},
      primaryclass = {cs.LG},
      author = {Zimmer, Max and Spiegel, Christoph and Pokutta, Sebastian},
      title = {Compression-aware training of neural networks using Frank–Wolfe}
    }

47. Troppens, H., Besançon, M., Wilken, S. E., and Pokutta, S. (2025). Mixed-Integer Optimization for Loopless Flux Distributions in Metabolic Networks. 23rd International Symposium on Experimental Algorithms (SEA 2025), 338, 26:1–26:18. Associated with SEA 2025. DOI: 10.4230/LIPIcs.SEA.2025.26 [arXiv]
    [BibTeX]

    @inproceedings{2025_TroppensBesanconWilkenPokutta_Mixedintegerloopless,
      year = {2025},
      booktitle = {23rd International Symposium on Experimental Algorithms (SEA 2025)},
      series = {Leibniz International Proceedings in Informatics},
      volume = {338},
      publisher = {Schloss Dagstuhl – Leibniz Center for Informatics},
      month = apr,
      pages = {26:1--26:18},
      doi = {10.4230/LIPIcs.SEA.2025.26},
      archiveprefix = {arXiv},
      eprint = {2502.00807},
      arxiv = {arXiv:2502.00807},
      primaryclass = {math.OC},
      author = {Troppens, Hannah and Besançon, Mathieu and Wilken, St. Elmo and Pokutta, Sebastian},
      title = {Mixed-Integer Optimization for Loopless Flux Distributions in Metabolic Networks}
    }

48. Głuch, G., Turan, B., Nagarajan, S. G., and Pokutta, S. (2025). The Good, the Bad and the Ugly: Meta-Analysis of Watermarks, Transferable Attacks and Adversarial Defenses. Accepted at ICLR 2025: Workshop on GenAI Watermarking @ ICLR 2025. [arXiv]
    [BibTeX]

    @misc{2024_GrzegorzTuranNagarajanPokutta_Watermarksadversarialdefenses:2,
      howpublished = {Accepted at ICLR 2025: Workshop on GenAI Watermarking @ ICLR 2025},
      year = {2025},
      month = mar,
      archiveprefix = {arXiv},
      eprint = {2410.08864},
      arxiv = {arXiv:2410.08864},
      primaryclass = {cs.LG},
      author = {Głuch, Grzegorz and Turan, Berkant and Nagarajan, Sai Ganesh and Pokutta, Sebastian},
      title = {The Good, the Bad and the Ugly: Meta-Analysis of Watermarks, Transferable Attacks and Adversarial Defenses}
    }

49. Lasby, M., Zimmer, M., Pokutta, S., and Schultheis, E. (2025). Compressed sparse tiles for memory-efficient unstructured and semi-structured sparsity. Accepted at Workshop on Sparsity in LLMs (SLLM): Deep Dive Into Mixture of Experts, Quantization, Hardware, and Inference. [URL]
    [BibTeX]

    @misc{2025_LasbyZimmerPokuttaSchultheis_SparseTiles,
      howpublished = {Accepted at Workshop on Sparsity in LLMs (SLLM): Deep Dive Into Mixture of Experts, Quantization, Hardware, and Inference},
      year = {2025},
      month = mar,
      url = {https://openreview.net/forum?id=iso0KV2HVq},
      author = {Lasby, Mike and Zimmer, Max and Pokutta, Sebastian and Schultheis, Erik},
      title = {Compressed sparse tiles for memory-efficient unstructured and semi-structured sparsity}
    }

50. Martínez-Rubio, D., Roux, C., Criscitiello, C., and Pokutta, S. (2025). Accelerated Methods for Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties. Proceedings of The 28th International Conference on Artificial Intelligence and Statistics, 258, 280–288. Associated with AISTATS 2025. [arXiv]
    [BibTeX]

    @inproceedings{2023_MartinezrubioRouxCriscitielloPokutta_Riemannianminmax,
      year = {2025},
      booktitle = {Proceedings of The 28th International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {258},
      month = jan,
      pages = {280--288},
      archiveprefix = {arXiv},
      eprint = {2305.16186},
      arxiv = {arXiv:2305.16186},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Roux, Christophe and Criscitiello, Christopher and Pokutta, Sebastian},
      title = {Accelerated Methods for Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties}
    }

51. Sadiku, S., Wagner, M., and Pokutta, S. (2025, January). GSE: Group-wise Sparse and Explainable Adversarial Attacks. International Conference on Learning Representations 2025. Associated with ICLR 2025. [arXiv]
    [BibTeX]

    @inproceedings{2023_SadikuWagnerPokutta_Groupwisesparseattacks,
      year = {2025},
      booktitle = {International Conference on Learning Representations 2025},
      publisher = {ICLR (OpenReview)},
      month = jan,
      archiveprefix = {arXiv},
      eprint = {2311.17434},
      arxiv = {arXiv:2311.17434},
      primaryclass = {cs.CV},
      author = {Sadiku, Shpresim and Wagner, Moritz and Pokutta, Sebastian},
      title = {GSE: Group-wise Sparse and Explainable Adversarial Attacks}
    }

52. Roux, C., Zimmer, M., and Pokutta, S. (2025, January). On the Byzantine-Resilience of Distillation-Based Federated Learning. International Conference on Learning Representations 2025. Associated with ICLR 2025. [arXiv]
    [BibTeX]

    @inproceedings{2024_RouxZimmerPokutta_Byzantineresilience,
      year = {2025},
      booktitle = {International Conference on Learning Representations 2025},
      publisher = {ICLR (OpenReview)},
      month = jan,
      archiveprefix = {arXiv},
      eprint = {2402.12265},
      arxiv = {arXiv:2402.12265},
      primaryclass = {cs.LG},
      author = {Roux, Christophe and Zimmer, Max and Pokutta, Sebastian},
      title = {On the Byzantine-Resilience of Distillation-Based Federated Learning}
    }

53. Sadiku, S., Wagner, M., Nagarajan, S. G., and Pokutta, S. (2025). S-CFE: Simple Counterfactual Explanations. Proceedings of The 28th International Conference on Artificial Intelligence and Statistics, 258. Associated with AISTATS 2025. [arXiv]
    [BibTeX]

    @inproceedings{2024_SadikuEtAl_Counterfactualexplanations,
      year = {2025},
      booktitle = {Proceedings of The 28th International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {258},
      month = jan,
      archiveprefix = {arXiv},
      eprint = {2410.15723},
      arxiv = {arXiv:2410.15723},
      primaryclass = {cs.LG},
      author = {Sadiku, Shpresim and Wagner, Moritz and Nagarajan, Sai Ganesh and Pokutta, Sebastian},
      title = {S-CFE: Simple Counterfactual Explanations}
    }

54. Wirth, E., Besançon, M., and Pokutta, S. (2025). The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control. Proceedings of The 28th International Conference on Artificial Intelligence and Statistics, 258, 271–279. Associated with AISTATS 2025. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2024_WirthBesanconPokutta_Pivotingframework,
      year = {2025},
      booktitle = {Proceedings of The 28th International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {258},
      month = jan,
      pages = {271--279},
      url = {https://proceedings.mlr.press/v258/besancon25a.html},
      archiveprefix = {arXiv},
      eprint = {2407.11760},
      arxiv = {arXiv:2407.11760},
      primaryclass = {math.OC},
      author = {Wirth, Elias and Besançon, Mathieu and Pokutta, Sebastian},
      title = {The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control}
    }

55. Fackeldey, K., Kannan, A., Pokutta, S., Sharma, K., Walter, D., Walther, A., and Weiser, M. (2025). Mathematical Optimization for Machine Learning. Mathematical Optimization for Machine Learning. DOI: 10.1515/9783111376776 [URL]
    [BibTeX]

    @inproceedings{2025_FackeldeyEtAl_MathematicalOptimization,
      year = {2025},
      booktitle = {Mathematical Optimization for Machine Learning},
      series = {De Gruyter Proceedings in Mathematics},
      publisher = {Walter de Gruyter},
      doi = {10.1515/9783111376776},
      url = {https://www.degruyterbrill.com/document/doi/10.1515/9783111376776/html},
      author = {Fackeldey, Konstantin and Kannan, Aswin and Pokutta, Sebastian and Sharma, Kartikey and Walter, Daniel and Walther, Andrea and Weiser, Martin},
      title = {Mathematical Optimization for Machine Learning}
    }

56. Pauls, J., Zimmer, M., Kelly, U. M., Schwartz, M., Saatchi, S., Ciais, P., Pokutta, S., Brandt, M., and Gieseke, F. (2024). Estimating Canopy Height at Scale. Proceedings of the 41st International Conference on Machine Learning, 235. Associated with ICML 2024. [arXiv] [code]
    [BibTeX]

    @inproceedings{2024_PaulsEtAl_Canopyheightestimation,
      year = {2024},
      booktitle = {Proceedings of the 41st International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {235},
      month = may,
      archiveprefix = {arXiv},
      eprint = {2406.01076},
      arxiv = {arXiv:2406.01076},
      primaryclass = {cs.CV},
      author = {Pauls, Jan and Zimmer, Max and Kelly, Una M and Schwartz, Martin and Saatchi, Sassan and Ciais, Philippe and Pokutta, Sebastian and Brandt, Martin and Gieseke, Fabian},
      title = {Estimating Canopy Height at Scale},
      code = {https://github.com/AI4Forest/Global-Canopy-Height-Map}
    }

57. Hendrych, D., Besançon, M., and Pokutta, S. (2024). Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods. 22nd International Symposium on Experimental Algorithms (SEA 2024), 301, 16:1–16:22. Associated with SEA 2024. DOI: 10.4230/LIPIcs.SEA.2024.16 [arXiv] [code]
    [BibTeX]

    @inproceedings{2023_HendrychBesanconPokutta_Optimalexperimentdesign,
      year = {2024},
      booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
      series = {Leibniz International Proceedings in Informatics},
      volume = {301},
      publisher = {Schloss Dagstuhl – Leibniz Center for Informatics},
      month = apr,
      pages = {16:1--16:22},
      doi = {10.4230/LIPIcs.SEA.2024.16},
      archiveprefix = {arXiv},
      eprint = {2312.11200},
      arxiv = {arXiv:2312.11200},
      primaryclass = {math.OC},
      author = {Hendrych, Deborah and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods},
      code = {https://github.com/ZIB-IOL/OptimalDesignWithBoscia}
    }

58. Mundinger, K., Zimmer, M., and Pokutta, S. (2024). Neural Parameter Regression for Explicit Representations of PDE Solution Operators. Accepted at ICLR 2024: AI4DifferentialEquations in Science. [URL] [arXiv]
    [BibTeX]

    @misc{2024_MundingerZimmerPokutta_Neuralparameterregression:1,
      howpublished = {Accepted at ICLR 2024: AI4DifferentialEquations in Science},
      year = {2024},
      month = mar,
      url = {https://openreview.net/forum?id=6Z0q0dzSJQ},
      archiveprefix = {arXiv},
      eprint = {2403.12764},
      arxiv = {arXiv:2403.12764},
      primaryclass = {cs.LG},
      author = {Mundinger, Konrad and Zimmer, Max and Pokutta, Sebastian},
      title = {Neural Parameter Regression for Explicit Representations of PDE Solution Operators}
    }

59. Wäldchen, S., Sharma, K., Turan, B., Zimmer, M., and Pokutta, S. (2024). Interpretability Guarantees with Merlin-Arthur Classifiers. Proceedings of The 27th International Conference on Artificial Intelligence and Statistics, 238. Associated with AISTATS 2024. [arXiv]
    [BibTeX]

    @inproceedings{2022_WaeldchenEtAl_Interpretabilityguarantees,
      year = {2024},
      booktitle = {Proceedings of The 27th International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {238},
      month = jan,
      archiveprefix = {arXiv},
      eprint = {2206.00759},
      arxiv = {arXiv:2206.00759},
      primaryclass = {cs.LG},
      author = {Wäldchen, Stephan and Sharma, Kartikey and Turan, Berkant and Zimmer, Max and Pokutta, Sebastian},
      title = {Interpretability Guarantees with Merlin-Arthur Classifiers}
    }

60. Kiem, A., Pokutta, S., and Spiegel, C. (2024). The Four-Color Ramsey Multiplicity of Triangles. Discrete Mathematics Days 2024, 20, 13–18. Associated with DMD 2024. [URL] [arXiv] [code]
    [BibTeX]

    @inproceedings{2023_KiemPokuttaSpiegel_4colorramsey:1,
      year = {2024},
      booktitle = {Discrete Mathematics Days 2024},
      series = {Obras Colectivas Ciencias},
      volume = {20},
      publisher = {Editorial Universidad de Alcalá},
      pages = {13--18},
      url = {https://dmd2024.web.uah.es/files/abstracts/paper_3.pdf},
      archiveprefix = {arXiv},
      eprint = {2312.08049},
      arxiv = {arXiv:2312.08049},
      primaryclass = {math.CO},
      author = {Kiem, Aldo and Pokutta, Sebastian and Spiegel, Christoph},
      title = {The Four-Color Ramsey Multiplicity of Triangles},
      code = {https://github.com/FordUniver/kps_trianglemult}
    }

61. Zimmer, M., Spiegel, C., and Pokutta, S. (2024). Sparse Model Soups: A Recipe for Improved Pruning via Model Averaging. International Conference on Learning Representations 2024. Associated with ICLR 2024. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2023_ZimmerSpiegelPokutta_Sparsemodelsoups,
      year = {2024},
      booktitle = {International Conference on Learning Representations 2024},
      publisher = {ICLR (OpenReview)},
      url = {https://iclr.cc/virtual/2024/poster/17433},
      archiveprefix = {arXiv},
      eprint = {2306.16788},
      arxiv = {arXiv:2306.16788},
      primaryclass = {cs.LG},
      author = {Zimmer, Max and Spiegel, Christoph and Pokutta, Sebastian},
      title = {Sparse Model Soups: A Recipe for Improved Pruning via Model Averaging}
    }

62. Kiem, A., Pokutta, S., and Spiegel, C. (2024). Categorification of Flag Algebras. Discrete Mathematics Days 2024, 20, 259–264. Associated with DMD 2024. [URL]
    [BibTeX]

    @inproceedings{2024_KiemPokuttaSpiegel_Categorificationflagalgebras,
      year = {2024},
      booktitle = {Discrete Mathematics Days 2024},
      series = {Obras Colectivas Ciencias},
      volume = {20},
      publisher = {Editorial Universidad de Alcalá},
      pages = {259--264},
      url = {https://dmd2024.web.uah.es/files/abstracts/paper_47.pdf},
      author = {Kiem, Aldo and Pokutta, Sebastian and Spiegel, Christoph},
      title = {Categorification of Flag Algebras}
    }

63. Martínez-Rubio, D., Roux, C., and Pokutta, S. (2024). Convergence and Trade-Offs in Riemannian Gradient Descent and Riemannian Proximal Point. Proceedings of the 41st International Conference on Machine Learning, 235. Associated with ICML 2024. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2024_MartinezrubioRouxPokutta_Riemanniangradientdescent,
      year = {2024},
      booktitle = {Proceedings of the 41st International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {235},
      url = {https://proceedings.mlr.press/v235/marti-nez-rubio24a.html},
      archiveprefix = {arXiv},
      eprint = {2403.10429},
      arxiv = {arXiv:2403.10429},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Roux, Christophe and Pokutta, Sebastian},
      title = {Convergence and Trade-Offs in Riemannian Gradient Descent and Riemannian Proximal Point}
    }

64. Mundinger, K., Pokutta, S., Spiegel, C., and Zimmer, M. (2024). Extending the Continuum of Six-Colorings. Discrete Mathematics Days 2024, 20, 178–183. Associated with DMD 2024. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2024_MundingerPokuttaSpiegelZimmer_SixcoloringsExpansion:1,
      year = {2024},
      booktitle = {Discrete Mathematics Days 2024},
      series = {Obras Colectivas Ciencias},
      volume = {20},
      publisher = {Editorial Universidad de Alcalá},
      pages = {178--183},
      url = {https://dmd2024.web.uah.es/files/abstracts/paper_27.pdf},
      archiveprefix = {arXiv},
      eprint = {2404.05509},
      arxiv = {arXiv:2404.05509},
      primaryclass = {math.CO},
      author = {Mundinger, Konrad and Pokutta, Sebastian and Spiegel, Christoph and Zimmer, Max},
      title = {Extending the Continuum of Six-Colorings}
    }

65. Sharma, K., Hendrych, D., Besançon, M., and Pokutta, S. (2024). Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe. Accepted at INFORMS Optimization Society Conference. [arXiv]
    [BibTeX]

    @misc{2024_SharmaHendrychBesanconPokutta_NetworkdesignMicoFrankwolfe:1,
      howpublished = {Accepted at INFORMS Optimization Society Conference},
      year = {2024},
      archiveprefix = {arXiv},
      eprint = {2402.00166},
      arxiv = {arXiv:2402.00166},
      primaryclass = {math.OC},
      author = {Sharma, Kartikey and Hendrych, Deborah and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe}
    }

66. Thuerck, D., Sofranac, B., Pfetsch, M., and Pokutta, S. (2023). Learning Cuts via Enumeration Oracles. Advances in Neural Information Processing Systems, 36, 79108–79123. Associated with NeurIPS 2023. DOI: 10.52202/075280-3461 [arXiv]
    [BibTeX]

    @inproceedings{2023_ThuerckSofranacPfetschPokutta_Learningcutsenumeration,
      year = {2023},
      booktitle = {Advances in Neural Information Processing Systems},
      series = {Advances in Neural Information Processing Systems},
      volume = {36},
      publisher = {Curran Associates},
      month = sep,
      pages = {79108--79123},
      doi = {10.52202/075280-3461},
      archiveprefix = {arXiv},
      eprint = {2305.12197},
      arxiv = {arXiv:2305.12197},
      primaryclass = {math.OC},
      author = {Thuerck, Daniel and Sofranac, Boro and Pfetsch, Marc and Pokutta, Sebastian},
      title = {Learning Cuts via Enumeration Oracles}
    }

67. Parczyk, O., Pokutta, S., Spiegel, C., and Szabó, T. (2023). Fully Computer-Assisted Proofs in Extremal Combinatorics. Proceedings of the AAAI Conference on Artificial Intelligence, 37(10), 12482–12490. Associated with AAAI 2023. DOI: 10.1609/aaai.v37i10.26470 [URL] [arXiv] [code]
    [BibTeX]

    @article{2022_ParczykPokuttaSpiegelSzabo_Ramseymultiplicityheuristics:2,
      year = {2023},
      date = {2023-06-26},
      journal = {Proceedings of the AAAI Conference on Artificial Intelligence},
      volume = {37},
      number = {10},
      month = jun,
      pages = {12482--12490},
      doi = {10.1609/aaai.v37i10.26470},
      url = {https://ojs.aaai.org/index.php/AAAI/article/view/26470},
      archiveprefix = {arXiv},
      eprint = {2206.04036},
      arxiv = {arXiv:2206.04036},
      primaryclass = {math.CO},
      author = {Parczyk, Olaf and Pokutta, Sebastian and Spiegel, Christoph and Szabó, Tibor},
      title = {Fully Computer-Assisted Proofs in Extremal Combinatorics},
      code = {https://zenodo.org/record/6602512#.YyvFhi8Rr5g}
    }

68. Martínez-Rubio, D., and Pokutta, S. (2023). Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties. Proceedings of Thirty Sixth Conference on Learning Theory, 195. Associated with COLT 2023. [URL] [arXiv] [poster]
    [BibTeX]

    @inproceedings{2022_MartinezrubioPokutta_Acceleratedriemannian,
      year = {2023},
      booktitle = {Proceedings of Thirty Sixth Conference on Learning Theory},
      series = {Proceedings of Machine Learning Research},
      volume = {195},
      month = may,
      url = {https://proceedings.mlr.press/v195/martinez-rubio23a/martinez-rubio23a.pdf},
      archiveprefix = {arXiv},
      eprint = {2211.14645},
      arxiv = {arXiv:2211.14645},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Pokutta, Sebastian},
      title = {Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties},
      poster = {https://pokutta.com/slides/20221203_poster_neurips_riemannian.pdf}
    }

69. Chmiela, A., Gleixner, A., Lichocki, P., and Pokutta, S. (2023). Online Learning for Scheduling MIP Heuristics. Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 13884, 114–123. Associated with CPAIOR 2023. DOI: 10.1007/978-3-031-33271-5_8 [arXiv]
    [BibTeX]

    @inproceedings{2023_ChmielaGleixnerLichockiPokutta_Onlinelearningscheduling,
      year = {2023},
      date = {2023-05-23},
      booktitle = {Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
      series = {Lecture Notes in Computer Science},
      volume = {13884},
      publisher = {Springer Science+Business Media},
      month = may,
      pages = {114--123},
      doi = {10.1007/978-3-031-33271-5_8},
      archiveprefix = {arXiv},
      eprint = {2304.03755},
      arxiv = {arXiv:2304.03755},
      primaryclass = {math.OC},
      author = {Chmiela, Antonia and Gleixner, Ambros and Lichocki, Pawel and Pokutta, Sebastian},
      title = {Online Learning for Scheduling MIP Heuristics}
    }

70. Martínez-Rubio, D., Roux, C., Criscitiello, C., and Pokutta, S. (2023). Accelerated Methods for Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties. Accepted at Optimization for Machine Learning. [arXiv]
    [BibTeX]

    @misc{2023_MartinezrubioRouxCriscitielloPokutta_Riemannianminmax:1,
      howpublished = {Accepted at Optimization for Machine Learning},
      year = {2023},
      month = may,
      archiveprefix = {arXiv},
      eprint = {2305.16186},
      arxiv = {arXiv:2305.16186},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Roux, Christophe and Criscitiello, Christopher and Pokutta, Sebastian},
      title = {Accelerated Methods for Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties}
    }

71. Martínez-Rubio, D., Wirth, E., and Pokutta, S. (2023). Accelerated and Sparse Algorithms for Approximate Personalized PageRank and Beyond. Proceedings of Thirty Sixth Conference on Learning Theory, 195. Associated with COLT 2023. [arXiv]
    [BibTeX]

    @inproceedings{2023_MartinezrubioWirthPokutta_Sparseapproximatepagerank,
      year = {2023},
      booktitle = {Proceedings of Thirty Sixth Conference on Learning Theory},
      series = {Proceedings of Machine Learning Research},
      volume = {195},
      month = may,
      archiveprefix = {arXiv},
      eprint = {2303.12875},
      arxiv = {arXiv:2303.12875},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Wirth, Elias and Pokutta, Sebastian},
      title = {Accelerated and Sparse Algorithms for Approximate Personalized PageRank and Beyond}
    }

72. Wirth, E., Kera, H., and Pokutta, S. (2023, January). Approximate Vanishing Ideal Computations at Scale. 11th International Conference on Learning Representations (ICLR 2023). Associated with ICLR 2023. [arXiv] [slides]
    [BibTeX]

    @inproceedings{2022_WirthKeraPokutta_Approximatevanishingideal,
      year = {2023},
      booktitle = {11th International Conference on Learning Representations (ICLR 2023)},
      publisher = {ICLR (OpenReview)},
      month = jan,
      archiveprefix = {arXiv},
      eprint = {2207.01236},
      arxiv = {arXiv:2207.01236},
      primaryclass = {cs.LG},
      author = {Wirth, Elias and Kera, Hiroshi and Pokutta, Sebastian},
      title = {Approximate Vanishing Ideal Computations at Scale},
      slides = {https://pokutta.com/slides/20220915_avi_at_scale.pdf}
    }

73. Wirth, E., Kerdreux, T., and Pokutta, S. (2023). Acceleration of Frank-Wolfe Algorithms with Open-Loop Step-Sizes. Proceedings of The 26th International Conference on Artificial Intelligence and Statistics, 206, 77–100. Associated with AISTATS 2023. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2022_WirthKerdreuxPokutta_Frankwolfeacceleration,
      year = {2023},
      booktitle = {Proceedings of The 26th International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {206},
      month = jan,
      pages = {77--100},
      url = {https://proceedings.mlr.press/v206/wirth23a.html},
      archiveprefix = {arXiv},
      eprint = {2205.12838},
      arxiv = {arXiv:2205.12838},
      primaryclass = {math.OC},
      author = {Wirth, Elias and Kerdreux, Thomas and Pokutta, Sebastian},
      title = {Acceleration of Frank-Wolfe Algorithms with Open-Loop Step-Sizes}
    }

74. Zimmer, M., Spiegel, C., and Pokutta, S. (2023). How I Learned to Stop Worrying and Love Retraining. 11th International Conference on Learning Representations (ICLR 2023). Associated with ICLR 2023. [URL] [arXiv] [code]
    [BibTeX]

    @inproceedings{2021_ZimmerSpiegelPokutta_Retrainingpruning,
      year = {2023},
      booktitle = {11th International Conference on Learning Representations (ICLR 2023)},
      publisher = {ICLR (OpenReview)},
      url = {https://iclr.cc/virtual/2023/poster/10914},
      archiveprefix = {arXiv},
      eprint = {2111.00843},
      arxiv = {arXiv:2111.00843},
      primaryclass = {cs.LG},
      author = {Zimmer, Max and Spiegel, Christoph and Pokutta, Sebastian},
      title = {How I Learned to Stop Worrying and Love Retraining},
      code = {https://github.com/ZIB-IOL/BIMP}
    }

75. Gasse, M., Bowly, S., Cappart, Q., Charfreitag, J., Charlin, L., Chételat, D., Chmiela, A., Dumouchelle, J., Gleixner, A., Kazachkov, A. M., Khalil, E., Lichocki, P., Lodi, A., Lubin, M., Maddison, C. J., Morris, C., Papageorgiou, D. J., Parjadis, A., Pokutta, S., … Kun, M. (2022). The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights. Proceedings of the NeurIPS 2021 Competitions and Demonstrations Track, 176, 220–231. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2022_GasseEtAl_Ml4coinsights,
      year = {2022},
      booktitle = {Proceedings of the NeurIPS 2021 Competitions and Demonstrations Track},
      series = {Proceedings of Machine Learning Research},
      volume = {176},
      month = jun,
      pages = {220--231},
      url = {https://proceedings.mlr.press/v176/gasse22a.html},
      archiveprefix = {arXiv},
      eprint = {2203.02433},
      arxiv = {arXiv:2203.02433},
      primaryclass = {cs.LG},
      author = {Gasse, Maxime and Bowly, Simon and Cappart, Quentin and Charfreitag, Jonas and Charlin, Laurent and Chételat, Didier and Chmiela, Antonia and Dumouchelle, Justin and Gleixner, Ambros and Kazachkov, Aleksandr M. and Khalil, Elias and Lichocki, Pawel and Lodi, Andrea and Lubin, Miles and Maddison, Chris J. and Morris, Christopher and Papageorgiou, Dimitri J. and Parjadis, Augustin and Pokutta, Sebastian and Prouvost, Antoine and Scavuzzo, Lara and Zarpellon, Giulia and Yang, Linxin and Lai, Sha and Wang, Akang and Luo, Xiaodong and Zhou, Xiang and Huang, Haohan and Shao, Shengcheng and Zhu, Yuanming and Zhang, Dong and Quan, Tao and Cao, Zixuan and Xu, Yang and Huang, Zhewei and Zhou, Shuchang and Binbin, Chen and Minggui, He and Hao, Hao and Zhiyu, Zhang and Zhiwu, An and Kun, Mao},
      title = {The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights}
    }

76. Parczyk, O., Pokutta, S., Spiegel, C., and Szabó, T. (2022). New Ramsey multiplicity bounds and search heuristics. Discrete Mathematics Days 2022, 263, 224–230. Associated with DMD 2022. [arXiv] [code]
    [BibTeX]

    @inproceedings{2022_ParczykPokuttaSpiegelSzabo_Ramseymultiplicityheuristics:1,
      year = {2022},
      date = {2022-06-29},
      booktitle = {Discrete Mathematics Days 2022},
      series = {Difunde},
      volume = {263},
      publisher = {Editorial de la Universidad de Cantabria},
      month = jun,
      pages = {224--230},
      archiveprefix = {arXiv},
      eprint = {2206.04036},
      arxiv = {arXiv:2206.04036},
      primaryclass = {math.CO},
      author = {Parczyk, Olaf and Pokutta, Sebastian and Spiegel, Christoph and Szabó, Tibor},
      title = {New Ramsey multiplicity bounds and search heuristics},
      code = {https://zenodo.org/record/6602512#.YyvFhi8Rr5g}
    }

77. Macdonald, J., Besançon, M., and Pokutta, S. (2022). Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance Orderings. Proceedings of the 39th International Conference on Machine Learning, 162. Associated with ICML 2022. [arXiv] [poster] [video]
    [BibTeX]

    @inproceedings{2021_MacdonaldBesanconPokutta_Interpretableneuralnetworks,
      year = {2022},
      booktitle = {Proceedings of the 39th International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {162},
      month = may,
      archiveprefix = {arXiv},
      eprint = {2110.08105},
      arxiv = {arXiv:2110.08105},
      primaryclass = {cs.LG},
      author = {Macdonald, Jan and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance Orderings},
      poster = {https://pokutta.com/slides/20220712_icml_poster_interpretable_rde.pdf},
      video = {https://slideslive.com/38983588}
    }

78. Tsuji, K., Tanaka, K., and Pokutta, S. (2022). Pairwise Conditional Gradients without Swap Steps and Sparser Kernel Herding. Proceedings of the 39th International Conference on Machine Learning, 162. Associated with ICML 2022. [arXiv] [summary] [slides] [code] [video]
    [BibTeX]

    @inproceedings{2021_TsujiTanakaPokutta_Pairwiseconditionalgradients,
      year = {2022},
      booktitle = {Proceedings of the 39th International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {162},
      month = may,
      archiveprefix = {arXiv},
      eprint = {2110.12650},
      arxiv = {arXiv:2110.12650},
      primaryclass = {math.OC},
      author = {Tsuji, Kazuma and Tanaka, Ken'ichiro and Pokutta, Sebastian},
      title = {Pairwise Conditional Gradients without Swap Steps and Sparser Kernel Herding},
      code = {https://github.com/ZIB-IOL/FrankWolfe.jl},
      slides = {https://pokutta.com/slides/20220624_ICML2022_BPCG.pdf},
      summary = {https://pokutta.com/blog/research/2022/05/21/bpcg-abstract.html},
      video = {https://slideslive.com/38983561}
    }

79. Wäldchen, S., Huber, F., and Pokutta, S. (2022). Training Characteristic Functions with Reinforcement Learning: XAI-methods play Connect Four. Proceedings of the 39th International Conference on Machine Learning, 162. Associated with ICML 2022. [arXiv] [poster] [video]
    [BibTeX]

    @inproceedings{2022_WaeldchenHuberPokutta_CharacteristicfunctionsReinforcementlearning,
      year = {2022},
      booktitle = {Proceedings of the 39th International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {162},
      month = may,
      archiveprefix = {arXiv},
      eprint = {2202.11797},
      arxiv = {arXiv:2202.11797},
      primaryclass = {cs.LG},
      author = {Wäldchen, Stephan and Huber, Felix and Pokutta, Sebastian},
      title = {Training Characteristic Functions with Reinforcement Learning: XAI-methods play Connect Four},
      poster = {https://pokutta.com/slides/20220712_icml_poster_conn4.pdf},
      video = {https://slideslive.com/38983111}
    }

80. Wirth, E., and Pokutta, S. (2022). Conditional Gradients for the Approximately Vanishing Ideal. Proceedings of The 25th International Conference on Artificial Intelligence and Statistics, 151. Associated with AISTATS 2022. [arXiv] [summary] [poster] [code]
    [BibTeX]

    @inproceedings{2022_WirthPokutta_Conditionalgradients,
      year = {2022},
      booktitle = {Proceedings of The 25th International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {151},
      month = jan,
      archiveprefix = {arXiv},
      eprint = {2202.03349},
      arxiv = {arXiv:2202.03349},
      primaryclass = {cs.LG},
      author = {Wirth, Elias and Pokutta, Sebastian},
      title = {Conditional Gradients for the Approximately Vanishing Ideal},
      code = {https://github.com/ZIB-IOL/cgavi/},
      poster = {https://pokutta.com/slides/20220223_CGAVI_poster.pdf},
      summary = {https://pokutta.com/blog/research/2022/02/20/CGAVI.html}
    }

81. Criado, F., Martínez-Rubio, D., and Pokutta, S. (2022). Fast Algorithms for Packing Proportional Fairness and its Dual. Advances in Neural Information Processing Systems, 35, 25754–25766. Associated with NeurIPS 2022. DOI: 10.52202/068431-1867 [arXiv] [poster]
    [BibTeX]

    @inproceedings{2021_CriadoMartinezrubioPokutta_Packingproportionalfairness,
      year = {2022},
      booktitle = {Advances in Neural Information Processing Systems},
      series = {Advances in Neural Information Processing Systems},
      volume = {35},
      publisher = {Curran Associates},
      pages = {25754--25766},
      doi = {10.52202/068431-1867},
      archiveprefix = {arXiv},
      eprint = {2109.03678},
      arxiv = {arXiv:2109.03678},
      primaryclass = {math.OC},
      author = {Criado, Francisco and Martínez-Rubio, David and Pokutta, Sebastian},
      title = {Fast Algorithms for Packing Proportional Fairness and its Dual},
      poster = {https://pokutta.com/slides/20211105_fairpacking-poster.pdf}
    }

82. Sofranac, B., Gleixner, A., and Pokutta, S. (2021). An Algorithm-Independent Measure of Progress for Linear Constraint Propagation. 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), 210, 52:1–52:17. Associated with CP 2021. DOI: 10.4230/LIPIcs.CP.2021.52 [URL] [arXiv] [video]
    [BibTeX]

    @inproceedings{2021_SofranacGleixnerPokutta_Progressmeasure:1,
      year = {2021},
      booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)},
      series = {Leibniz International Proceedings in Informatics},
      volume = {210},
      publisher = {Schloss Dagstuhl – Leibniz Center for Informatics},
      month = jun,
      pages = {52:1--52:17},
      doi = {10.4230/LIPIcs.CP.2021.52},
      url = {https://drops.dagstuhl.de/opus/volltexte/2021/15343/},
      archiveprefix = {arXiv},
      eprint = {2106.07573},
      arxiv = {arXiv:2106.07573},
      primaryclass = {math.OC},
      author = {Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian},
      title = {An Algorithm-Independent Measure of Progress for Linear Constraint Propagation},
      video = {https://youtu.be/paZtGYlkBfE}
    }

83. Carderera, A., Besançon, M., and Pokutta, S. (2021). Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions. Advances in Neural Information Processing Systems, 34, 5390–5401. Associated with NeurIPS 2021. [URL] [arXiv] [summary] [slides] [poster] [code]
    [BibTeX]

    @inproceedings{2024_CardereraBesanconPokutta_Scalablefrankwolfe:1,
      year = {2021},
      booktitle = {Advances in Neural Information Processing Systems},
      series = {Advances in Neural Information Processing Systems},
      volume = {34},
      publisher = {Curran Associates},
      month = may,
      pages = {5390--5401},
      url = {https://proceedings.neurips.cc/paper_files/paper/2021/file/2b323d6eb28422cef49b266557dd31ad-Paper.pdf},
      archiveprefix = {arXiv},
      eprint = {2105.13913},
      arxiv = {arXiv:2105.13913},
      primaryclass = {math.OC},
      author = {Carderera, Alejandro and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions},
      code = {https://doi.org/10.5281/zenodo.4836009},
      poster = {https://pokutta.com/slides/20211120_poster_NeurIPS21_lSimple_steps_are_all_you_need.pdf},
      slides = {https://pokutta.com/slides/20210710_FW-simpleSteps-SelfConcordance.pdf},
      summary = {https://pokutta.com/blog/research/2021/10/09/self-concordant-abstract.html}
    }

84. Chmiela, A., Khalil, E. B., Gleixner, A., Lodi, A., and Pokutta, S. (2021). Learning to Schedule Heuristics in Branch-and-Bound. Advances in Neural Information Processing Systems, 34, 24235–24246. Associated with NeurIPS 2021. [URL] [arXiv] [poster]
    [BibTeX]

    @inproceedings{2021_ChmielaEtAl_Heuristicscheduling,
      year = {2021},
      booktitle = {Advances in Neural Information Processing Systems},
      series = {Advances in Neural Information Processing Systems},
      volume = {34},
      publisher = {Curran Associates},
      month = mar,
      pages = {24235--24246},
      url = {https://proceedings.neurips.cc/paper_files/paper/2021/file/cb7c403aa312160380010ee3dd4bfc53-Paper.pdf},
      archiveprefix = {arXiv},
      eprint = {2103.10294},
      arxiv = {arXiv:2103.10294},
      primaryclass = {cs.LG},
      author = {Chmiela, Antonia and Khalil, Elias B. and Gleixner, Ambros and Lodi, Andrea and Pokutta, Sebastian},
      title = {Learning to Schedule Heuristics in Branch-and-Bound},
      poster = {https://pokutta.com/slides/20211120_poster_NeurIPS21_learningheuristics.pdf}
    }

85. Carderera, A., Diakonikolas, J., Lin, C. Y., and Pokutta, S. (2021). Parameter-free Locally Accelerated Conditional Gradients. Proceedings of the 38th International Conference on Machine Learning, 139. Associated with ICML 2021. [arXiv] [slides]
    [BibTeX]

    @inproceedings{2021_CardereraDiakonikolasLinPokutta_ParameterfreeLocallyAccelerated,
      year = {2021},
      booktitle = {Proceedings of the 38th International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {139},
      month = feb,
      archiveprefix = {arXiv},
      eprint = {2102.06806},
      arxiv = {arXiv:2102.06806},
      primaryclass = {math.OC},
      author = {Carderera, Alejandro and Diakonikolas, Jelena and Lin, Cheuk Yin and Pokutta, Sebastian},
      title = {Parameter-free Locally Accelerated Conditional Gradients},
      slides = {https://pokutta.com/slides/20210716_PF_LaCG_Poster.pdf}
    }

86. Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2021). Projection-Free Optimization on Uniformly Convex Sets. Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, 130, 19–27. Associated with AISTATS 2021. [arXiv] [slides]
    [BibTeX]

    @inproceedings{2021_KerdrexDaspremontPokutta_ProjectionFreeOptimization,
      year = {2021},
      booktitle = {Proceedings of The 24th International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {130},
      month = jan,
      pages = {19--27},
      note = {Oral Presentation + Conference Proceedings},
      archiveprefix = {arXiv},
      eprint = {2004.11053},
      arxiv = {arXiv:2004.11053},
      primaryclass = {math.OC},
      author = {Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Projection-Free Optimization on Uniformly Convex Sets},
      slides = {https://app.box.com/s/36wj0o8le96rrfdxec774wk7rrdp2vlm}
    }

87. Pokutta, S. (2020). Restarting Algorithms: Sometimes There Is Free Lunch. Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 12296, 22–38. Associated with CPAIOR 2020. DOI: 10.1007/978-3-030-58942-4_2 [arXiv] [slides] [video]
    [BibTeX]

    @inproceedings{2020_Pokutta_RestartingAlgorithms,
      year = {2020},
      booktitle = {Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
      series = {Lecture Notes in Computer Science},
      volume = {12296},
      publisher = {Springer Science+Business Media},
      month = sep,
      pages = {22--38},
      doi = {10.1007/978-3-030-58942-4_2},
      note = {Invited Paper},
      archiveprefix = {arXiv},
      eprint = {2006.14810},
      arxiv = {arXiv:2006.14810},
      primaryclass = {math.OC},
      author = {Pokutta, Sebastian},
      title = {Restarting Algorithms: Sometimes There Is Free Lunch},
      slides = {https://app.box.com/s/8ps8bhjv2phhy182xn55iurk9t3o1xc3},
      video = {https://youtube.com/watch?v=v3Xzoda2_gQ}
    }

88. Sofranac, B., Gleixner, A., and Pokutta, S. (2020). Accelerating Domain Propagation: An Efficient GPU-Parallel Algorithm over Sparse Matrices. 2020 IEEE/ACM 10th Workshop on Irregular Applications: Architectures and Algorithms (IA3), 1–11. DOI: 10.1109/IA351965.2020.00007 [arXiv] [summary] [slides] [video]
    [BibTeX]

    @inproceedings{2020_SofranacGleixnerPokutta_Domainpropagation:1,
      year = {2020},
      booktitle = {2020 IEEE/ACM 10th Workshop on Irregular Applications: Architectures and Algorithms (IA3)},
      publisher = {Institute of Electrical and Electronics Engineers},
      month = sep,
      pages = {1--11},
      doi = {10.1109/IA351965.2020.00007},
      archiveprefix = {arXiv},
      eprint = {2009.07785},
      arxiv = {arXiv:2009.07785},
      primaryclass = {cs.DC},
      author = {Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian},
      title = {Accelerating Domain Propagation: An Efficient GPU-Parallel Algorithm over Sparse Matrices},
      slides = {https://app.box.com/s/qy0pjmhtbm7shk2ypxjxlh2sj4nudvyu},
      summary = {https://pokutta.com/blog/research/2020/09/20/gpu-prob.html},
      video = {https://youtu.be/7mERPal9pVs}
    }

89. Mortagy, H., Gupta, S., and Pokutta, S. (2020). Walking in the Shadow: A New Perspective on Descent Directions for Constrained Minimization. Advances in Neural Information Processing Systems, 33. Associated with NeurIPS 2020. [arXiv] [slides] [code] [video]
    [BibTeX]

    @inproceedings{2020_MortagyGuptaPokutta_WalkingShadow,
      year = {2020},
      booktitle = {Advances in Neural Information Processing Systems},
      series = {Advances in Neural Information Processing Systems},
      volume = {33},
      publisher = {Curran Associates},
      month = jun,
      archiveprefix = {arXiv},
      eprint = {2006.08426},
      arxiv = {arXiv:2006.08426},
      primaryclass = {math.OC},
      author = {Mortagy, Hassan and Gupta, Swati and Pokutta, Sebastian},
      title = {Walking in the Shadow: A New Perspective on Descent Directions for Constrained Minimization},
      code = {https://github.com/pokutta/Walking-in-the-Shadow},
      slides = {https://app.box.com/s/wjhpe4nh8kv5pw6vl5jbp902v3mksivs},
      video = {https://youtu.be/CRmASevfnmE}
    }

90. Combettes, C., and Pokutta, S. (2020). Boosting Frank-Wolfe by Chasing Gradients. Proceedings of the 37th International Conference on Machine Learning, 119. Associated with ICML 2020. [URL] [arXiv] [slides] [code] [video]
    [BibTeX]

    @inproceedings{2020_CombettesPokutta_BoostingFrankWolfe,
      year = {2020},
      booktitle = {Proceedings of the 37th International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {119},
      month = mar,
      url = {https://proceedings.mlr.press/v119/combettes20a.html},
      archiveprefix = {arXiv},
      eprint = {2003.06369},
      arxiv = {arXiv:2003.06369},
      primaryclass = {math.OC},
      author = {Combettes, Cyrille and Pokutta, Sebastian},
      title = {Boosting Frank-Wolfe by Chasing Gradients},
      code = {https://github.com/cyrillewcombettes/boostfw},
      slides = {https://app.box.com/s/wwj247r5d456q0778p9b9y1jm6txuifb},
      video = {https://youtube.com/watch?v=BfyV0C5FRbE}
    }

91. Diakonikolas, J., Carderera, A., and Pokutta, S. (2020). Locally Accelerated Conditional Gradients. Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, 108. Associated with AISTATS 2020. [URL] [arXiv] [slides] [code]
    [BibTeX]

    @inproceedings{2019_DiakonikolasCardereraPokutta_BreakingCurse,
      year = {2020},
      booktitle = {Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {108},
      url = {https://proceedings.mlr.press/v108/diakonikolas20a/diakonikolas20a.pdf},
      archiveprefix = {arXiv},
      eprint = {1906.07867},
      arxiv = {arXiv:1906.07867},
      primaryclass = {math.OC},
      author = {Diakonikolas, Jelena and Carderera, Alejandro and Pokutta, Sebastian},
      title = {Locally Accelerated Conditional Gradients},
      code = {https://colab.research.google.com/drive/1ejjfCan7xnEhWWJXCIzb03CwQRG9iW_O},
      slides = {https://app.box.com/s/gphkhapso7d1vrfnzqykkb3vx0agxh8w}
    }

92. Pokutta, S., Singh, M., and Torrico, A. (2020). On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness. Proceedings of the 37th International Conference on Machine Learning, 119. Associated with ICML 2020. [arXiv] [slides] [video]
    [BibTeX]

    @inproceedings{2019_PokuttaSinghTorrico_UnreasonableEffectiveness,
      year = {2020},
      booktitle = {Proceedings of the 37th International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {119},
      archiveprefix = {arXiv},
      eprint = {2002.04063},
      arxiv = {arXiv:2002.04063},
      primaryclass = {cs.DS},
      author = {Pokutta, Sebastian and Singh, Mohit and Torrico, Alfredo},
      title = {On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness},
      slides = {https://app.box.com/s/fmjxhfdpiqubm28upf563ohy8t8fgl3a},
      video = {https://youtube.com/watch?v=VB1e0HrDmVo}
    }

93. Pfetsch, M., and Pokutta, S. (2020). IPBoost – Non-Convex Boosting via Integer Programming. Proceedings of the 37th International Conference on Machine Learning, 119. Associated with ICML 2020. [arXiv] [slides] [code]
    [BibTeX]

    @inproceedings{2020_PfetschPokutta_IPBoost,
      year = {2020},
      booktitle = {Proceedings of the 37th International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {119},
      archiveprefix = {arXiv},
      eprint = {2002.04679},
      arxiv = {arXiv:2002.04679},
      primaryclass = {cs.LG},
      author = {Pfetsch, Marc and Pokutta, Sebastian},
      title = {IPBoost -- Non-Convex Boosting via Integer Programming},
      code = {https://www2.mathematik.tu-darmstadt.de/~pfetsch/ipboost.html},
      slides = {https://app.box.com/s/8dpvmls88suouy11bkpwufhu7iiz6dxl}
    }

94. Braun, G., Pokutta, S., Tu, D., and Wright, S. (2019). Blended Conditional Gradients: the unconditioning of conditional gradients. Proceedings of the 36th International Conference on Machine Learning, 97, 735–743. Associated with ICML 2019. [URL] [arXiv] [summary] [slides] [poster] [code]
    [BibTeX]

    @inproceedings{2018_BraunPokuttaTuStephen_Blendedconditionalgradients,
      year = {2019},
      booktitle = {Proceedings of the 36th International Conference on Machine Learning},
      series = {Proceedings of Machine Learning Research},
      volume = {97},
      pages = {735--743},
      url = {https://proceedings.mlr.press/v97/braun19a},
      archiveprefix = {arXiv},
      eprint = {1805.07311},
      arxiv = {arXiv:1805.07311},
      primaryclass = {math.OC},
      author = {Braun, Gábor and Pokutta, Sebastian and Tu, Dan and Wright, Stephen},
      title = {Blended Conditional Gradients: the unconditioning of conditional gradients},
      code = {https://github.com/pokutta/bcg},
      poster = {https://app.box.com/s/nmmm671jd72i397nysa8emfnzh1hn6hf},
      slides = {https://app.box.com/s/xbx3z7ws6dxvl3rzgj4jp6forigycooe},
      summary = {https://pokutta.com/blog/research/2019/02/18/bcg-abstract.html}
    }

95. Anari, N., Haghtalab, N., Naor, S., Pokutta, S., Singh, M., and Torrico, A. (2019). Structured Robust Submodular Maximization: Offline and Online Algorithms. Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics, 89. Associated with AISTATS 2019. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2019_AnariHaghtalabNaorPokuttaSinghTorrico_StructuredRobustSubmodular:1,
      year = {2019},
      booktitle = {Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {89},
      url = {https://proceedings.mlr.press/v89/anari19a/anari19a.pdf},
      archiveprefix = {arXiv},
      eprint = {1710.04740},
      arxiv = {arXiv:1710.04740},
      primaryclass = {cs.DS},
      author = {Anari, N. and Haghtalab, N. and Naor, S. and Pokutta, Sebastian and Singh, Mohit and Torrico, Alfredo},
      title = {Structured Robust Submodular Maximization: Offline and Online Algorithms}
    }

96. Combettes, C., and Pokutta, S. (2019). Blended Matching Pursuit. Advances in Neural Information Processing Systems, 32, 2042–2052. Associated with NeurIPS 2019. [URL] [arXiv] [slides] [code]
    [BibTeX]

    @inproceedings{2019_CombettesPokutta_BlendedMatching,
      year = {2019},
      booktitle = {Advances in Neural Information Processing Systems},
      series = {Advances in Neural Information Processing Systems},
      volume = {32},
      publisher = {Curran Associates},
      pages = {2042--2052},
      url = {https://papers.nips.cc/paper/8478-blended-matching-pursuit},
      archiveprefix = {arXiv},
      eprint = {1904.12335},
      arxiv = {arXiv:1904.12335},
      primaryclass = {math.OC},
      author = {Combettes, Cyrille and Pokutta, Sebastian},
      title = {Blended Matching Pursuit},
      code = {https://colab.research.google.com/drive/17XYIxnCcJjKswba9mAaXFWnNGVZdsaXQ},
      slides = {https://app.box.com/s/8lfktq6h3dqp9t2gqydu2tp8h2uxgz7m}
    }

97. Diakonikolas, J., Carderera, A., and Pokutta, S. (2019). Breaking the Curse of Dimensionality (Locally) to Accelerate Conditional Gradients. Accepted at Optimization for Machine Learning. [URL] [arXiv] [slides] [code]
    [BibTeX]

    @misc{2019_DiakonikolasCardereraPokutta_BreakingCurse:1,
      howpublished = {Accepted at Optimization for Machine Learning},
      year = {2019},
      url = {https://opt-ml.org/papers/2019/paper_26.pdf},
      archiveprefix = {arXiv},
      eprint = {1906.07867},
      arxiv = {arXiv:1906.07867},
      primaryclass = {math.OC},
      author = {Diakonikolas, Jelena and Carderera, Alejandro and Pokutta, Sebastian},
      title = {Breaking the Curse of Dimensionality (Locally) to Accelerate Conditional Gradients},
      code = {https://colab.research.google.com/drive/1ejjfCan7xnEhWWJXCIzb03CwQRG9iW_O},
      slides = {https://app.box.com/s/gphkhapso7d1vrfnzqykkb3vx0agxh8w}
    }

98. Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2019). Restarting Frank-Wolfe. Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics, 89, 1275–1283. Associated with AISTATS 2019. [URL] [arXiv] [slides]
    [BibTeX]

    @inproceedings{2019_KerdrexDaspremontPokutta_RestartingFrankWolfe:1,
      year = {2019},
      booktitle = {Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics},
      series = {Proceedings of Machine Learning Research},
      volume = {89},
      pages = {1275--1283},
      url = {https://proceedings.mlr.press/v89/kerdreux19a/kerdreux19a.pdf},
      archiveprefix = {arXiv},
      eprint = {1810.02429},
      arxiv = {arXiv:1810.02429},
      primaryclass = {math.OC},
      author = {Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Restarting Frank-Wolfe},
      slides = {https://app.box.com/s/prd32r6xmuef2k4gah23rd0egllz9rv5}
    }

99. Pokutta, S., Singh, M., and Torrico, A. (2019). On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness. Accepted at Optimization for Machine Learning. [URL] [arXiv] [slides] [video]
    [BibTeX]

    @misc{2019_PokuttaSinghTorrico_UnreasonableEffectiveness:1,
      howpublished = {Accepted at Optimization for Machine Learning},
      year = {2019},
      url = {https://opt-ml.org/papers/2019/paper_16.pdf},
      archiveprefix = {arXiv},
      eprint = {2002.04063},
      arxiv = {arXiv:2002.04063},
      primaryclass = {cs.DS},
      author = {Pokutta, Sebastian and Singh, Mohit and Torrico, Alfredo},
      title = {On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness},
      slides = {https://app.box.com/s/fmjxhfdpiqubm28upf563ohy8t8fgl3a},
      video = {https://youtube.com/watch?v=VB1e0HrDmVo}
    }

100. Inanlouganji, A., Pedrielli, G., Fainekos, G., and Pokutta, S. (2018). Continuous Simulation Optimization with Model Mismatch Using Gaussian Process Regression. Proceedings of the 2018 Winter Simulation Conference, 2131–2142. DOI: 10.1109/wsc.2018.8632427
     [BibTeX]

     @inproceedings{2018_InanlouganjiPedrielliFainekosPokutta_ContinuousSimulation,
       year = {2018},
       booktitle = {Proceedings of the 2018 Winter Simulation Conference},
       publisher = {Institute of Electrical and Electronics Engineers},
       pages = {2131--2142},
       doi = {10.1109/wsc.2018.8632427},
       author = {Inanlouganji, A. and Pedrielli, G. and Fainekos, G. and Pokutta, Sebastian},
       title = {Continuous Simulation Optimization with Model Mismatch Using Gaussian Process Regression}
     }

101. Pokutta, S., Singh, M., and Torrico, A. (2018). Efficient algorithms for robust submodular maximization under matroid constraints. Accepted at ICML 2018: Modern Trends in Nonconvex Optimization for Machine Learning. [URL] [arXiv]
     [BibTeX]

     @misc{2018_PokuttaSinghTorrico_EfficientAlgorithms:1,
       howpublished = {Accepted at ICML 2018: Modern Trends in Nonconvex Optimization for Machine Learning},
       year = {2018},
       url = {https://sites.google.com/view/icml2018nonconvex/papers},
       archiveprefix = {arXiv},
       eprint = {1807.09405},
       arxiv = {arXiv:1807.09405},
       primaryclass = {cs.DS},
       author = {Pokutta, Sebastian and Singh, Mohit and Torrico, Alfredo},
       title = {Efficient algorithms for robust submodular maximization under matroid constraints}
     }

102. Braun, G., Pokutta, S., and Zink, D. (2017). Lazifying Conditional Gradient Algorithms. Proceedings of the 34th International Conference on Machine Learning, 70, 566–575. Associated with ICML 2017. [URL] [arXiv] [slides] [poster]
     [BibTeX]

     @inproceedings{2016_BraunPokuttaZink_Lazifyinggradientalgorithms:1,
       year = {2017},
       booktitle = {Proceedings of the 34th International Conference on Machine Learning},
       series = {Proceedings of Machine Learning Research},
       volume = {70},
       pages = {566--575},
       url = {https://proceedings.mlr.press/v70/braun17a},
       archiveprefix = {arXiv},
       eprint = {1610.05120},
       arxiv = {arXiv:1610.05120},
       primaryclass = {cs.DS},
       author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel},
       title = {Lazifying Conditional Gradient Algorithms},
       poster = {https://app.box.com/s/lysscdg17ytpz7mqr0tu2djffyqvkl6a},
       slides = {https://app.box.com/s/zsp0hixjz2ha23u1vuyosijjkjdh8k}
     }

103. Zink, D., Roy, A., and Pokutta, S. (2017). Estimating Anthropometric Features from Single Depth Images with Very High Accuracy. Accepted at INFORMS Computing Society Conference.
     [BibTeX]

     @misc{2016_ZinkRoyPokutta_EstimatingAnthropometric,
       howpublished = {Accepted at INFORMS Computing Society Conference},
       year = {2017},
       author = {Zink, Daniel and Roy, Aurko and Pokutta, Sebastian},
       title = {Estimating Anthropometric Features from Single Depth Images with Very High Accuracy}
     }

104. Arumugam, K., Kadampot, I., Tahmasbi, M., Shah, S., Bloch, M., and Pokutta, S. (2017). Modulation recognition using side information and hybrid learning. 2017 IEEE International Symposium on Dynamic Spectrum Access Networks (DySPAN), 1–2. DOI: 10.1109/dyspan.2017.7920750
     [BibTeX]

     @inproceedings{2017_ArumugamKadampotTahmasbiShahBlochPokutta_ModulationRecognition,
       year = {2017},
       booktitle = {2017 IEEE International Symposium on Dynamic Spectrum Access Networks (DySPAN)},
       publisher = {Institute of Electrical and Electronics Engineers},
       pages = {1--2},
       doi = {10.1109/dyspan.2017.7920750},
       author = {Arumugam, K. and Kadampot, I. and Tahmasbi, M. and Shah, S. and Bloch, M. and Pokutta, Sebastian},
       title = {Modulation recognition using side information and hybrid learning}
     }

105. Lan, G., Pokutta, S., Zhou, Y., and Zink, D. (2017). Conditional Accelerated Lazy Stochastic Gradient Descent. Proceedings of the 34th International Conference on Machine Learning, 70, 1965–1974. Associated with ICML 2017. [URL] [arXiv]
     [BibTeX]

     @inproceedings{2017_LanPokuttaZhouZink_ConditionalAccelerated,
       year = {2017},
       booktitle = {Proceedings of the 34th International Conference on Machine Learning},
       series = {Proceedings of Machine Learning Research},
       volume = {70},
       pages = {1965--1974},
       url = {https://proceedings.mlr.press/v70/lan17a.html},
       archiveprefix = {arXiv},
       eprint = {1703.05840},
       arxiv = {arXiv:1703.05840},
       primaryclass = {cs.LG},
       author = {Lan, G. and Pokutta, Sebastian and Zhou, Y and Zink, Daniel},
       title = {Conditional Accelerated Lazy Stochastic Gradient Descent}
     }

106. Roy, A., Xu, H., and Pokutta, S. (2017). Reinforcement Learning under Model Mismatch. Advances in Neural Information Processing Systems, 30. Associated with NeurIPS 2017. [arXiv]
     [BibTeX]

     @inproceedings{2017_RoyXuPokutta_ReinforcementLearning,
       year = {2017},
       booktitle = {Advances in Neural Information Processing Systems},
       series = {Advances in Neural Information Processing Systems},
       volume = {30},
       publisher = {Curran Associates},
       archiveprefix = {arXiv},
       eprint = {1706.04711},
       arxiv = {arXiv:1706.04711},
       primaryclass = {cs.LG},
       author = {Roy, Aurko and Xu, Huan and Pokutta, Sebastian},
       title = {Reinforcement Learning under Model Mismatch}
     }

107. Bärmann, A., Pokutta, S., and Schneider, O. (2017). Emulating the Expert: Inverse Optimization through Online Learning. Proceedings of the 34th International Conference on Machine Learning, 70, 400–410. Associated with ICML 2017. [URL] [arXiv] [slides] [video]
     [BibTeX]

     @inproceedings{2018_BarmannMartinPokuttaSchneider_OnlineLearningApproach,
       year = {2017},
       booktitle = {Proceedings of the 34th International Conference on Machine Learning},
       series = {Proceedings of Machine Learning Research},
       volume = {70},
       pages = {400--410},
       url = {https://proceedings.mlr.press/v70/barmann17a.html},
       archiveprefix = {arXiv},
       eprint = {1810.12997},
       arxiv = {arXiv:1810.12997},
       primaryclass = {math.OC},
       author = {Bärmann, Andreas and Pokutta, Sebastian and Schneider, Oskar},
       title = {Emulating the Expert: Inverse Optimization through Online Learning},
       slides = {https://app.box.com/s/7ti8sz8mf5s2znn1qo32in4jxy5gjnn1},
       video = {https://vimeo.com/channels/1301905/237243668}
     }

108. Braun, G., Pokutta, S., and Roy, A. (2016). Strong Reductions for Extended Formulations. Integer Programming and Combinatorial Optimization, 9682, 350–361. Associated with IPCO 2016. DOI: 10.1007/978-3-319-33461-5_29 [arXiv]
     [BibTeX]

     @inproceedings{2015_BraunPokuttaRoy_Strongreductions:1,
       year = {2016},
       booktitle = {Integer Programming and Combinatorial Optimization},
       series = {Lecture Notes in Computer Science},
       volume = {9682},
       publisher = {Springer Science+Business Media},
       month = may,
       pages = {350--361},
       doi = {10.1007/978-3-319-33461-5_29},
       archiveprefix = {arXiv},
       eprint = {1512.04932},
       arxiv = {arXiv:1512.04932},
       primaryclass = {cs.CC},
       author = {Braun, Gábor and Pokutta, Sebastian and Roy, Aurko},
       title = {Strong Reductions for Extended Formulations}
     }

109. Braun, G., Brown-Cohen, J., Huq, A., Pokutta, S., Raghavendra, P., Roy, A., Weitz, B., and Zink, D. (2016). The matching problem has no small symmetric SDP. Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1067–1078. Associated with SODA 2016. DOI: 10.1137/1.9781611974331.ch75 [arXiv]
     [BibTeX]

     @inproceedings{2015_BraunEtAl_MatchingproblemSdp:1,
       year = {2016},
       booktitle = {Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms},
       publisher = {Society for Industrial and Applied Mathematics},
       pages = {1067--1078},
       doi = {10.1137/1.9781611974331.ch75},
       archiveprefix = {arXiv},
       eprint = {1504.00703},
       arxiv = {arXiv:1504.00703},
       primaryclass = {cs.CC},
       author = {Braun, Gábor and Brown-Cohen, Jonah and Huq, Arefin and Pokutta, Sebastian and Raghavendra, Prasad and Roy, Aurko and Weitz, Benjamin and Zink, Daniel},
       title = {The matching problem has no small symmetric SDP}
     }

110. Roy, A., and Pokutta, S. (2016). Hierarchical Clustering via Spreading Metrics. Advances in Neural Information Processing Systems, 29. Associated with NeurIPS 2016. [URL] [arXiv]
     [BibTeX]

     @inproceedings{2017_RoyPokutta_HierarchicalClustering:1,
       year = {2016},
       booktitle = {Advances in Neural Information Processing Systems},
       series = {Advances in Neural Information Processing Systems},
       volume = {29},
       publisher = {Curran Associates},
       note = {Oral Presentation + Conference Proceedings},
       url = {https://papers.nips.cc/paper/by-source-2016-1199},
       archiveprefix = {arXiv},
       eprint = {1610.09269},
       arxiv = {arXiv:1610.09269},
       primaryclass = {cs.LG},
       author = {Roy, Aurko and Pokutta, Sebastian},
       title = {Hierarchical Clustering via Spreading Metrics}
     }

111. Braun, G., Pokutta, S., and Zink, D. (2015). Inapproximability of combinatorial problems via small LPs and SDPs. Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, 107–116. Associated with STOC 2015. DOI: 10.1145/2746539.2746550 [arXiv] [video]
     [BibTeX]

     @inproceedings{2014_BraunPokuttaZink_Affinereductions:1,
       year = {2015},
       booktitle = {Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing},
       publisher = {Association for Computing Machinery},
       month = jun,
       pages = {107--116},
       doi = {10.1145/2746539.2746550},
       archiveprefix = {arXiv},
       eprint = {1410.8816},
       arxiv = {arXiv:1410.8816},
       primaryclass = {cs.CC},
       author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel},
       title = {Inapproximability of combinatorial problems via small LPs and SDPs},
       video = {https://youtu.be/MxLEticZ8RY}
     }

112. Braun, G., and Pokutta, S. (2015). The matching polytope does not admit fully-polynomial size relaxation schemes. Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 837–846. Associated with SODA 2015. DOI: 10.1137/1.9781611973730.57 [URL] [arXiv]
     [BibTeX]

     @inproceedings{2014_BraunPokutta_Matchingpolytope:1,
       year = {2015},
       booktitle = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms},
       publisher = {Society for Industrial and Applied Mathematics},
       pages = {837--846},
       doi = {10.1137/1.9781611973730.57},
       url = {https://eccc.weizmann.ac.il/report/2013/056},
       archiveprefix = {arXiv},
       eprint = {1403.6710},
       arxiv = {arXiv:1403.6710},
       primaryclass = {cs.CC},
       author = {Braun, Gábor and Pokutta, Sebastian},
       title = {The matching polytope does not admit fully-polynomial size relaxation schemes}
     }

113. Bazzi, A., Fiorini, S., Pokutta, S., and Svensson, O. (2015). No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ε. 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1123–1142. Associated with FOCS 2015. DOI: 10.1109/FOCS.2015.73 [arXiv] [slides]
     [BibTeX]

     @inproceedings{2015_BazziFioriniPokuttaSvensson_SmallLinearPrograms:1,
       year = {2015},
       booktitle = {2015 IEEE 56th Annual Symposium on Foundations of Computer Science},
       publisher = {Institute of Electrical and Electronics Engineers},
       pages = {1123--1142},
       doi = {10.1109/FOCS.2015.73},
       archiveprefix = {arXiv},
       eprint = {1503.00753},
       arxiv = {arXiv:1503.00753},
       primaryclass = {cs.CC},
       author = {Bazzi, A. and Fiorini, S. and Pokutta, Sebastian and Svensson, O.},
       title = {No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ε},
       slides = {https://app.box.com/s/00aqupo722bbpmdcyzwt8xmfqzyu14iy}
     }

114. Collier, V., Ostrowski, J., and Pokutta, S. (2015). A Symmetric Extended Formulation of the Bin Packing Problem. Accepted at IISE Annual Conference.
     [BibTeX]

     @misc{2015_CollierOstrowskiPokutta_SymmetricExtendedBin,
       howpublished = {Accepted at IISE Annual Conference},
       year = {2015},
       note = {Paper won second place in the Undergraduate Research Operations Research competition.},
       author = {Collier, V. and Ostrowski, J. and Pokutta, Sebastian},
       title = {A Symmetric Extended Formulation of the Bin Packing Problem}
     }

115. Pokutta, S. (2015). Information Theory and Polyhedral Combinatorics. 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), 1119–1126. Associated with Allerton 2015. DOI: 10.1109/allerton.2015.7447134 [URL]
     [BibTeX]

     @inproceedings{2015_Pokutta_InformationTheoryPolyhedral,
       year = {2015},
       booktitle = {2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)},
       publisher = {Institute of Electrical and Electronics Engineers},
       pages = {1119--1126},
       doi = {10.1109/allerton.2015.7447134},
       url = {https://ieeexplore.ieee.org/abstract/document/7447134},
       author = {Pokutta, Sebastian},
       title = {Information Theory and Polyhedral Combinatorics}
     }

116. Song, R., Xie, Y., and Pokutta, S. (2015). On the effect of model mismatch for sequential Info-Greedy Sensing. 2015 IEEE International Symposium on Information Theory (ISIT), 1650–1654. DOI: 10.1109/isit.2015.7282736 [arXiv]
     [BibTeX]

     @inproceedings{2015_SongXiePokutta_SequentialSensing:1,
       year = {2015},
       booktitle = {2015 IEEE International Symposium on Information Theory (ISIT)},
       publisher = {Institute of Electrical and Electronics Engineers},
       pages = {1650--1654},
       doi = {10.1109/isit.2015.7282736},
       archiveprefix = {arXiv},
       eprint = {1501.06241},
       arxiv = {arXiv:1501.06241},
       primaryclass = {stat.ML},
       author = {Song, R. and Xie, Yao and Pokutta, Sebastian},
       title = {On the effect of model mismatch for sequential Info-Greedy Sensing}
     }

117. Xie, Y., Li, Q., and Pokutta, S. (2015). Supervised Online Subspace Tracking. Accepted at Asilomar Conference on Signals, Systems, and Computers.
     [BibTeX]

     @misc{2015_XieLiPokutta_SupervisedOnlineSubspace,
       howpublished = {Accepted at Asilomar Conference on Signals, Systems, and Computers},
       year = {2015},
       author = {Xie, Yao and Li, Q. and Pokutta, Sebastian},
       title = {Supervised Online Subspace Tracking}
     }

118. Braun, G., Fiorini, S., and Pokutta, S. (2014). Average Case Polyhedral Complexity of the Maximum Stable Set Problem. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014), 28, 515–530. DOI: 10.4230/LIPIcs.APPROX-RANDOM.2014.515 [URL] [arXiv]
     [BibTeX]

     @inproceedings{2013_BraunSamuelPokutta_Averagepolyhedralcomplexity:1,
       year = {2014},
       booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
       series = {Leibniz International Proceedings in Informatics},
       volume = {28},
       publisher = {Schloss Dagstuhl – Leibniz Center for Informatics},
       month = sep,
       pages = {515--530},
       doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.515},
       url = {https://drops.dagstuhl.de/opus/volltexte/2014/4720},
       archiveprefix = {arXiv},
       eprint = {1311.4001},
       arxiv = {arXiv:1311.4001},
       primaryclass = {cs.CC},
       author = {Braun, Gábor and Fiorini, Samuel and Pokutta, Sebastian},
       title = {Average Case Polyhedral Complexity of the Maximum Stable Set Problem}
     }

119. Braun, G., Pokutta, S., and Xie, Y. (2014). Info-greedy sequential adaptive compressed sensing. 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton), 858–865. Associated with Allerton 2014. DOI: 10.1109/ALLERTON.2014.7028544 [arXiv]
     [BibTeX]

     @inproceedings{2014_BraunPokuttaYao_Infogreedycompressedsensing:1,
       year = {2014},
       booktitle = {2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)},
       publisher = {Institute of Electrical and Electronics Engineers},
       pages = {858--865},
       doi = {10.1109/ALLERTON.2014.7028544},
       archiveprefix = {arXiv},
       eprint = {1407.0731},
       arxiv = {arXiv:1407.0731},
       primaryclass = {cs.IT},
       author = {Braun, Gábor and Pokutta, Sebastian and Xie, Yao},
       title = {Info-greedy sequential adaptive compressed sensing}
     }

120. Briet, J., Dadush, D., and Pokutta, S. (2013). On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity. Algorithms – ESA 2013, 8125, 217–228. DOI: 10.1007/978-3-642-40450-4_19 [arXiv]
     [BibTeX]

     @inproceedings{2013_BrietDadushPokutta_ExistencePolytopes:1,
       year = {2013},
       booktitle = {Algorithms – ESA 2013},
       series = {Lecture Notes in Computer Science},
       volume = {8125},
       publisher = {Springer Science+Business Media},
       pages = {217--228},
       doi = {10.1007/978-3-642-40450-4_19},
       archiveprefix = {arXiv},
       eprint = {1305.3268},
       arxiv = {arXiv:1305.3268},
       primaryclass = {cs.CC},
       author = {Briet, Jop and Dadush, Daniel and Pokutta, Sebastian},
       title = {On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity}
     }

121. Schmaltz, C., Pokutta, S., Heidorn, T., and Andrae, S. (2013). How to make regulators and shareholders happy under Basel III. Accepted at Australasian Finance and Banking Conference. [URL]
     [BibTeX]

     @misc{2013_SchmaltzPokuttaHeidornAndrae_BaselIII:1,
       howpublished = {Accepted at Australasian Finance and Banking Conference},
       year = {2013},
       url = {https://papers.ssrn.com/sol3/papers.cfm?abstract_id=2179490},
       author = {Schmaltz, Christian and Pokutta, Sebastian and Heidorn, Thomas and Andrae, Silvio},
       title = {How to make regulators and shareholders happy under Basel III}
     }

122. Braun, G., and Pokutta, S. (2013). Common Information and Unique Disjointness. 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 688–697. Associated with FOCS 2013. DOI: 10.1109/FOCS.2013.79 [URL]
     [BibTeX]

     @inproceedings{2016_BraunPokutta_CommoninformationDisjointness:1,
       year = {2013},
       booktitle = {2013 IEEE 54th Annual Symposium on Foundations of Computer Science},
       publisher = {Institute of Electrical and Electronics Engineers},
       pages = {688--697},
       doi = {10.1109/FOCS.2013.79},
       url = {https://eccc.weizmann.ac.il/report/2013/056},
       author = {Braun, Gábor and Pokutta, Sebastian},
       title = {Common Information and Unique Disjointness}
     }

123. Braun, G., and Pokutta, S. (2012). An Algebraic Approach to Symmetric Extended Formulations. Combinatorial Optimization, 7422, 141–152. Associated with ISCO 2012. DOI: 10.1007/978-3-642-32147-4_14 [arXiv]
     [BibTeX]

     @inproceedings{2012_BraunPokutta_Algebraicsymmetricformulations,
       year = {2012},
       booktitle = {Combinatorial Optimization},
       series = {Lecture Notes in Computer Science},
       volume = {7422},
       publisher = {Springer Science+Business Media},
       month = apr,
       pages = {141--152},
       doi = {10.1007/978-3-642-32147-4_14},
       archiveprefix = {arXiv},
       eprint = {1206.6318},
       arxiv = {arXiv:1206.6318},
       primaryclass = {cs.CC},
       author = {Braun, Gábor and Pokutta, Sebastian},
       title = {An Algebraic Approach to Symmetric Extended Formulations}
     }

124. Braun, G., Fiorini, S., Pokutta, S., and Steurer, D. (2012). Approximation Limits of Linear Programs (Beyond Hierarchies). 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 480–489. Associated with FOCS 2012. DOI: 10.1109/FOCS.2012.10 [arXiv]
     [BibTeX]

     @inproceedings{2012_BraunSamuelPokuttaSteurer_Approximationlimits:1,
       year = {2012},
       booktitle = {2012 IEEE 53rd Annual Symposium on Foundations of Computer Science},
       publisher = {Institute of Electrical and Electronics Engineers},
       pages = {480--489},
       doi = {10.1109/FOCS.2012.10},
       archiveprefix = {arXiv},
       eprint = {1204.0957},
       arxiv = {arXiv:1204.0957},
       primaryclass = {cs.CC},
       author = {Braun, Gábor and Fiorini, Samuel and Pokutta, Sebastian and Steurer, David},
       title = {Approximation Limits of Linear Programs (Beyond Hierarchies)}
     }

125. Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R., and de Wolf, R. (2012). Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing. Associated with STOC 2012. [arXiv]
     [BibTeX]

     @inproceedings{2012_FioriniMassarPokuttaTiwaryWolf_LinearVsSemidefinite:1,
       year = {2012},
       booktitle = {Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing},
       publisher = {Association for Computing Machinery},
       note = {Best paper award at STOC 2012.},
       archiveprefix = {arXiv},
       eprint = {1111.0837},
       arxiv = {arXiv:1111.0837},
       primaryclass = {math.CO},
       author = {Fiorini, S. and Massar, S. and Pokutta, Sebastian and Tiwary, H.R. and de Wolf, R.},
       title = {Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds}
     }

126. Helmke, H., Gluchshenko, O., Martin, A., Peter, A., Pokutta, S., and Siebert, U. (2011). Optimal mixed-mode runway scheduling — Mixed-integer programming for ATC scheduling. 2011 IEEE/AIAA 30th Digital Avionics Systems Conference, 2C4–1–2C4–13. DOI: 10.1109/dasc.2011.6095994 [URL]
     [BibTeX]

     @inproceedings{2011_HelmkeGluchshenkoMartinPeterPokuttaSiebert_OptimalMixed,
       year = {2011},
       date = {2011-10-01},
       booktitle = {2011 IEEE/AIAA 30th Digital Avionics Systems Conference},
       publisher = {Institute of Electrical and Electronics Engineers},
       month = oct,
       pages = {2C4--1--2C4--13},
       doi = {10.1109/dasc.2011.6095994},
       url = {https://app.box.com/s/34p1ea2of7exdgq7tlty},
       author = {Helmke, Hartmut and Gluchshenko, Olga and Martin, Alexander and Peter, Andrea and Pokutta, Sebastian and Siebert, Uwe},
       title = {Optimal mixed-mode runway scheduling — Mixed-integer programming for ATC scheduling}
     }

127. Dey, S. S., and Pokutta, S. (2011). Design and Verify: A New Scheme for Generating Cutting-Planes. Integer Programming and Combinatorial Optimization, 6655, 143–155. Associated with IPCO 2011. DOI: 10.1007/978-3-642-20807-2_12 [URL]
     [BibTeX]

     @inproceedings{2011_DeyPokutta_DesignVerify:1,
       year = {2011},
       booktitle = {Integer Programming and Combinatorial Optimization},
       series = {Lecture Notes in Computer Science},
       volume = {6655},
       publisher = {Springer Science+Business Media},
       pages = {143--155},
       doi = {10.1007/978-3-642-20807-2_12},
       url = {https://optimization-online.org/?p=2011/04/3002},
       author = {Dey, Santanu Sabush and Pokutta, Sebastian},
       title = {Design and Verify: A New Scheme for Generating Cutting-Planes}
     }

128. Pokutta, S., and Schmaltz, C. (2011). A Network Model for Bank Lending Capacity. Accepted at Systemic Risk, Basel III, Financial Stability and Regulation. [URL]
     [BibTeX]

     @misc{2011_PokuttaSchmaltz_NetworkModel:1,
       howpublished = {Accepted at Systemic Risk, Basel III, Financial Stability and Regulation},
       year = {2011},
       url = {https://papers.ssrn.com/sol3/papers.cfm?abstract_id=1773964},
       author = {Pokutta, Sebastian and Schmaltz, Christian},
       title = {A Network Model for Bank Lending Capacity}
     }

129. Braun, G., and Pokutta, S. (2010). Rank of random half-integral polytopes. Electronic Notes in Discrete Mathematics, 36, 415–422. Associated with ISCO 2010. DOI: 10.1016/j.endm.2010.05.053 [URL]
     [BibTeX]

     @article{2011_BraunPokutta_Randomhalfintegralpolytopes:1,
       year = {2010},
       date = {2010-08-01},
       journal = {Electronic Notes in Discrete Mathematics},
       volume = {36},
       month = aug,
       pages = {415--422},
       doi = {10.1016/j.endm.2010.05.053},
       url = {https://optimization-online.org/?p=2010/11/2813},
       author = {Braun, Gábor and Pokutta, Sebastian},
       title = {Rank of random half-integral polytopes}
     }

130. Drewes, S., and Pokutta, S. (2010). Computing discrete expected utility maximizing portfolios. Accepted at Australasian Finance and Banking Conference. [URL]
     [BibTeX]

     @misc{2010_DrewesPokutta_GeometricMean:1,
       howpublished = {Accepted at Australasian Finance and Banking Conference},
       year = {2010},
       url = {https://papers.ssrn.com/sol3/papers.cfm?abstract_id=1662729},
       author = {Drewes, Sarah and Pokutta, Sebastian},
       title = {Computing discrete expected utility maximizing portfolios}
     }

131. Martin, A., Müller, J., and Pokutta, S. (2010). Strict linear prices in non-convex European day-ahead electricity markets. Accepted at Australasian Finance and Banking Conference. [URL] [arXiv]
     [BibTeX]

     @misc{2010_MartinMullerPokutta_OnClearing:1,
       howpublished = {Accepted at Australasian Finance and Banking Conference},
       year = {2010},
       url = {https://papers.ssrn.com/sol3/papers.cfm?abstract_id=1660528},
       archiveprefix = {arXiv},
       eprint = {1203.4177},
       arxiv = {arXiv:1203.4177},
       primaryclass = {math.OC},
       author = {Martin, Alexander and Müller, Johannes and Pokutta, Sebastian},
       title = {Strict linear prices in non-convex European day-ahead electricity markets}
     }

132. Pokutta, S., and Schulz, A. S. (2010). On the Rank of Cutting-Plane Proof Systems. Integer Programming and Combinatorial Optimization, 6080, 450–463. Associated with IPCO 2010. DOI: 10.1007/978-3-642-13036-6_34 [URL]
     [BibTeX]

     @inproceedings{2010_PokuttaSchulz_RankGenericCutting,
       year = {2010},
       booktitle = {Integer Programming and Combinatorial Optimization},
       series = {Lecture Notes in Computer Science},
       volume = {6080},
       publisher = {Springer Science+Business Media},
       pages = {450--463},
       doi = {10.1007/978-3-642-13036-6_34},
       url = {https://optimization-online.org/?p=2013/02/3782},
       author = {Pokutta, Sebastian and Schulz, Andreas S.},
       title = {On the Rank of Cutting-Plane Proof Systems}
     }

133. Pokutta, S., and Schmaltz, C. (2009). Managing liquidity: Optimal degree of centralization. Accepted at Australasian Finance and Banking Conference. [URL]
     [BibTeX]

     @misc{2009_PokuttaSchmaltz_OptimalDegreeCentralization:1,
       howpublished = {Accepted at Australasian Finance and Banking Conference},
       year = {2009},
       url = {https://papers.ssrn.com/sol3/papers.cfm?abstract_id=1458963},
       author = {Pokutta, Sebastian and Schmaltz, Christian},
       title = {Managing liquidity: Optimal degree of centralization}
     }

134. Alf, M., and Pokutta, S. (2005). How logistics service providers can make use of the real options concept. Accepted at Symposium Mathematik & Logistik 2005.
     [BibTeX]

     @misc{2006_AlfPokutta_LogisticsServiceProviders,
       howpublished = {Accepted at Symposium Mathematik & Logistik 2005},
       year = {2005},
       author = {Alf, M. and Pokutta, Sebastian},
       title = {How logistics service providers can make use of the real options concept}
     }