Theory of Classification: a Survey of Some Recent Advances (Q3373749)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Theory of Classification: a Survey of Some Recent Advances	scientific article

Statements

scholarly article

0 references

Theory of Classification: a Survey of Some Recent Advances (English)

0 references

zbMATH Open document ID

0 references

10.1051/ps:2005018

0 references

Stéphane Boucheron

0 references

Olivier Bousquet

0 references

0 references

ESAIM: Probability and Statistics

0 references

publication date

9 March 2006

0 references

full work available at URL

http://www.numdam.org/item?id=PS_2005__9__323_0

0 references

https://eudml.org/doc/244764

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

Pattern recognition

0 references

statistical learning theory

0 references

concentration inequalities

0 references

empirical processes

0 references

model selection

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Correction to bounds on conditional probabilities with applications

0 references

The method of potential functions for the problem of restoring the characteristic of a function converter from randomly observed points

0 references

The probability problem of pattern recognition learning and the method of potential functions

0 references

Theoretical foundations of the potential function method in pattern recognition learning

0 references

A new look at the statistical model identification

0 references

A Remark on the Szarek–Talagrand Theorem

0 references

Scale-sensitive dimensions, uniform convergence, and learnability

0 references

Neural Network Learning

0 references

0 references

A result of Vapnik with applications

0 references

10.1162/153244303768966111

0 references

Strong minimax lower bounds for learning

0 references

Density and dimension

0 references

0 references

Weighted sums of certain dependent random variables

0 references

Model selection for regression on a fixed design

0 references

Risk bounds for model selection via penalization

0 references

0 references

Minimum complexity density estimation

0 references

Model selection and error estimation

0 references

Local Rademacher complexities

0 references

Hardness results for neural network approximation problems

0 references

Convexity, Classification, and Risk Bounds

0 references

10.1162/153244303321897690

0 references

Learning Theory

0 references

Potential function algorithms for pattern recognition learning machines

0 references

10.1162/153244303321897681

0 references

Probability Inequalities for the Sum of Independent Random Variables

0 references

An alternative point of view on Lepski's method

0 references

Rates of convergence for minimum contrast estimators

0 references

0 references

Minimum contrast estimators on sieves: Exponential bounds and rates of convergence

0 references

Statistical performance of support vector machines

0 references

10.1162/1532443041424319

0 references

Learnability and the Vapnik-Chervonenkis dimension

0 references

Poincaré's inequalities and Talagrand's concentration phenomenon for the exponential distribution

0 references

Moment inequalities for functions of independent random variables

0 references

A sharp concentration inequality with applications

0 references

Concentration inequalities using the entropy method

0 references

A Bennett concentration inequality and its application to suprema of empirical processes

0 references

0 references

10.1162/153244302760200704

0 references

0 references

Arcing classifiers. (With discussion)

0 references

Population theory for boosting ensembles.

0 references

0 references

Boosting With the<i>L</i><sub>2</sub>Loss

0 references

10.1162/153244302760200650

0 references

Density estimation via exponential model selection

0 references

Statistical learning theory and stochastic optimization. Ecole d'Eté de Probabilitiés de Saint-Flour XXXI -- 2001.

0 references

A graph-theoretic generalization of the Sauer-Shelah lemma

0 references

Logistic regression, AdaBoost and Bregman distances

0 references

Support-vector networks

0 references

Enumeration of Seven-Argument Threshold Functions

0 references

Smoothing noisy data with spline functions: Estimating the correct degree of smoothing by the method of generalized cross-validation

0 references

0 references

Large-scale typicality of Markov sample paths and consistency of MDL order estimators

0 references

The consistency of the BIC Markov order estimator.

0 references

On the mathematical foundations of learning

0 references

Information inequalities and concentration of measure

0 references

0 references

Automatic pattern recognition: a study of the probability of error

0 references

0 references

Distribution-free inequalities for the deleted and holdout error estimates

0 references

Distribution-free performance bounds for potential function rules

0 references

Ideal spatial adaptation by wavelet shrinkage

0 references

0 references

0 references

Central limit theorems for empirical measures

0 references

Balls in \(\mathbb{R}^k\) do not cut all subsets of \(k+2\) points

0 references

0 references

Universal Donsker classes and metric entropy

0 references

Uniform Central Limit Theorems

0 references

Uniform and universal Glivenko-Cantelli classes

0 references

Bootstrap methods: another look at the jackknife

0 references

0 references

0 references

A general lower bound on the number of examples needed for learning

0 references

Regularization networks and support vector machines

0 references

On the trace of finite sets

0 references

Boosting a weak learning algorithm by majority

0 references

Generalization bounds for averaged classifiers

0 references

A decision-theoretic generalization of on-line learning and an application to boosting

0 references

Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)

0 references

0 references

Empirical processes and applications: An overview. (With discussion)

0 references

Some limit theorems for empirical processes (with discussion)

0 references

0 references

Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers

0 references

0 references

Large sample optimality of least squares cross-validation in density estimation

0 references

The elements of statistical learning. Data mining, inference, and prediction

0 references

Decision theoretic generalizations of the PAC model for neural net and other learning applications

0 references

Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension

0 references

Predicting \(\{ 0,1\}\)-functions on randomly drawn points

0 references

10.1162/153244303765208368

0 references

Probability Inequalities for Sums of Bounded Random Variables

0 references

0 references

Process consistency for AdaBoost.

0 references

The densest hemisphere problem

0 references

Behavioral and prescriptive explanations of a reverse sunk cost effect

0 references

Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks

0 references

0 references

Strongly consistent code-based identification and order estimation for constrained finite-state model classes

0 references

A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines

0 references

Neural networks with quadratic VC dimension

0 references

0 references

0 references

Rademacher penalties and structural risk minimization

0 references

Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)

0 references

0 references

Empirical margin distributions and bounding the generalization error of combined classifiers

0 references

Learning pattern classification-a survey

0 references

0 references

On Talagrand's deviation inequalities for product measures

0 references

0 references

The importance of convexity in learning with squared loss

0 references

Optimal spatial adaptation to inhomogeneous smoothness: An approach based on kernel estimates with variable bandwidth selectors

0 references

0 references

0 references

Improved bounds on the sample complexity of learning

0 references

A note on margin-based loss functions in classification

0 references

Concentration for locally acting permutations

0 references

Adaptive model selection using empirical complexities

0 references

On the Bayes-risk consistency of regularized boosting methods.

0 references

Complexity regularization via localized random penalties

0 references

Concept learning using complexity regularization

0 references

Finiteness results for sigmoidal “neural” networks

0 references

Some Comments on C P

0 references

Smooth discrimination analysis

0 references

0 references

0 references

A simple proof of the blowing-up lemma (Corresp.)

0 references

Bounding \(\bar d\)-distance by informational divergence: A method to prove measure concentration

0 references

Erratum to: ``A measure concentration inequality for contracting Markov chains''

0 references

About the constants in Talagrand's concentration inequalities for empirical processes.

0 references

Some applications of concentration inequalities to statistics

0 references

Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.

0 references

Risk bounds for statistical learning

0 references

PAC-Bayesian stochastic model selection

0 references

0 references

0 references

Concentration for Independent Permutations

0 references

0 references

Improving the sample complexity using global data

0 references

0 references

0 references

Entropy and the combinatorial dimension

0 references

Probably Approximate Learning of Sets and Functions

0 references

A note on Talagrand's concentration inequality

0 references

Some extensions of an inequality of Vapnik and Chervonenkis

0 references

Symmetrization approach to concentration inequalities for empirical processes.

0 references

Convergence of stochastic processes

0 references

0 references

Measuring mass concentrations and estimating density contour clusters -- An excess mass approach

0 references

Concentration inequalities for set-indexed empirical processes

0 references

Une inégalité de Bennett pour les maxima de processus empiriques. (A Bennet type inequality for maxima of empirical processes)

0 references

0 references

A finite sample distribution-free performance bound for local discrimination rules

0 references

Combinatorics of random processes and sections of convex bodies

0 references

On the density of families of sets

0 references

0 references

Boosting the margin: a new explanation for the effectiveness of voting methods

0 references

0 references

Learning Theory

0 references

PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification

0 references

Structural risk minimization over data-dependent hierarchies

0 references

A combinatorial problem; stability and order for models and theories in infinitary languages

0 references

0 references

0 references

Existence of submatrices with all possible columns

0 references

10.1162/153244302760185252

0 references

Consistency of Support Vector Machines and Other Regularized Kernel Classifiers

0 references

Support vector machines are universally consistent

0 references

10.1162/1532443041827925

0 references

On the convexified Sauer-Shelah theorem

0 references

The Glivenko-Cantelli problem

0 references

Sharper bounds for Gaussian and empirical processes

0 references

Concentration of measure and isoperimetric inequalities in product spaces

0 references

The Glivenko-Cantelli problem, ten years later

0 references

Majorizing measures: The generic chaining

0 references

New concentration inequalities in product spaces

0 references

A new look at independence

0 references

Vapnik-Chervonenkis type conditions and uniform Donsker classes of functions

0 references

The Generic Chaining

0 references

On nonparametric estimation of density level sets

0 references

Optimal aggregation of classifiers in statistical learning.

0 references

Introduction to nonparametric estimation

0 references

Square root penalty: Adaption to the margin in classification and in edge estimation

0 references

A new approach to least-squares estimation, with applications

0 references

Estimating a regression function

0 references

0 references

Weak convergence and empirical processes. With applications to statistics

0 references

Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz

0 references

0 references

0 references

On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

0 references

Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations

0 references

0 references

On the infeasibility of training neural networks with small mean-squared error

0 references

Model selection in nonparametric regression

0 references

Some special Vapnik-Chervonenkis classes

0 references

Minimax nonparametric classification .I. Rates of convergence

0 references

Minimax nonparametric classification. II. Model selection for adaptation

0 references

0 references

Exponential Bounds for Large Deviations

0 references

Exponential inequalities for sums of random vectors

0 references

Statistical behavior and consistency of classification methods based on convex risk minimization.

0 references

Capacity of reproducing kernel spaces in learning theory

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3373749

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3373749&oldid=34863035"