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

115230345460 · Jun 202019922001200920172026
48 results for shape information

Topology-enhanced loss improves 3D object reconstruction from 2D images.

problem Challenges in reconstructing 3D objects from 2D images, especially capturing shape information.
method Integrates multi-scale topological features into the reconstruction loss using cubical complexes and optimal transport distance.
result Topology-aware loss substantially improves 3D reconstruction quality.

Any subset of the plane can be approximated by a set of square pixels. This transition from a shape to its pixelation is rather brutal since it destroys geometric and topological information about the shape. Using a technique inspired by Morse Theory, we algorithmically produce a PL approximation of the original shape …

2011-05-13abs ↗pdf ↗

The choice of constellations largely affects the performance of communication systems. When designing constellations, both the locations and probability of occurrence of the points can be optimized. These approaches are referred to as geometric and probabilistic shaping, respectively. Usually, the geometry of the const…

2019-06-18abs ↗pdf ↗

The paper analyzes extreme risk measures with limited distributional information.

problem Investigating risk measures under partial knowledge of distribution moments and shape.
method Employing probability inequalities and modified Schwarz inequality to derive bounds on distortion risk measures.
result Unified framework for calculating best- and worst-case scenarios of distortion risk measures.

Shape information is of great importance in many applications. For example, the oil-bearing capacity of sand bodies, the subterranean remnants of ancient rivers, is related to their cross-sectional shapes. The analysis of these shapes is therefore of some interest, but current classifications are simplistic and ad hoc.…

2018-02-26abs ↗pdf ↗

New scheme optimizes BMI through probabilistic and geometric shaping.

problem Optimizing bit-wise mutual information (BMI) for coded modulation.
method Joint optimization of BMI through probabilistic and geometric shaping.
result Joint optimization enables a continuum of constellation geometries and probability distributions.

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 registration-free framework monitors shape and color in 4D point clouds.

problem Monitoring shape and color changes in complex parts without registration.
method Laplace-Beltrami operator spectral properties for geometric and color feature capture; combined monitoring scheme for shape and color anomalies.
result Effective detection of shape deformations and color anomalies without registration or mesh reconstruction.

New method uses cluster shapes to improve track finding in particle collisions.

problem Combining timing and additional detector information for efficient track finding.
method Neural networks to analyze cluster shapes for track seeding.
result Cluster shapes reduce fake combinatorial backgrounds while maintaining high track efficiency.

Statistical shape models enhance machine learning algorithms providing prior information about deformation. A Point Distribution Model (PDM) is a popular landmark-based statistical shape model for segmentation. It requires choosing a model order, which determines how much of the variation seen in the training data is a…

2018-08-01abs ↗pdf ↗

New method uses KL-divergence to create non-informative priors for multivariate Gaussian.

problem Handling hyperparameters for non-informative limits in multivariate Gaussian conjugate priors.
method Using scaled KL-divergence between multivariate Gaussians to construct Wishart and normal-Wishart conjugate priors.
result Forming non-informative priors without violating Wishart shape parameter restrictions.

The incredible variety of galaxy shapes cannot be summarized by human defined discrete classes of shapes without causing a possibly large loss of information. Dictionary learning and sparse coding allow us to reduce the high dimensional space of shapes into a manageable low dimensional continuous vector space. Statisti…

2014-06-29abs ↗pdf ↗

In typical applications of Bayesian optimization, minimal assumptions are made about the objective function being optimized. This is true even when researchers have prior information about the shape of the function with respect to one or more argument. We make the case that shape constraints are often appropriate in at…

2016-12-28abs ↗pdf ↗

PointGMM learns hGMMs from point clouds for 3D shape representation.

problem Lack of shape priors and non-local information in point cloud representations.
method Neural network that learns hierarchical Gaussian mixture models (hGMMs) for 3D shapes.
result Generative model learns meaningful latent space for interpolations and novel shape synthesis.

Paper introduces a method to generate stable shapes using Grassmann manifolds.

problem Generating stable shapes with minimal extraneous transformations.
method Continuous normalization flows on Grassmann manifolds to eliminate extraneous transformations.
result The method significantly outperforms state-of-the-art methods in generating high-quality samples.

SaR-SVM-STV improves hyperspectral image classification with shape-adaptive reconstruction and denoising.

problem Classifying hyperspectral images with limited labeled data.
method Shape-adaptive Reconstruction (SaR) for pixel preprocessing, SVM for probability estimation, and Smoothed Total Variation (STV) for denoising.
result SaR-SVM-STV outperforms SVM-STV with fewer labeled data.

The importance of training robust neural network grows as 3D data is increasingly utilized in deep learning for vision tasks in robotics, drone control, and autonomous driving. One commonly used 3D data type is 3D point clouds, which describe shape information. We examine the problem of creating robust models from the …

2019-08-16abs ↗pdf ↗

Study S-shaped utility maximization with VaR constraint and unobservable drift.

problem Maximizing utility with a Value at Risk (VaR) constraint and unknown drift.
method Bayesian filter, concavification principle, change of measure, semi-closed integral representation, algorithms (Lagrange, simulation, deep neural network).
result Critical wealth level determining solution feasibility and optimal solution existence.

Piecewise Linear-Quadratic (PLQ) penalties are widely used to develop models in statistical inference, signal processing, and machine learning. Common examples of PLQ penalties include least squares, Huber, Vapnik, 1-norm, and their asymmetric generalizations. Properties of these estimators depend on the choice of pena…

2017-06-06abs ↗pdf ↗

The projective shape of a configuration of k points or "landmarks" in RP(d) consists of the information that is invariant under projective transformations and hence is reconstructable from uncalibrated camera views. Mathematically, the space of projective shapes for these k landmarks can be described as the quotient sp…

2016-02-13abs ↗pdf ↗

The space of shapes of a polyhedron with given total angles less than 2πat each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take place a finite distance from a nonsingular point. The metric completion is a comple…

1998-01-19abs ↗pdf ↗

Functional BART adds shape priors to Bayesian tree regression for better curve fitting.

problem Regression with function-on-scalar data and shape constraints.
method Bayesian tree structure with spline representations, customized Bayesian backfitting algorithm, shape priors.
result Improved estimation and prediction accuracy with shape priors.

The rotation prediction (Rotation) is a simple pretext-task for self-supervised learning (SSL), where models learn useful representations for target vision tasks by solving pretext-tasks. Although Rotation captures information of object shapes, it hardly captures information of textures. To tackle this problem, we intr…

2019-12-25abs ↗pdf ↗

A horospherical torus about a cusp of a hyperbolic manifold inherits a Euclidean similarity structure, called a cusp shape. We bound the change in cusp shape when the hyperbolic structure of the manifold is deformed via cone deformation preserving the cusp. The bounds are in terms of the change in structure in a neighb…

2004-10-08abs ↗pdf ↗

In this work we present a technique to use natural language to help reinforcement learning generalize to unseen environments. This technique uses neural machine translation, specifically the use of encoder-decoder networks, to learn associations between natural language behavior descriptions and state-action informatio…

2017-07-26abs ↗pdf ↗

For manifold learning, it is assumed that high-dimensional sample/data points are embedded on a low-dimensional manifold. Usually, distances among samples are computed to capture an underlying data structure. Here we propose a metric according to angular changes along a geodesic line, thereby reflecting the underlying …

2018-02-15abs ↗pdf ↗

Efficiently estimates material parameter space with multifidelity Gaussian process modeling.

problem Estimating a region of material parameter space with similar precipitate shapes.
method Multifidelity Gaussian process modeling to reduce computational cost.
result Significant reduction in sampling cost for accurate LER estimation.

2L-FUSE enhances feature sparsity through kernel learning.

problem Sparsity and feature selection in regression tasks.
method 2-Layered kernel machines for learning a shape matrix and feature direction identification.
result Minimal yet informative feature sets are identified without losing predictive performance.

ML predicts alloy properties considering chemistry, processing, and data transformations.

problem Designing and predicting alloy properties in high-dimensional design space.
method Physics-informed machine learning with engineered features from chemistry and heat treatment.
result ML models accurately predict alloy properties, including hysteresis in shape memory alloys.

Deep model predicts shapes of curves with multiple covariates.

problem Predicting shapes of planar curves with various covariates.
method Deep learning model using complex-valued functions, conditional covariance smoother with modality-specific encoders.
result Model accurately predicts shapes of curves with multimodal covariates.