THRESHOLDING RULES AND ITERATIVE SHRINKAGE/THRESHOLDING ALGORITHM: A CONVERGENCE STUDY
Identifieur interne : 000255 ( Hal/Curation ); précédent : 000254; suivant : 000256THRESHOLDING RULES AND ITERATIVE SHRINKAGE/THRESHOLDING ALGORITHM: A CONVERGENCE STUDY
Auteurs : Matthieu Kowalski [France]Source :
English descriptors
- mix :
Abstract
Imaging inverse problems can be formulated as an optimization problem and solved thanks to algorithms such as forward-backward or ISTA (Iterative Shrinkage/Thresholding Algorithm) for which non smooth functionals with sparsity constraints can be minimized efficiently. However, the soft thresholding operator involved in this algorithm leads to a biased estimation of large coefficients. That is why a step allowing to reduce this bias is introduced in practice. Indeed, in the statistical community, a large variety of thresholding operators have been studied to avoid the biased estimation of large coefficients; for instance, the non negative Garrote or the the SCAD thresholding. One can associate a non convex penalty to these opera-tors. We study the convergence properties of ISTA, possibly relaxed, with any thresholding rule and show that they correspond to a semi-convex penalty. The effectiveness of this approach is illustrated on image inverse problems.
Url:
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000255
Links to Exploration step
Hal:hal-01102810Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">THRESHOLDING RULES AND ITERATIVE SHRINKAGE/THRESHOLDING ALGORITHM: A CONVERGENCE STUDY</title>
<author><name sortKey="Kowalski, Matthieu" sort="Kowalski, Matthieu" uniqKey="Kowalski M" first="Matthieu" last="Kowalski">Matthieu Kowalski</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-1289" status="VALID"><orgName>Laboratoire des signaux et systèmes</orgName>
<orgName type="acronym">L2S</orgName>
<desc><address><addrLine>Plateau de Moulon 3 rue Joliot Curie 91192 GIF SUR YVETTE CEDEX</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.lss.supelec.fr/</ref>
</desc>
<listRelation><relation active="#struct-441569" type="direct"></relation>
<relation active="#struct-300812" type="direct"></relation>
<relation active="#struct-92966" type="direct"></relation>
<relation active="#struct-411575" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300812" type="direct"><org type="institution" xml:id="struct-300812" status="VALID"><orgName>SUPELEC</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-92966" type="direct"><org type="institution" xml:id="struct-92966" status="VALID"><orgName>Université Paris-Sud - Paris 11</orgName>
<orgName type="acronym">UP11</orgName>
<desc><address><addrLine>Bâtiment 300 - 91405 Orsay cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.u-psud.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-411575" type="direct"><org type="institution" xml:id="struct-411575" status="VALID"><orgName>CentraleSupélec</orgName>
<desc><address><addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.centralesupelec.fr</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-01102810</idno>
<idno type="halId">hal-01102810</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-01102810</idno>
<idno type="url">https://hal.archives-ouvertes.fr/hal-01102810</idno>
<date when="2014-10-27">2014-10-27</date>
<idno type="wicri:Area/Hal/Corpus">000255</idno>
<idno type="wicri:Area/Hal/Curation">000255</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">THRESHOLDING RULES AND ITERATIVE SHRINKAGE/THRESHOLDING ALGORITHM: A CONVERGENCE STUDY</title>
<author><name sortKey="Kowalski, Matthieu" sort="Kowalski, Matthieu" uniqKey="Kowalski M" first="Matthieu" last="Kowalski">Matthieu Kowalski</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-1289" status="VALID"><orgName>Laboratoire des signaux et systèmes</orgName>
<orgName type="acronym">L2S</orgName>
<desc><address><addrLine>Plateau de Moulon 3 rue Joliot Curie 91192 GIF SUR YVETTE CEDEX</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.lss.supelec.fr/</ref>
</desc>
<listRelation><relation active="#struct-441569" type="direct"></relation>
<relation active="#struct-300812" type="direct"></relation>
<relation active="#struct-92966" type="direct"></relation>
<relation active="#struct-411575" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300812" type="direct"><org type="institution" xml:id="struct-300812" status="VALID"><orgName>SUPELEC</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-92966" type="direct"><org type="institution" xml:id="struct-92966" status="VALID"><orgName>Université Paris-Sud - Paris 11</orgName>
<orgName type="acronym">UP11</orgName>
<desc><address><addrLine>Bâtiment 300 - 91405 Orsay cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.u-psud.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-411575" type="direct"><org type="institution" xml:id="struct-411575" status="VALID"><orgName>CentraleSupélec</orgName>
<desc><address><addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.centralesupelec.fr</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>Index Terms— Sparse approximation</term>
<term>nonnegative garrote</term>
<term>relaxed ISTA</term>
<term>semi convex optimiza-tion</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Imaging inverse problems can be formulated as an optimization problem and solved thanks to algorithms such as forward-backward or ISTA (Iterative Shrinkage/Thresholding Algorithm) for which non smooth functionals with sparsity constraints can be minimized efficiently. However, the soft thresholding operator involved in this algorithm leads to a biased estimation of large coefficients. That is why a step allowing to reduce this bias is introduced in practice. Indeed, in the statistical community, a large variety of thresholding operators have been studied to avoid the biased estimation of large coefficients; for instance, the non negative Garrote or the the SCAD thresholding. One can associate a non convex penalty to these opera-tors. We study the convergence properties of ISTA, possibly relaxed, with any thresholding rule and show that they correspond to a semi-convex penalty. The effectiveness of this approach is illustrated on image inverse problems.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">THRESHOLDING RULES AND ITERATIVE SHRINKAGE/THRESHOLDING ALGORITHM: A CONVERGENCE STUDY</title>
<author role="aut"><persName><forename type="first">Matthieu</forename>
<surname>Kowalski</surname>
</persName>
<email></email>
<idno type="idhal">mkowalski</idno>
<idno type="halauthor">622813</idno>
<affiliation ref="#struct-1289"></affiliation>
</author>
<editor role="depositor"><persName><forename>Matthieu</forename>
<surname>Kowalski</surname>
</persName>
<email>matthieu.kowalski@l2s.centralesupelec.fr</email>
</editor>
<funder>FMJH Program Gaspard Monge in optimization and operation research, and from the support to this program from EDF.</funder>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2015-01-13 15:21:40</date>
<date type="whenModified">2016-03-22 01:25:31</date>
<date type="whenReleased">2015-01-13 15:49:21</date>
<date type="whenProduced">2014-10-27</date>
<date type="whenEndEmbargoed">2015-01-13</date>
<ref type="file" target="https://hal.archives-ouvertes.fr/hal-01102810/document"><date notBefore="2015-01-13"></date>
</ref>
<ref type="file" subtype="author" n="1" target="https://hal.archives-ouvertes.fr/hal-01102810/file/MK_icip14_rev.pdf"><date notBefore="2015-01-13"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="124078"><persName><forename>Matthieu</forename>
<surname>Kowalski</surname>
</persName>
<email>matthieu.kowalski@l2s.centralesupelec.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">hal-01102810</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-01102810</idno>
<idno type="halBibtex">kowalski:hal-01102810</idno>
<idno type="halRefHtml">International Conference on Image Processing (ICIP) 2014, Oct 2014, La Défense, Paris, France</idno>
<idno type="halRef">International Conference on Image Processing (ICIP) 2014, Oct 2014, La Défense, Paris, France</idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="SUPELEC">SUPELEC</idno>
<idno type="stamp" n="SUP_LSS" p="CENTRALESUPELEC">Laboratoire des Signaux et Systèmes</idno>
<idno type="stamp" n="SUP_SIGNAUX" p="CENTRALESUPELEC">Pôle Signaux</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INSMI">CNRS-INSMI - INstitut des Sciences Mathématiques et de leurs Interactions</idno>
<idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
<idno type="stamp" n="L2S">Laboratoire des signaux et systèmes</idno>
<idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="invited" n="1">Yes</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">THRESHOLDING RULES AND ITERATIVE SHRINKAGE/THRESHOLDING ALGORITHM: A CONVERGENCE STUDY</title>
<author role="aut"><persName><forename type="first">Matthieu</forename>
<surname>Kowalski</surname>
</persName>
<idno type="idHal">mkowalski</idno>
<idno type="halAuthorId">622813</idno>
<affiliation ref="#struct-1289"></affiliation>
</author>
</analytic>
<monogr><meeting><title>International Conference on Image Processing (ICIP) 2014</title>
<date type="start">2014-10-27</date>
<date type="end">2014-10-30</date>
<settlement>La Défense, Paris</settlement>
<country key="FR">France</country>
</meeting>
<imprint></imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="en">relaxed ISTA</term>
<term xml:lang="en">nonnegative garrote</term>
<term xml:lang="en">Index Terms— Sparse approximation</term>
<term xml:lang="en">semi convex optimiza-tion</term>
</keywords>
<classCode scheme="halDomain" n="info.info-ts">Computer Science [cs]/Signal and Image Processing</classCode>
<classCode scheme="halDomain" n="math.math-oc">Mathematics [math]/Optimization and Control [math.OC]</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">Imaging inverse problems can be formulated as an optimization problem and solved thanks to algorithms such as forward-backward or ISTA (Iterative Shrinkage/Thresholding Algorithm) for which non smooth functionals with sparsity constraints can be minimized efficiently. However, the soft thresholding operator involved in this algorithm leads to a biased estimation of large coefficients. That is why a step allowing to reduce this bias is introduced in practice. Indeed, in the statistical community, a large variety of thresholding operators have been studied to avoid the biased estimation of large coefficients; for instance, the non negative Garrote or the the SCAD thresholding. One can associate a non convex penalty to these opera-tors. We study the convergence properties of ISTA, possibly relaxed, with any thresholding rule and show that they correspond to a semi-convex penalty. The effectiveness of this approach is illustrated on image inverse problems.</abstract>
</profileDesc>
</hal>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/OperaV1/Data/Hal/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000255 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Curation/biblio.hfd -nk 000255 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Musique |area= OperaV1 |flux= Hal |étape= Curation |type= RBID |clé= Hal:hal-01102810 |texte= THRESHOLDING RULES AND ITERATIVE SHRINKAGE/THRESHOLDING ALGORITHM: A CONVERGENCE STUDY }}
![]() | This area was generated with Dilib version V0.6.21. | ![]() |