ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1806.02107
  4. Cited By
Rademacher complexity for Markov chains : Applications to kernel
  smoothing and Metropolis-Hasting
v1v2 (latest)

Rademacher complexity for Markov chains : Applications to kernel smoothing and Metropolis-Hasting

6 June 2018
Patrice Bertail
Franccois Portier
ArXiv (abs)PDFHTML

Papers citing "Rademacher complexity for Markov chains : Applications to kernel smoothing and Metropolis-Hasting"

4 / 4 papers shown
Title
CLT and Edgeworth Expansion for m-out-of-n Bootstrap Estimators of The Studentized Median
CLT and Edgeworth Expansion for m-out-of-n Bootstrap Estimators of The Studentized Median
Imon Banerjee
Sayak Chakrabarty
81
0
0
16 May 2025
On the Global Convergence of Fitted Q-Iteration with Two-layer Neural
  Network Parametrization
On the Global Convergence of Fitted Q-Iteration with Two-layer Neural Network Parametrization
Mudit Gaur
Vaneet Aggarwal
Mridul Agarwal
MLT
109
1
0
14 Nov 2022
Safe and adaptive importance sampling: a mixture approach
Safe and adaptive importance sampling: a mixture approach
B. Delyon
Franccois Portier
161
11
0
20 Mar 2019
Exponential inequalities for nonstationary Markov Chains
Exponential inequalities for nonstationary Markov Chains
Pierre Alquier
P. Doukhan
Xiequan Fan
87
10
0
27 Aug 2018
1