Smooth discrimination analysis

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

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

zbMATH Keywords

Bayes risks discrimination optimal rates of convergence sieves empirical risk

Mathematics Subject Classification ID

Asymptotic properties of nonparametric inference (62G20) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Nonparametric estimation (62G05) Bayesian problems; characterization of Bayes procedures (62C10)

Related Items

Fast convergence rates of deep neural networks for classification ⋮ A reduced-rank approach to predicting multiple binary responses through machine learning ⋮ Debiased machine learning of set-identified linear models ⋮ User-friendly Introduction to PAC-Bayes Bounds ⋮ Deep neural network classifier for multidimensional functional data ⋮ Optimal convergence rates of deep neural networks in a classification setting ⋮ Transfer learning for contextual multi-armed bandits ⋮ Multiclass classification for multidimensional functional data through deep neural networks ⋮ A convex optimization approach to high-dimensional sparse quadratic discriminant analysis ⋮ Optimal aggregation of classifiers in statistical learning. ⋮ Classification in general finite dimensional spaces with the \(k\)-nearest neighbor rule ⋮ Woodroofe's one-armed bandit problem revisited ⋮ Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder) ⋮ Convergence rates of deep ReLU networks for multiclass classification ⋮ Neyman-Pearson classification: parametrics and sample size requirement ⋮ Rates of convergence for robust geometric inference ⋮ Noisy discriminant analysis with boundary assumptions ⋮ 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation ⋮ Smooth Contextual Bandits: Bridging the Parametric and Nondifferentiable Regret Regimes ⋮ PAC-Bayesian high dimensional bipartite ranking ⋮ Model selection by bootstrap penalization for classification ⋮ Classifiers of support vector machine type with \(\ell_1\) complexity regularization ⋮ Fast learning rates in statistical inference through aggregation ⋮ Robust estimation of \(U\)-statistics ⋮ The multi-armed bandit problem with covariates ⋮ Complex sampling designs: uniform limit theorems and applications ⋮ Risk bounds for statistical learning ⋮ Inverse statistical learning ⋮ Best subset binary prediction ⋮ Robust statistical learning with Lipschitz and convex loss functions ⋮ Optimal functional supervised classification with separation condition ⋮ Optimal rates for plug-in estimators of density level sets ⋮ Generalized density clustering ⋮ Intrinsic Dimension Adaptive Partitioning for Kernel Methods ⋮ Regularization in statistics ⋮ Convergence rates for empirical barycenters in metric spaces: curvature, convexity and extendable geodesics ⋮ Confidence regions for level sets ⋮ Hold-out estimates of prediction models for Markov processes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An adaptive multiclass nearest neighbor classifier ⋮ On the rates of convergence of simulation-based optimization algorithms for optimal stopping problems ⋮ Local nearest neighbour classification with applications to semi-supervised learning ⋮ Rates of convergence in active learning ⋮ Gibbs posterior concentration rates under sub-exponential type losses ⋮ Unnamed Item ⋮ Robust classification via MOM minimization ⋮ Deviation inequalities for random polytopes in arbitrary convex bodies ⋮ Learning the distribution of latent variables in paired comparison models with round-robin scheduling ⋮ Estimating conditional quantiles with the help of the pinball loss ⋮ Risk bounds for CART classifiers under a margin condition ⋮ Classification via local multi-resolution projections ⋮ Oracle inequalities for cross-validation type procedures ⋮ Classification with minimax fast rates for classes of Bayes rules with sparse representation ⋮ Model selection by resampling penalization ⋮ ERM and RERM are optimal estimators for regression problems when malicious outliers corrupt the labels ⋮ Margin-adaptive model selection in statistical learning ⋮ Nonparametric estimation of surface integrals on level sets ⋮ Methods for estimation of convex sets ⋮ Simultaneous adaptation to the margin and to complexity in classification ⋮ Pricing Bermudan options by nonparametric regression: optimal rates of convergence for lower estimates ⋮ Minimax semi-supervised set-valued approach to multi-class classification ⋮ Optimal third root asymptotic bounds in the statistical estimation of thresholds ⋮ Optimal rates for nonparametric F-score binary classification via post-processing ⋮ Optimal rates of aggregation in classification under low noise assumption ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Choice of neighbor order in nearest-neighbor classification ⋮ Fast rate of convergence in high-dimensional linear discriminant analysis ⋮ Structured kernel quantile regression ⋮ Surrogate losses in passive and active learning ⋮ Performance guarantees for individualized treatment rules ⋮ Unnamed Item ⋮ Bandwidth choice for nonparametric classification ⋮ A high-dimensional Wilks phenomenon ⋮ Fast rates for support vector machines using Gaussian kernels ⋮ Fast learning rates for plug-in classifiers ⋮ Variance-based regularization with convex objectives ⋮ Adaptation to lowest density regions with application to support recovery ⋮ Randomized allocation with arm elimination in a bandit problem with covariates ⋮ PAC-Bayesian bounds for randomized empirical risk minimizers ⋮ Bandwidth selection in kernel empirical risk minimization via the gradient ⋮ Theory of Classification: a Survey of Some Recent Advances ⋮ Bandwidth selection for kernel density estimators of multivariate level sets and highest density regions ⋮ Posterior contraction and credible regions for level sets ⋮ Optimal weighted nearest neighbour classifiers ⋮ Rates of Convergence for a Bayesian Level Set Estimation ⋮ Large‐margin classification with multiple decision rules ⋮ Set structured global empirical risk minimizers are rate optimal in general dimensions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Convergence rates of generalization errors for margin-based classification ⋮ Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions ⋮ Multiplier \(U\)-processes: sharp bounds and applications ⋮ Adaptive learning rates for support vector machines working on data with low intrinsic dimension ⋮ Optimal linear discriminators for the discrete choice model in growing dimensions ⋮ Adaptive transfer learning ⋮ Robust empirical Bayes tests for continuous distributions ⋮ Rejoinder: New Objectives for Policy Learning ⋮ Unnamed Item ⋮ Square root penalty: Adaption to the margin in classification and in edge estimation ⋮ Nonregular and minimax estimation of individualized thresholds in high dimension with binary responses ⋮ Unnamed Item ⋮ Nonasymptotic bounds for vector quantization in Hilbert spaces ⋮ Local Rademacher complexities ⋮ Minimax fast rates for discriminant analysis with errors in variables ⋮ Lower bounds for the rate of convergence in nonparametric pattern recognition

Cites Work