Theory of Classification: a Survey of Some Recent Advances
From MaRDI portal
Publication:3373749
Recommendations
Cites work
- scientific article; zbMATH DE number 2089354 (Why is no real title available?)
- scientific article; zbMATH DE number 2089371 (Why is no real title available?)
- scientific article; zbMATH DE number 991499 (Why is no real title available?)
- scientific article; zbMATH DE number 1804118 (Why is no real title available?)
- scientific article; zbMATH DE number 3883309 (Why is no real title available?)
- scientific article; zbMATH DE number 3147701 (Why is no real title available?)
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 3862476 (Why is no real title available?)
- scientific article; zbMATH DE number 5604036 (Why is no real title available?)
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- scientific article; zbMATH DE number 5654889 (Why is no real title available?)
- scientific article; zbMATH DE number 3782216 (Why is no real title available?)
- scientific article; zbMATH DE number 17222 (Why is no real title available?)
- scientific article; zbMATH DE number 28602 (Why is no real title available?)
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 47593 (Why is no real title available?)
- scientific article; zbMATH DE number 49991 (Why is no real title available?)
- scientific article; zbMATH DE number 53984 (Why is no real title available?)
- scientific article; zbMATH DE number 67633 (Why is no real title available?)
- scientific article; zbMATH DE number 1246230 (Why is no real title available?)
- scientific article; zbMATH DE number 1322222 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 708500 (Why is no real title available?)
- scientific article; zbMATH DE number 1064642 (Why is no real title available?)
- scientific article; zbMATH DE number 1109085 (Why is no real title available?)
- scientific article; zbMATH DE number 3436645 (Why is no real title available?)
- scientific article; zbMATH DE number 1950575 (Why is no real title available?)
- scientific article; zbMATH DE number 1950576 (Why is no real title available?)
- scientific article; zbMATH DE number 2034517 (Why is no real title available?)
- scientific article; zbMATH DE number 1552503 (Why is no real title available?)
- scientific article; zbMATH DE number 1556150 (Why is no real title available?)
- scientific article; zbMATH DE number 3797051 (Why is no real title available?)
- scientific article; zbMATH DE number 2118472 (Why is no real title available?)
- scientific article; zbMATH DE number 819196 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- scientific article; zbMATH DE number 835699 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- scientific article; zbMATH DE number 4197203 (Why is no real title available?)
- scientific article; zbMATH DE number 3215519 (Why is no real title available?)
- scientific article; zbMATH DE number 3336465 (Why is no real title available?)
- 10.1162/153244302760200650
- 10.1162/153244302760200704
- 10.1162/153244303321897681
- 10.1162/153244303321897690
- 10.1162/153244303765208368
- 10.1162/153244303768966111
- 10.1162/1532443041424319
- 10.1162/1532443041827925
- A Bennett concentration inequality and its application to suprema of empirical processes
- A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines
- A Remark on the Szarek–Talagrand Theorem
- A combinatorial problem; stability and order for models and theories in infinitary languages
- A decision-theoretic generalization of on-line learning and an application to boosting
- A finite sample distribution-free performance bound for local discrimination rules
- A general lower bound on the number of examples needed for learning
- A graph-theoretic generalization of the Sauer-Shelah lemma
- A new approach to least-squares estimation, with applications
- A new look at independence
- A new look at the statistical model identification
- A note on Talagrand's concentration inequality
- A note on margin-based loss functions in classification
- A result of Vapnik with applications
- A sharp concentration inequality with applications
- A simple proof of the blowing-up lemma (Corresp.)
- About the constants in Talagrand's concentration inequalities for empirical processes.
- Adaptive model selection using empirical complexities
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- Advances in large-margin classifiers
- An alternative point of view on Lepski's method
- An introduction to support vector machines and other kernel-based learning methods.
- Arcing classifiers. (With discussion)
- Automatic pattern recognition: a study of the probability of error
- Balls in \(\mathbb{R}^k\) do not cut all subsets of \(k+2\) points
- Behavioral and prescriptive explanations of a reverse sunk cost effect
- Boosting With theL2Loss
- Boosting a weak learning algorithm by majority
- Boosting the margin: a new explanation for the effectiveness of voting methods
- Bootstrap methods: another look at the jackknife
- Bounding \(\bar d\)-distance by informational divergence: A method to prove measure concentration
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
- Capacity of reproducing kernel spaces in learning theory
- Central limit theorems for empirical measures
- Combinatorics of random processes and sections of convex bodies
- Combining PAC-Bayesian and generic chaining bounds
- Complexity regularization via localized random penalties
- Concentration for Independent Permutations
- Concentration for locally acting permutations
- Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
- Concentration inequalities for set-indexed empirical processes
- Concentration inequalities using the entropy method
- Concentration of measure and isoperimetric inequalities in product spaces
- Concept learning using complexity regularization
- Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
- Convergence of stochastic processes
- Convexity, Classification, and Risk Bounds
- Correction to bounds on conditional probabilities with applications
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Density and dimension
- Density estimation via exponential model selection
- Distribution-free inequalities for the deleted and holdout error estimates
- Distribution-free performance bounds for potential function rules
- Empirical margin distributions and bounding the generalization error of combined classifiers
- Empirical processes and applications: An overview. (With discussion)
- Entropy and the combinatorial dimension
- Enumeration of Seven-Argument Threshold Functions
- Erratum to: ``A measure concentration inequality for contracting Markov chains
- Estimating a regression function
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Existence of submatrices with all possible columns
- Exponential Bounds for Large Deviations
- Exponential inequalities for sums of random vectors
- Finiteness results for sigmoidal “neural” networks
- Generalization bounds for averaged classifiers
- Hardness results for neural network approximation problems
- Ideal spatial adaptation by wavelet shrinkage
- Improved bounds on the sample complexity of learning
- Improving the sample complexity using global data
- Information inequalities and concentration of measure
- Introduction to nonparametric estimation
- Large sample optimality of least squares cross-validation in density estimation
- Large-scale typicality of Markov sample paths and consistency of MDL order estimators
- Learnability and the Vapnik-Chervonenkis dimension
- Learning Theory
- Learning Theory
- Learning pattern classification-a survey
- Local Rademacher complexities
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- Logistic regression, AdaBoost and Bregman distances
- Majorizing measures: The generic chaining
- Measuring mass concentrations and estimating density contour clusters -- An excess mass approach
- Minimax nonparametric classification .I. Rates of convergence
- Minimax nonparametric classification. II. Model selection for adaptation
- Minimum complexity density estimation
- Minimum contrast estimators on sieves: Exponential bounds and rates of convergence
- Model selection and error estimation
- Model selection for regression on a fixed design
- Model selection in nonparametric regression
- Moment inequalities for functions of independent random variables
- Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations
- Neural Network Learning
- Neural networks with quadratic VC dimension
- New concentration inequalities in product spaces
- On Talagrand's deviation inequalities for product measures
- On nonparametric estimation of density level sets
- On the Bayes-risk consistency of regularized boosting methods.
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On the convexified Sauer-Shelah theorem
- On the density of families of sets
- On the importance of small coordinate projections
- On the infeasibility of training neural networks with small mean-squared error
- On the influence of the kernel on the consistency of support vector machines
- On the mathematical foundations of learning
- On the trace of finite sets
- Optimal aggregation of classifiers in statistical learning.
- Optimal spatial adaptation to inhomogeneous smoothness: An approach based on kernel estimates with variable bandwidth selectors
- PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
- PAC-Bayesian stochastic model selection
- Pattern classification.
- Poincaré's inequalities and Talagrand's concentration phenomenon for the exponential distribution
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
- Population theory for boosting ensembles.
- Potential function algorithms for pattern recognition learning machines
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Probability Inequalities for Sums of Bounded Random Variables
- Probability Inequalities for the Sum of Independent Random Variables
- Probably Approximate Learning of Sets and Functions
- Process consistency for AdaBoost.
- Rademacher penalties and structural risk minimization
- Rates of convergence for minimum contrast estimators
- Regularization networks and support vector machines
- Risk bounds for model selection via penalization
- Risk bounds for statistical learning
- Scale-sensitive dimensions, uniform convergence, and learnability
- Sharper bounds for Gaussian and empirical processes
- Smooth discrimination analysis
- Smoothing noisy data with spline functions: Estimating the correct degree of smoothing by the method of generalized cross-validation
- Some Comments on C P
- Some applications of concentration inequalities to statistics
- Some extensions of an inequality of Vapnik and Chervonenkis
- Some limit theorems for empirical processes (with discussion)
- Some special Vapnik-Chervonenkis classes
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- Square root penalty: Adaption to the margin in classification and in edge estimation
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Statistical learning theory and stochastic optimization. Ecole d'Eté de Probabilitiés de Saint-Flour XXXI -- 2001.
- Statistical performance of support vector machines
- Strong minimax lower bounds for learning
- Strongly consistent code-based identification and order estimation for constrained finite-state model classes
- Structural risk minimization over data-dependent hierarchies
- Support vector machines are universally consistent
- Support-vector networks
- Symmetrization approach to concentration inequalities for empirical processes.
- The Generic Chaining
- The Glivenko-Cantelli problem
- The Glivenko-Cantelli problem, ten years later
- The consistency of the BIC Markov order estimator.
- The densest hemisphere problem
- The elements of statistical learning. Data mining, inference, and prediction
- The importance of convexity in learning with squared loss
- The method of potential functions for the problem of restoring the characteristic of a function converter from randomly observed points
- The probability problem of pattern recognition learning and the method of potential functions
- Theoretical foundations of the potential function method in pattern recognition learning
- Une inégalité de Bennett pour les maxima de processus empiriques. (A Bennet type inequality for maxima of empirical processes)
- Uniform Central Limit Theorems
- Uniform and universal Glivenko-Cantelli classes
- Universal Donsker classes and metric entropy
- Vapnik-Chervonenkis type conditions and uniform Donsker classes of functions
- Weak convergence and empirical processes. With applications to statistics
- Weighted sums of certain dependent random variables
Cited in
(only showing first 100 items - show all)- Percolation centrality via Rademacher Complexity
- Model selection by bootstrap penalization for classification
- Group invariance, stability to deformations, and complexity of deep convolutional representations
- Sample Complexity of Classifiers Taking Values in ℝQ, Application to Multi-Class SVMs
- On the kernel rule for function classification
- Concentration inequalities for samples without replacement
- Constructing processes with prescribed mixing coefficients
- Reducing mechanism design to algorithm design via machine learning
- Combinatorial bounds of overfitting for threshold classifiers
- Classification with reject option
- Testing piecewise functions
- Instability, complexity, and evolution
- scientific article; zbMATH DE number 7370537 (Why is no real title available?)
- Relative deviation learning bounds and generalization with unbounded loss functions
- Learning noisy linear classifiers via adaptive and selective sampling
- Robustness and generalization
- Depth separations in neural networks: what is actually being separated?
- scientific article; zbMATH DE number 7064063 (Why is no real title available?)
- Fast learning rates in statistical inference through aggregation
- Efficiency of classification methods based on empirical risk minimization
- Adaptive estimation of the optimal ROC curve and a bipartite ranking algorithm
- Sampling and empirical risk minimization
- An empirical classification procedure for nonparametric mixture models
- Convergence conditions for the observed mean method in stochastic programming
- Supervised Learning by Support Vector Machines
- Classification with many classes: challenges and pluses
- Concentration inequalities for two-sample rank processes with application to bipartite ranking
- A high-dimensional Wilks phenomenon
- Local nearest neighbour classification with applications to semi-supervised learning
- Measuring the capacity of sets of functions in the analysis of ERM
- Risk bounds for CART classifiers under a margin condition
- Hold-out estimates of prediction models for Markov processes
- For interpolating kernel machines, minimizing the norm of the ERM solution maximizes stability
- Some properties of Gaussian reproducing kernel Hilbert spaces and their implications for function approximation and learning theory
- Fast learning rates for plug-in classifiers
- Nonparametric classification with missing data
- Statistical learning from biased training samples
- PAC-Bayesian high dimensional bipartite ranking
- Bayesian approach, theory of empirical risk minimization. Comparative analysis
- scientific article; zbMATH DE number 7370598 (Why is no real title available?)
- PAC-Bayesian bounds for randomized empirical risk minimizers
- Multi-kernel regularized classifiers
- Generalized mirror averaging and D-convex aggregation
- Robust \(k\)-means clustering for distributions with two moments
- Sharpness estimation of combinatorial generalization ability bounds for threshold decision rules
- Stability and minimax optimality of tangential Delaunay complexes for manifold reconstruction
- Consistency of learning algorithms using Attouch-Wets convergence
- Cover-based combinatorial bounds on probability of overfitting
- On regularization algorithms in learning theory
- Upper bounds and aggregation in bipartite ranking
- Strong \(L^p\) convergence of wavelet deconvolution density estimators
- Maxisets for model selection
- Obtaining fast error rates in nonconvex situations
- Ranking and empirical minimization of \(U\)-statistics
- Robust statistical learning with Lipschitz and convex loss functions
- Nearest neighbor empirical processes
- The coreness and H-index of random geometric graphs
- Guest editorial: Learning theory
- Approaches to supervised learning for pattern recognition
- Cross-validation on extreme regions
- Classification algorithms using adaptive partitioning
- On signal representations within the Bayes decision framework
- Robust classification via MOM minimization
- How can we identify the sparsity structure pattern of high-dimensional data: an elementary statistical analysis to interpretable machine learning
- Optimal functional supervised classification with separation condition
- Neural network approximation
- Stochastic difference-of-convex-functions algorithms for nonconvex programming
- A partial overview of the theory of statistics with functional data
- Reference point logistic classification
- scientific article; zbMATH DE number 3923896 (Why is no real title available?)
- Empirical risk minimization for heavy-tailed losses
- Kullback-Leibler aggregation and misspecified generalized linear models
- Adaptive kernel methods using the balancing principle
- Bandwidth selection in kernel empirical risk minimization via the gradient
- scientific article; zbMATH DE number 7626777 (Why is no real title available?)
- SVRG meets AdaGrad: painless variance reduction
- Minimax fast rates for discriminant analysis with errors in variables
- Pattern classification as interpolation in N dimensions
- Classification with minimax fast rates for classes of Bayes rules with sparse representation
- Plugin procedure in segmentation and application to hyperspectral image segmentation
- Learning bounds for quantum circuits in the agnostic setting
- Learning sets with separating kernels
- Structure from randomness in halfspace learning with the zero-one loss
- Simultaneous adaptation to the margin and to complexity in classification
- Optimal survey schemes for stochastic gradient descent with applications to \(M\)-estimation
- Classification in general finite dimensional spaces with the \(k\)-nearest neighbor rule
- A survey of cross-validation procedures for model selection
- A statistical view of clustering performance through the theory of U-processes
- Permutational Rademacher Complexity
- Mathematical methods of randomized machine learning
- Agnostic active learning
- Learning by mirror averaging
- Optimal rates of aggregation in classification under low noise assumption
- When are epsilon-nets small?
- Statistical analysis of Mapper for stochastic and multivariate filters
- PACMAN: PAC-style bounds accounting for the mismatch between accuracy and negative log-loss
- Properties of convergence of a fuzzy set estimator of the density function
- Kernel methods in machine learning
- Adaptive partitioning schemes for bipartite ranking
- An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods
This page was built for publication: Theory of Classification: a Survey of Some Recent Advances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3373749)
