Results 41 to 50 of about 72,594 (306)
Control problem for the impulse process under stochastic optimization procedure and Levy conditions
Математичні Студії, 2021 A stochastic approximation procedure and a limit generator of the original problem are constructed for a system of stochastic differential equations with Markov switching and impulse perturbation under Levy approximation conditions with control, which is
Ya. M. Chabanyuk +2 more
doaj +1 more source
FEBS Letters, EarlyView.Inositol pyrophosphates are energy‐rich signaling molecules that perform critical functions in cells. Three different families of phosphatases hydrolyze the β phosphate of the inositol pyrophosphate molecules: two have narrow specificities and one is promiscuous.
Ronda J. Rolfes
wiley +1 more source
On Probabilistic Convergence Rates of Symmetric Stochastic Bernstein Polynomials
MathematicsThis paper analyzes the exponential convergence properties of Symmetric Stochastic Bernstein Polynomials (SSBPs), a novel approximation framework that combines the deterministic precision of classical Bernstein polynomials (BPs) with the adaptive node ...
Shenggang Zhang +2 more
doaj +1 more source
Stochastic Approximation on Riemannian Manifolds [PDF]
Applied Mathematics & Optimization, 2019 The standard theory of stochastic approximation (SA) is extended to the case when the constraint set is a Riemannian manifold. Specifically, the standard ODE method for analyzing SA schemes is extended to iterations constrained to stay on a manifold using a retraction mapping. In addition, for submanifolds of a Euclidean space, a framework is developed
openaire +3 more sources
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
A STOCHASTIC APPROXIMATION ALGORITHM FOR STOCHASTIC SEMIDEFINITE PROGRAMMING [PDF]
Probability in the Engineering and Informational Sciences, 2016 Motivated by applications to multi-antenna wireless networks, we propose a distributed and asynchronous algorithm for stochastic semidefinite programming. This algorithm is a stochastic approximation of a continuous-time matrix exponential scheme which is further regularized by the addition of an entropy-like term to the problem's objective function ...
Gaujal, Bruno, Mertikopoulos, Panayotis
openaire +5 more sources
On integer stochastic approximation [PDF]
, 1984 summary:Let $M : \bold R \rightarrow \bold R$ be observable, with experimental errors, at integer points only; unknown elsewhere. Iterative nonparametric procedures for finding the zero point of $M$ are called procedures of integer stochastic ...
Herkenrath, Ulrich, Dupač, Václav
core +1 more source
Molecular Oncology, EarlyView.Breast cancer remains a major cause of cancer death in women, frequently developing endocrine therapy resistance. This study demonstrates that upregulated p21‐activated kinase 1 (PAK1) activity drives resistance to tamoxifen and long‐term estrogen deprivation in ER+ breast cancer models.
Luisa Schwarzmüller +10 more
wiley +1 more source
Mutant NPM1 in Acute Myeloid Leukemia Initiation and Maintenance
Aging and Cancer, EarlyView.NPM1 mutations drive acute myeloid leukemia by acting as neomorphic transcriptional regulators that cooperate with Menin–MLL and XPO1 to sustain HOX/MEIS1 expression and block differentiation. Targeting these mutant‐specific transcriptional dependencies provides a rational therapeutic strategy for NPM1‐mutated AML.
Yanan Jiang +3 more
wiley +1 more source
Approximation algorithms for stochastic clustering
J. Mach. Learn. Res., 2018 We consider stochastic settings for clustering, and develop provably-good approximation algorithms for a number of these notions. These algorithms yield better approximation ratios compared to the usual deterministic clustering setting. Additionally, they offer a number of advantages including clustering which is fairer and has better long-term ...
David G. Harris 0001 +4 more
openaire +5 more sources