In the practice of point prediction, it is desirable that forecasters receive a directive in the form of a statistical functional, such as the mean or a quantile of the predictive distribution. When evaluating and comparing competing forecasts, it is then critical that the scoring function used for these purposes be co…
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
48 results for “consistent scoring functions”
A framework for sensitivity measures using scoring functions.
problem Constructing sensitivity measures for any elicitable functional.
method Score-based sensitivities constructed via consistent scoring functions.
result Demonstrated intuitive and desirable properties of score-based sensitivities.
Observational cohort studies with oversampled exposed subjects are typically implemented to understand the causal effect of a rare exposure. Because the distribution of exposed subjects in the sample differs from the source population, estimation of a propensity score function (i.e., probability of exposure given basel…
Identification and scoring functions are statistical tools to assess the calibration and the relative performance of risk measure estimates, e.g., in backtesting. A risk measures is called identifiable (elicitable) it it admits a strict identification function (strictly consistent scoring function). We consider measure…
A statistical functional, such as the mean or the median, is called elicitable if there is a scoring function or loss function such that the correct forecast of the functional is the unique minimizer of the expected score. Such scoring functions are called strictly consistent for the functional. The elicitability of a …
Robustifies elicitable functionals to handle small distribution misspecifications.
problem Determining uniquely optimal forecasts under distributional misspecification.
method Integrates statistical robustness into elicitable functionals using Kullback-Leibler divergence.
result Robust elicitable functionals admit unique solutions at the boundary of uncertainty regions.
Improves conformal prediction by combining multiple score functions and optimizing weights.
problem Limitations of single-score conformal predictors in multi-class classification.
method Combines multiple score functions and optimizes weights to minimize prediction set size.
result Consistently outperforms single-score conformal predictors while maintaining valid coverage.
This paper considers fair probabilistic binary classification where the outputs of primary interest are predicted probabilities, commonly referred to as scores. We formulate the problem of transforming scores to satisfy fairness constraints that are linear in conditional means of scores while minimizing a cross-entropy…
Predictions are issued on the basis of certain information. If the forecasting mechanisms are correctly specified, a larger amount of available information should lead to better forecasts. For point forecasts, we show how the effect of increasing the information set can be quantified by using strictly consistent scorin…
The debate of what quantitative risk measure to choose in practice has mainly focused on the dichotomy between Value at Risk (VaR) -- a quantile -- and Expected Shortfall (ES) -- a tail expectation. Range Value at Risk (RVaR) is a natural interpolation between these two prominent risk measures, which constitutes a trad…
We address the problem of learning vector representations for entities and relations in Knowledge Graphs (KGs) for Knowledge Base Completion (KBC). This problem has received significant attention in the past few years and multiple methods have been proposed. Most of the existing methods in the literature use a predefin…
Novel estimator reduces diffusion model variance.
problem High variance in score function estimation for diffusion models.
method Uses nearest neighbour samples to estimate the score function.
result Significant decrease in variance, leading to improved model performance.
Paper explores connections between loss functions and consistency in binary classification and regression.
problem Consistency in binary classification and regression applications.
method Characterization of conformable loss functions and derivation of a new Huber-type loss function.
result Margin-based loss functions are equivalent to loss functions of squared standardized logistic regression residuals.
Semiparametric KSD test: unifying score and distance-based approaches for goodness-of-fit testingstat.ML
Unified score and distance-based GoF tests for model adequacy.
problem Difficulty in extending score-based GoF tests to nonparametric alternatives.
method Introducing semiparametric kernelized Stein discrepancy (SKSD) test.
result SKSD test is computationally efficient and universally consistent.
Paper introduces new loss functions for multi-class abstention learning.
problem Learning with multi-class classification and the ability to abstain.
method Developed new families of surrogate losses for abstention.
result Proved strong consistency guarantees for new surrogate losses.
Gini index needs auto-calibration for consistent decision-making.
problem Gini index's inconsistency in decision-making.
method Restrict Gini index to auto-calibrated regression models.
result Gini index becomes strictly consistent with auto-calibration.
CTM improves diffusion model sampling quality with efficient ODE traversal.
problem Lack of natural trade-off between sample quality and speed in consistency models.
method CTM trains a neural network to output scores and traverse ODE trajectories efficiently.
result CTM achieves state-of-the-art FIDs and improves sample quality with increased computational budget.
In statistical analysis, measuring a score of predictive performance is an important task. In many scientific fields, appropriate scores were tailored to tackle the problems at hand. A proper score is a popular tool to obtain statistically consistent forecasts. Furthermore, a mathematical characterization of the proper…
The paper analyzes elicitability of return risk measures and their scoring functions.
problem Elicitability of return risk measures and their scoring functions.
method Dual representation results for convex and geometrically convex return risk measures, axiomatic characterizations of Orlicz premia, and construction of strictly consistent scoring functions.
result Orlicz premia are the only elicitable return risk measures under different sets of conditions.
Proposes methods to estimate posterior probability and propensity score functions without assuming constant propensity score.
problem Learning from biased positive-unlabeled data.
method Parametric approach to joint estimation of posterior probability and propensity score functions using maximum likelihood and alternating maximization.
result Proposed methods are comparable or better than existing methods based on Expectation-Maximisation scheme.
Topological anomaly scores predict return curves in S&P 500 stocks
problem Detecting anomalies in financial time series
method BallMapper, decoder-conditional VAE, Function-on-Function regression
result Anomaly history carries predictive content for return curves
Score matching is a popular method for estimating unnormalized statistical models. However, it has been so far limited to simple, shallow models or low-dimensional data, due to the difficulty of computing the Hessian of log-density functions. We show this difficulty can be mitigated by projecting the scores onto random…
We give a new consistent scoring function for structure learning of Bayesian networks. In contrast to traditional approaches to scorebased structure learning, such as BDeu or MDL, the complexity penalty that we propose is data-dependent and is given by the probability that a conditional independence test correctly show…
Provably Robust Score-Based Diffusion Posterior Sampling for Plug-and-Play Image Reconstructioneess.IV
Develops a robust method for image reconstruction from limited data.
problem Inference of unknown images from few measurements, often ill-posed.
method Introduces DPnP, a diffusion plug-and-play method combining likelihood and score-based samplers.
result Establishes performance guarantees for DPnP, demonstrating robustness and efficiency.
Enhances GANs by improving consistency regularization.
problem Improving the artifacts introduced by consistency regularization in GANs.
method Proposed modifications to consistency regularization to fix artifacts and improve performance.
result Significant improvement in FID scores on various GAN architectures.
EnScale: Temporally-consistent multivariate generative downscaling via proper scoring rulesphysics.ao-ph
EnScale learns to downscale climate models efficiently, capturing both spatial and temporal consistency.
problem Downscaling climate models from coarse to high-resolution data is computationally expensive and challenging.
method EnScale uses generative models and proper scoring rules to map GCM data to RCM data, reducing computational cost.
result EnScale achieves competitive performance and computational efficiency in downscaling multiple climate variables.
MAS scores cluster size consistency from points, robust to label changes.
problem Desired uniformity in cluster sizes, stability under label perturbations.
method Mass Agreement Score (MAS) measures point-centric cluster size consistency, robust to label changes.
result MAS yields similar scores for partitions with similar bulk structure, sensitive to genuine redistribution of cluster mass.
Classifies intrinsically linked tournaments by their score sequences.
problem Classifying intrinsically linked tournaments using their score sequences.
method Examining the score sequences of tournaments and identifying linkless sequences.
result The vast majority of score sequences for 8-vertex tournaments are linkless.
Score matching fails for general point processes, a new estimator improves accuracy.
problem Score matching estimators fail for general point processes.
method Introduced a weighted score matching estimator for point processes.
result The weighted score matching estimator accurately estimates model parameters on synthetic and real data.
This work extends diffusion models to function space for better generative modeling.
problem Limited applicability of diffusion models to functional data domains.
method Introduces Denoising Diffusion Operators (DDOs) for training diffusion models in function space.
result Demonstrates accurate function-valued generation at fixed cost.
This guide clarifies techniques for assessing and comparing model calibration and performance.
problem Assessing and comparing the calibration and performance of predictive models in insurance and actuarial practice.
method Clarifies statistical techniques for assessing model calibration and comparing models, emphasizing the importance of specifying the prediction target functional and choosing the appropriate scoring function.
result Provides guidance for the practical choice of scoring functions and illustrates results with real data case studies.
New scoring rules compare probabilistic top lists in classification.
problem Evaluation of probabilistic top lists in classification.
method Elicitability through symmetric proper scoring rules.
result Brier score provides a well-suited metric for comparison.
A new method optimizes anomaly scoring from score distribution to improve AD performance.
problem Vulnerability to anomaly contamination and lack of adaptability in existing AD methods.
method Optimizes anomaly scoring function from score distribution perspective, using Overlap loss.
result Overlap loss-based AD models significantly outperform state-of-the-art methods.
The paper examines the consistency of item embeddings in recommendation systems.
problem The relevance of averaging item embeddings for user or concept representation.
method Proposes an expected precision score to measure consistency and analyzes it theoretically and empirically.
result Real-world averages are less consistent for recommendation compared to theoretical assumptions.
Generative Adversarial Networks (GANs) are known to be difficult to train, despite considerable research effort. Several regularization techniques for stabilizing training have been proposed, but they introduce non-trivial computational overheads and interact poorly with existing techniques like spectral normalization.…
A new method for training diffusion models using likelihood matching.
problem Training efficient and accurate diffusion models.
method Likelihood Matching approach, quasi-likelihood approximation, score and Hessian estimation.
result Consistent matching of first two transitional moments between diffusion steps.
Graph-based semi-supervised learning is one of the most popular methods in machine learning. Some of its theoretical properties such as bounds for the generalization error and the convergence of the graph Laplacian regularizer have been studied in computer science and statistics literatures. However, a fundamental stat…
WS diffusion models handle anisotropic Gaussian noise better than conventional methods.
problem Handling anisotropic Gaussian noise in imaging inverse problems.
method Whitened Score (WS) diffusion models based on stochastic differential equations.
result WS DMs outperform conventional DMs on anisotropic Gaussian noise.
High-Dimensional Differential Parameter Inference in Exponential Family using Time Score Matchingstat.ML
Paper efficiently infers differential parameters in time-varying models using time score matching.
problem Efficiently inferring differential parameters in time-varying probabilistic models.
method Directly estimates the differential parameter using time score matching and proves consistency of the method.
result Consistent estimation of parameter derivatives in high-dimensional settings.
Learning how to rank multivariate unlabeled observations depending on their degree of abnormality/novelty is a crucial problem in a wide range of applications. In practice, it generally consists in building a real valued "scoring" function on the feature space so as to quantify to which extent observations should be co…
CNP improves few-shot learning for docking scores in molecular datasets.
problem Few observations of many related functions in chemical datasets.
method Conditional Neural Processes (CNP) applied to docking scores.
result CNP shows competitive performance in few-shot learning tasks.
Knowing when a classifier's prediction can be trusted is useful in many applications and critical for safely using AI. While the bulk of the effort in machine learning research has been towards improving classifier performance, understanding when a classifier's predictions should and should not be trusted has received …
Boosting method for causal SEMs from observational data.
problem Learning causal order among variables from observational data.
method Boosting-based approach with early stopping and component-wise gradient descent.
result Boosting with early stopping consistently favors the true causal ordering.
A faster method for density estimation using denoising score matching with random Fourier features.
problem Intractability of normalizing constant in density estimation.
method Denoising Score Matching with Random Fourier Features.
result The method is computationally faster and scalable to complex high-dimensional data.
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.
Proposes measures for uncertainty quantification using proper scoring rules.
problem Uncertainty quantification for prediction tasks.
method Decomposes proper scoring rules into divergence and entropy components, tailoring uncertainty quantification to specific tasks.
result Flexibility in uncertainty quantification improves performance in selective prediction and active learning.
New score-based methods identify causal structures with latent variables.
problem Identifying causal structures involving latent variables.
method Score-based methods with identifiability guarantees.
result Score equivalence and consistency for latent variable causal models.
We give a new consistent scoring function for structure learning of Bayesian networks. In contrast to traditional approaches to score-based structure learning, such as BDeu or MDL, the complexity penalty that we propose is data-dependent and is given by the probability that a conditional independence test correctly sho…