Piece-wise quadratic approximations of arbitrary error functions for fast and robust machine learning

DOI10.1016/j.neunet.2016.08.007zbMath1428.68239arXiv1605.06276OpenAlexW2513611732WikidataQ39378231 ScholiaQ39378231MaRDI QIDQ2281681

Yanyan Li

Publication date: 6 January 2020

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.06276

zbMATH Keywords

clusteringprincipal componentssparse regressionregularized regressiondata approximationnonquadratic potential

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Blessing of dimensionality: mathematical foundations of the statistical physics of data

Uses Software

• elmap

Cites Work

• Unnamed Item
• Unnamed Item
• A pure \(L_1\)-norm principal component analysis
• Topological grammars for data approximation
• Trimmed \(k\)-means: An attempt to robustify quantizers
• Principal manifolds for data visualization and dimension reduction. Reviews and original papers presented partially at the workshop `Principal manifolds for data cartography and dimension reduction', Leicester, UK, August 24--26, 2006.
• Neural network iterative method of principal curves for data with gaps
• Elastic principal graphs and manifolds and their practical applications
• Robust principal component analysis?
• Principal points
• Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squares Minimization
• Regularization and Variable Selection Via the Elastic Net
• Self-organizing maps.

This page was built for publication: Piece-wise quadratic approximations of arbitrary error functions for fast and robust machine learning