The asymptotic behavior of fraudulent algorithms - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2024

The asymptotic behavior of fraudulent algorithms

Résumé

Let $U$ be a Morse function on a compact connected $m$-dimensional Riemannian manifold, $m \geq 2,$ satisfying $\min U=0$ and let $\mathcal{U} = \{x \in M \: : U(x) = 0\}$ be the set of global minimizers. Consider the stochastic algorithm $X^{(\beta)}:=(X^{(\beta)}(t))_{t\geq 0}$ defined on $N = M \setminus \mathcal{U},$ whose generator is $U \Delta \cdot-\beta\langle \nabla U,\nabla \cdot\rangle$, where $\beta\in\RR$ is a real parameter. We show that for $\beta>\frac{m}{2}-1,$ $X^{(\beta)}(t)$ converges a.s.\ as $t \rightarrow \infty$, toward a point $p \in \mathcal{U}$ and that each $p \in \mathcal{U}$ has a positive probability to be selected. On the other hand, for $\beta < \frac{m}{2}-1,$ the law of $(X^{(\beta)}(t))$ converges in total variation (at an exponential rate) toward the probability measure $\pi_{\beta}$ having density proportional to $U(x)^{-1-\beta}$ with respect to the Riemannian measure.
Fichier principal
Vignette du fichier
discrimination-14.pdf (459.11 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04408800 , version 1 (22-01-2024)

Identifiants

Citer

Michel Benaïm, Laurent Miclo. The asymptotic behavior of fraudulent algorithms. 2024. ⟨hal-04408800⟩
23 Consultations
6 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More