Correlations of random classifiers on large data sets
From MaRDI portal
Publication:2100403
DOI10.1007/s00500-021-05938-4OpenAlexW3167806060MaRDI QIDQ2100403
Marcello Sanguineti, Vera Kurková
Publication date: 22 November 2022
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-021-05938-4
concentration of measurebinary classificationmethod of bounded differencesoptimization of feedforward networksrandom classifiers
Learning and adaptive systems in artificial intelligence (68T05) Computational aspects of data analysis and big data (68T09)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Can dictionary-based computational models outperform the best linear ones?
- Some comparisons of complexity in dictionary-based and linear computational models
- On the tractability of multivariate integration and approximation by neural networks
- Complexity estimates based on integral transforms induced by computational units
- Probabilistic lower bounds for approximation by shallow perceptron networks
- Quasiorthogonal dimension
- Approximation with random bases: pro et contra
- Quasiorthogonal dimension of Euclidean spaces
- Weighted sums of certain dependent random variables
- Concentration Inequalities and Martingale Inequalities: A Survey
- Greed is Good: Algorithmic Results for Sparse Approximation
- Universal approximation bounds for superpositions of a sigmoidal function
- Minimization of Error Functionals over Variable-Basis Functions
- Dependence of Computational Models on Input Dimension: Tractability of Approximation and Optimization Tasks
- On a Variational Norm Tailored to Variable-Basis Approximation Schemes
- Concentration of Measure for the Analysis of Randomized Algorithms
This page was built for publication: Correlations of random classifiers on large data sets
