Searcharxiv⌕ Search

arXiv subjects

Ruben Skorupinski

Publications and source records attributed to Ruben Skorupinski.

4 recordsLinked to original sources

Optimizing the Steady-State Travel Time of Nash Flows over Time with Capacity Increases

We study budgeted capacity augmentation for single-source single-sink \NFOTs under constant inflow $u_0$. The goal is to increase capacities on arcs subject to a global budget constraint in order to minimize the steady-state travel time in the network. We show that this problem is weakly NP-hard on series-parallel networks and provide an exact pseudopolynomial algorithm as well as a fully polynomial algorithm that attains the optimum travel time for budget $B$ while spending at most $B + \varepsilon\cdot\max\{B,u_0\}$. On general networks the problem becomes strongly NP-hard. Moreover, unless $\text{P} = \text{NP}$, for every fixed $\varepsilon \in (0,1)$, no polynomial-time algorithm can achieve the optimal steady-state travel time while exceeding the budget by at most a factor of $n^{1-\varepsilon}$. Lastly, we give structural properties about steady-state travel time under varying arc capacities. We identify capacity thresholds determined by subsets of $s$-$t$-cuts and show that the travel time is constant in the interior of the cells resulting from the corresponding hyperplane arrangement.

cs.DS↗

Optimal Zonotope Containment via Adaptive Gaussian Sampling

We investigate the convex-body containment problem $\max\{s >0 : s Z \subseteq Q\}$, where the outer body $Q \subseteq \mathbb{R}^d$ is described by a membership oracle and the inner body $Z \subseteq \mathbb{R}^d$ is a zonotope. Our main result is a sampling-based $O(\sqrt{d/\log d})$-approximation algorithm for this problem that matches the lower bound of $Ω(\sqrt{d/\log d})$ by Khot and Naor in the oracle model. Starting from approximate Lewis position, the algorithm samples Gaussian directions and adaptively shortens and repositions the generators. Its analysis combines preservation of the support in a fixed direction with contraction of the corresponding functional after renormalization. Crucially, the algorithm works directly with the input generators and does not use zonotope sparsification. We complement this result with a \emph{universal} $Ω(\sqrt{d/\log d})$ lower bound holding for \emph{all} full-dimensional zonotopes when the number of oracle queries is polynomial in $d$. Finally, we consider containment problems $\max\{s >0 : s K \subseteq Q\}$, for general convex bodies $K \subseteq \mathbb{R}^d$. A result of Nasz{ó}di on approximating $K \subseteq \mathbb{R}^d$ by a polytope implies a $Θ(d/\log d)$ approximation algorithm in polynomial time when the centroid of $K$ is the origin. We show the tightness of this approximation factor in the oracle model via a reduction to the circumradius computation. Our lower bound holds for centrally symmetric convex sets, implying that Barvinok's optimal $O(\sqrt{d})$-approximation of a centrally symmetric convex body by a polytope with a polynomial number of vertices cannot be computed in polynomial time.

cs.DS↗

Dimension-Free Rank Lifting from Random Hyperplane Arrangements

We study the width required for a randomly initialized hidden layer of a neural network to achieve rank lifting. Namely, given a dataset $X \in \mathbb{R}^{m \times d}$ of $m$, $d$-dimensional input vectors separated by an angle of at least $θ$, we consider the random feature matrix $σ(XR)$, where $R$ is standard Gaussian. For positively homogeneous nonpolynomial activations, which include sign, Heaviside, ReLU, and ReLU powers among others, we prove that $$n \gtrsim \frac{1}θ\max\left\{m,\log\left(\frac{1}δ\right)\right\}$$ neurons suffice for $σ(XR)$ to have full row rank $m$ with probability at least $1-δ$. This dimension-free bound exponentially improves the previous general-dimensional guarantee for sign features (Drago et al., 2026) and is essentially tight. The proof shows that one random feature column escapes every proper subspace of $\mathbb{R}^m$ with probability $Ω(θ)$, using a coupling of nearby Gaussian directions and a local crossing of the induced hyperplane arrangement. We also study stable rank lifting, where the goal is to establish a quantitative analogue of exact rank lifting, i.e., a lower bound on the smallest eigenvalue of the empirical feature Gram matrix in high-probability. Our analysis unifies and generalizes stable rank guarantees for all $q$-homogeneous non-polynomial activations following prior work in Panigrahi et al. (2020) and Song (2026). In particular, we combine a diagonally dominant Taylor tail of the population kernel with truncation and matrix concentration, to show that for positively homogeneous nonpolynomial activations, stable rank lifting is achieved at width $$n \gtrsim C^q \frac{m}{θ^{2q+1}} \log^{2q+\frac{1}{2}}\left(\frac{m}θ\right) \log\left(\frac{m}δ\right),$$ where $q$ is the degree of the activation and $C > 0$ is some universal constant.

cs.LG↗

Zonoid volumes are not log-submodular

We disprove the conjecture that volume is log-submodular under Minkowski addition on the class of zonoids by exhibiting a four-dimensional zonotope $A$ and two segments $B$ and $C$ such that \begin{align*} |A||A+B+C|>|A+B||A+C|, \end{align*} where $|\cdot|$ denotes the volume. Consequently, several related local mixed-volume, local Loomis-Whitney, projection-volume ratio, and volume-to-surface-area conjectures also fail for zonoids. The zonotope in our counterexample is generated by a 2-modular matrix. We also provide a proof of the correctness of the conjecture in the case where $A+B+C$ is a unimodular zonotope as well as a characterization of the equality cases in this setting.

math.MG↗