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

推荐订阅源

T
The Blog of Author Tim Ferriss
Hugging Face - Blog
Hugging Face - Blog
F
Fortinet All Blogs
B
Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Microsoft Security Blog
Microsoft Security Blog
Blog — PlanetScale
Blog — PlanetScale
月光博客
月光博客
腾讯CDC
小众软件
小众软件
G
Google Developers Blog
V
Visual Studio Blog
罗磊的独立博客
GbyAI
GbyAI
V
V2EX
大猫的无限游戏
大猫的无限游戏
H
Help Net Security
L
LangChain Blog
Engineering at Meta
Engineering at Meta
量子位
The GitHub Blog
The GitHub Blog
博客园 - 司徒正美
WordPress大学
WordPress大学
B
Blog RSS Feed

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
Asymptotics of the geometric mean error for in-homogeneou...
Sanguo Zhu, Youming Zhou, Yongjian Sheng · 2014-10-23 · via cs.IT updates on arXiv.org

Let $(f_i)_{i=1}^N$ be a family of contractive similitudes on $\mathbb{R}^q$ satisfying the open set condition. Let $(p_i)_{i=0}^N$ be a probability vector with $p_i>0$ for all $i=0,1,\ldots,N$. We study the asymptotic geometric mean errors $e_{n,0}(μ),n\geq 1$, in the quantization for the in-homogeneous self-similar measure $μ$ associated with the condensation system $((f_i)_{i=1}^N,(p_i)_{i=0}^N,ν)$. We focus on the following two independent cases: (I) $ν$ is a self-similar measure on $\mathbb{R}^q$ associated with $(f_i)_{i=1}^N$; (II) $ν$ is a self-similar measure associated with another family of contractive similitudes $(g_i)_{i=1}^M$ on $\mathbb{R}^q$ satisfying the open set condition and $((f_i)_{i=1}^N,(p_i)_{i=0}^N,ν)$ satisfies a version of in-homogeneous open set condition. We show that, in both cases, the quantization dimension $D_0(μ)$ of $μ$ of order zero exists and agrees with that of $ν$, which is independent of the probability vector $(p_i)_{i=0}^N$. We determine the convergence order of $(e_{n,0}(μ))_{n=1}^\infty$; namely, for $D_0(μ)=:d_0$, there exists a constant $D>0$, such that \[ D^{-1}n^{-\frac{1}{d_0}}\leq e_{n,0}(μ)\leq D n^{-\frac{1}{d_0}}, n\geq 1. \]