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

推荐订阅源

人人都是产品经理
人人都是产品经理
有赞技术团队
有赞技术团队
WordPress大学
WordPress大学
月光博客
月光博客
T
Tailwind CSS Blog
阮一峰的网络日志
阮一峰的网络日志
小众软件
小众软件
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Last Week in AI
Last Week in AI
大猫的无限游戏
大猫的无限游戏
S
SegmentFault 最新的问题
罗磊的独立博客
Jina AI
Jina AI
酷 壳 – CoolShell
酷 壳 – CoolShell
宝玉的分享
宝玉的分享
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
博客园 - 三生石上(FineUI控件)
量子位
雷峰网
雷峰网
Apple Machine Learning Research
Apple Machine Learning Research
美团技术团队
博客园 - 聂微东
V
V2EX

cs updates on arXiv.org

Beyond Binary Edits Robust Multimodal Knowledge Editing with Adversarial Subspace Alignment Agentic Proving for Program Verification MemAudit: Post-hoc Auditing of Poisoned Agent Memory via Causal Attribution and Structural Anomaly Detection OpenSkillEval: Automatically Auditing the Open Skill Ecosystem for LLM Agents One Policy, Infinite NPCs: Persona-Traceable Shared RL Policies for Scalable Game Agents How Human-Like Are Large Language Models? A Register-Aware Linguistic Evaluation Framework Benchmarking Google Embeddings 2 against Open-Source Models for Multilingual Dense Retrieval and RAG Systems Structure-Guided Entity Resolution: Fine-Tuning LLMs for Robust Name Matching in Complex Linguistic Contexts Solving the Aircraft Disassembly Scheduling Problem Co-ReAct: Rubrics as Step-Level Collaborators for ReAct Agents CP or DP? Why Not Both: A Case Study in the Partial Shop Scheduling Problem Asking For An Old Friend: Diagnosing and Mitigating Temporal Failure Modes in LLM-based Statutory Question Answering EDGE-OPD: Internalizing Privileged Context with Evidence Guided On-Policy Distillation ARES: Automated Rubric Synthesis for Scalable LLM Reinforcement Learning SSDAU: Structured Semantic Data Augmentation for Joint Entity and Relation Extraction Naturalistic measure of social norms alignment Articulatory strategy as a source of variation in acoustic vowel dynamics When Planning Fails Despite Correct Execution: On Epistemic Calibration for LLM-Based Multi-Agent Systems EquiSumm : A Gender Bias-Aware Framework for Inclusive Tweet Summarization Metacognition as Reward: Reinforcing LLM Reasoning via Knowledge and Regulation Signals From Correctness to Preference: A Framework for Personalized Agentic Reinforcement Learning Cultural Adaptation in Large Language Models for Political Discourse Emotion Recognition in Sign Language Conversation ClimateChat-300K: A Multi-Modal Facebook Dataset for Understanding Diverse Perspectives in Climate Communication AraHopeCorpus: Annotation Guidelines and Dataset for Hope Speech in Arabic Social Media Crisis Discourse Human-in-the-Loop Multi-Agent Ventilator Decision Support with Contextual Bandit Preference Learning Convergence Without Understanding: When Language Models Agree on Representations but Disagree on Reasoning DART: Semantic Recoverability for Structured Tool Agents Ontological Knowledge Blocks: Executable Compliance and Profile-Based Validation for Trustworthy AI Systems Parallel Context Compaction for Long-Horizon LLM Agent Serving
Exact Nonnegative Matrix Factorization via Cone-Ray Witne...
[Submitted on 21 Jun 2026] · 2026-06-23 · via cs updates on arXiv.org

View PDF HTML (experimental)

Abstract:We study exact nonnegative matrix factorization (NMF) of small exact-rank-r matrices via a cone-ray pipeline combining the truncated SVD, the polyhedral cone of nonnegative preimages, the Double Description Method (DDM, via Fukuda's cddlib), and an alternating linear program (alt-LP) for slack minimisation. Under a uniform-support restriction the factorisation constraint Q P^T = I_r reduces to entrywise nonnegativity of an r x r witness matrix M_T = R_T^{-1} (R_K^T)^{-1} for an r-subset pair (T, K) of cone rays; this closed-form witness recovers an exact NMF in microseconds when feasible.
We characterise feasibility by ranking r-subsets via geometric near-orthogonality ("obtuseness") and walking the top of each list. A 100-trial Monte Carlo at m=n=10 exposes a clean saturation curve: success 44/32/8, 79/85/58, and 79/87/59 of 100 at top-5/200/400 for r=4,5,6 -- beyond top-200 the failures are structural, not budget-limited. Enlarging m,n at fixed r hurts: at m=n=15 success collapses to 37/7/0/0/0 for r=4..8. On Olivetti faces (400x4096) the DDM step itself times out.
Our main contribution is a hybrid that breaks this ceiling: at each pair we first try the closed-form M_T, and when it is infeasible we augment both supports by k=2 maximally angularly-separated rays and solve for mu,nu>=0 by a short slack-LP alternation. On the same m=n=10 Monte Carlo this lifts success from 79/85/58 to 99/95/75 at r=4,5,6, with cone reconstruction error at or near machine precision. We close with the four scaling walls the pipeline faces and concrete next steps.

Submission history

From: Mithil Ramteke Mr [view email]
[v1] Sun, 21 Jun 2026 11:51:35 UTC (24 KB)