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

推荐订阅源

Hugging Face - Blog
Hugging Face - Blog
Recent Announcements
Recent Announcements
V
Visual Studio Blog
博客园 - 叶小钗
H
Help Net Security
aimingoo的专栏
aimingoo的专栏
宝玉的分享
宝玉的分享
U
Unit 42
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
F
Fortinet All Blogs
V
V2EX
Stack Overflow Blog
Stack Overflow Blog
WordPress大学
WordPress大学
D
DataBreaches.Net
J
Java Code Geeks
H
Hackread – Cybersecurity News, Data Breaches, AI and More
A
About on SuperTechFans
酷 壳 – CoolShell
酷 壳 – CoolShell
量子位
C
Check Point Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
小众软件
小众软件
Microsoft Azure Blog
Microsoft Azure Blog
M
MIT News - Artificial intelligence

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
Regularity of the positional penalization function in int...
[Submitted on 17 Jun 2026] · 2026-06-19 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:We study the Monge--Kantorovich optimal transport problem between two signed measures~$\mu$ and~$\nu$ on convex compact subsets of~$\mathbb{R}^d$, with a positional penalization function~$\lambda(x, y)$ that modulates the cost of inter-sign transport. Using four independent positive measures~$(\pi^{++}, \pi^{+-}, \pi^{-+}, \pi^{--})$ as decision variables, we prove that the admissible set~$\mathcal{A}(\mu, \nu)$ is weakly-$*$ compact and non-empty if and only if $\mu^+(X) = \nu^+(Y)$ and~$\mu^-(X) = \nu^-(Y)$. Strong duality is established via the Kantorovich minimax theorem, yielding a new compatibility condition on~$\lambda$ at the intersection of inter-sign supports. The penalization~$\lambda$ is shown to be Lipschitz and to admit Alexandrov second derivatives almost everywhere. Modified Monge--Ampère equations governing inter-sign transport maps are derived in the Alexandrov sense, with well-posedness characterized by $\sigma \det(D^2_{yx}\Lambda) e > 0$. The classical Brenier equation is recovered in the limit~$\lambda \to 0$.

Submission history

From: Yannick Tchaptchie Kouakep Dr [view email]
[v1] Wed, 17 Jun 2026 21:59:08 UTC (7 KB)