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

66131197262 · Jun 202019922001200920172026
48 results for metric reconstruction

The paper discusses algorithms for reconstructing curves with given Euclidean or affine curvatures.

problem Reconstructing planar curves with specified Euclidean or affine curvatures.
method The paper presents algorithms for curve reconstruction under the special Euclidean and equi-affine groups.
result The reconstructed curves are close to the original curves in terms of the specified curvatures.

We discuss whether it is possible to reconstruct a metric by its unparameterized geodesics, and how to do it effectively. We explain why this problem is interesting for general relativity. We show how to understand whether all curves from a sufficiently big family are umparameterized geodesics of a certain affine conne…

2011-01-11abs ↗pdf ↗

DCAE learns compact latent representations for one-class novelty detection.

problem Learning compact latent representations for one-class novelty detection.
method DCAE learns compact and collapse-free latent representations through internal discriminative layers of GANs, reconstructing in-class data finely and exclusively.
result DCAE achieves state-of-the-art performance on novelty and adversarial example detection.

Researchers reconstruct simple Riemannian manifolds from boundary wave arrival times.

problem Reconstructing Riemannian manifolds from unknown interior sources and arrival times.
method Discrete metric approximation using labeled Gromov--Hausdorff distance.
result Finite-time approximations converge to the true Riemannian manifold.

Improves point-cloud reconstruction by optimizing projections with self-attention.

problem Inefficient and non-metric projection methods for sliced Wasserstein distances.
method Proposes distributional sliced Wasserstein distance with self-attention for permutation-invariant and metric optimization.
result Self-attention amortized distributional projection optimization achieves better performance in point-cloud reconstruction.

Using a metric related to the returns correlation, a method is proposed to reconstruct an economic space from the market data. A reduced subspace, associated to the systematic structure of the market, is identified and its dimension related to the number of terms in factor models. Example were worked out involving sets…

2002-11-06abs ↗pdf ↗

End-to-end deep metric learning tackles multi-label image classification.

problem Multi-label image classification problem.
method Two-way deep distance metric learning in a latent space with a reconstruction module.
result Our method outperforms state-of-the-arts on publicly available image datasets.

Given a compact manifold with boundary with unknown Riemannian metric. The problem is to reconstruct the metric in a class of conformal metrics from knowledge of lengths of all closed geodesics (kinematic data). An integral inequality is stated which implies uniqueness and stability for this problem. If the conformal c…

2012-02-24abs ↗pdf ↗

This paper proposes a new evaluation metric and boosting method for weight separability in neural network design. In contrast to general visual recognition methods designed to encourage both intra-class compactness and inter-class separability of latent features, we focus on estimating linear independence of column vec…

2019-10-20abs ↗pdf ↗

Study the tradeoff between signal distortion and human perception over finite channels.

problem Characterize the distortion-perception tradeoff for finite channels with arbitrary metrics.
method Solve linear programming problems to compute the distortion-perception function and optimal reconstructions.
result DP function is piecewise linear in the perception index.

A ML-based method reconstructs 3D organ doses from 2D radiographs for pediatric abdominal radiotherapy.

problem Reconstructing detailed 3D dose distributions for childhood cancer survivors using limited 2D radiographs.
method Surrogate-free ML approach using 142 abdominal planning CTs, 300 artificial plans, and evolutionary algorithm.
result Accurate 3D dose reconstructions with MAEs ≤ 1.7 Gy for edge organs, validated on independent dataset.

Unified SVD compression fails in practical tasks, highlighting the importance of per layer activation reconstruction.

problem The failure of a unified SVD compression method in practical tasks like perplexity and accuracy.
method Unified optimization problem for SVD based compression methods, focusing on cross-layer coupling.
result Downstream metrics like perplexity and accuracy degrade severely compared to standard per layer SVD LLM.

We study the geometric Whitney problem on how a Riemannian manifold (M,g)(M,g) can be constructed to approximate a metric space (X,dX)(X,d_X). This problem is closely related to manifold reconstruction where a smooth nn-dimensional submanifold SRmS\subset {\mathbb R}^m, m>nm>n needs to be constructed to approximate a point clo…

2015-08-04abs ↗pdf ↗

Topolow embeds dissimilarity data into Euclidean space robustly against non-metricity and sparsity.

problem Embedding dissimilarity data into Euclidean space when dissimilarities are non-metric or sparse.
method Topolow uses a physics-inspired, gradient-free optimization framework to maximize likelihood under a Laplace error model.
result Topolow outperforms standard MDS methods in reconstructing sparse and non-Euclidean data.

It is well-known that a compact Riemannian spin manifold can be reconstructed from its canonical spectral triple which consists of the algebra of smooth functions, the Hilbert space of square integrable spinors and the Dirac operator. It seems to be a folklore fact that the metric can be reconstructed up to conformal e…

2007-04-17abs ↗pdf ↗

iTimER learns from reconstruction errors to represent irregularly sampled time series.

problem Learning from irregularly sampled time series with missing data.
method iTimER models reconstruction errors as a proxy for unobserved values, using a mixup strategy and a Wasserstein metric.
result iTimER outperforms state-of-the-art methods in classification, interpolation, and forecasting tasks.

ENSURE framework trains deep image recon algorithms without clean data.

problem Lack of clean, fully sampled ground-truth data for deep learning image reconstruction.
method Introduces ENSURE framework, a generalization of SURE and GSURE to random sampling patterns.
result ENSURE loss function is an unbiased estimate for true mean-square error.

We prove that a potential qq can be reconstructed from the Dirichlet-to-Neumann map for the Schrodinger operator Δg+q-Δ_g + q in a fixed admissible 3-dimensional Riemannian manifold (M,g)(M,g). We also show that an admissible metric gg in a fixed conformal class can be constructed from the Dirichlet-to-Neumann map for $Δ_…

2010-11-02abs ↗pdf ↗

Study improves confidence measures in medical imaging pipelines by addressing bias.

problem Bias in metric-based imaging pipelines compromises the efficiency of prediction intervals.
method Formalized symmetric and asymmetric CP formulations, analyzed bias effects, and validated empirically.
result Symmetric intervals are inflated by bias, while asymmetric intervals remain unaffected.

RADAR uses diffusion models to detect anomalies without reconstruction, improving accuracy and efficiency.

problem Challenges in anomaly detection and segmentation, especially in real-time applications.
method RADAR uses attention-based diffusion models to directly produce anomaly maps from the diffusion process, bypassing reconstruction.
result RADAR improves F1 score by 7% on MVTec-AD and 13% on 3D-printed material compared to state-of-the-art methods.

This paper reconstructs complex graph signals using kernel methods on manifolds.

problem Reconstructing complex graph signals from samples on graph vertices.
method Kernel methods on complex manifolds, embedding vertices into higher-dimensional spaces.
result Effective reconstruction of complex graph signals, outperforming conventional methods.

Given a bounded domain MM in Rn\mathbb{R}^n with a conformally Euclidean metric g=ρdx2g=ρ\,dx^2, in this paper we consider the inverse problem of recovering a semigeodesic neighborhood of a domain ΓMΓ\subset \partial M and the conformal factor ρρ in the neighborhood from the travel time data (defined below) and the Carte…

2014-09-28abs ↗pdf ↗

Deep learning is having a profound impact in many fields, especially those that involve some form of image processing. Deep neural networks excel in turning an input image into a set of high-level features. On the other hand, tomography deals with the inverse problem of recreating an image from a number of projections.…

2017-01-02abs ↗pdf ↗

The paper introduces a method for dimension reduction using sub-Riemannian geometry.

problem Dimension reduction for manifold learning and surface reconstruction.
method Combining local linear approximations of a point cloud to obtain lower dimensional bundles.
result Sub-Riemannian geodesics can successfully be applied to problems like constructing an approximating submanifold and computing distances.

The paper analyzes discrete approximations to minimize curve length in Euclidean space.

problem Minimizing the length of curves between two sets in Euclidean space.
method Finite differences and numerical integration for discrete approximations.
result The squared length of the reconstructed curve converges to the squared minimal length with rate O(N1/2)O(N^{-1/2}).

This paper analyzes how training data can be leaked from gradients in neural networks and proposes a metric for measuring model security.

problem Training data leakage from gradients in neural networks for image classification.
method Formulated the problem as an optimisation problem for each layer, involving weights, gradients, and constraints from preceding layers.
result Attributed training data leakage to the architecture of the deep network and proposed a metric for measuring model security.