arXiv research

Paper offers a method for finding the smallest sphere enclosing a set in d-dimensional space.

This paper shows GNNs can learn good approximations for graph problems.

Mathematical framework for minimum enclosing ball problem.

We employ random geometric digraphs to construct semi-parametric classifiers. These data-random digraphs are from parametrized random digraph families called proximity catch digraphs (PCDs). A related geometric digraph family, class cover catch digraph (CCCD), has been used to solve the class cover problem by using its…

This paper studies the geometry of minimum-volume confidence sets for multinomial parameters.

Machine teaches IRL with minimal demonstrations.

We create an interpretable credit risk model with transparent explanations.

Ensemble methods have been shown to be an effective tool for solving multi-label classification tasks. In the RAndom k-labELsets (RAKEL) algorithm, each member of the ensemble is associated with a small randomly-selected subset of k labels. Then, a single label classifier is trained according to each combination of ele…

We present a method for the reconstruction of networks, based on the order of nodes visited by a stochastic branching process. Our algorithm reconstructs a network of minimal size that ensures consistency with the data. Crucially, we show that global consistency with the data can be achieved through purely local consid…

Optimizes minimum-volume prediction sets for multivariate regression.

We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every face of a planar embedding of the graph in order to capture the effect of unary potentials. A ground state of the resulting approximation can…

The notion of covering type was recently introduced by Karoubi and Weibel to measure the complexity of a topological space by means of good coverings. When X has the homotopy type of a finite CW-complex, its covering type coincides with the minimum possible number of vertices of a simplicial complex homotopy equivalent…

We consider the relations between different measures of complexity for free homotopy classes of curves on a surface $Σ$, including the minimum number of self-intersections, the minimum length of the words representing them in a geometric presentation of $π_1(Σ)$, and the minimum degree of the coverings of $Σ$ to which …

The paper identifies the minimum mean-variance spanning set and its importance in asset evaluation.

Tiny complexes share 3-5 triangles in common coverings.

We find the minimum dilatation of pseudo-Anosov braids on n-punctured discs for 3 <= n <= 8. This covers the results of Song-Ko-Los (n=4) and Ham-Song (n=5). The proof is elementary, and uses the Lefschetz formula.

Max-product Belief Propagation (BP) is a popular message-passing algorithm for computing a Maximum-A-Posteriori (MAP) assignment over a distribution represented by a Graphical Model (GM). It has been shown that BP can solve a number of combinatorial optimization problems including minimum weight matching, shortest path…

\noindent Given a Riemann surface $M$, the \emph{complexity} of a branched cover of $M$ to the Riemann sphere $S^2$, of degree $d$ and with branching set of cardinality $n \geq 3$, is defined as $d$ times the hyperbolic area of the complement of its branching set in $S^2$. A branched cover $p \colon M \to S^2$ of degre…

Small covers were introduced by Davis and Januszkiewicz in 1991. We introduce the notion of equilibrium triangulations for small covers. We study equilibrium and vertex minimal $\mathbb{Z}_2^2$-equivariant triangulations of $2$-dimensional small covers. We discuss vertex minimal equilibrium triangulations of $\mathbb{R…

Extends conformal prediction to contrastive learning for better coverage of positive samples.

Study efficient algorithms for identifying minimum interventional sets to learn causal relationships.

Two algorithms for interpreting and boosting tree-based models using rule covering.

Study membership inference under skewed priors and adaptive thresholds, improving attack accuracy.

In 2004, Sormani and Wei introduced the covering spectrum: a geometric invariant that isolates part of the length spectrum of a Riemannian manifold. In their paper they observed that certain Sunada isospectral manifolds share the same covering spectrum, thus raising the question of whether the covering spectrum is a sp…

It is known that any surface knot can be transformed to an unknotted surface knot or a surface knot which has a diagram with no triple points by a finite number of 1-handle additions. The minimum number of such 1-handles is called the unknotting number or the triple point cancelling number, respectively. In this paper,…

This paper classifies periodic weaves and their universal cover, extending Tait's conjectures.

We find the minimum probability of lifetime ruin of an investor who can invest in a market with a risky and a riskless asset and can purchase a deferred annuity. Although we let the admissible set of strategies of annuity purchasing process to be increasing adapted processes, we find that the individual will not buy a …

SGD converges to global minimum for certain non-convex functions.

New method finds unrealizable branched cover data.

We analyze the topology and geometry of a polyhedron of dimension 2 according to the minimum size of a cover by PL collapsible polyhedra. We provide partial characterizations of the polyhedra of dimension 2 that can be decomposed as the union of two PL collapsible subpolyhedra in terms of their simple homotopy type and…

Designs interventions to learn causal graphs with minimum cost.

Study on a new family of problems interpolating expert advice and multi-armed bandits.

We propose a new framework for deriving screening rules for convex optimization problems. Our approach covers a large class of constrained and penalized optimization formulations, and works in two steps. First, given any approximate point, the structure of the objective function and the duality gap is used to gather in…

Defines observer-invariant time derivatives on moving surfaces.

Combines TSP and SC to solve real-world vaccine distribution.

Paper certifies intersection of minimum-volume confidence sets for multinomial outcomes.

Motivated by Bonahon's result for hyperbolic surfaces, we construct an analogue of the Patterson-Sullivan-Bowen-Margulis map from the Culler-Vogtmann outer space $CV(F_k)$ into the space of projectivized geodesic currents on a free group. We prove that this map is a topological embedding. We also prove that for every $…

MMCGAN uses explicit manifold learning to improve GAN performance.

Sparse optimization refers to an optimization problem involving the zero-norm in objective or constraints. In this paper, nonconvex approximation approaches for sparse optimization have been studied with a unifying point of view in DC (Difference of Convex functions) programming framework. Considering a common DC appro…

New sampling method optimizes learning minimum mean among distributions.

Solve arc diagrams on surfaces via branched covers.

Makeev proved that among centrally symmetric four-dimensional polytopes, with more than twenty facets and circumscribed about the Euclidean ball of diameter one, there is no universal cover for the family of unit diameter sets. In this paper we examine the converse problem, and prove that each centrally symmetric polyt…

In this paper we continue to study (`strong') Nielsen coincidence numbers (which were introduced recently for pairs of maps between manifolds of arbitrary dimensions) and the corresponding minimum numbers of coincidence points and pathcomponents. We explore compatibilities with fibrations and, more specifically, with c…

We develop an efficient algorithm to find confidence ellipsoids with volume guarantees in high dimensions.

Study stabilizes components of Galois cover moduli spaces.

We present a class of models that, via a simple construction, enables exact, incremental, non-parametric, polynomial-time, Bayesian inference of conditional measures. The approach relies upon creating a sequence of covers on the conditioning variable and maintaining a different model for each set within a cover. Infere…

Maps from curved spaces have a minimum energy bound.

This paper introduces PSI-flatness to better understand ReLU neural networks' flatness and generalization.