181 citations · 620 across the 171 of their papers we have counts for
189 papers
AlphaDiana: A Measurement System for Agents in Verifiable Reasoning Tasks
Zhanke Zhou, Zongze Li, Weikai Huang +16
Agents pair reasoning models with harnesses that organize model calls, execute tools, load skill instructions, and retain history in memory. Understanding agent performance require…
The exact worst-case asymptotic rate of Nesterov acceleration for strongly convex optimization
Sebastian Pokutta, Bartolomeo Stellato
We study Nesterov's accelerated gradient method with its standard constant parameters for smooth strongly convex optimization. We characterize the exact worst-case asymptotic facto…
LinearPFN: Amortized Variable Selection for Linear Models with Interactions
Louis Schiekiera, Max Zimmer, Christophe Roux +3
Spike-and-slab regression is a standard Bayesian formulation of variable selection: it returns a posterior distribution over which candidate effects are active rather than a single…
Prompting Against Persona Drift: Comparing Intervention Timing and Content in LLM-Simulated Conversations
Nicolas Leins, Jennifer Haase, Varvara Geronimus +2
Simulating student personas with large language models (LLMs) enables scalable evaluation of educational systems. However, behavioral drift, a progressive decline in persona consis…
Optimal Gradient-Norm Minimization in Non-Euclidean Hölder-Smooth Convex Optimization
Nico Pelleriti, Maryam Shiran, David Martínez-Rubio +2
Minimizing gradients of a convex function is an important problem across optimization and learning tasks. The gradient provides a directly computable certificate of approximate sta…
Discrete eigenvalue optimization from entropic smoothing and first-order methods
Deborah Hendrych, Mathieu Besançon, Sebastian Pokutta
We study the maximization of the minimum eigenvalue under combinatorial and integrality constraints. We propose a new approach based on branch-and-bound combines entropic smoothing…
Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation
Alejandro R. Ramos Ramos, Maximilian Fröhlich, Aaron Sander +4
Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies, as existing Lindblad estimation methods are typically limited…
Bounded-Support Additive Latin Transversals
Antoine Deza, Yan Gerard, Yijun Ma +1
We consider the following additive Latin transversal problem. Given a multiset of elements of and a set of cardinality …
Joint-Range Inequalities for Nonconvex QCQPs
Liding Xu, Sebastian Pokutta
We study cutting planes for nonconvex quadratically constrained quadratic programs (QCQPs) through a project-then-lift approach inspired by mixed-integer rounding (MIR) inequalitie…
When Does LLM Orchestration Pay Off? A Controlled Evaluation of Accuracy, Cost, and Task Difficulty
Nicolas Leins, Nico Pelleriti, Jana Gonnermann-Müller +1
LLM orchestration is often assumed to improve reasoning by allocating additional inference-time computation, yet its gains may not justify its cost. Existing comparisons also frequ…
The Weight Distribution of the Third-Order Reed-Muller Code of Length 2048
Kirill Khoruzhii, Patrick Gelß, Sebastian Pokutta
We compute the weight distribution of the third-order Reed--Muller code RM(3,11) of length 2048. The weight enumerator is assembled from the coset weight enumerators of f+RM(2,10),…
A Counterexample to Ziegler's Cross-Polytope Conjecture for Simplicial 0/1-Polytopes
Volker Kaibel, Sebastian Pokutta
Ziegler proved that every simplicial -dimensional -polytope has at most vertices, and asked whether equality forces the polytope to be centrally symmetric and hence, e…
Classification of Boolean Cubic Forms in Ten Variables
Kirill Khoruzhii, Patrick Gelß, Sebastian Pokutta
We classify Boolean cubic forms in ten variables up to GL(10,2)-equivalence. The catalog contains all 3691560 nonzero orbits. For every orbit we provide a representative with small…
(Approximate) Symmetric Extension Complexity of the Spanning Tree Polytope
Sebastian Pokutta
We prove a tight lower bound on symmetric LP formulations for the spanning tree polytope of the complete graph. More precisely, let be the spanning tree polytope of $…
Neural Field Tokenizations with Hierarchy and Spatial Locality Priors
Alonso Urbano, David W. Romero, Max Zimmer +1
Neural fields parameterize data as functions from coordinates to values, providing a unified framework for representation learning across modalities. Existing approaches are domina…
Random-Subspace Frank--Wolfe over Strongly Convex Sets
Pierre-Louis Poirion, Sebastian Pokutta, Akiko Takeda
Frank--Wolfe methods avoid projections, but over curved feasible regions the full-space linear minimization oracle (LMO) can itself become the computational bottleneck. We introduc…
What Do Evolutionary Coding Agents Evolve?
Nico Pelleriti, Sree Harsha Nelaturu, Zhanke Zhou +4
Recent work pairs LLMs with evolutionary search to iteratively generate, modify, and select code using task-specific feedback. These systems have produced strong results in mathema…
Abs-Smooth Frank-Wolfe Method: Primal-Dual Analysis, Heavy Ball Momentum, and Inexact Oracles
Sri Harshitha Tadinada, Sebastian Pokutta, Andrea Walther
We study projection-free optimization for convex objectives that satisfy abs-smoothness, a structural property that captures many non-smooth yet piecewise smooth functions arising,…
Curvature-Dependent Lower Bounds for Frank-Wolfe
Jannis Halbey, Christophe Roux, Sebastian Pokutta
The Frank-Wolfe algorithm achieves a convergence rate of for smooth convex optimization over compact convex domains, accelerating to when bo…
Simulating Eating Disorder Patients with LLMs: Evaluating Psychological Persona Stability in Multi-Turn Conversations
Jennifer Haase, Jana Gonnermann-Müller, See Heng Yim +3
Large language model (LLM)-based simulations of clinical patients are increasingly used for research and training, yet their validity requires persona stability: coherent maintenan…
Agentic MIP Research: Accelerated Constraint Handler Generation
Liding Xu, Yugeng Zhou, Sebastian Pokutta
Mixed-integer programming (MIP) research is both mathematically sophisticated and engineering-intensive: testing an algorithmic hypothesis within a branch-and-cut solver requires s…
CHAP: A Hybrid GPU-CPU Heuristic for MIP
Gennesaret Kharistio Tjusila, Alexander Hoen, Nils-Christian Kempke +5
We present CHAP (Coordinating Heuristics Across Platforms) a GPU-CPU-hybrid primal heuristic framework for mixed-integer programming. CHAP adopts a portfolio approach where it coor…
Out-of-the-Box Global Optimization for Packing Problems: New Models and Improved Solutions
Timo Berthold, Dominik Kamp, Gioni Mexi +2
Recent LLM-driven discoveries have renewed interest in geometric packing problems. In this paper, we study several classes of such packing problems through the lens of modern globa…
LLM-Based Educational Simulation: Evaluating Temporal Student Persona Stability Across ADHD Profiles
Jana Gonnermann-Müller, Jennifer Haase, Nicolas Leins +2
Large language model (LLM)-based student simulation offers a scalable alternative for educational research, teacher training, and learner practice. However, its validity depends on…