相关论文: Estimating the reach of a manifold via its convexi…

Statistical decision problems lie at the heart of statistical machine learning. The simplest problems are binary and multiclass classification and class probability estimation. Central to their definition is the choice of loss function,…

Consider a convex set of which we remove an arbitrarily number of disjoints convex sets -- the obstacles -- and a convex function whose minimum is the agent's goal. We consider a local and stochastic approximation of the gradient of a…

In this work, we propose a novel framework for estimating the dimension of the data manifold using a trained diffusion model. A diffusion model approximates the score function i.e. the gradient of the log density of a noise-corrupted…

Obtaining reliable and accurate quantification of uncertainty estimates from deep neural networks is important in safety-critical applications. A well-calibrated model should be accurate when it is certain about its prediction and indicate…

The ratio of convexity radius over injectivity radius may be made arbitrarily small within the class of compact Riemannian manifolds of any fixed dimension at least two. This is proved using Gulliver's method of constructing manifolds with…

Stochastic Gradient Descent (SGD) stands as a cornerstone optimization algorithm with proven real-world empirical successes but relatively limited theoretical understanding. Recent research has illuminated a key factor contributing to its…

Let $M$ denote a low-dimensional manifold embedded in Euclidean space and let ${X}= \{ x_1, \dots, x_n \}$ be a collection of points uniformly sampled from it. We study the relationship between the curvature of a random geometric graph…

This paper poses a theoretical characterization of the stochastic reachability problem in terms of probability measures, capturing the probability measure of the state of the system that satisfies the reachability specification for all…

We start by considering the problem of estimating intrinsic distances on a smooth submanifold. We show that minimax optimality can be obtained via a reconstruction of the surface, and discuss the use of a particular mesh construction -- the…

Under a set of assumptions on a family of submanifolds $\subset {\mathbb R}^D$, we derive a series of geometric properties that remain valid after finite-dimensional and almost isometric Diffusion Maps (DM), including almost uniform…

Lower a posteriori error bounds obtained using the standard bubble function approach are reviewed in the context of anisotropic meshes. A numerical example is given that clearly demonstrates that the short-edge jump residual terms in such…

Current work on human-machine alignment aims at understanding machine-learned latent spaces and their correspondence to human representations. G{\"a}rdenfors' conceptual spaces is a prominent framework for understanding human…

Jensen's inequality is ubiquitous in measure and probability theory, statistics, machine learning, information theory and many other areas of mathematics and data science. It states that, for any convex function $f\colon K \to \mathbb{R}$…

We study the problem of regression with interval targets, where only upper and lower bounds on target values are available in the form of intervals. This problem arises when the exact target label is expensive or impossible to obtain, due…

We study the convergence rate of Bregman gradient methods for convex optimization in the space of measures on a $d$-dimensional manifold. Under basic regularity assumptions, we show that the suboptimality gap at iteration $k$ is in…

In this article we show the following result: if $C$ is an $n$-dimensional convex and compact subset, $f:C\rightarrow[0,\infty)$ is concave, and $\phi:[0,\infty)\rightarrow[0,\infty)$ is a convex function with $\phi(0)=0$, we then…

In this paper we introduce the concept of modulus of regularity as a tool to analyze the speed of convergence, including the finite termination, for classes of Fej\'er monotone sequences which appear in fixed point theory, monotone operator…

The main goal of this paper is to present results of existence and non-existence of convex functions on Riemannian manifolds and, in the case of the existence, we associate such functions to the geometry of the manifold. Precisely, we prove…

Diffusion models achieve state-of-the-art performance in various generation tasks. However, their theoretical foundations fall far behind. This paper studies score approximation, estimation, and distribution recovery of diffusion models,…

We give lower bounds for the first Dirichilet eigenvalues for domains in submanifolds with locally bounded mean curvatures. These bounds depend on the injectivity radius, sectional curvature (upperbound) of the ambient space and on the mean…