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

推荐订阅源

MyScale Blog
MyScale Blog
Apple Machine Learning Research
Apple Machine Learning Research
H
Help Net Security
雷峰网
雷峰网
V
Visual Studio Blog
G
Google Developers Blog
Microsoft Azure Blog
Microsoft Azure Blog
Hugging Face - Blog
Hugging Face - Blog
爱范儿
爱范儿
IT之家
IT之家
Engineering at Meta
Engineering at Meta
Microsoft Security Blog
Microsoft Security Blog
aimingoo的专栏
aimingoo的专栏
大猫的无限游戏
大猫的无限游戏
M
MIT News - Artificial intelligence
月光博客
月光博客
A
About on SuperTechFans
B
Blog RSS Feed
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
The GitHub Blog
The GitHub Blog
N
Netflix TechBlog - Medium
J
Java Code Geeks
云风的 BLOG
云风的 BLOG
Blog — PlanetScale
Blog — PlanetScale

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
Distances between non-symmetric convex bodies: optimal bo...
[Submitted on 23 Oct 2025 (v1), last revised 1 Jul 2026 (this ve · 2025-10-23 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:In this paper we determine, up to polylogarithmic factors, the diameter of the Banach--Mazur compactum of $n$-dimensional convex bodies without symmetry assumptions. We prove that for any convex bodies $K_1,K_2\subset \mathbb{R}^n$, \begin{equation} d_{BM}(K_1,K_2)\le Cn\log^\alpha(n+1), \label{eq_1624} \end{equation} for universal constants $C,\alpha>0$, improving an earlier bound of Rudelson. We also study the partial-containment distance $d_{PC}$, in which the Banach-Mazur requirement to contain the other body in its entirety is relaxed to $99\%$-containment. We prove that this relaxation leads to a very different behavior: \begin{equation} d_{PC}(K_1,K_2) \leq C \log^{\alpha} (n+1) \label{eq_1625} \end{equation} for all convex bodies $K_1,K_2 \subseteq \mathbb{R}^n$. This demonstrates that in high dimensions, any convex body is not too far from an affine image of any other convex body, when we look at the bulk of their mass.
\medskip In the centrally-symmetric case, the optimal upper bound for the Banach-Mazur distance is obtained in the John position. In contrast, our proofs rely on the isotropic position. The analytic core of our argument is a two-sided comparison, in the gauge order, between isotropic log-concave measures and Gaussian measures. This yields a new isotropic $M$-bound that complements E. Milman's $M^*$-bound. We also provide applications to linear symplectic geometry and to the first Dirichlet eigenvalue of the Laplacian.

Submission history

From: Boaz Klartag [view email]
[v1] Thu, 23 Oct 2025 12:55:33 UTC (22 KB)
[v2] Wed, 5 Nov 2025 15:02:31 UTC (24 KB)
[v3] Wed, 1 Jul 2026 20:56:22 UTC (31 KB)