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

100200299399 · May 202619922001200920172026
48 results for consistency metric

CCE improves anomaly detection metrics by measuring both confidence and consistency.

problem Existing anomaly detection metrics lack discriminative power, hyperparameter dependency, and robustness to perturbations.
method CCE uses Bayesian estimation to quantify uncertainty and constructs global and event-level confidence and consistency scores.
result CCE demonstrates strict boundedness, robustness, and linear time complexity.

We extend a recently proposed 1-nearest-neighbor based multiclass learning algorithm and prove that our modification is universally strongly Bayes-consistent in all metric spaces admitting any such learner, making it an "optimistically universal" Bayes-consistent learner. This is the first learning algorithm known to e…

2019-06-24abs ↗pdf ↗

Consistent algorithms for multiclass learning with complex metrics and constraints.

problem Learning with complex performance metrics and constraints.
method General framework for designing consistent algorithms by viewing the problem as an optimization over feasible confusion matrices.
result Rates of convergence to the optimal (feasible) classifier, showing asymptotic consistency.

Prototype rules simplify multiclass classification in metric spaces, achieving consistency and reduced complexity.

problem Multiclass classification in metric spaces, focusing on universal consistency and convergence rates.
method Novel Proto-NN and hybrid rules for multiclass classification in metric spaces, analyzing convergence rates.
result Proto-NN is universally consistent and simpler to implement, with similar computational advantages.

Learning rule consistency tied to non-existence of real-valued measurable cardinals.

problem Consistency of k-NN learning rule in metric spaces.
method Analyzing separable subspaces and density conditions.
result The k-NN classifier's consistency depends on the absence of real-valued measurable cardinals.

Study finds AUC is most consistent across different prevalence in binary classification.

problem Consistency of model evaluation metrics across varying prevalence in binary classification.
method Analysis of 156 data scenarios with 18 metrics, 5 models, and a random guess model.
result AUC has the smallest variance in evaluating individual models and ranking of models.

Develops algorithms for optimizing multi-label metrics with provable guarantees.

problem Optimizing complex multi-label metrics like F-measure and Jaccard index.
method Principled learning algorithms based on H-consistency for generalized metrics.
result Provable HH-consistency bounds for multi-label metric optimization.

This paper establishes a theoretical foundation for consistency training in diffusion models.

problem Lack of a comprehensive theoretical understanding of consistency training in diffusion models.
method Demonstrates the necessity of a number of steps in consistency learning exceeding d5/2/εd^{5/2}/\varepsilon for generating samples within ε\varepsilon proximity to the target distribution.
result Establishes rigorous insights into the validity and efficacy of consistency models, offering theoretical underpinnings for their utility.

The nearest neighbor rule is proven consistent in a broad setting.

problem Proving consistency of the nearest neighbor rule in various settings.
method Proving online consistency for all measurable functions in doubling metric spaces under mild assumptions.
result The nearest neighbor rule is online consistent in all measurable functions in doubling metric spaces.

We propose a framework for constructing and analyzing multiclass and multioutput classification metrics, i.e., involving multiple, possibly correlated multiclass labels. Our analysis reveals novel insights on the geometry of feasible confusion tensors -- including necessary and sufficient conditions for the equivalence…

2019-08-24abs ↗pdf ↗

A new framework for consistent segmentation evaluation reduces operating losses.

problem Inconsistent thresholding-based segmentation methods lead to suboptimal solutions.
method Developed a consistent ranking-based framework (RankDice/RankIoU) using Bayes rules and Dice-/IoU-calibration.
result The proposed framework is Dice-/IoU-calibrated and provides excess risk bounds and convergence rates.

Curved Frobenius manifolds link to Hessian metrics in geometry.

problem Understanding curved Frobenius manifolds and their relation to Hessian metrics.
method Analyzing the relationship between curved Frobenius structures and Hessian metrics on spaces with non-vanishing curvature.
result Consistent curved Frobenius structures on constant curvature spaces are linked to Hessian metrics.

Novel framework for uncertainty quantification in metric spaces.

problem Uncertainty quantification in regression models with metric responses.
method Developed algorithms for large datasets, agnostic to predictive models, with asymptotic and non-asymptotic guarantees.
result Asymptotic and non-asymptotic guarantees for special cases, demonstrated in clinical applications.

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.

New method evaluates language model forecasters by checking consistency of predictions.

problem Evaluating the performance of language model forecasters is difficult due to lack of ground truth.
method Developed a consistency check framework based on arbitrage to evaluate forecasters.
result Consistency metrics correlate with ground truth performance of LLM forecasters.

We consider the space of all quasifuchsian metrics on the product of a surface with the real line. We show that, in a neighborhood of the submanifold consisting of fuchsian metrics, every non-fuchsian metric is completely determined by the bending data of its convex core.

2002-10-16abs ↗pdf ↗

Saliency maps are a popular approach to creating post-hoc explanations of image classifier outputs. These methods produce estimates of the relevance of each pixel to the classification output score, which can be displayed as a saliency map that highlights important pixels. Despite a proliferation of such methods, littl…

2019-11-29abs ↗pdf ↗

In many structured prediction problems, complex relationships between variables are compactly defined using graphical structures. The most prevalent graphical prediction methods---probabilistic graphical models and large margin methods---have their own distinct strengths but also possess significant drawbacks. Conditio…

2018-11-07abs ↗pdf ↗

Study shows kk-NN classifier is not universally consistent on (0,1)(0,1) but consistent on discrete and specific measure spaces.

problem Consistency of kk-NN classifier under Wasserstein distance on measure spaces.
method Analysis of kk-NN classifier properties under Wasserstein distance, use of σσ-finite metric dimension, geodesic structures of Wasserstein spaces.
result Consistency of kk-NN classifier on specific measure spaces (discrete, Gaussian, wavelet series) but not on (0,1)(0,1).

Conditional Generative Adversarial Networks (cGANs) are finding increasingly widespread use in many application domains. Despite outstanding progress, quantitative evaluation of such models often involves multiple distinct metrics to assess different desirable properties, such as image quality, conditional consistency,…

2019-07-11abs ↗pdf ↗

New algorithms optimize metrics for binary classification with class imbalance.

problem Optimizing metrics like Fβ, AM, Jaccard for imbalanced classes.
method Reformulates metric optimization as cost-sensitive learning, using surrogate loss functions.
result METRO algorithms provide strong theoretical guarantees and outperform baselines.

Proposes a neural network method to improve consistencies in high dimensional data analysis.

problem Inconsistencies among dimensionality reduction, clustering, and visualization tasks in high dimensional data analysis.
method Consistent Representation Learning (CRL) neural network that performs NLDR transformations to satisfy LGP constraints.
result Improves consistencies in data interpretation through end-to-end task execution.

Note shows equivalence of recent NEC reformulation to classical NEC for C2C^2-metrics.

problem Consistency of null energy condition in Lorentzian length spaces.
method Shows equivalence of recent reformulation of null energy condition to classical formulation for C2C^2-metrics.
result Equivalence of recent reformulation of null energy condition to classical formulation for C2C^2-metrics.

Deconfounds neural network representation similarity metrics to improve consistency and accuracy.

problem Confounding by population structure in similarity metrics like RSA and CKA.
method Covariate adjustment regression to adjust for confounders.
result Improves detection of semantically similar neural networks and consistency in transfer learning.

A new metric assesses causal graphs using node permutations to detect inconsistencies.

problem Quantifying the goodness of causal graphs and distinguishing them from random graphs.
method Constructing a baseline through node permutations and comparing inconsistencies.
result The proposed metric can distinguish between true and wrong causal graphs.

Paper tackles efficient learning of non-convex hypotheses in metric spaces.

problem Efficiently find consistent hypotheses for non-convex hypotheses composed of possibly several disconnected regions.
method Proposes a general domain-independent algorithm for finding consistent weakly convex hypotheses and proves sufficient conditions for its efficiency.
result Shows that consistent hypothesis finding problem can be solved in polynomial time for a broad class of weakly convex hypotheses over metric spaces.

A unique hyperbolic metric is found for each spherical cone-metric on the boundary of a hyperbolizable 3-manifold.

problem Finding a hyperbolic metric for a given spherical cone-metric on the boundary of a hyperbolizable 3-manifold.
method Constructing a strictly polyhedral hyperbolic metric on the 3-manifold such that the given spherical cone-metric is the induced dual metric on the boundary.
result The existence and uniqueness of a strictly polyhedral hyperbolic metric for a given spherical cone-metric on the boundary of a hyperbolizable 3-manifold.

In this paper, we give two classes of positive semi-definite metrics on 2-manifolds. The one is called a class of Kossowski metrics and the other is called a class of Whitney metrics: The pull-back metrics of wave fronts which admit only cuspidal edges and swallowtails in R3\boldsymbol{R}^3 are Kossowski metrics, and t…

2014-09-01abs ↗pdf ↗