← Back to all news
arXiv Machine Learning October 2, 2026 By Luca Becchetti, Matteo Russo, Ruben Skorupinski

Dimension-Free Rank Lifting from Random Hyperplane Arrangements

Read the original on arXiv Machine Learning →

The Flow has not summarised this story yet — read it at arXiv Machine Learning.

One email a morning, machine-written

One email a day, machine-written, one click to leave. We never share your address.

Related stories

arXiv Machine Learning
Jul 21

Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization

arXiv:2602. 20376v3 Announce Type: replace-cross Abstract: We study the problem of maximizing a complex-valued quadratic form over the $K^{\text{th}}$ roots of unity.

By Ria Stevens, Fangshuo Liao, Barbara Su, Thanasis Hadjidimoulas, Jianqiang Li, Anastasios Kyrillidis
benchmarks
More like this →
arXiv Machine Learning
Aug 17

High-dimensional nonparametric changepoint detection via low-rank degree-two density projection

arXiv:2608. 13922v1 Announce Type: new Abstract: Detecting distributional changes in high dimension is difficult when neither the pre-change nor post-change density is parametrically specified.

By Guoqing Zhang, Zhaixin Chen
efficiencybenchmarks
More like this →
arXiv Machine Learning
Sep 23

Intrinsic Interaction Geometry Controls the Low-Rank Complexity of Softmax Attention

arXiv:2608.28150v2 Announce Type: replace Abstract: How much matrix rank is required to preserve every bounded value output of normalized softmax attention? We study the unrestricted maximum-row-\(\e...

By Yuhe Sui, Jianing Zhang, Yingzhi Tang
llms
More like this →
arXiv Machine Learning
Jun 16

Stochastic trace estimation with tensor train random vectors

arXiv:2606. 15679v1 Announce Type: cross Abstract: Stochastic trace estimation is a standard tool for approximating the trace of a large-scale matrix available only through matrix-vector products.

By Zvonimir Bujanovi\'c, Daniel Kressner, Hrvoje Oli\'c
More like this →
arXiv Machine Learning
Jul 10

A law of robustness for two-layer neural networks with arbitrary weights

arXiv:2607. 07778v1 Announce Type: new Abstract: Bubeck, Li and Nagaraj conjectured that, for generic data, any two-layer neural network with $m$ neurons that fits $n$ noisy labels must have Lipschitz constant at least of order $\sqrt{n/m}$, with no restriction on the size of the weights.

By Yitzchak Shmalo
More like this →
arXiv Machine Learning
Aug 11

Exact Rank and Convex Calibration Dimension Lower Bounds for the Multi-Label F1 Loss

arXiv:2608. 08399v1 Announce Type: new Abstract: The instance-wise $F_1$ measure is a central performance measure for multi-label classification.

By Mingyuan Zhang
More like this →
About Pricing API Newsletter Sources Privacy Terms Refunds Accessibility Provider info Contact RSS

The Flow links to publishers and never republishes their articles. Summaries are machine-generated.

v1.1.0 · 5f852ea