On sample complexity for covariance estimation via the unadjusted Langevin algorithm

Documenti analoghi

• Fast Mixing of Data Augmentation Algorithms: Bayesian Probit, Logit, and Lasso Regression
  di: Lee, Holden, et al.
  Pubblicazione: (2024)
• Dimension-free uniform concentration bound for logistic regression
  di: Nakakita, Shogo
  Pubblicazione: (2024)
• Convergence of stochastic gradient descent schemes for Lojasiewicz-landscapes
  di: Dereich, Steffen, et al.
  Pubblicazione: (2021)
• Non-asymptotic analysis of Langevin-type Monte Carlo algorithms
  di: Nakakita, Shogo
  Pubblicazione: (2023)
• Truncated sequential guaranteed estimation for the Cox-Ingersoll-Ross models
  di: Alaya, Mohamed Ben, et al.
  Pubblicazione: (2025)