GLORIA

GEOMAR Library Ocean Research Information Access

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 5 (1993), S. 407-417 
    ISSN: 1572-9265
    Keywords: Least absolute deviations ; robust regression ; smoothing and regression splines ; thin plate splines ; radial basis functions ; cross validation ; nonparametric estimation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We propose an algorithm for the computation ofL 1 (LAD) smoothing splines in the spacesW M (D), with $$[0, 1]^n \subseteq D$$ . We assume one is given data of the formy i =(f(t i ) +ε i , i=1,...,N with {itti} i=1 N ⊂D , theε i are errors withE(ε i )=0, andf is assumed to be inW M . The LAD smoothing spline, for fixed smoothing parameterλ⩾0, is defined as the solution,s λ, of the optimization problem $$\min _{g \in W_M }$$ (1/N)∑ i=1 N ¦y i −g(t i ¦+λJ M (g), whereJ M (g) is the seminorm consisting of the sum of the squaredL 2 norms of theMth partial derivatives ofg. Such an LAD smoothing spline,s λ, would be expected to give robust smoothed estimates off in situations where theε i are from a distribution with heavy tails. The solution to such a problem is a “thin plate spline” of known form. An algorithm for computings λ is given which is based on considering a sequence of quadratic programming problems whose structure is guided by the optimality conditions for the above convex minimization problem, and which are solved readily, if a good initial point is available. The “data driven” selection of the smoothing parameter is achieved by minimizing aCV(λ) score of the form $$(1/N)[\sum\nolimits_{i = 1}^N {\left| {y_i - s_\lambda (t_i )} \right| + \sum\nolimits_{res_i = 0} 1 } ]$$ .The combined LAD-CV smoothing spline algorithm is a continuation scheme in λ↘0 taken on the above SQPs parametrized inλ, with the optimal smoothing parameter taken to be that value ofλ at which theCV(λ) score first begins to increase. The feasibility of constructing the LAD-CV smoothing spline is illustrated by an application to a problem in environment data interpretation.
    Type of Medium: Electronic Resource
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...