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

94187281374 · Jun 202019922001200920172026
48 results for validation metrics

CAI automates extraction and validation of corporate GHG emission metrics.

problem Manual extraction of corporate GHG emission metrics is labor-intensive and error-prone.
method CAI uses LLMs to automate extraction and validation of metrics from corporate disclosures.
result CAI improves data collection efficiency and accuracy by automating the process.

New method uses interval-based metric to validate prediction uncertainty in machine learning.

problem Validation of prediction uncertainty in machine learning regression tasks is unreliable due to heavy-tailed distributions.
method Shift from variance-based metrics to interval-based Prediction Interval Coverage Probability (PICP).
result PICP method more quickly and reliably tests prediction intervals than variance-based metrics.

This study revisits UQ validation methods based on consistency and adaptivity concepts.

problem Lack of comprehensive validation methods for UQ metrics across input feature ranges.
method Revisit and extend common validation methods for UQ metrics based on consistency and adaptivity concepts.
result Improved understanding and capabilities of UQ metrics validation methods.

metric-learn is an open source Python package implementing supervised and weakly-supervised distance metric learning algorithms. As part of scikit-learn-contrib, it provides a unified interface compatible with scikit-learn which allows to easily perform cross-validation, model selection, and pipelining with other machi…

2019-08-13abs ↗pdf ↗

In this paper two metric properties on geodesic length spaces are introduced by means of the metric projection, studying their validity on Alexandrov and Busemann NPC spaces. In particular, we prove that both properties characterize the non-positivity of the sectional curvature on Riemannian manifolds. Further results …

2016-02-12abs ↗pdf ↗

Analyzes metric spaces homeomorphic to manifolds, proving rigidity and inequalities.

problem Analyzing metric spaces homeomorphic to manifolds.
method Geometric and analytic approaches, proving existence of integral currents, establishing rigidity and inequalities.
result Metric manifolds admit non-trivial integral currents and satisfy isoperimetric inequalities.

Study validates Michor-Mumford conjecture in infinite dimensional Hilbertian H-type groups.

problem Validation of Michor-Mumford conjecture in infinite dimensional Hilbertian H-type groups.
method Introduced infinite dimensional Hilbertian H-type groups with weak, graded, left invariant Riemannian metrics and proved the vanishing of geodesic distance and local unboundedness of sectional curvature.
result Validation of Michor-Mumford conjecture linking geodesic distance vanishing to local unboundedness of sectional curvature.

Study evaluates synthetic data augmentation for small datasets, highlighting inconsistencies in traditional metrics.

problem Inconsistent validation of synthetic data generated for small sample sizes.
method Proposes a normalized Bottleneck distance metric to evaluate synthetic tabular data.
result Common metrics like propensity scoring and MMD fail for small datasets, showing instability and high variability.

We investigate the validity of the isometry extension property for (Riemannian) Einstein metrics on manifolds with boundary. Given a metric on the boundary, this is the issue of whether any Killing field of the boundary metric extends to a Killing field of any bulk or filling Einstein metric inducing the given data on …

2007-04-25abs ↗pdf ↗

Causal ML methods failed to validate their personalized treatment effects in two large trials.

problem Validating causal machine learning methods for personalized treatment effects in precision medicine.
method Assessed 17 mainstream causal heterogeneity ML methods using two large randomized controlled trials.
result None of the ML methods reliably validated their performance, internal or external, showing significant discrepancies between training and test data.

The goal of the paper is to study the angle between two curves in the framework of metric (and metric measure) spaces. More precisely, we give a new notion of angle between two curves in a metric space. Such a notion has a natural interplay with optimal transportation and is particularly well suited for metric measure …

2017-01-18abs ↗pdf ↗

This paper proposes a new AED framework for multi-metric experiments with fixed budget.

problem Statistical power challenges in testing multiple metrics simultaneously.
method Two-phase structure: adaptive exploration followed by validation. SHRVar algorithm with relative-variance-based sampling.
result Achieves provable error probability that decreases exponentially.

Improves test set performance and reduces out-of-sample disappointment for unstable models.

problem Ensuring strong test set performance via cross-validation for unstable models.
method Nested k-fold cross-validation with hyperparameter selection based on a weighted sum of cross-validation metric and model stability measure.
result Improves out-of-sample MSE for sparse ridge regression and CART by 4% and 2% respectively, compared to k-fold cross-validation.

Study reveals gaps between simulated and real-world treatment effect evaluation metrics.

problem Evaluation of treatment effect estimation models differs between academic and practical settings.
method Comprehensive empirical study comparing semi-simulated benchmarks and real-world datasets.
result Counterfactual metrics do not reliably predict observable metrics, and rankings from simulated benchmarks do not generalize to real-world data.

Real-world machine learning applications often have complex test metrics, and may have training and test data that are not identically distributed. Motivated by known connections between complex test metrics and cost-weighted learning, we propose addressing these issues by using a weighted loss function with a standard…

2018-05-27abs ↗pdf ↗

Proposes a neural network loss function for better uncertainty estimation.

problem Challenges in estimating predictive uncertainty of neural networks.
method Bayesian Validation Metric (BVM) framework with ensemble learning.
result Competitive and robust uncertainty estimation on in-distribution and out-of-distribution data.

Paper proves Hermitian-Yang-Mills metrics for stable Kähler bundles.

problem Existence of Hermitian-Yang-Mills metrics for Kähler vector bundles.
method Analyzes slope polystability and uses Kähler currents with singularities.
result Validates existence of Hermitian-Yang-Mills metrics for stable bundles and nef-big currents.

The paper broadens a mathematical correspondence to include more balanced metrics.

problem Extending a mathematical correspondence to a broader class of metrics.
method Using key observations and known theorems to apply results to a new class of metrics.
result The known results can be applied to a larger class of metrics, including those arising from multipolarizations.

The paper proves a Moser-Trudinger inequality on metric spaces with curvature-dimension conditions.

problem Proving a Moser-Trudinger inequality on metric measure spaces.
method Rearrangement of functions on CD(k,n)-spaces satisfying a Polya-Szegö type inequality.
result Characterization of manifolds with lower bounded Ricci curvature admitting a Moser-Trudinger inequality.

Optimal inequalities found between Riemannian and Hilbert metrics in convex projective domains.

problem Finding optimal bounds between Riemannian and Hilbert metrics in convex projective domains.
method Optimal control techniques applied to Riemannian metrics induced by centro-affine hypersurface immersions.
result Optimal inequalities between Riemannian and Hilbert metrics for a class of convex projective domains.

Recent work in metric learning has significantly improved the state-of-the-art in k-nearest neighbor classification. Support vector machines (SVM), particularly with RBF kernels, are amongst the most popular classification algorithms that uses distance metrics to compare examples. This paper provides an empirical analy…

2012-08-16abs ↗pdf ↗