pith. sign in

arxiv: 1403.1278 · v2 · pith:TMKGVYICnew · submitted 2014-03-05 · 🧮 math.OC

Dynamic sampling schemes for optimal noise learning under multiple nonsmooth constraints

classification 🧮 math.OC
keywords constraintscomputationaldatabaseslearningmultiplenoisenonsmoothoptimal
0
0 comments X
read the original abstract

We consider the bilevel optimisation approach proposed by De Los Reyes, Sch\"onlieb (2013) for learning the optimal parameters in a Total Variation (TV) denoising model featuring for multiple noise distributions. In applications, the use of databases (dictionaries) allows an accurate estimation of the parameters, but reflects in high computational costs due to the size of the databases and to the nonsmooth nature of the PDE constraints. To overcome this computational barrier we propose an optimisation algorithm that by sampling dynamically from the set of constraints and using a quasi-Newton method, solves the problem accurately and in an efficient way.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.