SearcharxivSearch

arXiv subjects

Sarah Lemler

Publications and source records attributed to Sarah Lemler.

12 recordsLinked to original sources

Estimation and variable selection in high dimension in nonlinear mixed-effects models

We consider nonlinear mixed effects models including high-dimensional covariates to model individual parameters variability. The objective is to identify relevant covariates among a large set under sparsity assumption and to estimate model parameters. To face the high dimensional setting we consider a regularized estimator namely the maximum likelihood estimator penalized with the l1-penalty. We rely on the use of the eBIC model choice criteria to select an optimal reduced model. Then we estimate the parameters by maximizing the likelihood of the reduced model. We calculate in practice the maximum likelihood estimator penalized with the l1-penalty though a weighted proximal stochastic gradient descent algorithm with an adaptive learning rate. This choice allows us to consider very general models, in particular models that do not belong to the curved exponential family. We demonstrate first in a simple linear toy model through a simulation study the good convergence properties of this optimization algorithm. We compare then the performance of the proposed methodology with those of the \glmmLasso procedure in a linear mixed effects model in a simulation study. We illustrate also its performance in a nonlinear mixed-effects logistic growth model through simulation. We finally highlight the beneficit of the proposed procedure relying on an integrated single step approach regarding two others two steps approaches for variable selection objective.

math.ST

Nonparametric estimation of the stationary density for Hawkes-diffusion systems with known and unknown intensity

We investigate the nonparametric estimation problem of the density $\pi$, representing the stationary distribution of a two-dimensional system $\left(Z_t\right)_{t \in[0, T]}=\left(X_t, \lambda_t\right)_{t \in[0, T]}$. In this system, $X$ is a Hawkes-diffusion process, and $\lambda$ denotes the stochastic intensity of the Hawkes process driving the jumps of $X$. Based on the continuous observation of a path of $(X_t)$ over $[0, T]$, and initially assuming that $\lambda$ is known, we establish the convergence rate of a kernel estimator $\widehat\pi\left(x^*, y^*\right)$ of $\pi\left(x^*,y^*\right)$ as $T \rightarrow \infty$. Interestingly, this rate depends on the value of $y^*$ influenced by the baseline parameter of the Hawkes intensity process. From the rate of convergence of $\widehat\pi\left(x^*,y^*\right)$, we derive the rate of convergence for an estimator of the invariant density $\lambda$. Subsequently, we extend the study to the case where $\lambda$ is unknown, plugging an estimator of $\lambda$ in the kernel estimator and deducing new rates of convergence for the obtained estimator. The proofs establishing these convergence rates rely on probabilistic results that may hold independent interest. We introduce a Girsanov change of measure to transform the Hawkes process with intensity $\lambda$ into a Poisson process with constant intensity. To achieve this, we extend a bound for the exponential moments for the Hawkes process, originally established in the stationary case, to the non-stationary case. Lastly, we conduct a numerical study to illustrate the obtained rates of convergence of our estimators.

math.ST

Estimation and variable selection in high dimension in a causal joint model of survival times and longitudinal outcomes with random effects

We consider a joint survival and mixed-effects model to explain the survival time from longitudinal data and high-dimensional covariates in a population. The longitudinal data is modeled using a non linear mixed-effects model to account for the inter-individual variability in the population. The corresponding regression function serves as a link function incorporated into the survival model. In that way, the longitudinal data is related to the survival time. We consider a Cox model that takes into account both high-dimensional covariates and the link function. There are two main objectives: first, identify the relevant covariates that contribute to explaining survival time, and second, estimate all unknown parameters of the joint model. For the first objective, we consider the estimate defined by maximizing the marginal log-likelihood regularized with a l1-penalty term. To tackle the optimization problem, we implement an adaptive stochastic gradient to handle the latent variables of the non linear mixed-effects model associated with a proximal operator to manage the non-differentiability of the penalty. We rely on an eBIC model choice criterion to select an optimal value for the regularization parameter. Once the relevant covariates are selected, we re-estimate the parameters in the reduced model by maximizing the likelihood using an adaptive stochastic gradient descent. We provide relevant simulations that showcase the performance of the proposed variable selection and parameter estimation method in the joint model. We investigate the effect of censoring and of the presence of correlation between the individual parameters in the mixed model.

math.ST

Efficient preconditioned stochastic gradient descent for estimation in latent variable models

Latent variable models are powerful tools for modeling complex phenomena involving in particular partially observed data, unobserved variables or underlying complex unknown structures. Inference is often difficult due to the latent structure of the model. To deal with parameter estimation in the presence of latent variables, well-known efficient methods exist, such as gradient-based and EM-type algorithms, but with practical and theoretical limitations. In this paper, we propose as an alternative for parameter estimation an efficient preconditioned stochastic gradient algorithm. Our method includes a preconditioning step based on a positive definite Fisher information matrix estimate. We prove convergence results for the proposed algorithm under mild assumptions for very general latent variables models. We illustrate through relevant simulations the performance of the proposed methodology in a nonlinear mixed effects model and in a stochastic block model.

math.ST

On the nonparametric inference of coefficients of self-exciting jump-diffusion

In this paper, we consider a one-dimensional diffusion process with jumps driven by a Hawkes process. We are interested in the estimations of the volatility function and of the jump function from discrete high-frequency observations in a long time horizon which remained an open question until now. First, we propose to estimate the volatility coefficient. For that, we introduce a truncation function in our estimation procedure that allows us to take into account the jumps of the process and estimate the volatility function on a linear subspace of L2(A) where A is a compact interval of R. We obtain a bound for the empirical risk of the volatility estimator, ensuring its consistency, and then we study an adaptive estimator w.r.t. the regularity. Then, we define an estimator of a sum between the volatility and the jump coefficient modified with the conditional expectation of the intensity of the jumps. We also establish a bound for the empirical risk for the non-adaptive estimators of this sum, the convergence rate up to the regularity of the true function, and an oracle inequality for the final adaptive estimator.Finally, we give a methodology to recover the jump function in some applications. We conduct a simulation study to measure our estimators' accuracy in practice and discuss the possibility of recovering the jump function from our estimation procedure.

math.ST

Neuronal Network Inference and Membrane Potential Model using Multivariate Hawkes Processes

In this work, we propose to catch the complexity of the membrane potential's dynamic of a motoneuron between its spikes, taking into account the spikes from other neurons around. Our approach relies on two types of data: extracellular recordings of multiple spikes trains and intracellular recordings of the membrane potential of a central neuron. Our main contribution is to provide a unified framework and a complete pipeline to analyze neuronal activity from data extraction to statistical inference. The first step of the procedure is to select a subnetwork of neurons impacting the central neuron: we use a multivariate Hawkes process to model the spike trains of all neurons and compare two sparse inference procedures to identify the connectivity graph. Then we infer a jump-diffusion dynamic in which jumps are driven from a Hawkes process, the occurrences of which correspond to the spike trains of the aforementioned subset of neurons that interact with the central neuron. We validate the Hawkes model with a goodness-of-fit test and we show that taking into account the information from the connectivity graph improves the inference of the jump-diffusion process. The entire code has been developed and is freely available on GitHub.

math.ST

Neural networks to predict survival from RNA-seq data in oncology

Survival analysis consists of studying the elapsed time until an event of interest, such as the death or recovery of a patient in medical studies. This work explores the potential of neural networks in survival analysis from clinical and RNA-seq data. If the neural network approach is not recent in survival analysis, methods were classically considered for low-dimensional input data. But with the emergence of high-throughput sequencing data, the number of covariates of interest has become very large, with new statistical issues to consider. We present and test a few recent neural network approaches for survival analysis adapted to high-dimensional inputs.

math.ST

Exponential ergodicity for diffusions with jumps driven by a Hawkes process

In this paper, we introduce a new class of processes which are diffusions with jumps driven by a multivariate nonlinear Hawkes process. Our goal is to study their long-time behavior. In the case of exponential memory kernels for the underlying Hawkes process we establish conditions for the positive Harris recurrence of the couple (X, Y), where X denotes the diffusion process and Y the piecewise deterministic Markov process (PDMP) defining the stochastic intensity of the driving Hawkes. As a direct consequence of the Harris recurrence, we obtain the ergodic theorem for X. Furthermore, we provide sufficient conditions under which the process is exponentially $β$--mixing.

math.PR

Nonparametric drift estimation for diffusions with jumps driven by a Hawkes process

We consider a 1-dimensional diffusion process X with jumps. The particularity of this model relies in the jumps which are driven by a multidimensional Hawkes process denoted N. This article is dedicated to the study of a nonparametric estimator of the drift coefficient of this original process. We construct estimators based on discrete observations of the process X in a high frequency framework with a large horizon time and on the observations of the process N. The proposed nonparametric estimator is built from a least squares contrast procedure on subspace spanned by trigonometric basis vectors. We obtain adaptive results that are comparable with the one obtained in the nonparametric regression context. We finally conduct a simulation study in which we first focus on the implementation of the process and then on showing the good behavior of the estimator.

math.ST

Adaptive kernel estimation of the baseline function in the Cox model, with high-dimensional covariates

The aim of this article is to propose a novel kernel estimator of the baseline function in a general high-dimensional Cox model, for which we derive non-asymptotic rates of convergence. To construct our estimator, we first estimate the regression parameter in the Cox model via a Lasso procedure. We then plug this estimator into the classical kernel estimator of the baseline function, obtained by smoothing the so-called Breslow estimator of the cumulative baseline function. We propose and study an adaptive procedure for selecting the bandwidth, in the spirit of Gold-enshluger and Lepski (2011). We state non-asymptotic oracle inequalities for the final estimator, which reveal the reduction of the rates of convergence when the dimension of the covariates grows.

stat.AP

Adaptive estimation of the baseline hazard function in the Cox model by model selection, with high-dimensional covariates

The purpose of this article is to provide an adaptive estimator of the baseline function in the Cox model with high-dimensional covariates. We consider a two-step procedure : first, we estimate the regression parameter of the Cox model via a Lasso procedure based on the partial log-likelihood, secondly, we plug this Lasso estimator into a least-squares type criterion and then perform a model selection procedure to obtain an adaptive penalized contrast estimator of the baseline function. Using non-asymptotic estimation results stated for the Lasso estimator of the regression parameter, we establish a non-asymptotic oracle inequality for this penalized contrast estimator of the baseline function, which highlights the discrepancy of the rate of convergence when the dimension of the covariates increases.

math.ST

Oracle inequalities for the Lasso in the high-dimensional Aalen multiplicative intensity model

In a general counting process setting, we consider the problem of obtaining a prognostic on the survival time adjusted on covariates in high-dimension. Towards this end, we construct an estimator of the whole conditional intensity. We estimate it by the best Cox proportional hazards model given two dictionaries of functions. The first dictionary is used to construct an approximation of the logarithm of the baseline hazard function and the second to approximate the relative risk. We introduce a new data-driven weighted Lasso procedure to estimate the unknown parameters of the best Cox model approximating the intensity. We provide non-asymptotic oracle inequalities for our procedure in terms of an appropriate empirical Kullback divergence. Our results rely on an empirical Bernstein's inequality for martingales with jumps and properties of modified self-concordant functions.

math.ST