Algorithm removes leaves to find root in uniform trees.
problem Finding the root in large uniform attachment trees.
method Leaf-stripping algorithm recursively removes leaves.
result Set of remaining vertices contains the root with high probability.
On-device research index
arXiv research
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.
168,695 papers · 148 categories
Trend · papers per month
48 results for “uniform attachment trees”
Paper estimates the order of vertices in random recursive trees.
problem Estimating the order of arrival of vertices in random recursive trees.
method Proposes an order estimator based on the Jordan centrality measure and defines risk measures.
result Establishes a nearly optimal estimator for the problem.
We study the problem of identifying the source of a diffusion spreading over a regular tree. When the degree of each node is at least three, we show that it is possible to construct confidence sets for the diffusion source with size independent of the number of infected nodes. Our estimators are motivated by analogous …
This paper studies how adding leaves to a tree affects its spectral properties.
problem Investigating the asymptotic behavior of tree spectra under leaf attachment.
method Analyzing the Ricci matrix and its largest eigenvalue for trees with pendant edges added.
result The sequence of largest eigenvalues converges to a limit that depends on local branch data.
Transforms uniform learners to work under arbitrary distributions efficiently.
problem Learning under arbitrary distributions from uniform learners.
method Black-box transformation using decision tree decomposition.
result Efficient transformation with runtime scaling with distribution complexity.
Proves convergence of gradient Ricci shrinkers with uniform bounds.
problem Compactness and energy concentration in gradient Ricci shrinkers.
method Bubble-tree convergence and local energy analysis.
result No energy concentrates in neck regions, leading to a local diffeomorphism finiteness theorem.
The paper explores uniform perfectness and centers in Morse boundaries.
problem Detecting -center exhaustivity in uniformly perfect Morse boundaries.
method Analyzes CAT(0) and geodesic spaces, using visual boundary data and metric transforms.
result Fixed-basepoint uniform perfectness is insufficient for -center exhaustivity.
The paper studies geometric properties of quasi-trees and tree approximations.
problem Geometric properties and tree approximations of quasi-trees.
method Construction of a tree approximating quasi-trees, proving quasi-isometric properties.
result Every quasi-tree is -quasi-isometric to a simplicial tree.
We study the effectiveness of non-uniform randomized feature selection in decision tree classification. We experimentally evaluate two feature selection methodologies, based on information extracted from the provided dataset: \emph{leverage scores-based} and \emph{norm-based} feature selection. Experimenta…
Study proves Lojasiewicz inequalities for harmonic maps near simple bubble trees.
problem Analyzing harmonic maps near simple bubble trees.
method Proves Lojasiewicz inequalities for harmonic maps close to simple bubble trees.
result Obtains new results on the convergence of harmonic map flow and energy spectrum.
Knots in lattice homologymath.GT
Assume that Γ_{v_0} is a tree with vertex set Vert(Γ_{v_0})={v_0, v_1,..., v_n}, and with an integral framing (weight) attached to each vertex except v_0. Assume furthermore that the intersection matrix of G=Γ_{v_0}-{v_0} is negative definite. We define a filtration on the chain complex computing the lattice homology o…
Uniform proof reconstructs spaces using cross ratio on boundary.
problem Reconstructing spaces using cross ratio on boundary.
method Using CAT(-1) spaces and cross ratio on visual boundary.
result Spaces can be reconstructed using cross ratio on boundary.
The nested Chinese restaurant process and Bayesian nonparametric inference of topic hierarchiesstat.ML
We present the nested Chinese restaurant process (nCRP), a stochastic process which assigns probability distributions to infinitely-deep, infinitely-branching trees. We show how this stochastic process can be used as a prior distribution in a Bayesian nonparametric model of document collections. Specifically, we presen…
In this paper, we study the weak compactness of the set of conformal metrics in any Riemann surface without boundary whose Calabi energy and area are uniformly bounded. We prove that for any sequence of such metrics, there alwasy exists a subsequence which converges in H\sp{2,2}_\sb{loc} everywhere except a finite numb…
The paper challenges the use of decision trees for pointwise inference due to slow convergence rates.
problem The slow convergence rates of decision trees in uniform norm, especially with non-vanishing probability.
method Demonstrates the limitations of adaptive recursive partitioning and shows how random forests can improve performance.
result Decision trees can fail to achieve polynomial rates of convergence in uniform norm, even with pruning.
We continue to develop an obstruction theory for embedding 2-spheres into 4-manifolds in terms of Whitney towers. The proposed intersection invariants take values in certain graded abelian groups generated by labelled trivalent trees, and with relations well known from the 3-dimensional theory of finite type invariants…
History estimation in random recursive trees: Pointwise approach via iterated Jordan centralitiesmath.PR
Estimate arrival times in random recursive trees using iterated Jordan centralities.
problem Estimate arrival times in random recursive trees.
method Pointwise approach using iterated Jordan centralities.
result Tail bounds for relative estimation error.
Paper develops a new method to analyze 3D tree-like objects.
problem Analyzing complex geometrical and topological variations in 3D tree-like objects.
method Extended SRVF representation and new metric for tree-shaped 3D objects.
result Captures full elasticity and topological variations of branches.
Improved decision tree learning guarantees for complex functions.
problem Achieving provable guarantees for decision tree induction with complex target functions.
method Introduces a new splitting criterion that considers correlations between target function and subsets of attributes.
result Proves provable guarantees for all target functions with respect to the uniform distribution, circumventing previous impossibility results.
Algorithm learns decision trees from noisy data.
problem Learning stochastic decision trees from corrupted samples.
method Quasipolynomial-time algorithm for adversarial noise.
result Returns a hypothesis with error within of optimal.
New algorithm learns decision trees faster than before.
problem Properly learning decision trees in polynomial time.
method Membership query algorithm with time complexity.
result Achieved faster learning time for decision trees.
Study attached submanifolds in solvmanifolds, generalizing symmetric space results.
problem Exploring submanifolds in non-symmetric spaces with unusual curvature properties.
method Generalizing Tamaru's construction to pseudo-Riemannian scalar products and root spaces.
result Ricci curvature restriction holds for attached submanifolds under specific algebraic conditions.
Study investigates lattices fibring over the circle, focusing on BNSR invariants.
problem Investigating BNSR invariants of irreducible uniform lattices.
method Examines BNSR invariants and Bestvina-Brady groups to understand lattice properties.
result Irreducibility of lattices is linked to the vanishing of BNSR invariants for all finite-index subgroups.
The paper introduces a new type of Ricci flow on graphs to study their curvature.
problem Understanding the curvature of graphs and their convergence properties.
method Proposes a weighted Forman and Lin-Lu-Yau Ricci flow on graphs and proves the existence and uniqueness of solutions.
result The normalized curvature flow on trees converges to a constant curvature metric.
The Mondrian process represents an elegant and powerful approach for space partition modelling. However, as it restricts the partitions to be axis-aligned, its modelling flexibility is limited. In this work, we propose a self-consistent Binary Space Partitioning (BSP)-Tree process to generalize the Mondrian process. Th…
This work improves mixing rates for Bayesian CART, a key component of BART.
problem Understanding and improving mixing rates for Bayesian inference with MCMC.
method Derived upper bounds on mixing times, provided sufficient conditions for polynomial mixing, and proposed Twiggy Bayesian CART.
result Twiggy Bayesian CART achieves polynomial mixing without assuming signal connectivity.
Defines extended TQFTs using handle attachments.
problem Constructing extended topological quantum field theories (TQFTs).
method Finite presentation of cobordism symmetric monoidal bicategory using handle attachments and relations.
result Constructs a once extended TQFT from categorified TQFT and handle 2-morphisms.
Study of 3-handle attachments in 4D manifolds using Kirby calculus.
problem Inclusion of 3-handles in Kirby diagrams for 4D manifolds.
method Developed moves to extend Kirby calculus, established homological criterion.
result Identified geometric basis of 3-handle attachments, proved uniqueness theorem.
The main theorem of this paper generalizes recent results in Dehn surgery to the case of handlebody attachment. We consider attaching handlebodies and solid tori to the boundary of an irreducible, boundary-irreducible, atoroidal and acylindrical 3-manifold. We show that for a large class of homeomorphisms attaching the…
The paper models social networks with varying levels of reciprocity.
problem Understanding diverse reciprocal behavior in social networks.
method Developed a preferential attachment model with heterogeneous reciprocity.
result Captures the heavy-tailed nature of empirical degree distributions and identifies multiple user groups.
We analyze the consistency of decision trees and random forests in regression.
problem Consistency of decision trees and random forests in regression.
method Elementary proofs following classical arguments for smoothing methods.
result Establish weak and almost sure convergence of honest trees and forest averages to the true regression function.
Covering R-treesmath.MG
We show that every inner metric space X is the metric quotient of a complete R-tree via a free isometric action, which we call the covering R-tree of X. The quotient mapping is a weak submetry (hence, open) and light. In the case of compact 1-dimensional geodesic space X, the free isometric action is via a subgroup of …
Paper introduces methods to handle missing data in probabilistic regression trees.
problem Handling missing data in probabilistic regression trees.
method Three approaches: uniform probability, partial observation, and dimension-reduced smoothing.
result Preserves interpretability while extending applicability to incomplete datasets.
J. Boyle classified 1-handles attached to surface-knots, that are closed and connected surfaces embedded in the Euclidean 4-space, in the case that the surfaces are oriented and 1-handles are orientable with respect to the orientations of the surfaces. In that case, the equivalence classes of 1-handles correspond to th…
Smoothly attaches manifolds with controlled curvature.
problem Attaching manifolds with corners and controlling curvature.
method Desingularization theorem to smoothly attach manifolds with controlled scalar and mean curvature.
result Smoothly attaches manifolds with controlled scalar curvature and mean curvature of boundary.
This paper has two parts, on Baumslag-Solitar groups and on general G-trees. In the first part we establish bounds for stable commutator length (scl) in Baumslag-Solitar groups. For a certain class of elements, we further show that scl is computable and takes rational values. We also determine exactly which of these el…
We use the generalized Pontryagin-Thom construction to analyze the effect of attaching a bypass on the homotopy class of the contact structure. In particular, given a 3-dimensional contact manifold with convex boundary, we show that the bypass triangle attachment changes the homotopy class of the contact structure rela…
CEDA analyzes large categorical datasets using tree geometry and binary codes.
problem Analyzing large categorical datasets with extreme- samples.
method CEDA uses tree geometry and binary codes to analyze categorical data.
result CEDA discovers patterns and evaluates their reliability in large categorical datasets.
As the second part of the sequel, we investigate the variation of rearrangement operators (more precisely, the spectral functions behind) arising in the study of modular geometry on noncommutative (two) tori. We initiate a systematic approach by introducing transformations corresponding to basic operations in calculus,…
The study provides theoretical guarantees for the statistical performance of optimal decision trees.
problem Theoretical limits on the statistical performance of globally optimal decision trees.
method Sharp oracle inequalities and uniform concentration framework based on Rademacher complexity.
result Derivation of minimax optimal rates for piecewise sparse heterogeneous anisotropic Besov space.
Formulae for 1-3 handle attachments in 4-manifolds.
problem Understanding handle attachments in 4-dimensional manifolds.
method Developed general formulae for 1-3 handle attachments using skein modules.
result Derived complete description of gluing homomorphism on skein modules.
A new random forest algorithm improves tree construction for optimal performance.
problem Improving the performance of random forests, especially in complex and smooth scenarios.
method Adaptive split-balancing method using permutation-based splitting criterion.
result Achieves minimax optimality under various Lipschitz and Hölder classes.
We consider the detection of activations over graphs under Gaussian noise, where signals are piece-wise constant over the graph. Despite the wide applicability of such a detection algorithm, there has been little success in the development of computationally feasible methods with proveable theoretical guarantees for ge…
In this paper we define a new cohomology of a smooth manifold called Lichnerowicz type cohomology attached to a function. Firstly, we study some basic properties of this cohomology as: a de Rham type isomorphism, dependence on the function, singular forms, relative cohomology, Mayer-Vietoris sequence, homotopy invarian…
We construct a family of analytic discs attached to a real submanifold M \subset of codimension defined near a CR singularity.
The paper proposes a method to improve random forest classification accuracy by weighting trees based on their decision path reliability.
problem Random forests' uniform voting fails to correct errors in regions where incorrect tree representations outnumber correct ones.
method The paper introduces using the structural pattern of each tree's decision path as an instance-adaptive reliability signal to identify and weight more reliable trees.
result Using the proposed method yields a statistically significant accuracy improvement over RF on 36 binary classification benchmarks.
Holomorphic handle attaching proves complex surface properties.
problem Characterizing complex surfaces with contact boundaries.
method Holomorphic handle attaching method.
result Closed contact 3-manifolds can be filled as complex surfaces' boundaries.
For spin manifolds with boundary we consider Riemannian metrics which are product near the boundary and are such that the corresponding Dirac operator is invertible when half-infinite cylinders are attached at the boundary. The main result of this paper is that these properties of a metric can be preserved when the met…