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

Trend · papers per month

138276414552 · Jun 202019922001200920172026
48 results for 3D tree analysis

This research detects and identifies human-made objects in 3D point clouds using novel methods.

problem Detect and identify human-made objects in 3D point clouds.
method Ground filtering, local information extraction, clustering using Marked Point Fields (MPFs) and Hessian matrix.
result The proposed method outperforms previous techniques in detecting human-made objects.

New approach handles stochastic and partially-observable environments using discrete autoencoders and Monte Carlo tree search.

problem Challenges in planning for stochastic and partially-observable environments.
method Uses discrete autoencoders and a stochastic variant of Monte Carlo tree search.
result Significantly outperforms MuZero on stochastic chess and scales to DeepMind Lab.

3D object recognition accuracy can be improved by learning the multi-scale spatial features from 3D spatial geometric representations of objects such as point clouds, 3D models, surfaces, and RGB-D data. Current deep learning approaches learn such features either using structured data representations (voxel grids and o…

2018-05-30abs ↗pdf ↗

Improved 3D LiDAR data classification using product coefficients.

problem Enhancing accuracy in 3D LiDAR data classification.
method Introducing product coefficients derived from measure theory as additional features in the classification process, alongside PCA.
result Significant improvement in classification accuracy with product coefficients.

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

problem Exploring deviations from general relativity in a 3D context.
method Developed a polynomial affine model of gravity, applied to homogeneous isotropic cosmological models, and classified solutions.
result Explicit solutions derived from the connection allow the definition of alternative/emergent metrics.

This paper finds efficient algorithms for approximating Markov networks with k-tree topologies.

problem Efficiently approximating Markov networks with complex topologies.
method Developed O(n^{k+1})-time algorithms for finding maximum spanning k-trees (MSkT) that retain certain subgraphs.
result Optimal approximation of Markov networks with k-tree topology is achieved in polynomial time.

Generative modeling of 3D shapes has become an important problem due to its relevance to many applications across Computer Vision, Graphics, and VR. In this paper we build upon recently introduced 3D mesh-convolutional Variational AutoEncoders which have shown great promise for learning rich representations of deformab…

2019-06-07abs ↗pdf ↗

Random forests are a learning algorithm proposed by Breiman [Mach. Learn. 45 (2001) 5--32] that combines several randomized decision trees and aggregates their predictions by averaging. Despite its wide usage and outstanding practical performance, little is known about the mathematical properties of the procedure. This…

2014-05-12abs ↗pdf ↗

Enhanced 3D shape analysis using information geometry.

problem Challenges in comparing 3D point clouds due to their unstructured nature and complex geometry.
method Information geometric framework for 3D point cloud shape analysis using Gaussian Mixture Models (GMMs) on a statistical manifold. Proposed MSKL divergence with upper and lower bounds.
result MSKL provides stable and monotonically varying values that directly reflect geometric variation, outperforming traditional distances and existing KL approximations.

A novel 3D shape registration method using spectral graph embedding and probabilistic matching.

problem Challenges in 3D shape analysis and registration, especially with large variability.
method Combining spectral graph matching with Laplacian embedding for large graphs, using commute-time embedding and PCA.
result A method to register shapes with different samplings and isometric deformations.

Discover gaps in q-series exponents for 3d N=2 theories.

problem Understanding statistical properties of BPS q-series for 3d N=2 theories.
method Used principal component analysis with machine learning to calculate and analyze feature saliencies.
result Gaps in q-series exponents are statistically more significant at the beginning compared to higher powers.

Paper proposes Roweisposes for 3D action recognition using generalized eigenvalue problem.

problem Need for basic methods in 3D action recognition.
method Roweisposes uses Roweis discriminant analysis for generalized subspace learning.
result Roweisposes is effective for 3D action recognition.

3D models vulnerable to adversarial attacks, new method improves success rate and naturalness.

problem Vulnerability of 3D deep learning models to adversarial examples in the physical world.
method ε-isometric (εε-ISO) attack considering geometric properties and invariance to physical transformations.
result Significantly improved attack success rate and naturalness of 3D adversarial examples.

Study 3d N=1 vacua from M-theory compactification on Spin(7) space.

problem Quantum corrections in 3d N=1 vacua from M-theory compactification.
method Use Higgs bundles to analyze 3d N=1 vacua and track corrections.
result Topological anomalies are robust and calculable in 3d effective field theory.

Constructing of molecular structural models from Cryo-Electron Microscopy (Cryo-EM) density volumes is the critical last step of structure determination by Cryo-EM technologies. Methods have evolved from manual construction by structural biologists to perform 6D translation-rotation searching, which is extremely comput…

2019-01-03abs ↗pdf ↗

Regression Trees analyze stock returns, revealing market excess return as the most informative factor.

problem Understanding informational content of three factors in stock returns.
method Joint regression tree analysis of daily stock return data for 5 major US corporations.
result The market excess return factor is always the most informative in all cases (solo and joint).

The paper certifies decision trees against evasion attacks using program analysis.

problem Vulnerability of decision tree models to evasion attacks by maliciously crafted perturbations.
method Transform decision trees into imperative programs for program analysis, leveraging abstract interpretation.
result Soundly verifies security guarantees of decision tree models, yielding minimal false positives.

Improved 3D ECG feature attributions for clinical interpretation.

problem Lack of interpretability in deep learning models for 12-lead ECG analysis.
method Cross-modal mapping of feature attributions from 12-lead ECG models onto CineECG 3D space.
result Mapped feature attributions yield higher Dice scores than standard 12-lead attributions.

Study of asymptotics of meromorphic 3D-index as q approaches 1.

problem Understanding the asymptotic behavior of a meromorphic function related to 3D-index.
method Developed a conjectural asymptotic approximation using stationary phase analysis of a circle-valued angle structure integral.
result Found connections to angle structures and volume optimization.

This work analyzes tree-based methods from a ranking perspective, providing insights and new statistics.

problem Understanding the effectiveness of tree-based methods in finite-sample settings, especially symbolic feature selection.
method Local ranking perspective, finite-sample analysis, oracle bounds, posterior contraction results, concordant divergence statistics.
result New insights and statistics for evaluating symbolic feature mappings.

Decision tree learning heuristics fail even in smoothed analysis for complex targets.

problem Greedy decision tree learning heuristics fail for complex target functions in the smoothed analysis model.
method Construct counterexamples and analyze the behavior of heuristics in the smoothed setting and agnostic setting.
result Greedy decision tree learning heuristics can build trees of exponential depth before achieving high accuracy for certain complex target functions.

Proposes a new method for subgroup analysis using optimal trees with parameter fusion.

problem Challenges of greedy heuristics and overfitting in tree-based recursive partitioning methods.
method Fused optimal causal tree method leveraging mixed integer optimization (MIO) for globally optimal partitions and parameter fusion.
result Substantial improvement in subgroup discovery accuracy and statistical efficiency.

Regression trees learn gradients of differentiable functions.

problem Understanding gradients of differentiable functions using regression trees.
method Developed a method to estimate gradients of differentiable functions using regression trees and exposed quantities from tree learning libraries.
result Gradient estimates from regression trees can be used to improve predictive analysis and solve tasks in uncertainty quantification.

In this paper we study supersymmetric co-dimension 2 and 4 defects in the compactification of the 6d (2,0)(2,0) theory of type AN1A_{N-1} on a 3-manifold MM. The so-called 3d-3d correspondence is a relation between complexified Chern-Simons theory (with gauge group SL(N,C)SL(N, \mathbb{C})) on MM and a 3d N=2\mathcal{N}=2 theo…

2015-10-16abs ↗pdf ↗