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

推荐订阅源

F
Fortinet All Blogs
有赞技术团队
有赞技术团队
量子位
N
Netflix TechBlog - Medium
博客园 - 叶小钗
博客园 - 三生石上(FineUI控件)
Google DeepMind News
Google DeepMind News
aimingoo的专栏
aimingoo的专栏
GbyAI
GbyAI
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Blog — PlanetScale
Blog — PlanetScale
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
月光博客
月光博客
Martin Fowler
Martin Fowler
Y
Y Combinator Blog
宝玉的分享
宝玉的分享
博客园 - 司徒正美
云风的 BLOG
云风的 BLOG
V
Visual Studio Blog
V
V2EX
IT之家
IT之家
L
LangChain Blog
大猫的无限游戏
大猫的无限游戏
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More

cs.IT updates on arXiv.org

Theoretical Limits of Language Model Alignment $f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Expert Routing for Communication-Efficient MoE via Finite Expert Banks Contextual Memory-Enhanced Source Coding for Low-SNR Communications Realizable Bayes-Consistency for General Metric Losses Leveraging Code Automorphisms for Improved Syndrome-Based Neural Decoding A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning Dueling DDQN-Based Adaptive Multi-Objective Handover Optimization for LEO Satellite Networks The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy Optimization of CV-QKD Under Practical Constraints Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels SwiftChannel: Algorithm-Hardware Co-Design for Deep Learning-Based 5G Channel Estimation Evolving Token Communication with Parametric Memory Network Remote Action Generation: Remote Control with Minimal Communication The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation Linear-Readout Floors and Threshold Recovery in Computation in Superposition Soft Graph Diffusion Transformer for MIMO Detection Hierarchical Federated Learning for Networked AI: From Communication Saving to Architecture-Aware Design Exponential families from a single KL identity MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness Diffusion-OAMP for Joint Image Compression and Wireless Transmission Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
Unitary orthonormal bases of finite dimensional inclusions
Keshab Chandra Bakshi, B V Rajarama Bhat · 2025-02-17 · via cs.IT updates on arXiv.org

We study unitary orthonormal bases in the sense of Pimsner and Popa for inclusions $(\mathcal{B}\subseteq \mathcal{A}, E),$ where $\mathcal{A}, \mathcal{B}$ are finite dimensional von Neumann algebras and $E$ is a conditional expectation map from $\mathcal{A}$ onto $\mathcal{B}$. It is shown that existence of such bases requires that the associated inclusion matrix satisfies a spectral condition forcing dimension vectors to be Perron-Frobenius eigenvectors and the conditional expectation map preserves the Markov trace. Subject to these conditions, explicit unitary orthonormal bases are constructed if either one of the algebras is abelian or simple. They generalize complex Hadamard matrices, Weyl unitary bases, and a recent work of Crann et al which correspond to the special cases of $\mathcal{A}$ being abelian, simple, and general multi-matrix algebras respectively with $\mathcal{B}$ being the algebra of complex numbers. For the first time $\mathcal{B}$ is more general. As an application of these results it is shown that if $(\mathcal{B}\subseteq \mathcal{A}, E),$ admits a unitary orthonormal basis then the Connes-Størmer relative entropy $H(\mathcal{A}_1|\mathcal{A})$ equals the logarithm of the square of the norm of the inclusion matrix, where $\mathcal{A}_1$ denotes the Jones basic construction of the inclusion. As a further application, we prove the existence of unitary orthonormal bases for a large class of depth 2 subfactors with abelian relative commutant.