Related papers: An unexpected application of minimization theory t…
This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…
Robust Optimization is becoming increasingly important in machine learning applications. This paper studies the problem of robust submodular minimization subject to combinatorial constraints. Constrained Submodular Minimization arises in…
Decomposition, statically dividing a program into multiple units, is a common programming technique for realizing parallelism and refining programs. The decomposition of a sequential program into components is tedious, due to the…
We study the approximation of general multiobjective optimization problems with the help of scalarizations. Existing results state that multiobjective minimization problems can be approximated well by norm-based scalarizations. However, for…
We develop a theory of modulus sheaves with transfers, which generalizes Voevodsky's theory of sheaves with transfers. This paper and its sequel are foundational for the theory of motives with modulus, which is developed in [KMSY20].
Decomposable ordered structures were introduced in \cite{OnSt} to develop a general framework to study `finite-dimensional' totally ordered structures. This paper continues this work to include decomposable structures on which a ordered…
Computation of the interleaving distance between persistence modules is a central task in topological data analysis. For $1$-parameter persistence modules, thanks to the isometry theorem, this can be done by computing the bottleneck…
The general aim of this paper is to supply a method to decide whether a discrete system decoheres or not, and under what conditions decoherence occurs, with no need of appealing to computer simulations to obtain the time evolution of the…
A modular method was suggested before to recover a band limited signal from the sample and hold and linearly interpolated (or, in general, an nth-order-hold) version of the regular samples. In this paper a novel approach for compensating…
Multivariate information decompositions hold promise to yield insight into complex systems, and stand out for their ability to identify synergistic phenomena. However, the adoption of these approaches has been hindered by there being…
In the context of complex algebraic varieties, the decomposition theorem for semi-small maps provides a decomposition of the direct image of the constant sheaf. In this work, we develop a decomposition theorem for branched coverings of…
The aim of these notes is to demonstrate the potential for ideas in machine learning to impact on the fields of inverse problems and data assimilation. The perspective is one that is primarily aimed at researchers from inverse problems…
The article $-$ part of a larger thesis which aims to give a detailed description of the generalisation to the category of groups with operators of the classical theory of semisimplicity for modules $-$ presents a straightforward…
Nearly all practical applications of the theory of characteristic modes (CMs) involve the use of computational tools. Here in Paper 2 of this Series on CMs, we review the general transformations that move CMs from a continuous theoretical…
We propose a novel modular debiasing technique applicable to any discrete random source, addressing the fundamental challenge of reliably extracting high-quality randomness from inherently imperfect physical processes. The method involves…
In this paper we present the novel qualities of entanglement of formation for general (so also infinite dimensional) quantum systems. A major benefit of our presentation is a rigorous description of entanglement of formation. In particular,…
We propose a method to reduce the computational effort to solve a partial differential equation on a given domain. The main idea is to split the domain of interest in two subdomains, and to use different approximation methods in each of the…
Recognising that real-world optimisation problems have multiple interdependent components can be quite easy. However, providing a generic and formal model for dependencies between components can be a tricky task. In fact, a PMIC can be…
A direct sum decomposition theory is developed for direct summands (and complements) of modules over a semiring $R$, having the property that $v+w = 0$ implies $v = 0$ and $w = 0$. Although this never occurs when $R$ is a ring, it always…
We introduce a technique to decompose the scattered near field of two-dimensional arbitrary metaatoms into its multipole contributions. To this end we expand the scattered field upon plane wave illumination into cylindrical harmonics as…