Optimal convex correcting procedures in problems of high dimension

DOI10.1134/S0965542511090090MaRDI QIDQ2839436zbMATH OpenOpenAlexFDO

Authors A. A. Dokukin, O. V. Sen'ko

Publication date 5 July 2013

Published in Zhurnal Vychislitel'noĭ Matematiki i Matematicheskoĭ Fiziki (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0965542511090090

zbMATH Keywords

convex correcting proceduresprognostic propertiesregression variable selection

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Quadratic programming (90C20)

Recommendations

• Persistene in high-dimensional linear predictor-selection and the virtue of overparametrization
• Regression model based on convex combinations best correlated with response
• On some universal methods of correction of the improper convex programming problems
• scientific article; zbMATH DE number 998425
• scientific article; zbMATH DE number 3892369

Cited in

(5)

• Convex models of high dimensional discrete data
• Regression model based on convex combinations best correlated with response
• Method for improving gradient boosting learning efficiency based on modified loss functions
• Convex optimisation-based methods for K-complex detection
• A two-level method for constructing linear regressions using optimal convex combinations

This page was built for publication: Optimal convex correcting procedures in problems of high dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2839436)