Related papers: Quantitative approximate definable choices

Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…

In this paper we present a complete description of a stochastic semigroup of finite-dimensional projections in Hilbert space. The geometry of such semigroups is characterized by the asymptotic behavior of the widths of compact subsets with…

Multimodal tasks, such as image-text retrieval and generation, require embedding data from diverse modalities into a shared representation space. Aligning embeddings from heterogeneous sources while preserving shared and modality-specific…

We propose a framework to give a precise meaning to the intuitive notion of "family of real forms of a variety parametrised by a variety" and study some fundamental properties of this notion. As an illustration, for any $n \geq 1$, we…

We propose and analyze a novel theoretical and algorithmic framework for structured prediction. While so far the term has referred to discrete output spaces, here we consider more general settings, such as manifolds or spaces of probability…

We prove that each semialgebraic subset of $\R^n$ of positive codimension can be locally approximated of any order by means of an algebraic set of the same dimension. As a consequence of previous results, algebraic approximation preserving…

We introduce and analyze an abstract algorithm that aims to find the projection onto a closed convex subset of a Hilbert space. When specialized to the fixed point set of a quasi nonexpansive mapping, the required sufficient condition…

Approximation in this paper is of vectors on the unit $d$-cube by the projection of integer lattice points onto the same cube. We define badly approximable vectors on a rational quadratic variety and show that sets of these vectors, which…

In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…

Interesting data often concentrate on low dimensional smooth manifolds inside a high dimensional ambient space. Random projections are a simple, powerful tool for dimensionality reduction of such data. Previous works have studied bounds on…

Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…

This article is concerned with a geometric tool given by a pair of projector operators defined by almost product structures on finite dimensional manifolds, polarized by a distribution of constant rank and also endowed with some geometric…

We consider the problem of approximating a two-dimensional shape contour (or curve segment) using discrete assembly systems, which allow to build geometric structures based on limited sets of node and edge types subject to edge length and…

We investigate the enumerative geometry of point configurations in projective space. We define "projective configuration counts": these enumerate configurations of points in projective space such that certain specified subsets are in fixed…

There are many methods developed to approximate a cloud of vectors embedded in high-dimensional space by simpler objects: starting from principal points and linear manifolds to self-organizing maps, neural gas, elastic maps, various types…

Given a non-rational real space curve and a tolerance $\epsilon>0$, we present an algorithm to approximately parametrize the curve. The algorithm checks whether a planar projection of the space curve is $\epsilon$-rational and, in the…

We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.

In this work, we consider a class of convex optimization problems in a real Hilbert space that can be solved by performing a single projection, i.e., by projecting an infeasible point onto the feasible set. Our results improve those…

A theory of graded manifolds can be viewed as a generalization of differential geometry of smooth manifolds. It allows one to work with functions which locally depend not only on ordinary real variables, but also on $\mathbb{Z}$-graded…