CORRECTING DATA CORRUPTION ERRORS FOR MULTIVARIATE FUNCTION APPROXIMATION

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 56
  • Download : 0
We discuss the problem of constructing an accurate function approximation when data are corrupted by unexpected errors. The unexpected corruption errors are different from the standard observational noise in the sense that they can have much larger magnitude and in most cases are sparse. By focusing on overdetermined case, we prove that the sparse corruption errors can be effectively eliminated by using l(1)-minimization, also known as the least absolute deviations method. In particular, we establish probabilistic error bounds of the l(1)-minimization solution with the corrupted data. Both the lower bound and the upper bound are related only to the errors of the l(1) and l(2)-minimization solutions with respect to the uncorrupted data and the sparsity of the corruption errors. This ensures that the l(1)-minimization solution with the corrupted data are close to the regression results with uncorrupted data, thus effectively eliminating the corruption errors. Several numerical examples are presented to verify the theoretical finding.
Publisher
SIAM PUBLICATIONS
Issue Date
2016
Language
English
Article Type
Article
Citation

SIAM JOURNAL ON SCIENTIFIC COMPUTING, v.38, no.4, pp.A2492 - A2511

ISSN
1064-8275
DOI
10.1137/16M1059473
URI
http://hdl.handle.net/10203/297257
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0