Smooth discrimination analysis

From MaRDI portal
Publication:1583889

DOI10.1214/aos/1017939240zbMath0961.62058OpenAlexW2049393399MaRDI QIDQ1583889

Enno Mammen, Alexandre B. Tsybakov

Publication date: 5 June 2001

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aos/1017939240




Related Items

Fast convergence rates of deep neural networks for classificationA reduced-rank approach to predicting multiple binary responses through machine learningDebiased machine learning of set-identified linear modelsUser-friendly Introduction to PAC-Bayes BoundsDeep neural network classifier for multidimensional functional dataOptimal convergence rates of deep neural networks in a classification settingTransfer learning for contextual multi-armed banditsMulticlass classification for multidimensional functional data through deep neural networksA convex optimization approach to high-dimensional sparse quadratic discriminant analysisOptimal aggregation of classifiers in statistical learning.Classification in general finite dimensional spaces with the \(k\)-nearest neighbor ruleWoodroofe's one-armed bandit problem revisitedLocal Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)Convergence rates of deep ReLU networks for multiclass classificationNeyman-Pearson classification: parametrics and sample size requirementRates of convergence for robust geometric inferenceNoisy discriminant analysis with boundary assumptions1-bit matrix completion: PAC-Bayesian analysis of a variational approximationSmooth Contextual Bandits: Bridging the Parametric and Nondifferentiable Regret RegimesPAC-Bayesian high dimensional bipartite rankingModel selection by bootstrap penalization for classificationClassifiers of support vector machine type with \(\ell_1\) complexity regularizationFast learning rates in statistical inference through aggregationRobust estimation of \(U\)-statisticsThe multi-armed bandit problem with covariatesComplex sampling designs: uniform limit theorems and applicationsRisk bounds for statistical learningInverse statistical learningBest subset binary predictionRobust statistical learning with Lipschitz and convex loss functionsOptimal functional supervised classification with separation conditionOptimal rates for plug-in estimators of density level setsGeneralized density clusteringIntrinsic Dimension Adaptive Partitioning for Kernel MethodsRegularization in statisticsConvergence rates for empirical barycenters in metric spaces: curvature, convexity and extendable geodesicsConfidence regions for level setsHold-out estimates of prediction models for Markov processesUnnamed ItemUnnamed ItemAn adaptive multiclass nearest neighbor classifierOn the rates of convergence of simulation-based optimization algorithms for optimal stopping problemsLocal nearest neighbour classification with applications to semi-supervised learningRates of convergence in active learningGibbs posterior concentration rates under sub-exponential type lossesUnnamed ItemRobust classification via MOM minimizationDeviation inequalities for random polytopes in arbitrary convex bodiesLearning the distribution of latent variables in paired comparison models with round-robin schedulingEstimating conditional quantiles with the help of the pinball lossRisk bounds for CART classifiers under a margin conditionClassification via local multi-resolution projectionsOracle inequalities for cross-validation type proceduresClassification with minimax fast rates for classes of Bayes rules with sparse representationModel selection by resampling penalizationERM and RERM are optimal estimators for regression problems when malicious outliers corrupt the labelsMargin-adaptive model selection in statistical learningNonparametric estimation of surface integrals on level setsMethods for estimation of convex setsSimultaneous adaptation to the margin and to complexity in classificationPricing Bermudan options by nonparametric regression: optimal rates of convergence for lower estimatesMinimax semi-supervised set-valued approach to multi-class classificationOptimal third root asymptotic bounds in the statistical estimation of thresholdsOptimal rates for nonparametric F-score binary classification via post-processingOptimal rates of aggregation in classification under low noise assumptionUnnamed ItemUnnamed ItemChoice of neighbor order in nearest-neighbor classificationFast rate of convergence in high-dimensional linear discriminant analysisStructured kernel quantile regressionSurrogate losses in passive and active learningPerformance guarantees for individualized treatment rulesUnnamed ItemBandwidth choice for nonparametric classificationA high-dimensional Wilks phenomenonFast rates for support vector machines using Gaussian kernelsFast learning rates for plug-in classifiersVariance-based regularization with convex objectivesAdaptation to lowest density regions with application to support recoveryRandomized allocation with arm elimination in a bandit problem with covariatesPAC-Bayesian bounds for randomized empirical risk minimizersBandwidth selection in kernel empirical risk minimization via the gradientTheory of Classification: a Survey of Some Recent AdvancesBandwidth selection for kernel density estimators of multivariate level sets and highest density regionsPosterior contraction and credible regions for level setsOptimal weighted nearest neighbour classifiersRates of Convergence for a Bayesian Level Set EstimationLarge‐margin classification with multiple decision rulesSet structured global empirical risk minimizers are rate optimal in general dimensionsUnnamed ItemUnnamed ItemConvergence rates of generalization errors for margin-based classificationEstimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functionsMultiplier \(U\)-processes: sharp bounds and applicationsAdaptive learning rates for support vector machines working on data with low intrinsic dimensionOptimal linear discriminators for the discrete choice model in growing dimensionsAdaptive transfer learningRobust empirical Bayes tests for continuous distributionsRejoinder: New Objectives for Policy LearningUnnamed ItemSquare root penalty: Adaption to the margin in classification and in edge estimationNonregular and minimax estimation of individualized thresholds in high dimension with binary responsesUnnamed ItemNonasymptotic bounds for vector quantization in Hilbert spacesLocal Rademacher complexitiesMinimax fast rates for discriminant analysis with errors in variablesLower bounds for the rate of convergence in nonparametric pattern recognition



Cites Work