Christine De Mol
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Christine De Mol has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- A. Custo
INFM and DISI, Università di Genova, via Dodecaneso 33, 16146 Genova, Italy
1 shared publication - Alessandro Verri
DISI, Università degli Studi di Genova, Genova, Italy
1 shared publication - Ernesto De Vito
Dipartimento di Matematica Università di Genova Via Dodecaneso 35 Genova Italy
1 shared publication - Ingrid Daubechies
Department of Mathematics and Program in Applied and Computational Mathematics Princeton University 08544
1 shared publication - Ingrid Daubechies
Duke University
1 shared publication - Lorenzo Rosasco
Malga -DIBRIS University of Genova IT
1 shared publication
Latest Publications
- 5 August 2016
- Published by IOP Publishing in Inverse Problems
- Vol. 32 (10) , 104001
Sparsity-enforcing regularisation and ISTA revisited
About two decades ago, the concept of sparsity emerged in different disciplines such as statistics, imaging, signal processing and inverse problems, and proved to be useful for several applications. Sparsity-enforcing constraints or penalties were then shown to provide a viable alternative to the usual quadratic ones for the regularisation of ill-posed problems. To compute the corresponding regularised solutions, a simple, iterative and provably convergent algorithm was proposed and later on referred to as the iterative soft-thresholding algorithm. This paper provides a brief review of these early results as well as that of the subsequent literature, albeit from the authors’ limited perspective. It also presents the previously unpublished proof of an extension of the original framework.
- 5 August 2016
- Published by IOP Publishing in Inverse Problems
- Vol. 32 (10) , 104001
Sparsity-enforcing regularisation and ISTA revisited
About two decades ago, the concept of sparsity emerged in different disciplines such as statistics, imaging, signal processing and inverse problems, and proved to be useful for several applications. Sparsity-enforcing constraints or penalties were then shown to provide a viable alternative to the usual quadratic ones for the regularisation of ill-posed problems. To compute the corresponding regularised solutions, a simple, iterative and provably convergent algorithm was proposed and later on referred to as the iterative soft-thresholding algorithm. This paper provides a brief review of these early results as well as that of the subsequent literature, albeit from the authors’ limited perspective. It also presents the previously unpublished proof of an extension of the original framework.
- Open Access
- 14 October 2013
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 464 (1) , 012003
Regularized Blind Deconvolution with Poisson Data
We propose easy-to-implement algorithms to perform blind deconvolution of nonnegative images in the presence of noise of Poisson type. Alternate minimization of a regularized Kullback-Leibler cost function is achieved via multiplicative update rules. The scheme allows to prove convergence of the iterates to a stationary point of the cost function. Numerical examples are reported to demonstrate the feasibility of the proposed method.
- 14 October 2013
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 464 (1) , 012003
Open AccessRegularized Blind Deconvolution with Poisson Data
We propose easy-to-implement algorithms to perform blind deconvolution of nonnegative images in the presence of noise of Poisson type. Alternate minimization of a regularized Kullback-Leibler cost function is achieved via multiplicative update rules. The scheme allows to prove convergence of the iterates to a stationary point of the cost function. Numerical examples are reported to demonstrate the feasibility of the proposed method.
- Open Access
A Regularized Method for Selecting Nested Groups of Relevant Genes from Microarray Data
Gene expression analysis aims at identifying the genes able to accurately predict biological parameters like, for example, disease subtyping or progression. While accurate prediction can be achieved by means of many different techniques, gene identification, due to gene correlation and the limited number of available samples, is a much more elusive problem. Small changes in the expression values often produce different gene lists, and solutions which are both sparse and stable are difficult to obtain. We propose a two-stage regularization method able to learn linear models characterized by a high prediction performance. By varying a suitable parameter these linear models allow to trade sparsity for the inclusion of correlated genes and to produce gene lists which are almost perfectly nested. Experimental results on synthetic and microarray data confirm the interesting properties of the proposed method and its potential as a starting point for further biological investigations
Open AccessA Regularized Method for Selecting Nested Groups of Relevant Genes from Microarray Data
Gene expression analysis aims at identifying the genes able to accurately predict biological parameters like, for example, disease subtyping or progression. While accurate prediction can be achieved by means of many different techniques, gene identification, due to gene correlation and the limited number of available samples, is a much more elusive problem. Small changes in the expression values often produce different gene lists, and solutions which are both sparse and stable are difficult to obtain. We propose a two-stage regularization method able to learn linear models characterized by a high prediction performance. By varying a suitable parameter these linear models allow to trade sparsity for the inclusion of correlated genes and to produce gene lists which are almost perfectly nested. Experimental results on synthetic and microarray data confirm the interesting properties of the proposed method and its potential as a starting point for further biological investigations
- Open Access
Elastic-Net Regularization in Learning Theory
Within the framework of statistical learning theory we analyze in detail the so-called elastic-net regularization scheme proposed by Zou and Hastie for the selection of groups of correlated variables. To investigate on the statistical properties of this scheme and in particular on its consistency properties, we set up a suitable mathematical framework. Our setting is random-design regression where we allow the response variable to be vector-valued and we consider prediction functions which are linear combination of elements ({\em features}) in an infinite-dimensional dictionary. Under the assumption that the regression function admits a sparse representation on the dictionary, we prove that there exists a particular ``{\em elastic-net representation}'' of the regression function such that, if the number of data increases, the elastic-net estimator is consistent not only for prediction but also for variable/feature selection. Our results include finite-sample bounds and an adaptive scheme to select the regularization parameter. Moreover, using convex analysis tools, we derive an iterative thresholding algorithm for computing the elastic-net solution which is different from the optimization procedure originally proposed by Zou and HastieOpen AccessElastic-Net Regularization in Learning Theory
Within the framework of statistical learning theory we analyze in detail the so-called elastic-net regularization scheme proposed by Zou and Hastie for the selection of groups of correlated variables. To investigate on the statistical properties of this scheme and in particular on its consistency properties, we set up a suitable mathematical framework. Our setting is random-design regression where we allow the response variable to be vector-valued and we consider prediction functions which are linear combination of elements ({\em features}) in an infinite-dimensional dictionary. Under the assumption that the regression function admits a sparse representation on the dictionary, we prove that there exists a particular ``{\em elastic-net representation}'' of the regression function such that, if the number of data increases, the elastic-net estimator is consistent not only for prediction but also for variable/feature selection. Our results include finite-sample bounds and an adaptive scheme to select the regularization parameter. Moreover, using convex analysis tools, we derive an iterative thresholding algorithm for computing the elastic-net solution which is different from the optimization procedure originally proposed by Zou and Hastie - Top Cited Papers
- 26 August 2004
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 57 (11) , 1413-1457
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
We consider linear inverse problems where the solution is assumed to have a sparse expansion on an arbitrary preassigned orthonormal basis. We prove that replacing the usual quadratic regularizing penalties by weighted 𝓁p‐penalties on the coefficients of such expansions, with 1 ≤p≤ 2, still regularizes the problem. Use of such 𝓁p‐penalized problems withp< 2 is often advocated when one expects the underlying ideal noiseless solution to have a sparse expansion with respect to the basis under consideration. To compute the corresponding regularized solutions, we analyze an iterative algorithm that amounts to a Landweber iteration with thresholding (or nonlinear shrinkage) applied at each iteration step. We prove that this algorithm converges in norm.
- 26 August 2004
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 57 (11) , 1413-1457
Top Cited PapersAn iterative thresholding algorithm for linear inverse problems with a sparsity constraint
We consider linear inverse problems where the solution is assumed to have a sparse expansion on an arbitrary preassigned orthonormal basis. We prove that replacing the usual quadratic regularizing penalties by weighted 𝓁p‐penalties on the coefficients of such expansions, with 1 ≤p≤ 2, still regularizes the problem. Use of such 𝓁p‐penalized problems withp< 2 is often advocated when one expects the underlying ideal noiseless solution to have a sparse expansion with respect to the basis under consideration. To compute the corresponding regularized solutions, we analyze an iterative algorithm that amounts to a Landweber iteration with thresholding (or nonlinear shrinkage) applied at each iteration step. We prove that this algorithm converges in norm.
- Open Access
- 1 August 2003
- Published by EDP Sciences in Astronomy & Astrophysics
- Vol. 406 (2) , 765-772
A Fourier-based method for the restoration of chopped and nodded images
Astronomy & Astrophysics (A&A) is an international journal which publishes papers on all aspects of astronomy and astrophysics
- 1 August 2003
- Published by EDP Sciences in Astronomy & Astrophysics
- Vol. 406 (2) , 765-772
Open AccessA Fourier-based method for the restoration of chopped and nodded images
Astronomy & Astrophysics (A&A) is an international journal which publishes papers on all aspects of astronomy and astrophysics