On the Whitney extension problem for near isometries and beyond

• URL: http://arxiv.org/abs/2103.09748v1
• Date: Wed, 17 Mar 2021 16:12:53 GMT
• Title: On the Whitney extension problem for near isometries and beyond
• Authors: Steven B. Damelin
• Abstract summary: A significant portion of the work is based on joint research with Charles Fefferman. The topics of this work include (a) The space of maps of bounded mean oscillation (BMO) in $mathbb RD,, Dgeq 2$. The labeled and unlabeled near alignment and Procrustes problem for point sets with certain geometries and for not too thin compact sets both in $mathbb RD,, Dgeq 2$.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper is an exposition of work of the author et al. detailing fascinating connections between several mathematical problems which lie on the intersection of several mathematics subjects, namely algebraic-differential geometry, analysis on manifolds, complex-harmonic analysis, data science, partial differential equations, optimization and probability. A significant portion of the work is based on joint research with Charles Fefferman in the papers [39, 40, 41, 42]. The topics of this work include (a) The space of maps of bounded mean oscillation (BMO) in $\mathbb R^D,\, D\geq 2$. (b) The labeled and unlabeled near alignment and Procrustes problem for point sets with certain geometries and for not too thin compact sets both in $\mathbb R^D,\, D\geq 2$. (c) The Whitney near isometry extension problem for point sets with certain geometries and for not too thin compact sets both in $\mathbb R^D,\, D\geq 2$. (d) Partitions and clustering of compact sets and point sets with certain geometries in $\mathbb R^D,\, D\geq 2$ and analysis on certain manifolds in $\mathbb R^D,\, D\geq 2$. Many open problems for future research are given.

Related papers

• Algorithmic contiguity from low-degree conjecture and applications in correlated random graphs [0.0]
  We provide evidence of computational hardness for two problems. One of the main ingredient in our proof is to derive certain forms of emphalgorithm contiguity between two probability measures. This framework provides a useful tool for performing reductions between different tasks.
  arXiv  Detail & Related papers  (2025-02-14T00:24:51Z)
• On lower bounds of the density of planar periodic sets without unit distances [55.2480439325792]
  We introduce a novel approach to estimating $m_1(mathbbR2)$ by reformulating the problem as a Maximal Independent Set (MIS) problem on graphs constructed from flat torus. Our experimental results supported by theoretical justifications of proposed method demonstrate that for a sufficiently wide range of parameters this approach does not improve the known lower bound.
  arXiv  Detail & Related papers  (2024-11-20T12:07:19Z)
• Provably learning a multi-head attention layer [55.2904547651831]
  Multi-head attention layer is one of the key components of the transformer architecture that sets it apart from traditional feed-forward models. In this work, we initiate the study of provably learning a multi-head attention layer from random examples. We prove computational lower bounds showing that in the worst case, exponential dependence on $m$ is unavoidable.
  arXiv  Detail & Related papers  (2024-02-06T15:39:09Z)
• An Approximation Theory for Metric Space-Valued Functions With A View Towards Deep Learning [25.25903127886586]
  We build universal functions approximators of continuous maps between arbitrary Polish metric spaces $mathcalX$ and $mathcalY$. In particular, we show that the required number of Dirac measures is determined by the structure of $mathcalX$ and $mathcalY$.
  arXiv  Detail & Related papers  (2023-04-24T16:18:22Z)
• Detection-Recovery Gap for Planted Dense Cycles [72.4451045270967]
  We consider a model where a dense cycle with expected bandwidth $n tau$ and edge density $p$ is planted in an ErdHos-R'enyi graph $G(n,q)$. We characterize the computational thresholds for the associated detection and recovery problems for the class of low-degree algorithms.
  arXiv  Detail & Related papers  (2023-02-13T22:51:07Z)
• Decay of multi-point correlation functions in $\mathbb{Z}^d$ [7.334752859070876]
  We prove multi-point correlation bounds in $mathbbZd$ for arbitrary $dgeq 1$ with symmetrized distances. As applications, we prove multi-point correlation bounds for the Ising model on $mathbbZd$, and multi-point dynamical localization in expectation for uniformly localized disordered systems.
  arXiv  Detail & Related papers  (2022-08-04T02:53:39Z)
• Learning a Single Neuron with Adversarial Label Noise via Gradient Descent [50.659479930171585]
  We study a function of the form $mathbfxmapstosigma(mathbfwcdotmathbfx)$ for monotone activations. The goal of the learner is to output a hypothesis vector $mathbfw$ that $F(mathbbw)=C, epsilon$ with high probability.
  arXiv  Detail & Related papers  (2022-06-17T17:55:43Z)
• Metric Hypertransformers are Universal Adapted Maps [4.83420384410068]
  metric hypertransformers (MHTs) are capable of approxing any adapted map $F:mathscrXmathbbZrightarrow mathscrYmathbbZ$ with approximable complexity. Our results provide the first (quantimat) universal approximation theorem compatible with any such $mathscrX$ and $mathscrY$.
  arXiv  Detail & Related papers  (2022-01-31T10:03:46Z)
• Average-case Complexity of Teaching Convex Polytopes via Halfspace Queries [55.28642461328172]
  We show that the average-case teaching complexity is $Theta(d)$, which is in sharp contrast to the worst-case teaching complexity of $Theta(n)$. Our insights allow us to establish a tight bound on the average-case complexity for $phi$-separable dichotomies.
  arXiv  Detail & Related papers  (2020-06-25T19:59:24Z)
• A diffusion approach to Stein's method on Riemannian manifolds [65.36007959755302]
  We exploit the relationship between the generator of a diffusion on $mathbf M$ with target invariant measure and its characterising Stein operator. We derive Stein factors, which bound the solution to the Stein equation and its derivatives. We imply that the bounds for $mathbb Rm$ remain valid when $mathbf M$ is a flat manifold.
  arXiv  Detail & Related papers  (2020-03-25T17:03:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.