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

推荐订阅源

月光博客
月光博客
D
Docker
腾讯CDC
J
Java Code Geeks
大猫的无限游戏
大猫的无限游戏
The Cloudflare Blog
Martin Fowler
Martin Fowler
MongoDB | Blog
MongoDB | Blog
博客园 - Franky
博客园 - 三生石上(FineUI控件)
Recent Announcements
Recent Announcements
F
Fortinet All Blogs
IT之家
IT之家
WordPress大学
WordPress大学
M
MIT News - Artificial intelligence
爱范儿
爱范儿
Microsoft Azure Blog
Microsoft Azure Blog
Vercel News
Vercel News
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
小众软件
小众软件
N
Netflix TechBlog - Medium
T
Tailwind CSS Blog
Engineering at Meta
Engineering at Meta
博客园 - 【当耐特】

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
The macroscopic shape of Gelfand-Tsetlin patterns and fre...
[Submitted on 14 Oct 2024 (v1), last revised 23 Jul 2026 (this v · 2024-10-15 · via math updates on arXiv.org

View PDF

Abstract:A compression is a function $F:\mathbb{R}\times[0,1]\to[0,1]$ such that each $F(\cdot,\tau)$ is the distribution function of a measure of mass $\tau$, while each $F(x,\cdot)$ is increasing and $1$-Lipschitz. Compressions are continuum analogues of Gelfand--Tsetlin patterns: if $(t_{k,j})_{ 0 \leq j \leq k \leq n}$ is a Gelfand--Tsetlin pattern, setting $F(t_{k,j},k/n) = j/n$ and interpolating creates a compression. For a differentiable compression $F$, we define the compression entropy \begin{align*} \mathcal{H}[F] :=\int_{-\infty}^\infty\int_0^1 F_x \left\{-\log F_x+\log\sin(\pi F_\tau)+1-\log\pi\right\} \mathrm{d}\tau\mathrm{d}x. \end{align*} If $\mu$ is absolutely continuous and compactly supported, we prove \begin{equation*} \sup\left\{\mathcal{H}[F]:F \text{ compression}, F(\cdot,1)\text{ is the distribution function of }\mu\right\} =\chi[\mu], \end{equation*} where $\chi[\mu]$ is Voiculescu's free entropy. By identifying the Euler--Lagrange equations for $\mathcal{H}[F]$ with a Burgers equation for Cauchy transforms, we show that the supremum is attained uniquely by the free compression of free probability theory.
We also view Gelfand--Tsetlin patterns as Ginzburg--Landau $\nabla\phi$-interface models with a hard-core interaction, and compute the surface tension: \begin{equation*} \sigma(u_1,u_2) =-\log(u_1+u_2)-\log\sin\left(\pi\frac{u_1}{u_1+u_2}\right)-1+\log\pi. \end{equation*} Finally, we prove that uniform $n$-dimensional Gelfand--Tsetlin patterns with deterministic bottom rows converging to $\mu$ satisfy a large deviation principle with speed $n^2$ and rate function \begin{equation*} I_\mu[F]=-\mathcal{H}[F]+\chi[\mu]. \end{equation*} These results resolve a conjecture of Shlyakhtenko and Tao stating that the Euler--Lagrange equations for free compression arise from the statistical mechanics of interlacing point processes.

Submission history

From: Samuel Johnston [view email]
[v1] Mon, 14 Oct 2024 17:26:27 UTC (62 KB)
[v2] Tue, 15 Oct 2024 07:40:23 UTC (62 KB)
[v3] Thu, 23 Jul 2026 18:59:39 UTC (3,275 KB)