Sparse kernel deep stacking networks

DOI10.1007/s00180-018-0832-9zbMath1505.62422OpenAlexW2889181573MaRDI QIDQ2319474

Matthias Schmid, Thomas Welchowski

Publication date: 19 August 2019

Published in: Computational Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00180-018-0832-9

zbMATH Keywords

kernel regressionvariable selectionsparsitydeep learningmodel-based optimizationdropout

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Nonparametric regression and quantile regression (62G08) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

kernDeepStackNet, Proceedings of Reisensburg 2016--2017

Uses Software

• R
• UCI-ml
• mboost
• EGO
• DiceKriging
• DiceOptim
• irace
• CORElearn
• GA
• CIFAR
• DANN
• ReliefF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedy function approximation: A gradient boosting machine.
• Bagging predictors
• Model-based boosting in R: a hands-on tutorial using the R package mboost
• Computing the nearest correlation matrix--a problem from finance
• Boosting algorithms: regularization, prediction and model fitting
• An introduction to copulas.
• Kernel methods in machine learning
• Efficient global optimization of expensive black-box functions
• Theoretical and empirical analysis of ReliefF and RReliefF
• On the Expressive Power of Deep Architectures
• Deep Learning: Methods and Applications
• On measures of dependence
• Support Vector Machines
• Large Sample Properties of Simulations Using Latin Hypercube Sampling
• 10.1162/153244303322753616
• Random forests