 A class of parameter choice rules for fractional Tikhonov regularization scheme in learning theorySreepriya P., Denny K.D. and G.D. Reddy Applied Mathematics and Computation, 2025, vol. 500, issue C Abstract: Klann and Ramlau [16] hypothesized fractional Tikhonov regularization as an interpolation between generalized inverse and Tikhonov regularization. In fact, fractional schemes can be viewed as a generalization of the Tikhonov scheme. One of the motives of this work is the major pitfall of the a priori parameter choice rule, which primarily relies on source conditions that are often unknown. It necessitates the need for advocating a data-driven approach (a posteriori choice strategy). We briefly overview fractional scheme in learning theory and propose a modified Engl type [9] discrepancy principle, thus integrating supervised learning into the field of inverse problems. In due course of the investigation, we effectively explored the relation between learning from examples and the inverse problems. We demonstrate the regularization properties and establish the convergence rate of this scheme. Finally, the theoretical results are corroborated using two well known examples in learning theory. Keywords: Ill-posed problems; Regularization; Non parametric regression; Supervised learning; Inequalities in approximation (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:500:y:2025:i:c:s0096300325001742 DOI: 10.1016/j.amc.2025.129447 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.