Related papers: On $\alpha$-minimizing hypercones
In this paper, we introduce a novel family of iterative algorithms which carry out $\alpha$-divergence minimisation in a Variational Inference context. They do so by ensuring a systematic decrease at each step in the $\alpha$-divergence…
We introduce a direct numerical treatment of nonlinear higher-index differential-algebraic equations by means of overdetermined polynomial least-squares collocation. The procedure is not much more computationally expensive than standard…
Consider an $(n+1)$-dimensional circular cone with opening angle $\alpha \in (0,\pi)$. Using a free-boundary adaptation of the classical calibration method, we prove that, for $n \geq 4$, there exists a threshold $\bar{\alpha}(n) \in…
A careful exposition of Zilber's quasiminimal excellent classes and their categoricity is given, leading to two new results: the L_w1,w(Q)-definability assumption may be dropped, and each class is determined by its model of dimension…
Optimization problems with convex quadratic cost and polyhedral constraints are ubiquitous in signal processing, automatic control and decision-making. We consider here an enlarged problem class that allows to encode logical conditions and…
Sequences of orthogonal polynomials that are alternative to the Jacobi polynomials on the interval $[0,1]$ are defined and their properties are established. An $(\alpha,\beta)$-parameterized system of orthogonal polynomials of the…
Weak KAM theory for discount Hamilton-Jacobi equations and corresponding discount Lagrangian/Hamiltonian dynamics is developed. Then it is applied to error estimates for viscosity solutions in the vanishing discount process. The main…
We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some…
Being cautious is crucial for enhancing the trustworthiness of machine learning systems integrated into decision-making pipelines. Although calibrated probabilities help in optimal decision-making, perfect calibration remains unattainable,…
A Minkowski symmetral of an $\alpha$-concave function is introduced, and some of its fundamental properties are derived. It is shown that for a given $\alpha$-concave function, there exists a sequence of Minkowski symmetrizations that…
This paper enriches the list of known properties of congruence sequences starting from the universal relation and successively performing the operators lower $k$ and lower $t$. Two series of inverse semigroups, namely…
In this paper, we prove that the product of a paired calibrated set and a set of codimension 1 calibrated by a coflat calibration with small singularity set is Almgren minimal. This is motivated by the attempt to classify all possible…
In this paper we obtain several extensions to the quaternionic setting of some results concerning the approximation by polynomials of functions continuous on a compact set and holomorphic in its interior. The results include approximation…
We obtain new results on the geometry of Hilbert modular varieties in positive characteristic and morphisms between them. Using these results and methods of rigid geometry, we develop a theory of canonical subgroups for abelian varieties…
Machine learning classifiers often produce probabilistic predictions that are critical for accurate and interpretable decision-making in various domains. The quality of these predictions is generally evaluated with proper losses, such as…
Parafermions of order two are shown to be the fundamental tool to construct ternary superspaces related to cubic extensions of the Poincar\'e algebra
We compute the dimension of the Hilbert scheme of subvarieties of positive dimension in projective space which are cut by maximal minors of a matrix with polynomial entries.
We describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…
A novel approach is introduced to a very widely occurring problem, providing a complete, explicit resolution of it: minimisation of a convex quadratic under a general quadratic, equality or inequality, constraint. Completeness comes via…
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…