Research
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,694 papers · 148 categories

Trend · papers per month

21416282 · Jun 202019922001200920172026
48 results for tree delineation

Graph embeddings from commute networks identify socioeconomic disparities in urban areas.

problem Urban delineation and socioeconomic group identification.
method Graph Neural Network (GNN) for modeling commute networks and deriving node embeddings.
result GNNs effectively capture socioeconomic disparities between urban communities.

Novel pricing method for equity-indexed annuities under uncertain volatility and stochastic interest rate.

problem Pricing equity-indexed annuities with early surrender risk under uncertain market conditions.
method Advanced financial modeling techniques, including uncertain volatility framework and Hull-White model for interest rate dynamics. Numerical algorithm using tree-based framework with local volatility optimization.
result High effectiveness of the proposed numerical algorithm compared to machine learning-based methods.

ECG-DelNet uses neural networks to accurately delineate ECGs, even with low-quality data.

problem Lack of model explainability and small databases limit deep learning applicability in ECG detection.
method Adapted U-Net architecture for 1D data, used PhysioNet's QT database, applied data augmentation and regularization techniques.
result Best configuration achieved high precision and recall for P, QRS, and T waves.

Algorithm generates adaptive confidence sets for instance segmentation with guaranteed coverage.

problem Uncalibrated predictions and lack of uncertainty quantification in instance segmentation models.
method Conformal prediction algorithm to generate adaptive confidence sets with provable guarantees.
result Empirically, prediction sets vary in size based on query difficulty and attain target coverage, outperforming baselines.

Inverse inference, or "brain reading", is a recent paradigm for analyzing functional magnetic resonance imaging (fMRI) data, based on pattern recognition and statistical learning. By predicting some cognitive variables related to brain activation maps, this approach aims at decoding brain activity. Inverse inference ta…

2011-05-02abs ↗pdf ↗

Image segmentation is widely used in a variety of computer vision tasks, such as object localization and recognition, boundary detection, and medical imaging. This thesis proposes deep learning architectures to improve automatic object localization and boundary delineation for salient object segmentation in natural ima…

2019-09-19abs ↗pdf ↗

New CNN architecture improves pediatric image segmentation by homogenizing pose and size.

problem Challenges in segmenting pediatric images due to pose and size heterogeneity.
method Spatial Transformer Network (STN) for pose and scale invariance, combined with UNet for segmentation.
result Improved pediatric segmentation, especially renal tumor delineation, with accelerated processing.

Geospatial ML models need special evaluation methods due to their unique challenges.

problem Evaluating geospatial machine learning models is challenging due to their specific characteristics.
method Delineated unique challenges and proposed concrete takeaways for improving geospatial model evaluations.
result Concrete takeaways for improving evaluations of geospatial model performance.

Study on new metrics on para-Kähler-Norden manifolds with conformal deformation.

problem Exploring geometric and harmonic properties of new metrics.
method Conformal deformation of Berger-type metric, analysis of Levi-Civita link, study of curvature varieties, and harmonic maps.
result Detailed examination of curvature varieties and harmonic maps on the manifold.

The paper explains how nearest neighbor methods succeed in prediction.

problem Explaining the success of nearest neighbor methods in prediction.
method The paper covers both theoretical and practical aspects of nearest neighbor methods, including statistical guarantees and practical algorithms.
result The paper provides nonasymptotic statistical guarantees and practical algorithms for nearest neighbor methods.

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…

2013-03-27abs ↗pdf ↗

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…

2018-02-24abs ↗pdf ↗

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…

2010-07-04abs ↗pdf ↗

The bane of one-class collaborative filtering is interpreting and modelling the latent signal from the missing class. In this paper we present a novel Bayesian generative model for implicit collaborative filtering. It forms a core component of the Xbox Live architecture, and unlike previous approaches, delineates the o…

2013-09-26abs ↗pdf ↗

Paper analyzes soft tree ensembles using NTK, finding only leaf count matters.

problem Understanding impact of various tree architectures in ensemble learning.
method Formulated and analyzed Neural Tangent Kernel (NTK) for soft tree ensembles.
result Only the number of leaves at each depth is relevant for tree architecture in ensemble learning.

The paper studies geometric structures in perfect fluid spacetimes with specific metrics.

problem Analyzing the geometric properties of perfect fluid spacetimes with specific metrics.
method Investigates conditions for conformal Ricci-Yamabe soliton and derives Laplace equations.
result Conditions for expanding, steady, or shrinking conformal Ricci-Yamabe solitons are identified.

Optimal survival trees ensemble reduces tree count and improves predictive performance.

problem Improving predictive performance in survival analysis.
method Grows a forest of optimal survival trees by ranking and selecting the best trees based on out-of-bag error.
result Reduces the number of trees in the ensemble while improving predictive performance.

The task of translating between programming languages differs from the challenge of translating natural languages in that programming languages are designed with a far more rigid set of structural and grammatical rules. Previous work has used a tree-to-tree encoder/decoder model to take advantage of the inherent tree s…

2018-07-04abs ↗pdf ↗

Recently proposed budding tree is a decision tree algorithm in which every node is part internal node and part leaf. This allows representing every decision tree in a continuous parameter space, and therefore a budding tree can be jointly trained with backpropagation, like a neural network. Even though this continuity …

2014-12-19abs ↗pdf ↗

Characterizes fundamental groups of disjointly tree-graded spaces.

problem Understanding fundamental groups of complex geometric structures.
method Defines and analyzes disjointly tree-graded spaces, characterizing their fundamental groups.
result Fundamental groups of disjointly tree-graded spaces embed into inverse limits of free products of fundamental groups of pieces.