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

推荐订阅源

Last Week in AI
Last Week in AI
GbyAI
GbyAI
Apple Machine Learning Research
Apple Machine Learning Research
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
N
Netflix TechBlog - Medium
量子位
aimingoo的专栏
aimingoo的专栏
D
Docker
F
Fortinet All Blogs
T
Tailwind CSS Blog
V
V2EX
D
DataBreaches.Net
Google DeepMind News
Google DeepMind News
MyScale Blog
MyScale Blog
G
Google Developers Blog
罗磊的独立博客
MongoDB | Blog
MongoDB | Blog
Microsoft Security Blog
Microsoft Security Blog
Microsoft Azure Blog
Microsoft Azure Blog
WordPress大学
WordPress大学
博客园 - 三生石上(FineUI控件)
小众软件
小众软件
A
About on SuperTechFans
IT之家
IT之家

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
Extreme-Case Distorted Utility under Moment Ambiguity
[Submitted on 23 Jun 2026] · 2026-06-24 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Many operations decisions under distributional ambiguity, from pricing and inventory to capacity and contracting, evaluate an action through a tail-sensitive distorted utility of an uncertain payoff and hedge against the least favorable distribution consistent with a few known moments; the resulting worst-case evaluation is the inner problem of a moment-based distributionally robust decision. We study this inner problem, the extreme-case distorted utility under moment constraints, for a locally Lipschitz utility that may be nonsmooth and neither convex nor concave together with a general, possibly atomic, distortion. Recasting the problem in the quantile domain, we develop a unified method that yields exact first-order optimality conditions and closed-form extremal values and distributions for both the worst and best cases, drawing on nonsmooth variational analysis. A central step treats the monotonicity constraint by isotonic projection onto the monotone cone, turning an abstract infinite-dimensional restriction into an inexpensive inner solve that scales linearly in the discretization. The method recovers and extends classical moment bounds through three examples: a range value-at-risk extension of the Scarf bound, GlueVaR distortions with a reward--penalty utility, and a capped incentive contract under conditional value-at-risk. As the inner oracle of a robust min-max decision, the characterization embeds directly in outer robust optimization, illustrated on a real capacity-provisioning problem for generative artificial intelligence inference where accounting for moment ambiguity lowers required capacity while preserving service compliance.

Submission history

From: Zehao Li [view email]
[v1] Tue, 23 Jun 2026 08:18:20 UTC (238 KB)