Minimax-optimal classification with dyadic decision trees

From MaRDI portal
Publication:3547602

DOI10.1109/TIT.2006.871056zbMath1318.62216MaRDI QIDQ3547602

Clayton Scott, Robert D. Nowak

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)




Related Items (22)

Optimal dyadic decision treesClassifiers of support vector machine type with \(\ell_1\) complexity regularizationIntrinsic Dimension Adaptive Partitioning for Kernel MethodsClassification Trees for Imbalanced Data: Surface-to-Volume RegularizationA cross-validation framework for signal denoising with applications to trend filtering, dyadic CART and beyondQuantile regression by dyadic CARTRisk bounds for CART classifiers under a margin conditionA tree-based regressor that adapts to intrinsic dimensionClassification with minimax fast rates for classes of Bayes rules with sparse representationPenalized empirical risk minimization over Besov spacesAlgorithms for optimal dyadic decision treesClassification algorithms using adaptive partitioningComplexity-penalized estimation of minimum volume sets for dependent dataLearning Bayesian networks with local structure, mixed variables, and exact algorithmsAdaptive estimation of multivariate piecewise polynomials and bounded variation functions by optimal decision treesPolynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic TilingsOn signal representations within the Bayes decision frameworkAdaptive learning rates for support vector machines working on data with low intrinsic dimensionUncertainty quantification for Bayesian CARTAdaptive transfer learningMinimax-optimal nonparametric regression in high dimensionsOptimal survival trees




This page was built for publication: Minimax-optimal classification with dyadic decision trees