arXiv research

Active-LATHE boosts error exponent for learning homogeneous trees.

We present an algorithm for classification tasks on big data. Experiments conducted as part of this study indicate that the algorithm can be as accurate as ensemble methods such as random forests or gradient boosted trees. Unlike ensemble methods, the models produced by the algorithm can be easily interpreted. The algo…

New classification of complex hypersurfaces using advanced algebraic methods.

We propose a new anytime hierarchical clustering method that iteratively transforms an arbitrary initial hierarchy on the configuration of measurements along a sequence of trees we prove for a fixed data set must terminate in a chain of nested partitions that satisfies a natural homogeneity requirement. Each recursive …

We present some explicit constructions of universal R-trees with applications to the asymptotic geometry of hyperbolic spaces. In particular, we show that any asymptotic cone of a complete simply connected manifold of negative curvature is a complete homogeneous R-tree with the valency $2^{\aleph_0}$ at every point. It…

We classify the resolution graphs of weighted homogeneous surface singularities which admit rational homology disk smoothings. The nonexistence of rational homology disk smoothings is shown by symplectic geometric methods, while the existence is verified via smoothings of negative weights. In particular, it is shown th…

We define and give explicit construction of the universal tree-graded space with a given collection of pieces. We apply that to proving uniqueness of asymptotic cones of relatively hyperbolic groups whose peripheral subgroups have unique asymptotic cones. Modulo the Continuum Hypothesis, we show that if an asymptotic c…

Asymptotic subcone of an unbounded metric space is another metric space, capturing the structure of the original space at infinity. In this paper we define a functional metric space S which is an asymptotic subcone of the hyperbolic plane. This space is a real tree branching at every its point. Moreover, it is a homoge…

We consider numerical integrators of ODEs on homogeneous spaces (spheres, affine spaces, hyperbolic spaces). Homogeneous spaces are equipped with a built-in symmetry. A numerical integrator respects this symmetry if it is equivariant. One obtains homogeneous space integrators by combining a Lie group integrator with an…

Decision trees are a popular technique in statistical data classification. They recursively partition the feature space into disjoint sub-regions until each sub-region becomes homogeneous with respect to a particular class. The basic Classification and Regression Tree (CART) algorithm partitions the feature space using…

This paper presents a new probabilistic generative model for image segmentation, i.e. the task of partitioning an image into homogeneous regions. Our model is grounded on a mid-level image representation, called a region tree, in which regions are recursively split into subregions until superpixels are reached. Given t…

Survey of Bayesian nonparametric space partition models and their applications.

Decision trees with binary splits are popularly constructed using Classification and Regression Trees (CART) methodology. For binary classification and regression models, this approach recursively divides the data into two near-homogenous daughter nodes according to a split point that maximizes the reduction in sum of …

Exact learning of tree-structured models with side info and noise.

Regression trees are becoming increasingly popular as omnibus predicting tools and as the basis of numerous modern statistical learning ensembles. Part of their popularity is their ability to create a regression prediction without ever specifying a structure for the mean model. However, the method implicitly assumes ho…

The paper studies statistical properties of CART regression trees.

The Ising model is important in statistical modeling and inference in many applications, however its normalizing constant, mean number of active vertices and mean spin interaction -- quantities needed in inference -- are computationally intractable. We provide accurate approximations that make it possible to numericall…

Binomial tree methods (BTM) and explicit difference schemes (EDS) for the variational inequality model of American options with time dependent coefficients are studied. When volatility is time dependent, it is not reasonable to assume that the dynamics of the underlying asset's price forms a binomial tree if a partitio…

A new model improves homogeneity in burn patient reimbursement.

In ensemble methods, the outputs of a collection of diverse classifiers are combined in the expectation that the global prediction be more accurate than the individual ones. Heterogeneous ensembles consist of predictors of different types, which are likely to have different biases. If these biases are complementary, th…

Four constructions of Seifert surfaces - Hopf plumbing, arborescent plumbing, basketry, and T-bandword handle decomposition - are described, and some interrelationships found, e.g.: arborescent Seifert surfaces are baskets; Hopf-plumbed baskets are precisely homogeneous T-bandword surfaces. A Seifert surface is Hopf-pl…

Networks are ubiquitous in biology and computational approaches have been largely investigated for their inference. In particular, supervised machine learning methods can be used to complete a partially known network by integrating various measurements. Two main supervised frameworks have been proposed: the local appro…

Bayesian Context Trees improve change-point detection in discrete data.

Let $f:T^2\to \mathbb{R}$ be Morse function on $2$-torus $T^2,$ and $\mathcal{O}(f)$ be the orbit of $f$ with respect to the right action of the group of diffeomorphisms $\mathcal{D}(T^2)$ on $C^{\infty}(T^2)$. Let also $\mathcal{O}_f(f,X)$ be a connected component of $\mathcal{O}(f,X)$ which contains $f.$ In the case …

The assumption of positivity in causal inference (also known as common support and co-variate overlap) is necessary to obtain valid causal estimates. Therefore, confirming it holds in a given dataset is an important first step of any causal analysis. Most common methods to date are insufficient for discovering non-posi…

We prove that the first reduced cohomology with values in a mixing Lp-representation, p larger than 1, vanishes for a class of amenable groups including connected amenable Lie groups. In particular this solves for this class of amenable groups a conjecture of Gromov saying that every finitely generated amenable group h…

Local MDI+ improves feature importance for tree-based models, enhancing interpretability and performance.

We study biinvariant word metrics on groups. We provide an efficient algorithm for computing the biinvariant word norm on a finitely generated free group and we construct an isometric embedding of a locally compact tree into the biinvariant Cayley graph of a nonabelian free group. We investigate the geometry of cyclic …

Every Kauffman state σof a link diagram D(K) naturally defines a state surface S_σwhose boundary is K. For a homogeneous state σ, we show that K is a fibered link with fiber surface S_σif and only if an associated graph G'_σis a tree. As a corollary, it follows that for an adequate knot or link, the second and next-to-…

We discuss a variation of Gromov's notion of asymptotic dimension that was introduced and named Nagata dimension by Assouad. The Nagata dimension turns out to be a quasisymmetry invariant of metric spaces. The class of metric spaces with finite Nagata dimension includes in particular all doubling spaces, metric trees, …

In this paper, we characterize the sigma-adequacy of a link diagram in two ways: in terms of a certain edge subset of its Tait graph and in terms of a certain product of Tutte polynomials. Furthermore, we show that the symmetrized Tutte polynomial of the Tait graph of a link diagram can be written as a sum of these pro…

A Dynamic Chain Event Graph (DCEG) provides a rich tree-based framework for modelling a dynamic process with highly asymmetric developments. An N Time-Slice DCEG (NT-DCEG) is a useful subclass of the DCEG class that exhibits a specific type of periodicity in its supporting tree graph and embodies a time-homogeneity ass…

New data-driven Cartan connection tracks complex vascular structures.

While studying response trajectory, often the population of interest may be diverse enough to exist distinct subgroups within it and the longitudinal change in response may not be uniform in these subgroups. That is, the timeslope and/or influence of covariates in longitudinal profile may vary among these different sub…

Ensembles are popular methods for solving practical supervised learning problems. They reduce the risk of having underperforming models in production-grade software. Although critical, methods for learning heterogeneous regression ensembles have not been proposed at large scale, whereas in classical ML literature, stac…

The polynomial affine model of gravity is explored in 3D, focusing on cosmological solutions.

Most existing image denoising approaches assumed the noise to be homogeneous white Gaussian distributed with known intensity. However, in real noisy images, the noise models are usually unknown beforehand and can be much more complex. This paper addresses this problem and proposes a novel blind image denoising algorith…

Boosting meta-trees improve decision tree performance.

Introduces new types of homogeneous spaces and their properties.

The paper studies geometric properties of quasi-trees and tree approximations.

Efficiently updates posterior tree distributions over meta-trees.

Introduces homogeneity supermanifolds for studying graded structures.

Recently, it is shown that each regular homogeneous Finsler space $M$ admits at least one homogeneous geodesic through any point $o\in M$. The purpose of this article is to study the existence of homogeneous geodesics on singular homogeneous $(α,β)$-spaces, specially, homogeneous Kropina spaces. We show that any homoge…

In this paper, we study homogeneous geodesics in homogeneous Finsler spaces. We first give a simple criterion that characterizes geodesic vectors. We show that the geodesics on a Lie group, relative to a bi-invariant Finsler metric, are the cosets of the one-parameter subgroups. The existence of infinitely many homogen…

This paper describes experiments, on two domains, to investigate the effect of averaging over predictions of multiple decision trees, instead of using a single tree. Other authors have pointed out theoretical and commonsense reasons for preferring the multiple tree approach. Ideally, we would like to consider predictio…

We introduce a novel incremental decision tree learning algorithm, Hoeffding Anytime Tree, that is statistically more efficient than the current state-of-the-art, Hoeffding Tree. We demonstrate that an implementation of Hoeffding Anytime Tree---"Extremely Fast Decision Tree", a minor modification to the MOA implementat…

We introduce block-tree graphs as a framework for deriving efficient algorithms on graphical models. We define block-tree graphs as a tree-structured graph where each node is a cluster of nodes such that the clusters in the graph are disjoint. This differs from junction-trees, where two clusters connected by an edge al…

We prove that the Penrose limit of a spacetime along a homogeneous geodesic is a homogeneous plane wave spacetime and that the Penrose limit of a reductive homogeneous spacetime along a homogeneous geodesic is a Cahen--Wallach space. We then consider several homogenous examples to show that these results are indeed sha…