Valeriya Naumova
Valeriya Naumova has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Markus Grasmair
Department of Mathematical Sciences, Norwegian University of Science and Technology, Trondheim, Norway
6 shared publications - Zeljko Kereta
Computer Science Department, University College London, Camden, London, United Kingdom
5 shared publications - Ernesto De Vito
Dipartimento di Matematica Università di Genova Via Dodecaneso 35 Genova Italy
3 shared publications - Timo Klock
Department of Numerical Analysis and Scientific Computing Simula Research Laboratory Oslo Norway
3 shared publications - Ahmed Elmokashfi
Simula Metropolitan Center for Digital Engineering, Oslo, Norway
2 shared publications - Johannes Maly
Department of Mathematics, LMU Munich, Munich, Germany
2 shared publications
Latest Publications
- 25 February 2023
- Published by Springer Nature
- p. 943-967
Multi-parameter Approaches in Image Processing
- 25 February 2023
- Published by Springer Nature
- p. 943-967
Multi-parameter Approaches in Image Processing
- Open Access
- 16 November 2022
- Published by Springer Nature in BMC Bioinformatics
- Vol. 23 (S12) , 1-15
Matrix factorization for the reconstruction of cervical cancer screening histories and prediction of future screening results
Background: Mass screening programs for cervical cancer prevention in the Nordic countries have strongly reduced cancer incidence and mortality at the population level. An alternative to the current mass screening is a more personalised screening strategy adapting the recommendations to each individual. However, this necessitates reliable risk prediction models accounting for disease dynamics and individual data. Herein we propose a novel matrix factorisation framework to classify females by the time-varying risk of being diagnosed with cervical cancer. We cast the problem as a time-series prediction model where the data from females in the Norwegian screening population are represented as sparse vectors in time and then combined into a single matrix. Using novel temporal regularisation and discrepancy terms for the cervical cancer screening context, we reconstruct complete screening profiles from this scarce matrix and use these to predict the next exam results indicating the risk of cervical cancer. The algorithm is validated on both synthetic and registry screening data by measuring the probability of agreement (PoA) between Kaplan-Meier estimates. Results: In numerical experiments on synthetic data, we demonstrate that the novel regularisation and discrepancy term can improve the data reconstruction ability as well as prediction performance over varying data scarcity. Using a hold-out set of screening data, we compare several numerical models and find that the proposed framework attains the strongest PoA. We observe strong correlations between the empirical survival curves from our method and the hold-out data, and evaluate the ability of our framework to predict the females’ next results for up to five years ahead in time using only their current screening histories as input. Conclusions: We have proposed a matrix factorization model for predicting future screening results and evaluated its performance in a female cohort to demonstrate the potential for developing prediction models for more personalized cervical cancer screening.
- 16 November 2022
- Published by Springer Nature in BMC Bioinformatics
- Vol. 23 (S12) , 1-15
Open AccessMatrix factorization for the reconstruction of cervical cancer screening histories and prediction of future screening results
Background: Mass screening programs for cervical cancer prevention in the Nordic countries have strongly reduced cancer incidence and mortality at the population level. An alternative to the current mass screening is a more personalised screening strategy adapting the recommendations to each individual. However, this necessitates reliable risk prediction models accounting for disease dynamics and individual data. Herein we propose a novel matrix factorisation framework to classify females by the time-varying risk of being diagnosed with cervical cancer. We cast the problem as a time-series prediction model where the data from females in the Norwegian screening population are represented as sparse vectors in time and then combined into a single matrix. Using novel temporal regularisation and discrepancy terms for the cervical cancer screening context, we reconstruct complete screening profiles from this scarce matrix and use these to predict the next exam results indicating the risk of cervical cancer. The algorithm is validated on both synthetic and registry screening data by measuring the probability of agreement (PoA) between Kaplan-Meier estimates. Results: In numerical experiments on synthetic data, we demonstrate that the novel regularisation and discrepancy term can improve the data reconstruction ability as well as prediction performance over varying data scarcity. Using a hold-out set of screening data, we compare several numerical models and find that the proposed framework attains the strongest PoA. We observe strong correlations between the empirical survival curves from our method and the hold-out data, and evaluate the ability of our framework to predict the females’ next results for up to five years ahead in time using only their current screening histories as input. Conclusions: We have proposed a matrix factorization model for predicting future screening results and evaluated its performance in a female cohort to demonstrate the potential for developing prediction models for more personalized cervical cancer screening.
- Open Access
- 18 June 2022
- Published by Springer Nature
- p. 99-120
Chapter 6 Digital tracing, validation, and reporting
Manual contact tracing has been a key component in controlling the outbreak of the COVID-19 pandemic. The identification and isolation of close contacts of confirmed cases have successfully interrupted transmission chains and reduced the disease spread. Even though manual contact tracing has been widely used, its practice has shown that it is slow and cannot be scaled up once the epidemic grows beyond the early phase. In this case, digital contact tracing can play a significant role in controlling the pandemic. In this chapter, based on our experience and lessons learned from the Smittestopp project, we discuss the main prerequisites for the efficient implementation and validation of digital contact tracing in a population. Specifically, we discuss how to translate a close contact defined for manual tracing to proximity events discovered by a phone, that is, how to define a meaningful risk score and validate the digital contact tracing. We discuss challenges related to each step and provide solutions to some of them, even though questions still remain.
- 18 June 2022
- Published by Springer Nature
- p. 99-120
Open AccessChapter 6 Digital tracing, validation, and reporting
Manual contact tracing has been a key component in controlling the outbreak of the COVID-19 pandemic. The identification and isolation of close contacts of confirmed cases have successfully interrupted transmission chains and reduced the disease spread. Even though manual contact tracing has been widely used, its practice has shown that it is slow and cannot be scaled up once the epidemic grows beyond the early phase. In this case, digital contact tracing can play a significant role in controlling the pandemic. In this chapter, based on our experience and lessons learned from the Smittestopp project, we discuss the main prerequisites for the efficient implementation and validation of digital contact tracing in a population. Specifically, we discuss how to translate a close contact defined for manual tracing to proximity events discovered by a phone, that is, how to define a meaningful risk score and validate the digital contact tracing. We discuss challenges related to each step and provide solutions to some of them, even though questions still remain.
- Open Access
- 18 June 2022
- Published by Springer Nature
- p. 1-9
Chapter 1 Introduction
In the early months of 2020, a new virus began to spread in societies around the world. This virus, named SARS-CoV-2 or simply coronavirus, caused a disease called COVID-19 that had a deadly outcome in a disturbingly high fraction of cases. The elderly and those with an underlying chronic disease seemed to be particularly vulnerable [3]. Some months into 2020, the disease was classified as a global pandemic.
- 18 June 2022
- Published by Springer Nature
- p. 1-9
Open AccessChapter 1 Introduction
In the early months of 2020, a new virus began to spread in societies around the world. This virus, named SARS-CoV-2 or simply coronavirus, caused a disease called COVID-19 that had a deadly outcome in a disturbingly high fraction of cases. The elderly and those with an underlying chronic disease seemed to be particularly vulnerable [3]. Some months into 2020, the disease was classified as a global pandemic.
- 11 February 2022
- Published by Springer Nature
- p. 1-25
Multiparameter Approaches in Image Processing
- Open Access
- 16 April 2021
- Published by Springer Nature in Journal of Fourier Analysis and Applications
- Vol. 27 (2) , 1-39
Construction and Monte Carlo Estimation of Wavelet Frames Generated by a Reproducing Kernel
We introduce a construction of multiscale tight frames on general domains. The frame elements are obtained by spectral filtering of the integral operator associated with a reproducing kernel. Our construction extends classical wavelets as well as generalized wavelets on both continuous and discrete non-Euclidean structures such as Riemannian manifolds and weighted graphs. Moreover, it allows to study the relation between continuous and discrete frames in a random sampling regime, where discrete frames can be seen as Monte Carlo estimates of the continuous ones. Pairing spectral regularization with learning theory, we show that a sample frame tends to its population counterpart, and derive explicit finite-sample rates on spaces of Sobolev and Besov regularity. Our results prove the stability of frames constructed on empirical data, in the sense that all stochastic discretizations have the same underlying limit regardless of the set of initial training samples.
- 16 April 2021
- Published by Springer Nature in Journal of Fourier Analysis and Applications
- Vol. 27 (2) , 1-39
Open AccessConstruction and Monte Carlo Estimation of Wavelet Frames Generated by a Reproducing Kernel
We introduce a construction of multiscale tight frames on general domains. The frame elements are obtained by spectral filtering of the integral operator associated with a reproducing kernel. Our construction extends classical wavelets as well as generalized wavelets on both continuous and discrete non-Euclidean structures such as Riemannian manifolds and weighted graphs. Moreover, it allows to study the relation between continuous and discrete frames in a random sampling regime, where discrete frames can be seen as Monte Carlo estimates of the continuous ones. Pairing spectral regularization with learning theory, we show that a sample frame tends to its population counterpart, and derive explicit finite-sample rates on spaces of Sobolev and Besov regularity. Our results prove the stability of frames constructed on empirical data, in the sense that all stochastic discretizations have the same underlying limit regardless of the set of initial training samples.
- Open Access
- 19 January 2021
- Published by IOP Publishing in Inverse Problems
- Vol. 37 (5) , 055008
Computational approaches to non-convex, sparsity-inducing multi-penalty regularization
In this work we consider numerical efficiency and convergence rates for solvers of non-convex multi-penalty formulations when reconstructing sparse signals from noisy linear measurements. We extend an existing approach, based on reduction to an augmented single-penalty formulation, to the non-convex setting and discuss its computational intractability in large-scale applications. To circumvent this limitation, we propose an alternative single-penalty reduction based on infimal convolution that shares the benefits of the augmented approach but is computationally less dependent on the problem size. We provide linear convergence rates for both approaches, and their dependence on design parameters. Numerical experiments substantiate our theoretical findings.
- 19 January 2021
- Published by IOP Publishing in Inverse Problems
- Vol. 37 (5) , 055008
Open AccessComputational approaches to non-convex, sparsity-inducing multi-penalty regularization
In this work we consider numerical efficiency and convergence rates for solvers of non-convex multi-penalty formulations when reconstructing sparse signals from noisy linear measurements. We extend an existing approach, based on reduction to an augmented single-penalty formulation, to the non-convex setting and discuss its computational intractability in large-scale applications. To circumvent this limitation, we propose an alternative single-penalty reduction based on infimal convolution that shares the benefits of the augmented approach but is computationally less dependent on the problem size. We provide linear convergence rates for both approaches, and their dependence on design parameters. Numerical experiments substantiate our theoretical findings.
- Open Access
Computational approaches to non-convex, sparsity-inducing multi-penalty regularization
In this work we consider numerical efficiency and convergence rates for solvers of non-convex multi-penalty formulations when reconstructing sparse signals from noisy linear measurements. We extend an existing approach, based on reduction to an augmented single-penalty formulation, to the non-convex setting and discuss its computational intractability in large-scale applications. To circumvent this limitation, we propose an alternative single-penalty reduction based on infimal convolution that shares the benefits of the augmented approach but is computationally less dependent on the problem size. We provide linear convergence rates for both approaches, and their dependence on design parameters. Numerical experiments substantiate our theoretical findings.
Open AccessComputational approaches to non-convex, sparsity-inducing multi-penalty regularization
In this work we consider numerical efficiency and convergence rates for solvers of non-convex multi-penalty formulations when reconstructing sparse signals from noisy linear measurements. We extend an existing approach, based on reduction to an augmented single-penalty formulation, to the non-convex setting and discuss its computational intractability in large-scale applications. To circumvent this limitation, we propose an alternative single-penalty reduction based on infimal convolution that shares the benefits of the augmented approach but is computationally less dependent on the problem size. We provide linear convergence rates for both approaches, and their dependence on design parameters. Numerical experiments substantiate our theoretical findings.
- Open Access
Nonlinear generalization of the monotone single index model
Single index model is a powerful yet simple model, widely used in statistics, machine learning, and other scientific fields. It models the regression function as $g()$, where a is an unknown index vector and x are the features. This paper deals with a nonlinear generalization of this framework to allow for a regressor that uses multiple index vectors, adapting to local changes in the responses. To do so we exploit the conditional distribution over function-driven partitions, and use linear regression to locally estimate index vectors. We then regress by applying a kNN type estimator that uses a localized proxy of the geodesic metric. We present theoretical guarantees for estimation of local index vectors and out-of-sample prediction, and demonstrate the performance of our method with experiments on synthetic and real-world data sets, comparing it with state-of-the-art methods.Open AccessNonlinear generalization of the monotone single index model
Single index model is a powerful yet simple model, widely used in statistics, machine learning, and other scientific fields. It models the regression function as $g()$, where a is an unknown index vector and x are the features. This paper deals with a nonlinear generalization of this framework to allow for a regressor that uses multiple index vectors, adapting to local changes in the responses. To do so we exploit the conditional distribution over function-driven partitions, and use linear regression to locally estimate index vectors. We then regress by applying a kNN type estimator that uses a localized proxy of the geodesic metric. We present theoretical guarantees for estimation of local index vectors and out-of-sample prediction, and demonstrate the performance of our method with experiments on synthetic and real-world data sets, comparing it with state-of-the-art methods. - Open Access
Unsupervised parameter selection for denoising with the elastic net
Despite recent advances in regularisation theory, the issue of parameter selection still remains a challenge for most applications. In a recent work the framework of statistical learning was used to approximate the optimal Tikhonov regularisation parameter from noisy data. In this work, we improve their results and extend the analysis to the elastic net regularisation, providing explicit error bounds on the accuracy of the approximated parameter and the corresponding regularisation solution in a simplified case. Furthermore, in the general case we design a data-driven, automated algorithm for the computation of an approximate regularisation parameter. Our analysis combines statistical learning theory with insights from regularisation theory. We compare our approach with state-of-the-art parameter selection criteria and illustrate its superiority in terms of accuracy and computational time on simulated and real data sets.
Open AccessUnsupervised parameter selection for denoising with the elastic net
Despite recent advances in regularisation theory, the issue of parameter selection still remains a challenge for most applications. In a recent work the framework of statistical learning was used to approximate the optimal Tikhonov regularisation parameter from noisy data. In this work, we improve their results and extend the analysis to the elastic net regularisation, providing explicit error bounds on the accuracy of the approximated parameter and the corresponding regularisation solution in a simplified case. Furthermore, in the general case we design a data-driven, automated algorithm for the computation of an approximate regularisation parameter. Our analysis combines statistical learning theory with insights from regularisation theory. We compare our approach with state-of-the-art parameter selection criteria and illustrate its superiority in terms of accuracy and computational time on simulated and real data sets.