CORTEXA
← Browse
arxivcs.LG2026-07-31

Pyramidal Width Can Increase Under Vertex Insertion

Jinze Zhao

Lacoste-Julien and Jaggi conjectured in 2015 that the pyramidal width of a polytope cannot increase when a vertex is added, provided that every old point remains a vertex. We give an exact counterexample with six integer points in $\R^3$. For \[ P=\conv\{v_0,\ldots,v_4\},\qquad Q=\conv\{v_0,\ldots,v_5\}, \] where \[ \begin{aligned} v_0&=(-1,-3,-1), & v_1&=(3,2,-2), & v_2&=(0,2,1),\\ v_3&=(-1,-3,3), & v_4&=(-2,0,1), & v_5&=(-1,0,-2), \end{aligned} \] all five vertices of $P$ remain vertices of $Q$, but \[ \PWidth(P)^2=\frac{48}{353} \quad\text{and}\quad \PWidth(Q)^2=\frac{36}{133}. \] Thus vertex insertion increases pyramidal width by the factor $\sqrt{1059/532}\approx 1.410886779$. The proof uses the equivalence between pyramidal width and facial distance, certifies both face lattices by integer supporting hyperplanes, and evaluates every facial distance by a finite rational calculation. A dependency-free exact verifier accompanies the paper.

View free PDFSource page

Related papers

arxivcs.LG2026-07-18

Effects of width-dependent model hyperparameters and $\ell_2$-regularization on the loss landscape of two-layer ReLU networks

Haruka Eshima, Makoto Yamada

Understanding deep neural networks remains a central challenge in machine learning. In particular, the theoretical properties of even two-layer ReLU networks, especially in the presence of weight decay, remain poorly understood. To this end, we derive a sufficient condition on th…

View free PDFSource page
arxivcs.LGquant-ph2026-07-15

PQFA: Parallel Quantum Feature Augmentation of Fused Representations for Multimodal Classification

Mingzhu Wang, Yun Shang

Most multimodal learning methods improve how heterogeneous representations are aligned and fused, while post-fusion enhancement remains less explored. We propose Parallel Quantum Feature Augmentation (PQFA), a hybrid quantum-classical framework that applies multiple shallow varia…

View free PDFSource page
arxivcs.CVcs.AIcs.LG2026-07-24

CARDIAG: A Dense Segment Classification Benchmark of Deep Learning Architectures for Coronary Angiography

Dominik Bernard Lau, Hubert Malinowski, Jerzy Szyjut, Adam Brzeski, Tomasz Dziubich, Radosław Targoński, et al.

Accurate pixel-level classification of coronary angiograms is critical for cardiovascular disease assessment, yet the field lacks standardized evaluation protocols. In this work we demonstrate a new benchmark for the assessment of deep learning models which densely classify pixel…

View free PDFSource page
arxivcs.LGcs.AI2026-07-14

Learning-based Probabilistic Load Forecasting with Post-hoc and In-model Uncertainty

Sarah Al-Shareeda, Gulcihan Ozdemir, Heung Seok Jeon

Smart-building load forecasters are often trained offline on dense, multivariate, high-frequency data, but deployment may provide only hourly, feature-limited inputs. Missing features must then be reconstructed, and their errors can propagate through the model. If this input unce…

View free PDFSource page
arxivcs.LG2026-07-10

FlashTrie: A GPU-Accelerated Constrained Beam Search for Generative Retrieval

Dakshitha Anandakumar, Anurag Mukkara, Wenxiang Hu, Jiusheng Chen, M Akash Kumar, Ting Ye, et al.

Constrained decoding is essential in generative retrieval, where document identifiers generated directly from a query must exactly match a predefined library of valid IDs. At scale, decoding is often constrained using a trie with beam search but most implementations run on CPU. L…

View free PDFSource page