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

推荐订阅源

GbyAI
GbyAI
Blog — PlanetScale
Blog — PlanetScale
The GitHub Blog
The GitHub Blog
Microsoft Security Blog
Microsoft Security Blog
I
InfoQ
A
About on SuperTechFans
T
The Blog of Author Tim Ferriss
D
DataBreaches.Net
L
LangChain Blog
F
Fortinet All Blogs
C
Check Point Blog
Google DeepMind News
Google DeepMind News
云风的 BLOG
云风的 BLOG
Engineering at Meta
Engineering at Meta
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
H
Help Net Security
J
Java Code Geeks
月光博客
月光博客
H
Hackread – Cybersecurity News, Data Breaches, AI and More
IT之家
IT之家
aimingoo的专栏
aimingoo的专栏
小众软件
小众软件
宝玉的分享
宝玉的分享
Jina AI
Jina AI

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
Metric embeddings of cubes into dense subsets of cubes
[Submitted on 4 Mar 2026 (v1), last revised 1 Jul 2026 (this ver · 2026-03-05 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Fix $k \in \mathbb{N}, 0 < \delta < 1$. We study how large $N$ must be so that every $\delta$-dense subset $\mathcal{D} \subset \{0,1\}^N$ (meaning $|\mathcal{D}|\geq \delta 2^N$) contains the image of a metric embedding $f: \{0,1\}^k \to \mathcal{D}$. We study $3$ variants: For a $(1+\varepsilon)$-bi-Lipschitz map $f$ for a fixed $\varepsilon>0$, we show that $N = O(\varepsilon^{-2}\log(1/\delta) k^3)$. For an isometric map $f$ with arbitrary rescaling (i.e. undistorted), we show that $N = \log(1/\delta) e^{\Omega(k)}$. For an isometric map $f$ with bounded rescaling we show that $N = \exp{[\log(1/\delta)e^{\Theta(k)}]}$.
Regarding the path space, we prove the density analog of a coloring theorem of Rödl--Sales. We give bounds for $(1+\varepsilon)$-bi-Lipschitz embeddings of the path $[k] = \{1,...,k\}$ into dense subsets of the path $[N] = \{1,...,N\}$, improving a bound of Dumitrescu. We prove similar bounds for the binary tree space, using the tree replicas theorem of Pach--Solymosi--Tardos.
As a geometric application we obtain a non-positive Alexandrov curvature counterpart to the work of Bartal--Linial--Mendel--Naor on the nonlinear Dvoretzky problem who showed that any $\mathcal{D} \subset \{0,1\}^N$ that embeds with bi-Lipschitz distortion $<\alpha$ into a metric space of non-negative Alexandrov curvature must be small, namely, necessarily $|\mathcal{D}| \lesssim 2^{N(1-\Omega(\alpha^{-2}))}$. We prove that for every $N\gtrsim \alpha^{6}\ge 1$, any $\mathcal{D} \subset \{0,1\}^N$ that embeds with distortion $<\alpha$ into some metric space of non-positive Alexandrov curvature must satisfy $|\mathcal{D}| \lesssim 2^{N(1-\Omega(\alpha^{-4}))}$ via an approach which is entirely different from that of Bartal--Linial--Mendel--Naor. We also show that nontrivial metric type and non-universality are preserved by taking finite unions of subspaces.

Submission history

From: Cosmas Kravaris [view email]
[v1] Wed, 4 Mar 2026 22:12:53 UTC (37 KB)
[v2] Wed, 1 Jul 2026 22:06:58 UTC (41 KB)