惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

爱范儿
爱范儿
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
WordPress大学
WordPress大学
Y
Y Combinator Blog
I
InfoQ
美团技术团队
罗磊的独立博客
B
Blog RSS Feed
GbyAI
GbyAI
小众软件
小众软件
IT之家
IT之家
Engineering at Meta
Engineering at Meta
Blog — PlanetScale
Blog — PlanetScale
V
V2EX
Last Week in AI
Last Week in AI
酷 壳 – CoolShell
酷 壳 – CoolShell
Jina AI
Jina AI
MyScale Blog
MyScale Blog
博客园 - 聂微东
Microsoft Security Blog
Microsoft Security Blog
博客园 - 【当耐特】
Apple Machine Learning Research
Apple Machine Learning Research
The GitHub Blog
The GitHub Blog
T
The Blog of Author Tim Ferriss

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Gap-Aware Exact Nonnegative Matrix Factorization: A Two-S...
[Submitted on 24 Jun 2026] · 2026-06-25 · via math.ST updates on arXiv.org

View PDF HTML (experimental)

Abstract:We extend the cone-ray exact-NMF pipeline of Ramteke (arXiv:2606.22451) from the uniform-support regime r_+ = r to the gap regime r_+ > r, and classify recoverable nonnegative factorisations by the rank of the W-factor into a three-regime taxonomy. Regime A (rank(W) = r_+, full column rank): a two-sided SVD-gauge cone-ray pipeline W = U_{r+}(G) Q, H = P V_{r+}(K)^T with G, K on Stiefel manifolds and square consistency Q P = diag(S_r, 0). On 10x10 dense random gap matrices it gives 100/100 recovery at r_+ = 5 and 6. We explain this via two geometric facts: slack enclosure (the data cone has codimension r_+ - r in the outer cone) and NRF-variety thickness (valid gauges form a positive-measure set, so the blind SVD lands on one with probability one). Regime B (rank(W) = r, W a column subset of M): a rank-deficient-W branch enumerating r_+-subsets of M's columns with per-column LP tests. On the block-diagonal family diag(C, J_k), where additivity of nonnegative rank collapses the valid gauges to a single point and the blind SVD pipeline fails, the column-subset branch restores recovery in milliseconds. Regime C (r < rank(W) < r_+, W not a column subset): exposed by the regular octagon's slack matrix. An exact size-6 NRF exists and is reachable by the symmetric formulation at an oracle gauge derived from a known factorisation (residual 1.5e-10), but the blind problem is open: 50 Haar random restarts and Riemannian gradient descent on the Stiefel/Grassmann gauge all stall, because the alt-LP residual is piecewise constant on cells of gauge-space, so local descent cannot cross cell walls. A combined toolkit (Regime B then A) covers regimes A and B with no regression on dense draws; Regime C remains open, with the regular octagon as the cleanest unsolved test case.

Submission history

From: Mithil Ramteke Mr [view email]
[v1] Wed, 24 Jun 2026 11:31:05 UTC (31 KB)