| http://dbpedia.org/ontology/abstract
|
Spectral regularization is any of a class … Spectral regularization is any of a class of regularization techniques used in machine learning to control the impact of noise and prevent overfitting. Spectral regularization can be used in a broad range of applications, from deblurring images to classifying emails into a spam folder and a non-spam folder. For instance, in the email classification example, spectral regularization can be used to reduce the impact of noise and prevent overfitting when a machine learning system is being trained on a labeled set of emails to learn how to tell a spam and a non-spam email apart. Spectral regularization algorithms rely on methods that were originally defined and studied in the theory of ill-posed inverse problems (for instance, see) focusing on the inversion of a linear operator (or a matrix) that possibly has a bad condition number or an unbounded inverse. In this context, regularization amounts to substituting the original operator by a bounded operator called the "regularization operator" that has a condition number controlled by a regularization parameter, a classical example being Tikhonov regularization. To ensure stability, this regularization parameter is tuned based on the level of noise. The main idea behind spectral regularization is that each regularization operator can be described using spectral calculus as an appropriate filter on the eigenvalues of the operator that defines the problem, and the role of the filter is to "suppress the oscillatory behavior corresponding to small eigenvalues". Therefore, each algorithm in the class of spectral regularization algorithms is defined by a suitable filter function (which needs to be derived for that particular algorithm). Three of the most commonly used regularization algorithms for which spectral filtering is well-studied are Tikhonov regularization, Landweber iteration, and truncated singular value decomposition (TSVD). As for choosing the regularization parameter, examples of candidate methods to compute this parameter include the discrepancy principle, generalized cross validation, and the L-curve criterion. It is of note that the notion of spectral filtering studied in the context of machine learning is closely connected to the literature on function approximation (in signal processing).tion approximation (in signal processing).
|
| http://dbpedia.org/ontology/wikiPageID
|
41323011
|
| http://dbpedia.org/ontology/wikiPageLength
|
11815
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
912609013
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Regularization_%28mathematics%29 +
, http://dbpedia.org/resource/Category:Mathematical_analysis +
, http://dbpedia.org/resource/Singular_value_decomposition +
, http://dbpedia.org/resource/Cross-validation_%28statistics%29 +
, http://dbpedia.org/resource/Landweber_iteration +
, http://dbpedia.org/resource/Machine_learning +
, http://dbpedia.org/resource/Category:Computer_engineering +
, http://dbpedia.org/resource/Condition_number +
, http://dbpedia.org/resource/Function_approximation +
, http://dbpedia.org/resource/Category:Inverse_problems +
, http://dbpedia.org/resource/Tikhonov_regularization +
, http://dbpedia.org/resource/Ill-posed_problem +
, http://dbpedia.org/resource/Overfitting +
, http://dbpedia.org/resource/Gradient_descent +
, http://dbpedia.org/resource/Inverse_problem +
, http://dbpedia.org/resource/Principal_component_analysis +
, http://dbpedia.org/resource/RKHS +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Mathematical_analysis +
, http://dbpedia.org/resource/Category:Computer_engineering +
, http://dbpedia.org/resource/Category:Inverse_problems +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Regularization_by_spectral_filtering?oldid=912609013&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Regularization_by_spectral_filtering +
|
| owl:sameAs |
http://yago-knowledge.org/resource/Regularization_by_spectral_filtering +
, https://global.dbpedia.org/id/fv13 +
, http://dbpedia.org/resource/Regularization_by_spectral_filtering +
, http://www.wikidata.org/entity/Q17051930 +
, http://rdf.freebase.com/ns/m.0_qjd4_ +
|
| rdf:type |
http://dbpedia.org/class/yago/WikicatInverseProblems +
, http://dbpedia.org/class/yago/Problem114410605 +
, http://dbpedia.org/class/yago/Difficulty114408086 +
, http://dbpedia.org/class/yago/Condition113920835 +
, http://dbpedia.org/class/yago/Attribute100024264 +
, http://dbpedia.org/class/yago/State100024720 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
|
| rdfs:comment |
Spectral regularization is any of a class … Spectral regularization is any of a class of regularization techniques used in machine learning to control the impact of noise and prevent overfitting. Spectral regularization can be used in a broad range of applications, from deblurring images to classifying emails into a spam folder and a non-spam folder. For instance, in the email classification example, spectral regularization can be used to reduce the impact of noise and prevent overfitting when a machine learning system is being trained on a labeled set of emails to learn how to tell a spam and a non-spam email apart.to tell a spam and a non-spam email apart.
|
| rdfs:label |
Regularization by spectral filtering
|
