Recommendations
- Smoothed analysis. Motivation and discrete models
- Smoothing for Discrete Kernels in Discrimination
- scientific article; zbMATH DE number 2163921
- scientific article; zbMATH DE number 1431771
- Smoothed analysis of condition numbers
- scientific article; zbMATH DE number 1962932
- Smoothed detrended fluctuation analysis
- scientific article; zbMATH DE number 1369661
Cites work
- Approximation and estimation bounds for artificial neural networks
- Asymptotical minimax recovery of sets with smooth boundaries
- Estimation des densit�s: risque minimax
- Estimation of a Convex Density Contour in Two Dimensions
- Excess Mass Estimates and Tests for Multimodality
- scientific article; zbMATH DE number 17222 (Why is no real title available?)
- scientific article; zbMATH DE number 572272 (Why is no real title available?)
- scientific article; zbMATH DE number 3446442 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- Measuring mass concentrations and estimating density contour clusters -- An excess mass approach
- Metric entropy of some classes of sets with differentiable boundaries
- Minimax theory of image reconstruction
- Minimum contrast estimators on sieves: Exponential bounds and rates of convergence
- Monotone Discriminant Functions and Their Applications in Rheumatology
- Nonparametric regression under qualitative smoothness assumptions
- On nonparametric estimation of density level sets
- Optimal rates of convergence to Bayes risk in nonparametric discrimination
- Probability inequalities for likelihood ratios and convergence rates of sieve MLEs
- Rates of convergence for minimum contrast estimators
- Risk bounds for model selection via penalization
- The method of sieves and minimum contrast estimators
Cited in
(only showing first 100 items - show all)- Convergence rates of generalization errors for margin-based classification
- Robust empirical Bayes tests for continuous distributions
- Bandwidth selection for kernel density estimators of multivariate level sets and highest density regions
- Lower bounds for the rate of convergence in nonparametric pattern recognition
- 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation
- PAC-Bayesian high dimensional bipartite ranking
- Best subset binary prediction
- Methods for estimation of convex sets
- Bandwidth choice for nonparametric classification
- Optimal aggregation of classifiers in statistical learning.
- 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
- Minimax semi-supervised set-valued approach to multi-class classification
- Surrogate losses in passive and active learning
- Posterior contraction and credible regions for level sets
- Set structured global empirical risk minimizers are rate optimal in general dimensions
- 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
- Nonregular and minimax estimation of individualized thresholds in high dimension with binary responses
- Convergence rates of deep ReLU networks for multiclass classification
- Robust statistical learning with Lipschitz and convex loss functions
- Optimal functional supervised classification with separation condition
- Convergence rates for empirical barycenters in metric spaces: curvature, convexity and extendable geodesics
- Local nearest neighbour classification with applications to semi-supervised learning
- 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
- ERM and RERM are optimal estimators for regression problems when malicious outliers corrupt the labels
- Nonparametric estimation of surface integrals on level sets
- Optimal rates for nonparametric F-score binary classification via post-processing
- Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions
- Nonasymptotic bounds for vector quantization in Hilbert spaces
- Minimax fast rates for discriminant analysis with errors in variables
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- Model selection by bootstrap penalization for classification
- Fast learning rates in statistical inference through aggregation
- Rates of convergence in active learning
- Simultaneous adaptation to the margin and to complexity in classification
- Optimal third root asymptotic bounds in the statistical estimation of thresholds
- Optimal rates of aggregation in classification under low noise assumption
- Bandwidth selection in kernel empirical risk minimization via the gradient
- Square root penalty: Adaption to the margin in classification and in edge estimation
- Local Rademacher complexities
- Classifiers of support vector machine type with \(\ell_1\) complexity regularization
- Complex sampling designs: uniform limit theorems and applications
- Gibbs posterior concentration rates under sub-exponential type losses
- Classification in general finite dimensional spaces with the \(k\)-nearest neighbor rule
- Fast rate of convergence in high-dimensional linear discriminant analysis
- Rates of convergence for robust geometric inference
- Robust estimation of U-statistics
- Theory of Classification: a Survey of Some Recent Advances
- Noisy discriminant analysis with boundary assumptions
- The multi-armed bandit problem with covariates
- Inverse statistical learning
- Confidence regions for level sets
- Risk bounds for CART classifiers under a margin condition
- Margin-adaptive model selection in statistical learning
- Rate of convergence of k-nearest-neighbor classification rule
- Pricing Bermudan options by nonparametric regression: optimal rates of convergence for lower estimates
- Structured kernel quantile regression
- Neyman-Pearson classification: parametrics and sample size requirement
- Large‐margin classification with multiple decision rules
- Aggregated hold-out
- A flexible model-free prediction-based framework for feature ranking
- Rejoinder: New Objectives for Policy Learning
- scientific article; zbMATH DE number 7626745 (Why is no real title available?)
- scientific article; zbMATH DE number 7626777 (Why is no real title available?)
- Smooth Contextual Bandits: Bridging the Parametric and Nondifferentiable Regret Regimes
- Intrinsic dimension adaptive partitioning for kernel methods
- An adaptive multiclass nearest neighbor classifier
- Robust high dimensional learning for Lipschitz and convex losses
- Universal consistency and rates of convergence of multiclass prototype algorithms in metric spaces
- Active learning for cost-sensitive classification
- Variance-based regularization with convex objectives
- scientific article; zbMATH DE number 7064063 (Why is no real title available?)
- Rates of Convergence for a Bayesian Level Set Estimation
- Performance guarantees for individualized treatment rules
- scientific article; zbMATH DE number 7660136 (Why is no real title available?)
- Adaptation to lowest density regions with application to support recovery
- Randomized allocation with arm elimination in a bandit problem with covariates
- Hold-out estimates of prediction models for Markov processes
- Optimal rates for plug-in estimators of density level sets
- Generalized density clustering
- 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
- On the rates of convergence of simulation-based optimization algorithms for optimal stopping problems
- Estimating conditional quantiles with the help of the pinball loss
- Adaptive Algorithm for Multi-Armed Bandit Problem with High-Dimensional Covariates
- Optimal classification for functional data
- On regression and classification with possibly missing response variables in the data
This page was built for publication: Smooth discrimination analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583889)
