Pages that link to "Item:Q3547602"

The following pages link to Minimax-optimal classification with dyadic decision trees (Q3547602):

Displaying 19 items.

• Risk bounds for CART classifiers under a margin condition (Q437488) (← links)
• A tree-based regressor that adapts to intrinsic dimension (Q439996) (← links)
• Classification algorithms using adaptive partitioning (Q482871) (← links)
• On signal representations within the Bayes decision framework (Q763367) (← links)
• Complexity-penalized estimation of minimum volume sets for dependent data (Q990877) (← links)
• Classification with minimax fast rates for classes of Bayes rules with sparse representation (Q1951772) (← links)
• Penalized empirical risk minimization over Besov spaces (Q1952004) (← links)
• Algorithms for optimal dyadic decision trees (Q1959591) (← links)
• Adaptive estimation of multivariate piecewise polynomials and bounded variation functions by optimal decision trees (Q2054517) (← links)
• Adaptive learning rates for support vector machines working on data with low intrinsic dimension (Q2073699) (← links)
• Uncertainty quantification for Bayesian CART (Q2073718) (← links)
• Adaptive transfer learning (Q2073726) (← links)
• Optimal survival trees (Q2102354) (← links)
• Learning Bayesian networks with local structure, mixed variables, and exact algorithms (Q2302809) (← links)
• Minimax-optimal nonparametric regression in high dimensions (Q2343958) (← links)
• Optimal dyadic decision trees (Q2384139) (← links)
• Classifiers of support vector machine type with \(\ell_1\) complexity regularization (Q2642804) (← links)
• A cross-validation framework for signal denoising with applications to trend filtering, dyadic CART and beyond (Q6183749) (← links)
• Quantile regression by dyadic CART (Q6200907) (← links)