Thomas Rothvoss

activity

20102026

most citedExtended formulations for polygons

81 citations · 136 across the 38 of their papers we have counts for

collaborators

45 papers

math.MG2026

Linear-size $ℓ_{1}$ sparsifiers

Victor Reis, Thomas Rothvoss

We prove that for any matrix $A \in R^{m \times n}$ and any $ε > 0$ there is a diagonal matrix $D \in R_{\geq 0}^{m \times m}$ with at most $O(\frac{n}{…

cs.DM2025

Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure

Daniel Dadush, Friedrich Eisenbrand, Rom Pinchasi +2

For a real matrix $A \in R^{d \times n}$ with non-collinear columns, we show that $n \leq O (d^{4} κ_{A})$ where $κ_{A}$ is the \emph{circuit imbalance measure} of $A$ . The circu…

cs.LG2025

DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy Theory

Jerry Chee, Arturs Backurs, Rainie Heck +4

Quantizing the weights of a neural network has two steps: (1) Finding a good low bit-complexity representation for weights (which we call the quantization grid) and (2) Rounding th…

cs.CC2025

A parameterized linear formulation of the integer hull

Friedrich Eisenbrand, Thomas Rothvoss

Let $A \in Z^{m \times n}$ be an integer matrix with components bounded by $Δ$ in absolute value. Cook et al.~(1986) have shown that there exists a universal matrix $B \in…

math.PR2024

A Geometric Perspective on the Injective Norm of Sums of Random Tensors

Afonso S. Bandeira, Sivakanth Gopi, Haotian Jiang +2

Matrix concentration inequalities, intimately connected to the Non-Commutative Khintchine inequality, have been an important tool in both applied and pure mathematics. We study ten…

math.OC2023

Forall-exist statements in pseudopolynomial time

Eleonore Bach, Friedrich Eisenbrand, Thomas Rothvoss +1

Given a convex set $Q \subseteq R^{m}$ and an integer matrix $W \in Z^{m \times n}$ , we consider statements of the form $\forall b \in Q \cap Z^{m}$ $\exists x \in Z^{n}$ s.t. $Wx \leq…