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

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920172026
48 results for Ground metric

A new method learns meaningful distances between samples using optimal transport.

problem Learning meaningful distances between samples in datasets without labeled data.
method Computes OT distances between samples and features using singular vectors of a function mapping ground metrics to OT distances.
result Wasserstein Singular Vectors provide a scalable solution for unsupervised ground metric learning.

Optimal transport (OT) distances between probability distributions are parameterized by the ground metric they use between observations. Their relevance for real-life applications strongly hinges on whether that ground metric parameter is suitably chosen. Selecting it adaptively and algorithmically from prior knowledge…

2019-11-08abs ↗pdf ↗

Transportation distances have been used for more than a decade now in machine learning to compare histograms of features. They have one parameter: the ground metric, which can be any metric between the features themselves. As is the case for all parameterized distances, transportation distances can only prove useful in…

2011-10-11abs ↗pdf ↗

The paper identifies magnetic ground states and their role in determining the conformal class of a surface.

problem Understanding the magnetic ground states and their relation to the conformal class of a surface.
method Analyzing the magnetic Laplacian and its eigenvalues on a Riemannian surface.
result The ground state spectrum uniquely determines the volume and conformal class of the metric.

Paper introduces metrics to evaluate missing data imputation without ground truth.

problem Handling missing data in time series without ground truth.
method Introduces Wasserstein distance (WD) and Jensen-Shannon divergence (JSD) as metrics to evaluate imputation quality.
result WD and JSD are effective metrics for assessing missing data imputation quality.

Unsupervised clustering can reproduce categorization systems if features and metrics are correctly selected.

problem Reproducing expert-provided categorization systems using unsupervised clustering.
method Investigated using toy datasets and real-world fund categorization. Used appropriate feature selection and a supervised Random Forest-based distance metric.
result Unsupervised clustering can reproduce ground truth classes if features and metrics are correctly selected.

Generative Adversial Networks (GANs) have made a major impact in computer vision and machine learning as generative models. Wasserstein GANs (WGANs) brought Optimal Transport (OT) theory into GANs, by minimizing the 11-Wasserstein distance between model and data distributions as their objective function. Since then, W…

2019-02-10abs ↗pdf ↗

RealCause provides a realistic benchmark for causal inference.

problem Lack of a reliable benchmark for comparing causal effect estimators.
method Flexible generative models to create a benchmark that is both ground-truth and realistic.
result Evaluation of over 1500 causal estimators provides evidence for choosing hyperparameters using predictive metrics.

New method estimates model performance bounds without ground truth labels.

problem Evaluation of weakly supervised models without direct access to ground truth labels.
method Formulates model evaluation as a partial identification problem and uses Fréchet bounds for performance estimation.
result Derives accurate and computationally efficient bounds for key metrics like accuracy, precision, recall, and F1-score.

Interferometric Synthetic Aperture Radar (InSAR) imagery for estimating ground movement, based on microwaves reflected off ground targets is gaining increasing importance in remote sensing. However, noise corrupts microwave reflections received at satellite and contaminates the signal's wrapped phase. We introduce Conv…

2020-01-20abs ↗pdf ↗

The study categorizes reward errors in reinforcement learning, finding some can be beneficial.

problem Training language models with imperfect proxy rewards.
method Theoretical analysis of policy gradient optimization and categorization of reward errors.
result Reward errors can be benign or even beneficial, preventing policy from stalling.

Proposes a method to choose thresholds for LLM evaluation metrics.

problem Ensuring reliable large language models (LLMs) with correct threshold selection.
method Identify risks, stakeholders' risk tolerance, and use ground-truth data to determine thresholds.
result Demonstrates a concrete example with the Faithfulness metric and HaluBench dataset.

We define a novel class of distances between statistical multivariate distributions by modeling an optimal transport problem on their marginals with respect to a ground distance defined on their conditionals. These new distances are metrics whenever the ground distance between the marginals is a metric, generalize both…

2018-12-19abs ↗pdf ↗

Evaluates change point detection algorithms on real-world data.

problem Insufficient evaluation of change point detection algorithms on real-world time series.
method Developed a data set of 37 time series from various domains, annotated by human experts, and evaluated 14 algorithms using consistency metrics.
result Demonstrates the need for better evaluation methods in change point detection.

Statistical analysis of Diffusion Tensor Imaging (DTI) data requires a computational framework that is both numerically tractable (to account for the high dimensional nature of the data) and geometric (to account for the nonlinear nature of diffusion tensors). Building upon earlier studies that have shown that a Rieman…

2012-10-10abs ↗pdf ↗

New framework to test neural network representation similarity measures.

problem Disagreements among dissimilarity measures in neural networks.
method Statistical testing framework to evaluate measures based on functional behavior.
result Current metrics have different weaknesses; a classical baseline performs surprisingly well.

TemperatureGAN generates hourly atmospheric temperature data with high fidelity.

problem Generating accurate hourly atmospheric temperature data for climate risk assessment.
method Generative Adversarial Network (GAN) conditioned on months, locations, and time periods.
result TemperatureGAN produces high-fidelity hourly atmospheric temperature data with good spatial and temporal consistency.

We present a novel algorithm that predicts the probability that the time derivative of the horizontal component of the ground magnetic field dB/dtdB/dt exceeds a specified threshold at a given location. This quantity provides important information that is physically relevant to Geomagnetically Induced Currents (GIC), whic…

2019-12-02abs ↗pdf ↗

Consider a sample of nn points taken i.i.d from a submanifold ΣΣ of Euclidean space. We show that there is a way to estimate the Ricci curvature of ΣΣ with respect to the induced metric from the sample. Our method is grounded in the notions of Carré du Champ for diffusion semi-groups, the theory of Empirical process…

2014-10-13abs ↗pdf ↗

Study on ground states of semilinear elliptic equations with various potential wells.

problem Characterizing ground states of semilinear elliptic equations with arbitrary potential wells.
method Analyzing solutions in convex domains and manifolds with non-negative Ricci curvature, using Morse theory and min-max methods.
result Ground states are mountain-pass type with Morse index 1 in convex domains and manifolds with non-negative Ricci curvature.

Ground-A-Video edits videos without training, preserving intended changes.

problem Complex multi-attribute video editing with omitted or wrong changes.
method Grounding-guided video-to-video translation with Cross-Frame Gated Attention.
result Zero-shot multi-attribute video editing with improved accuracy and frame consistency.

A new method matches measures across different spaces using cost-regularized optimal transport.

problem Matching measures in different spaces without aligned data.
method Cost-regularized optimal transport formulation to match measures across two Euclidean spaces.
result Demonstrated applicability to single-cell spatial transcriptomics/multiomics matching tasks.

Metrics assess uncertainty structure and distribution for regression models.

problem Quantifying uncertainty in high-dimensional and nonlinear regression tasks.
method Two bounded comparison metrics for uncertainty structure and distribution.
result DNNs and DNOs provide encouraging uncertainty metric values in high dimensions.

Recent work in distance metric learning has focused on learning transformations of data that best align with provided sets of pairwise similarity and dissimilarity constraints. The learned transformations lead to improved retrieval, classification, and clustering algorithms due to the better adapted distance or similar…

2016-03-11abs ↗pdf ↗

New algorithms sample from complex path measures using neural networks.

problem Sampling from posterior path measures under a general prior process.
method Combines controlled equilibrium dynamics and optimization in infinite-dimensional probability space.
result The algorithms can be integrated with neural networks for learning target trajectory ensembles.

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.

CREAM models enable concept-grounded predictions and interpretability.

problem Designing models that can encode and extend prior knowledge about concept-concept and concept-task relationships.
method Proposes a flexible and efficient framework (CREAMs) that encodes arbitrary CCC-C and CoYC o Y relationships, incorporating a side-channel for incomplete concept sets.
result CREAM models achieve competitive task performance while encouraging concept-grounded predictions, avoiding concept leakage and achieving black-box-level performance.