most citedNon-asymptotic Analysis of Biased Stochastic Approximation Scheme

26 citations · 54 across the 5 of their papers we have counts for

collaborators

5 papers

stat.ML202011 cited

FedSKETCH: Communication-Efficient and Private Federated Learning via Sketching

Farzin Haddadpour, Belhal Karimi, Ping Li +1

Communication complexity and privacy are the two key challenges in Federated Learning where the goal is to perform a distributed learning through a large volume of devices. In this…

stat.ML201916 cited

On the Global Convergence of (Fast) Incremental Expectation Maximization Methods

Belhal Karimi, Hoi-To Wai, Eric Moulines +1

The EM algorithm is one of the most popular algorithm for inference in latent data models. The original formulation of the EM algorithm does not scale to large data set, because th…

stat.ME20191 cited

f-SAEM: A fast Stochastic Approximation of the EM algorithm for nonlinear mixed effects models

Belhal Karimi, Marc Lavielle, Eric Moulines

The ability to generate samples of the random effects from their conditional distributions is fundamental for inference in mixed effects models. Random walk Metropolis is widely us…

stat.AP2019

Efficient Metropolis-Hastings Sampling for Nonlinear Mixed Effects Models

Belhal Karimi, Marc Lavielle

The ability to generate samples of the random effects from their conditional distributions is fundamental for inference in mixed effects models. Random walk Metropolis is widely us…

stat.ML201926 cited

Non-asymptotic Analysis of Biased Stochastic Approximation Scheme

Belhal Karimi, Blazej Miasojedow, Eric Moulines +1

Stochastic approximation (SA) is a key method used in statistical learning. Recently, its non-asymptotic convergence analysis has been considered in many papers. However, most of t…