Related papers: Dream resolution and principalization II: excellen…
This paper focuses on regularisation methods using models up to the third order to search for up to second-order critical points of a finite-sum minimisation problem. The variant presented belongs to the framework of [3]: it employs random…
These lecture notes provide a unified overview of most known canonical desingularization methods in characteristic zero. It starts with discussing the classical method, and then proceeds with the recently discovered ones: logarithmic…
We introduce a novel family of invariant, convex, and non-quadratic functionals that we employ to derive regularized solutions of ill-posed linear inverse imaging problems. The proposed regularizers involve the Schatten norms of the Hessian…
We generalize an algorithm by Goward for principalization of monomial ideals in nonsingular varieties to work on any scheme of finite type over a field. The normal crossings condition considered by Goward is weakened to the condition that…
Decentralized optimization is a powerful paradigm that finds applications in engineering and learning design. This work studies decentralized composite optimization problems with non-smooth regularization terms. Most existing gradient-based…
Deep neural networks often severely forget previously learned knowledge when learning new knowledge. Various continual learning (CL) methods have been proposed to handle such a catastrophic forgetting issue from different perspectives and…
The canonical duality theory has provided with a unified analytic solution to a range of discrete and continuous problems in global optimization, which can transform a nonconvex primal problem to a concave maximization dual problem over a…
Given an algorithm of resolution of singularities satisfying certain conditions (``good algorithms''), natural notions of simultaneous algorithmic resolution, or equiresolution, for families of embedded schemes (parametrized by a reduced…
This article is the second work in our series of papers dedicated to image processing models based on the fractional order total variation $TV^r$. In our first work of this series, we studied key analytic properties of these semi-norms.…
We apply the recently proposed superiorization methodology (SM) to the inverse planning problem in radiation therapy. The inverse planning problem is represented here as a constrained minimization problem of the total variation (TV) of the…
This paper revisits the well-studied fixed point problem from a unified viewpoint of mathematical modeling and canonical duality theory, i.e. the original problem is first reformulated as a nonconvex optimization problem, its well-posedness…
We give an overview of invariants of algebraic singularities over perfect fields. We then show how they lead to a synthetic proof of embedded resolution of singularities of 2-dimensional schemes.
We further develop an algorithmic and diagrammatic computational framework for very general exact renormalization groups, where the embedded regularisation scheme, parametrised by a general cutoff function and infinitely many higher point…
We propose an extended primal-dual algorithm framework for solving a general nonconvex optimization model. This work is motivated by image reconstruction problems in a class of nonlinear imaging, where the forward operator can be formulated…
We apply the superiorization methodology to the intensity-modulated radiation therapy (IMRT) treatment planning problem. In superiorization, linear voxel dose inequality constraints are the fundamental modeling tool within which a…
We present a survey on the recent progress with desingularization of quasi-excellent schemes of characteristic zero. Due to expository goals of the paper we concentrate on giving examples and outlining main ideas, and we refer to other…
This work introduces a novel approach to achieving architecture-agnostic equivariance in deep learning, particularly addressing the limitations of traditional layerwise equivariant architectures and the inefficiencies of the existing…
We discuss to what extent the local techniques of resolution of singularities over fields of characteristic zero can be applied to improve singularities in general. For certain interesting classes of singularities, this leads to an embedded…
We show how to transform any set of prioritized propositional defaults into an equivalent set of parallel (i.e., unprioritized) defaults, in circumscription. We give an algorithm to implement the transform. We show how to use the transform…
We propose a regularization scheme for image reconstruction that leverages the power of deep learning while hinging on classic sparsity-promoting models. Many deep-learning-based models are hard to interpret and cumbersome to analyze…