Related papers: Generalized Ellipsoids
In this paper we present an immersed weak Galerkin method for solving second-order elliptic interface problems on polygonal meshes, where the meshes do not need to be aligned with the interface. The discrete space consists of constants on…
Using gradient descent (GD) with fixed or decaying step-size is a standard practice in unconstrained optimization problems. However, when the loss function is only locally convex, such a step-size schedule artificially slows GD down as it…
For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…
In this paper, we demonstrate the construction of generalized Rough Polyhamronic Splines (GRPS) within the Bayesian framework, in particular, for multiscale PDEs with rough coefficients. The optimal coarse basis can be derived automatically…
We give a classification theorem for certain four-dimensional families of geometric $\lambda$-adic Galois representations attached to a pure motive. More precisely, we consider families attached to the cohomology of a smooth projective…
Inspired by a theorem by Skornjakov-Hughes-Pasini [9, 7, 8] and a problem which turned up in our recent paper [13], we start a study of epimorphisms with source a thick generalized m-gon and target a thin generalized m-gon. In this first…
In this paper, we extend the previous convergence results for the generalized alternating projection method applied to subspaces in [arXiv:1703.10547] to hold also for smooth manifolds. We show that the algorithm locally behaves similarly…
We show that the decision problem of determining whether a given (abstract simplicial) $k$-complex has a geometric embedding in $\mathbb R^d$ is complete for the Existential Theory of the Reals for all $d\geq 3$ and $k\in\{d-1,d\}$. This…
A gaussoid is a combinatorial structure that encodes independence in probability and statistics, just like matroids encode independence in linear algebra. The gaussoid axioms of Lnenicka and Mat\'us are equivalent to compatibility with…
We study geometric properties of GL-spaces. We demonstrate that every finite-dimensional GL-space is polyhedral; that in dimension 2 there are only two, up to isometry, GL-spaces, namely the space whose unit sphere is a square (like…
Embeddings in machine learning are low-dimensional representations of complex input patterns, with the property that simple geometric operations like Euclidean distances and dot products can be used for classification and comparison tasks.…
Given independent standard Gaussian points $v_1, \ldots, v_n$ in dimension $d$, for what values of $(n, d)$ does there exist with high probability an origin-symmetric ellipsoid that simultaneously passes through all of the points? This…
We prove that for every convex body $K$ with the center of mass at the origin and every $\varepsilon\in \left(0,\frac{1}{2}\right)$, there exists a convex polytope $P$ with at most $e^{O(d)}\varepsilon^{-\frac{d-1}{2}}$ vertices such that…
We give two characterizations of cones over ellipsoids in real normed vector spaces. Let $C$ be a closed convex cone with nonempty interior such that $C$ has a bounded section of codimension $1$. We show that $C$ is a cone over an ellipsoid…
Similarly to the classic notion in $E^d$, a subset of a positive diameter below $\frac{\pi}{2}$ of a hemisphere of the sphere $S^d$ is called complete, provided adding any extra point increases its diameter. Complete sets are convex bodies…
We consider Galois/monodromy groups arising in computer vision applications, with a view towards building more efficient polynomial solvers. The Galois/monodromy group allows us to decide when a given problem decomposes into algebraic…
We consider efficient estimation of the Euclidean parameters in a generalized partially linear additive models for longitudinal/clustered data when multiple covariates need to be modeled nonparametrically, and propose an estimation…
The complete elliptic integral of the first and second kind, K(k) and E(k), appear in a multitude of physics and engineering applications. Because there is no known closed-form, the exact values have to be computed numerically. Here,…
We study symplectic forms on hypersurface algebroids. These are a broad generalization of the $b^{k}$-Poisson structures studied extensively by Miranda, Scott, and collaborators, and their geometry is intimately related to the group of…
This paper studies robust solutions and semidefinite linear programming (SDP) relaxations of a class of convex polynomial programs in the face of data uncertainty. The class of convex programs, called robust SOS-convex programs, includes…