Martin Lotz

Martin Lotz

Auto-generated profile, based on publicly available information

Martin Lotz

University of Warwick

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 March 2020 in Foundations of Computational Mathematics
Verified
Journal Article
Open access
PDF file
MLMartin Lotz
Martin Lotz
VNVanni Noferini
Vanni Noferini
We propose a new approach to the theory of conditioning for numerical analysis problems for which both classical and stochastic perturbation theories fail to predict the observed accuracy of computed solutions. To motivate our ideas, we present examples of problems that are discontinuous at a given input and even have infinite stochastic condition number, but where the solution is still computed to machine precision without relying on structured algorithms. Stimulated by the failure of classical and stochastic perturbation theory in capturing such phenomena, we define and analyse a weak worst-case and a weak stochastic condition number. This new theory is a more powerful predictor of the accuracy of computations than existing tools, especially when the worst-case and the expected sensitivity of a problem to perturbations of the input is not finite. We apply our analysis to the computation of simple eigenvalues of matrix polynomials, including the more difficult case of singular matrix polynomials. In addition, we show how the weak condition numbers can be estimated in practice.

8 June 2020 in British Journal of Dermatology
Verified
Journal Article
Open access
PDF file
MLM. Lotz
M. Lotz
TBT. Budden
T. Budden
Simon FurneySimon Furney
Simon Furney
AVA. Virós
A. Virós
SummaryBackground. Many cancer types display sex and age disparity in incidence and outcome. The mutational load of tumours, including melanoma, varies accordin

4 June 2019 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
SDSajad Daei
Sajad Daei
FHFarzan Haddadi
Farzan Haddadi
AAArash Amini
Arash Amini
MLMartin Lotz
Martin Lotz
Evaluating the statistical dimension is a common tool to determine the asymptotic phase transition in compressed sensing problems with Gaussian ensemble. Unfortunately, the exact evaluation of the statistical dimension is very difficult and it has become standard to replace it with an upper-bound. To ensure that this technique is suitable, [1] has introduced an upper-bound on the gap between the statistical dimension and its approximation. In this work, we first show that the error bound in [1] in some low-dimensional models such as total variation and ℓ1 analysis minimization becomes poorly large. Next, we develop a new error bound which significantly improves the estimation gap compared to [1]. In particular, unlike the bound in [1] that fails in some settings with overcomplete dictionaries, our bound exhibits a decaying behavior in such cases.

2 October 2019 in Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
Verified
Journal Article
Open access
MLMartin Lotz
Martin Lotz
We show that recent results on randomized dimension reduction schemes that exploit structural properties of data can be applied in the context of persistent homology. In the spirit of compressed sensing, the dimension reduction is determined by the Gaussian width of a structure associated with the dataset, rather than its size, and such a reduction can be computed efficiently. We further relate the Gaussian width to the doubling dimension of a finite metric space, which appears in the study of the complexity of other methods for approximating persistent homology. We can, therefore, literally replace the ambient dimension by an intrinsic notion of dimension related to the structure of the data.

10 January 2020 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
DADennis Amelunxen
Dennis Amelunxen
MLMartin Lotz
Martin Lotz
JWJake Walvin
Jake Walvin
We derive bounds relating Renegar’s condition number to quantities that govern the statistical performance of convex regularization in settings that include the ℓ1-analysis setting. Using results from conic integral geometry, we show that the bounds can be made to depend only on a random projection, or restriction, of the analysis operator to a lower dimensional space, and can still be effective if these operators are ill-conditioned. As an application, we get new bounds for the undersampling phase transition of composite convex regularizers. Key tools in the analysis are Slepian’s inequality and the kinematic formula from integral geometry.

19 October 2021 in Journal of Applied and Computational Topology
Verified
Journal Article
Open access
PDF file
SAShreya Arya
Shreya Arya
JBJean-Daniel Boissonnat
Jean-Daniel Boissonnat
KDKunal Dutta
Kunal Dutta
MLMartin Lotz
Martin Lotz
Given a set P of n points and a constant k, we are interested in computing the persistent homology of the Čech filtration of P for the k-distance, and investigate the effectiveness of dimensionality reduction for this problem, answering an open question of Sheehy (The persistent homology of distance functions under random projection. In Cheng, Devillers (eds), 30th Annual Symposium on Computational Geometry, SOCG’14, Kyoto, Japan, June 08–11, p 328, ACM, 2014). We show that any linear transformation that preserves pairwise distances up to a $$(1\pm {\varepsilon })$$ ( 1 ± ε ) multiplicative factor, must preserve the persistent homology of the Čech filtration up to a factor of $$(1-{\varepsilon })^{-1}$$ ( 1 - ε ) - 1 . Our results also show that the Vietoris-Rips and Delaunay filtrations for the k-distance, as well as the Čech filtration for the approximate k-distance of Buchet et al. [J Comput Geom, 58:70–96, 2016] are preserved up to a $$(1\pm {\varepsilon })$$ ( 1 ± ε ) factor. We also prove extensions of our main theorem, for point sets (i) lying in a region of bounded Gaussian width or (ii) on a low-dimensional submanifold, obtaining embeddings having the dimension bounds of Lotz (Proc R Soc A Math Phys Eng Sci, 475(2230):20190081, 2019) and Clarkson (Tighter bounds for random projections of manifolds. In Teillaud (ed) Proceedings of the 24th ACM Symposium on Computational Geom- etry, College Park, MD, USA, June 9–11, pp 39–48, ACM, 2008) respectively. Our results also work in the terminal dimensionality reduction setting, where the distance of any point in the original ambient space, to any point in P, needs to be approximately preserved.