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

推荐订阅源

让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
V
V2EX
小众软件
小众软件
MongoDB | Blog
MongoDB | Blog
Jina AI
Jina AI
G
Google Developers Blog
H
Help Net Security
Microsoft Azure Blog
Microsoft Azure Blog
月光博客
月光博客
The GitHub Blog
The GitHub Blog
Y
Y Combinator Blog
爱范儿
爱范儿
B
Blog
云风的 BLOG
云风的 BLOG
H
Hackread – Cybersecurity News, Data Breaches, AI and More
GbyAI
GbyAI
博客园 - 叶小钗
aimingoo的专栏
aimingoo的专栏
Blog — PlanetScale
Blog — PlanetScale
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
有赞技术团队
有赞技术团队
博客园_首页
Google DeepMind News
Google DeepMind News
M
MIT News - Artificial intelligence

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
Fourier-Reflexive Partitions Induced by Poset Metric
Yang Xu, Haibin Kan, Guangyue Han · 2021-07-22 · via cs.IT updates on arXiv.org

Let $\mathbf{H}$ be the cartesian product of a family of finite abelian groups indexed by a finite set $Ω$. A given poset (i.e., partially ordered set) $\mathbf{P}=(Ω,\preccurlyeq_{\mathbf{P}})$ gives rise to a poset metric on $\mathbf{H}$, which further leads to a partition $\mathcal{Q}(\mathbf{H},\mathbf{P})$ of $\mathbf{H}$. We prove that if $\mathcal{Q}(\mathbf{H},\mathbf{P})$ is Fourier-reflexive, then its dual partition $Λ$ coincides with the partition of $\hat{\mathbf{H}}$ induced by $\mathbf{\overline{P}}$, the dual poset of $\mathbf{P}$, and moreover, $\mathbf{P}$ is necessarily hierarchical. This result establishes a conjecture proposed by Gluesing-Luerssen in \cite{4}. We also show that with some other assumptions, $Λ$ is finer than the partition of $\hat{\mathbf{H}}$ induced by $\mathbf{\overline{P}}$. In addition, we give some necessary and sufficient conditions for $\mathbf{P}$ to be hierarchical, and for the case that $\mathbf{P}$ is hierarchical, we give an explicit criterion for determining whether two codewords in $\hat{\mathbf{H}}$ belong to the same block of $Λ$. We prove these results by relating the involved partitions with certain family of polynomials, a generalized version of which is also proposed and studied to generalize the aforementioned results.