Related papers: Computing Hulls And Centerpoints In Positive Defin…
The paper characterizes the convex hull of the closure of the cone-volume set $C_\cv(U)$, consisting of all cone-volume vectors of polygons with outer unit normals vectors contained in $U$, for any finite set $U \subseteq \R^2, \pos(U) =…
We study the convex hull of $SO(n)$, thought of as the set of $n\times n$ orthogonal matrices with unit determinant, from the point of view of semidefinite programming. We show that the convex hull of $SO(n)$ is doubly spectrahedral, i.e.…
Recently, various convolutions based on continuous or discrete kernels for point cloud processing have been widely studied, and achieve impressive performance in many applications, such as shape classification, scene segmentation and so on.…
Using elementary duality properties of positive semidefinite moment matrices and polynomial sum-of-squares decompositions, we prove that the convex hull of rationally parameterized algebraic varieties is semidefinite representable (that is,…
The predicted mass function of dark matter halos is essential in connecting observed galaxy cluster counts and models of galaxy clustering to the properties of the primordial density field. We determine the mass function in the concordance…
Estimating the head pose of a person is a crucial problem for numerous applications that is yet mainly addressed as a subtask of frontal pose prediction. We present a novel method for unconstrained end-to-end head pose estimation to tackle…
The purpose of this paper is to propose and analyze a multi-step iterative algorithm to solve a convex optimization problem and a fixed point problem posed on a Hadamard space. The convergence properties of the proposed algorithm are…
We introduce a novel type of approximation spaces for functions with values in a nonlinear manifold. The discrete functions are constructed by piecewise polynomial interpolation in a Euclidean embedding space, and then projecting pointwise…
The problem to compute the vertices of a polytope given by affine inequalities is called vertex enumeration. The inverse problem, which is equivalent by polarity, is called the convex hull problem. We introduce `approximate vertex…
Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erd\H{o}s-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2)$ space complexity that compute: (1) A subset $S$ of $P$…
Volume estimates of metric balls in manifolds find diverse applications in information and coding theory. In this paper, some new results for the volume of a metric ball in unitary group are derived via various tools from random matrix…
The recent increase in computational resources and data availability has led to a significant rise in the use of Machine Learning (ML) techniques for data analysis in physics. However, the application of ML methods to solve differential…
The tubal tensor framework provides a clean and effective algebraic setting for tensor computations, supporting matrix-mimetic features like Singular Value Decomposition and Eckart-Young-like optimality results. Underlying the tubal tensor…
We introduce a framework for describing the halo selection function of optical cluster finders. We treat the problem as being separable into a term that describes the intrinsic galaxy content of a halo (the Halo Occupation Distribution, or…
Reliable extraction of cosmological information from clustering measurements of galaxy surveys requires estimation of the error covariance matrices of observables. The accuracy of covariance matrices is limited by our ability to generate…
$\renewcommand{\Re}{\mathbb{R}}$ We develop a general randomized technique for solving "implic it" linear programming problems, where the collection of constraints are defined implicitly by an underlying ground set of elements. In many…
We suggest efficient and provable methods to compute an approximation for imbalanced point clustering, that is, fitting $k$-centers to a set of points in $\mathbb{R}^d$, for any $d,k\geq 1$. To this end, we utilize \emph{coresets}, which,…
The goal of this paper is to study the geometry of cusped complex hyperbolic manifolds through their compactifications. We characterize toroidal compactifications with non-nef canonical divisor. We derive effective very ampleness results…
The increase in the observed volume in cosmological surveys imposes various challenges on simulation preparations. Firstly, the volume of the simulations required increases proportionally to the observations. However, large-volume…
In this paper, the proximal point algorithm for quasi-convex minimization problem in nonpositive curvature metric spaces is studied. We prove $\Delta$-convergence of the generated sequence to a critical point (which is defined in the text)…