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

推荐订阅源

T
The Blog of Author Tim Ferriss
罗磊的独立博客
月光博客
月光博客
GbyAI
GbyAI
腾讯CDC
G
Google Developers Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
U
Unit 42
Engineering at Meta
Engineering at Meta
A
About on SuperTechFans
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
aimingoo的专栏
aimingoo的专栏
C
Check Point Blog
Y
Y Combinator Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Microsoft Azure Blog
Microsoft Azure Blog
I
InfoQ
雷峰网
雷峰网
B
Blog RSS Feed
美团技术团队
M
MIT News - Artificial intelligence
有赞技术团队
有赞技术团队
D
Docker

math.PR updates on arXiv.org

Visibility in the Boolean Model on Harmonic Manifolds Global estimates on the Brenier map Geodesics and Wandering Exponents in Brochette First-Passage Percolation State-dependent inverse-subordinator time changes of regenerative processes: Excursion structure and multiscale occupation-time limits Randomly twisted transfer operators and singular values statistics Generalized Bessel-Dunkl diffusions An almost sure invariance principle for the Takagi-van der Waerden class functions Central limit theorems for high dimensional lattice polytopes: cosmological polytopes Convergence rate estimates for semigroups and heat kernels associated with resistance forms Second-order Poincaré inequalities and localization on the Poisson space Maximum Probability of Independence in Transitive Matroids On global solutions to the semidiscrete stochastic heat equation The Poisson Tail Conjecture for primes in short intervals A Complete Spectral Analysis of the CEV Operator with Applications to Arbitrage Holographic functions and neural networks From Betting to Empirical Bernstein LIL Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise Pointwise Generalization in Deep Neural Networks Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors Wasserstein bounds for denoising diffusion probabilistic models via the Föllmer process A note on connections between the Föllmer process and the denoising diffusion probabilistic model Simple Approximation and Derivative Free Inference-Time Scaling for Diffusion Models via Sequential Monte Carlo on Path Measures Diffusion-Based Stochastic Operator Networks for Uncertainty Quantification in Stochastic Partial Differential Equations A Fourier perspective on the learning dynamics of neural networks: from sample complexities to mechanistic insights Propagation of Chaos in Contextual Flow Maps Dimension-Uniform Discretization Analysis of Preconditioned Annealed Langevin Dynamics for Multimodal Gaussian Mixtures $α$-TCAV: A Unified Framework for Testing with Concept Activation Vectors Scaling Laws from Sequential Feature Recovery: A Solvable Hierarchical Model On the Limits of Latent Reuse in Diffusion Models State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives
A new perspective on the Løkka-Zervos dichotomy for absol...
[Submitted on 14 Apr 2026 (v1), last revised 22 Aug 2026 (this v · 2026-04-15 · via math.PR updates on arXiv.org

View PDF HTML (experimental)

Abstract:We revisit the optimization problem (and its dichotomous solution) analyzed in Renaud et al. (2026). By choosing affine functions (of the surplus level) to bound the dividend rates, we are able to provide a more explicit derivation of the solution, avoiding the use of viscosity solutions. Moreover, with explicitly parameterized expressions, we are able to study analytical properties of the optimal thresholds and to refine the statement of the dichotomy. To reach these objectives, we add a penalty-at-ruin parameter in the performance function, allowing us to unify the expressions of the value functions of the two subproblems appearing in the dichotomous solution; as a by-product, the dichotomy can also be expressed in terms of this newly added parameter. Finally, we perform sensitivity analyses to illustrate that the range of values generated in an affine-bound framework is flexible and can span the range from a constant bound to the singular version of this problem.

Submission history

From: Tommy Mastromonaco [view email]
[v1] Tue, 14 Apr 2026 21:15:54 UTC (78 KB)
[v2] Thu, 16 Apr 2026 22:20:19 UTC (78 KB)
[v3] Wed, 17 Jun 2026 16:44:41 UTC (78 KB)
[v4] Sat, 22 Aug 2026 17:38:39 UTC (79 KB)