Learning Weakly Convex Sets in Metric Spaces

05/10/2021
by   Eike Stadtländer, et al.
20

We introduce the notion of weak convexity in metric spaces, a generalization of ordinary convexity commonly used in machine learning. It is shown that weakly convex sets can be characterized by a closure operator and have a unique decomposition into a set of pairwise disjoint connected blocks. We give two generic efficient algorithms, an extensional and an intensional one for learning weakly convex concepts and study their formal properties. Our experimental results concerning vertex classification clearly demonstrate the excellent predictive performance of the extensional algorithm. Two non-trivial applications of the intensional algorithm to polynomial PAC-learnability are presented. The first one deals with learning k-convex Boolean functions, which are already known to be efficiently PAC-learnable. It is shown how to derive this positive result in a fairly easy way by the generic intensional algorithm. The second one is concerned with the Euclidean space equipped with the Manhattan distance. For this metric space, weakly convex sets are a union of pairwise disjoint axis-aligned hyperrectangles. We show that a weakly convex set that is consistent with a set of examples and contains a minimum number of hyperrectangles can be found in polynomial time. In contrast, this problem is known to be NP-complete if the hyperrectangles may be overlapping.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/31/2022

Weakly toll convexity and proper interval graphs

A walk u_0u_1 … u_k-1u_k is a weakly toll walk if u_0u_i ∈ E(G) implies ...
research
03/13/2023

Computing the hull and interval numbers in the weakly toll convexity

A walk u_0u_1 … u_k-1u_k of a graph G is a weakly toll walk if u_0u_k ∉E...
research
10/05/2022

On Convexity in Split graphs: Complexity of Steiner tree and Domination

Given a graph G with a terminal set R ⊆ V(G), the Steiner tree problem (...
research
05/22/2018

M-convexity of the minimum-cost packings of arborescences

In this paper, we first prove that the minimum-cost packings of disjoint...
research
10/18/2018

On estimation of biconvex sets

A set in the Euclidean plane is said to be θ-biconvex, for some θ∈[0,π/2...
research
09/21/2018

On the convexity number for complementary prisms

In the geodetic convexity, a set of vertices S of a graph G is convex if...
research
04/27/2020

Formal Adventures in Convex and Conical Spaces

Convex sets appear in various mathematical theories, and are used to def...

Please sign up or login with your details

Forgot password? Click here to reset