Consistency analysis of spectral regularization algorithms (Q437553): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Hongwei Sun / rank | |||
Normal rank | |||
| Property / review text | |||
Summary: We investigate the consistency of spectral regularization algorithms. We generalize the usual definition of regularization function to enrich the content of spectral regularization algorithms. Under a more general prior condition, using refined error decompositions and techniques of operator norm estimation, satisfactory error bounds and learning rates are proved. | |||
| Property / review text: Summary: We investigate the consistency of spectral regularization algorithms. We generalize the usual definition of regularization function to enrich the content of spectral regularization algorithms. Under a more general prior condition, using refined error decompositions and techniques of operator norm estimation, satisfactory error bounds and learning rates are proved. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68T05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6058113 / rank | |||
Normal rank | |||
Revision as of 00:18, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Consistency analysis of spectral regularization algorithms |
scientific article |
Statements
Consistency analysis of spectral regularization algorithms (English)
0 references
18 July 2012
0 references
Summary: We investigate the consistency of spectral regularization algorithms. We generalize the usual definition of regularization function to enrich the content of spectral regularization algorithms. Under a more general prior condition, using refined error decompositions and techniques of operator norm estimation, satisfactory error bounds and learning rates are proved.
0 references
