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.
SHAKE-GNN scales GNNs for large graphs with multi-scale representations.
Bicycle paths form geodesics in 3D subspaces, related to Kirchhoff rods.
Introduces Lax-Kirchhoff moduli spaces for quivers and Lie groups.
Kirchhoff energy is a classical functional on the space of arclength-parameterized framed curves whose critical points approximate configurations of springy elastic rods. We introduce a generalized functional on the space of framed curves of arbitrary parameterization, which model rods with axial stretch or cross-secti…
Study p-Willmore disks with boundary energies, finding equilibrium configurations.
Develops control and observer methods for complex systems.
Determinants of theta curves and symmetric graphs are studied.
Theory of point vortices extended to closed surfaces.
New approach to electric group for knots and links.
By a theorem of Kirchhoff if the six sphere admits an almost complex structure then the seven sphere is parallelizable, more crucial, he exhibited an explicit global frame constructed out of the given almost complex structure. This result implicitly equips the seven sphere with a definite H-space multiplication. We pro…
The paper explores variational problems on Riemannian manifolds with special foliations, proving existence results.
We discuss several issues regarding material homogeneity and strain compatibility for materially uniform thin elastic shells from the viewpoint of a 3-dimensional theory, with small thickness, as well as a 2-dimensional Cosserat theory. A relationship between inhomogeneity and incompatibility measures under the two des…
We consider a family of compact manifolds which shrinks with respect to an appropriate parameter to a graph. The main result is that the spectrum of the Laplace-Beltrami operator converges to the spectrum of the (differential) Laplacian on the graph with Kirchhoff boundary conditions at the vertices. On the other hand,…
iMondrian forest combines isolation forest and Mondrian forest for better anomaly detection.
Ensembles of randomized decision trees, usually referred to as random forests, are widely used for classification and regression tasks in machine learning and statistics. Random forests achieve competitive predictive performance and are computationally efficient to train and test, making them excellent candidates for r…
New random forest method provides optimal rates and confidence bands.
RFpredInterval package builds prediction intervals for random forests and boosted forests.
We propose random hinge forests, a simple, efficient, and novel variant of decision forests. Importantly, random hinge forests can be readily incorporated as a general component within arbitrary computation graphs that are optimized end-to-end with stochastic gradient descent or variants thereof. We derive random hinge…
Improved random forest proximities capture data geometry.
Deep forests enhance expressiveness exponentially with depth, not width or tree size.
This paper improves forest pruning to balance accuracy and interpretability.
This paper is a comment on the survey paper by Biau and Scornet (2016) about random forests. We focus on the problem of quantifying the impact of each ingredient of random forests on their performance. We show that such a quantification is possible for a simple pure forest , leading to conclusions that could apply more…
Forest-guided smoothing uses random forest outputs for interpretable local smoothers.
In this paper we propose using the principle of boosting to reduce the bias of a random forest prediction in the regression setting. From the original random forest fit we extract the residuals and then fit another random forest to these residuals. We call the sum of these two random forests a \textit{one-step boosted …
By seeking the narrowest prediction intervals (PIs) that satisfy the specified coverage probability requirements, the recently proposed quality-based PI learning principle can extract high-quality PIs that better summarize the predictive certainty in regression tasks, and has been widely applied to solve many practical…
Improves time series classification with forest proximities.
Random forests reduce bias and variance, especially in low SNR settings.
New random forest variants achieve optimal performance in high dimensions.
Enhances random forest consistency and introduces DMRF for improved performance.
Knot Theory is currently a very broad field. Even a long survey can only cover a narrow area. Here we concentrate on the path from Goeritz matrices to quasi-alternating links. On the way, we often stray from the main road and tell related stories, especially if they allow as to place the main topic in a historical cont…
Online random forests improve Q-learning performance in specific gym environments.
New method learns representations for decision forests using input perturbation.
In this paper, we propose a probabilistic parsing model, which defines a proper conditional probability distribution over non-projective dependency trees for a given sentence, using neural representations as inputs. The neural network architecture is based on bi-directional LSTM-CNNs which benefits from both word- and …
Improved random forest models enhance machine learning predictions.
Introduced by Breiman, Random Forests are widely used classification and regression algorithms. While being initially designed as batch algorithms, several variants have been proposed to handle online learning. One particular instance of such forests is the \emph{Mondrian Forest}, whose trees are built using the so-cal…
We investigate the effect of the proportional hazards assumption on prognostic and predictive models of the survival time of patients suffering from amyotrophic lateral sclerosis (ALS). We theoretically compare the underlying model formulations of several variants of survival forests and implementations thereof, includ…
Many scientific and engineering challenges -- ranging from personalized medicine to customized marketing recommendations -- require an understanding of treatment effect heterogeneity. In this paper, we develop a non-parametric causal forest for estimating heterogeneous treatment effects that extends Breiman's widely us…
Decision forests, including Random Forests and Gradient Boosting Trees, have recently demonstrated state-of-the-art performance in a variety of machine learning settings. Decision forests are typically ensembles of axis-aligned decision trees; that is, trees that split only along feature dimensions. In contrast, many r…
A fast method for finding counterfactual explanations for decision forests.
We improve random forest consistency and performance with DMRF, a new variant.
Proves bounds on spanning two-forests and random cut sizes.
Paper explores grafting consistent estimators to improve Random Forest consistency.
Random forests have proven to be reliable predictive algorithms in many application areas. Not much is known, however, about the statistical properties of random forests. Several authors have established conditions under which their predictions are consistent, but these results do not provide practical estimates of ran…
Theoretical study of random forests for nonlinear time series.
Study models forest transitions with deep learning for parameter estimation.
We propose an algorithm named best-scored random forest for binary classification problems. The terminology "best-scored" means to select the one with the best empirical performance out of a certain number of purely random tree candidates as each single tree in the forest. In this way, the resulting forest can be more …
A random forest is a popular tool for estimating probabilities in machine learning classification tasks. However, the means by which this is accomplished is unprincipled: one simply counts the fraction of trees in a forest that vote for a certain class. In this paper, we forge a connection between random forests and ke…
New methods estimate survival functions with time-varying covariates.