21 citations · 50 across the 18 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
math.OC2026
On the Distribution of Unweighted Minimum Knapsack Instances with Large SOS Rank
Adam Kurpisz, Lucas Slot, Mikhail Zaytsev
We analyze the sum-of-squares rank of unweighted instances of the Minimum Knapsack (MK) problem, i.e., minimization of for 0/1 variables under the constraint $\s…
cs.LG2026
Agnostic learning in (almost) optimal time via Gaussian surface area
Lucas Pesenti, Lucas Slot, Manuel Wiedmer
The complexity of learning a concept class under Gaussian marginals in the difficult agnostic model is closely related to its -approximability by low-degree polynomials. For a…
math.AT2026
Robustness of Persistent Topological Features and Minimum Homological Cuts
Pepijn Roos Hoefgeest, Lucas Slot
Persistent homology is a popular method for computing topological features of (metric) data. Standard approaches based on the Čech or Rips filtration are stable under small perturb…