The following pages link to Learning Theory (Q4680891):
Displaying 11 items.
- Estimation of the transition density of a Markov chain (Q405506) (← links)
- Complexity-penalized estimation of minimum volume sets for dependent data (Q990877) (← links)
- Algorithms for optimal dyadic decision trees (Q1959591) (← links)
- Minimax bounds for Besov classes in density estimation (Q2044410) (← links)
- Uncertainty quantification for Bayesian CART (Q2073718) (← links)
- Adaptation to anisotropy and inhomogeneity via dyadic piecewise polynomial selection (Q2261910) (← links)
- Optimal dyadic decision trees (Q2384139) (← links)
- Smoothing and adaptation of shifted Pólya tree ensembles (Q2676928) (← links)
- Automatic locally adaptive smoothing for tree-based set estimation (Q4922637) (← links)
- Density estimation under local differential privacy and Hellinger loss (Q6160979) (← links)
- Time-penalised trees (\texttt{TpT}): introducing a new tree-based data mining algorithm for time-varying covariates (Q6661058) (← links)
