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

推荐订阅源

Hugging Face - Blog
Hugging Face - Blog
WordPress大学
WordPress大学
Microsoft Azure Blog
Microsoft Azure Blog
F
Fortinet All Blogs
B
Blog RSS Feed
Last Week in AI
Last Week in AI
The Cloudflare Blog
大猫的无限游戏
大猫的无限游戏
人人都是产品经理
人人都是产品经理
P
Proofpoint News Feed
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Microsoft Security Blog
Microsoft Security Blog
博客园 - 三生石上(FineUI控件)
Y
Y Combinator Blog
GbyAI
GbyAI
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
小众软件
小众软件
雷峰网
雷峰网
C
Check Point Blog
阮一峰的网络日志
阮一峰的网络日志
博客园 - 叶小钗
博客园 - 司徒正美
U
Unit 42
量子位

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Operator Inequalities in $Φ$-Product Tensor Algebras: Inv...
[Submitted on 19 Jun 2026] · 2026-06-23 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:We study classical operator inequalities in $\Phi$-product tensor algebras (a transformation $\Phi$-based generalization of the $t$-product framework) for third-order tensors. Although these algebras are algebraically isomorphic under different unitary transforms $\Phi$, we show that their quantitative behavior is not invariant. We prove that fundamental inequalities, including Golden--Thompson, Jensen, Klein, and Lieb, extend to the $\Phi$-product setting with the same constants as in the matrix case. However, the associated defect -- the slack between the two sides of the inequality -- depends explicitly on transform-domain noncommutativity. In particular, we establish a sharp characterization of the defect in terms of slice-wise commutators, revealing that inequality tightness is governed by transform-induced noncommutativity. We further demonstrate strong transform sensitivity by constructing explicit tensor pairs for which the defect vanishes under one transform (e.g., discrete Fourier transform) but grows linearly with the tensor depth under another transform (e.g., discrete Cosine transform), yielding an $\Omega(p)$ separation where $p$ is the matrix dimension of $\Phi$. Moreover, we prove that no transform is universally optimal: for any pair of transforms, there exist tensors for which each is strictly better than the other. These results show that the choice of transform defines a coordinate system in which commutativity is measured, inducing a nontrivial geometry of inequality tightness. Consequently, optimal transform selection is inherently data-dependent and can be formulated as an optimization problem over the unitary group.

Submission history

From: Shih Yu Chang [view email]
[v1] Fri, 19 Jun 2026 18:17:48 UTC (51 KB)