A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Paper proves equivalence of two Floer theories using pearly trees and Hamiltonian flows.
This is a survey of the theory of real trees and their applications.
Tree-graded spaces are generalizations of R-trees. They appear as asymptotic cones of groups (when the cones have cut points). Since many questions about endomorphisms and automorphisms of groups, solving equations over groups, studying embeddings of a group into another group, etc. lead to actions of groups on the asy…
Recent theory work has found that a special type of spatial partition tree - called a random projection tree - is adaptive to the intrinsic dimension of the data from which it is built. Here we examine this same question, with a combination of theory and experiments, for a broader class of trees that includes k-d trees…
Existence and uniqueness of discrete Einstein metrics on trees proven.
A new approach to Morse theory using folded ribbon trees.
We characterize and study variable importance (VIMP) and pairwise variable associations in binary regression trees. A key component involves the node mean squared error for a quantity we refer to as a maximal subtree. The theory naturally extends from single trees to ensembles of trees and applies to methods like rando…
The study proves how groups can be split with limited complexity.
This paper proves a Faber-Krahn inequality for trees with given matching number.
agtboost speeds up gradient tree boosting with automatic complexity adjustment.
This work is the first step towards a description of the Gromov boundary of the free factor graph of a free product, with applications to subgroup classification for outer automorphisms. We extend the theory of algebraic laminations dual to trees, as developed by Coulbois, Hilion, Lustig and Reynolds, to the context of…
We give an overview of two approaches to probability theory where lower and upper probabilities, rather than probabilities, are used: Walley's behavioural theory of imprecise probabilities, and Shafer and Vovk's game-theoretic account of probability. We show that the two theories are more closely related than would be …
This paper uses ML and EVT to analyze tree ring data, improving accuracy of predictions.
New groups defined that act on trees without repeating.
This paper solves the open problem of computing Bayes optimal prediction for decision trees using a Markov chain Monte Carlo method.
The study analyzes when Bayesian averaging over decision trees is reliable.
A new method for automatic gradient tree boosting using information theory.
Latent tree models are graphical models defined on trees, in which only a subset of variables is observed. They were first discussed by Judea Pearl as tree-decomposable distributions to generalise star-decomposable distributions such as the latent class model. Latent tree models, or their submodels, are widely used in:…
Semi-analytic models are best suited to compare galaxy formation and evolution theories with observations. These models rely heavily on halo merger trees, and their realistic features (i.e., no drastic changes on halo mass or jumps on physical locations). Our aim is to provide a new framework for halo merger tree gener…
Boosting meta-trees improve decision tree performance.
SDSR reconstructs species trees from genetic markers efficiently.
The problem of maximum-likelihood (ML) estimation of discrete tree-structured distributions is considered. Chow and Liu established that ML-estimation reduces to the construction of a maximum-weight spanning tree using the empirical mutual information quantities as the edge weights. Using the theory of large-deviations…
The study reveals decision trees' limitations in fitting data from additive models, proving a generalization lower bound.
In this paper we prove that if we consider the standard real metric on simplicial rooted trees then the category Tower-Set of inverse sequences can be described by means of the bounded coarse geometry of the naturally associated trees. Using this we give a geometrical characterization of Mittag-Leffler property in inve…
The paper develops a theory for random forests, separating variance components and providing methods for estimating prediction intervals.
In previous work, we defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we look at the case when this graph is a tree, and we show that in many cases these trees determine the chord diagram (modulo the usual 1-term and 4-term rela…
The study provides theoretical guarantees for the statistical performance of optimal decision trees.
A new probability distribution on full rooted trees helps in model selection.
To every tree we associate a filtered cochain complex. Its cohomology and the corresponding spectral sequence have clear combinatorial description. If a tree is the Dynkin diagram of a simple plane curve singularity, the graded Euler characteristic of this complex coincides with the Alexander polynomial of the link. In…
We study a notion of deformation for simplicial trees with group actions (G-trees). Here G is a fixed, arbitrary group. Two G-trees are related by a deformation if there is a finite sequence of collapse and expansion moves joining them. We show that this relation on the set of G-trees has several characterizations, in …
In previous work, the author defined the intersection graph of a chord diagram associated with string links (as in the theory of finite type invariants). In this paper, we classify the trees which can be obtained as intersection graphs of string link diagrams.
New framework detects model weaknesses in decision tree ensembles.
Tree structures are ubiquitous in data across many domains, and many datasets are naturally modelled by unobserved tree structures. In this paper, first we review the theory of random fragmentation processes [Bertoin, 2006], and a number of existing methods for modelling trees, including the popular nested Chinese rest…
New method for comparing different mass measures on tree structures using entropy partial transport.
Enhances time-series regression trees with latent factors for robust financial analysis.
This paper studies how adding leaves to a tree affects its spectral properties.
New method finds knots without low treewidth diagrams.
We introduce a recoupling theory for virtual braided trees. This recoupling theory can be utilized to incorporate swap gates into anyonic models of quantum computation.
Proves bounds on spanning two-forests and random cut sizes.
Collaborative Trees model analyzes feature interactions and additive effects.
Paper proposes an algorithm to reconstruct optimal model structure from graph adjacency matrix.
We show that uniformly finite homology of products of trees vanishes in all degrees except degree , where it is infinite dimensional. Our method is geometric and applies to several large scale homology theories, including almost equivariant homology and controlled coarse homology. As an application we determine …
In this paper, we study the dynamics of degenerating sequences of rational maps on Riemann sphere using -trees. Given a sequence of degenerating rational maps, we give two constructions for limiting dynamics on -trees: one geometric and one algebraic. The geometric constructio…
Edge subdivision affects the Perron eigenvalue of tree Ricci matrices.
Topological methods improve neuron analysis and tracer injection summary.
Proves convergence of gradient Ricci shrinkers with uniform bounds.
The number of BMW groups on tree products is bounded.
Decision trees are consistent for regression and classification tasks even with many predictors.