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.

169,051 papers · 148 categories

Trend · papers per month

2.5%4.9%7.4%9.9% · May 202619922001200920182026
48 results for SCORE

This work improves likelihood of score-based diffusion ODEs using high-order denoising score matching.

problem The gap between maximum likelihood and score matching objectives for score-based diffusion ODEs.
method High-order denoising score matching to maximize likelihood.
result Score-based diffusion ODEs achieve better likelihood on synthetic and CIFAR-10 data.

A new method improves data generation quality by correcting score mismatches.

problem Score mismatch issue in conditional score-based data generation methods.
method Denoising Likelihood Score Matching (DLSM) loss for classifier training.
result The proposed method outperforms previous methods on Cifar-10 and Cifar-100 benchmarks.

New scoring rules improve probabilistic classification model evaluation.

problem Traditional scoring rules misalign with the preference for correct classifications.
method Introduces Penalized Brier Score (PBS) and Penalized Logarithmic Loss (PLL) to modify proper scoring rules.
result PBS and PLL better identify optimal checkpoints and early stopping points, leading to superior F1 scores.

New scoring rules for multivariate distributions and level sets.

problem Evaluating forecast accuracy for multivariate distributions and level sets.
method Theoretical framework for scoring rules, decomposition of multivariate scoring functions, numerical algorithm for computation.
result New scoring functions for multivariate distributions and level sets, including density and cumulative distribution level sets.

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.

A new method for estimating complex models and high-dimensional data.

problem Difficulty in computing Hessian of log-density functions for complex models and high-dimensional data.
method Sliced score matching, which projects scores onto random vectors before comparison.
result Sliced score matching can learn deep energy-based models and produce accurate score estimates.

Improved score matching methods for estimating score functions and Hessians without high dimensionality.

problem Estimating score functions and Hessians efficiently in high-dimensional data.
method Implicit score matching and denoising score matching, leveraging Gagliardo-Nirenberg inequalities.
result Achieves convergence rates similar to denoising score matching and estimates Hessians without dimensionality issues.

Map projections can reverse district compactness scores, affecting fairness evaluations.

problem District compactness scores can be reordered by map projections, impacting fairness evaluations.
method Mathematical proof and empirical demonstration of map projection effects on compactness scores.
result Map projections can reverse the order of compactness scores, altering fairness evaluations.

The statistical leverage scores of a complex matrix ACn×dA\in\mathbb{C}^{n\times d} record the degree of alignment between col(A)(A) and the coordinate axes in Cn\mathbb{C}^n. These score are used in random sampling algorithms for solving certain numerical linear algebra problems. In this paper we present a max-plus algebr…

2016-09-29abs ↗pdf ↗

Two-stage scoring approach for P2P lending improves loan profitability prediction.

problem Class imbalance and lack of profitability prediction in existing scoring methods.
method Integrates credit scoring and profit scoring using wide and deep learning.
result Two-stage scoring approach outperforms existing methods in loan profitability prediction.

Score matching is a recently developed parameter learning method that is particularly effective to complicated high dimensional density models with intractable partition functions. In this paper, we study two issues that have not been completely resolved for score matching. First, we provide a formal link between maxim…

2012-05-09abs ↗pdf ↗

The paper establishes bounds for score-matching in causal discovery and generative modeling.

problem Estimating causal relationships from data.
method Training a deep neural network to estimate the score function and applying it to causal discovery.
result Bounds on the error rate of causal discovery methods using score-matching.

The paper investigates the convergence of Vendi scores under finite samples and introduces a truncated version for better performance.

problem The Vendi score's convergence is hindered by computational limitations when using large sample sizes.
method The authors introduce the t-truncated Vendi score to address this issue by truncating the eigenspectrum of the kernel matrix.
result The t-truncated Vendi score converges to its asymptotic limit with a smaller number of samples, improving upon the standard Vendi score.

This paper introduces and develops a novel variable importance score function in the context of ensemble learning and demonstrates its appeal both theoretically and empirically. Our proposed score function is simple and more straightforward than its counterpart proposed in the context of random forest, and by avoiding …

2015-01-25abs ↗pdf ↗

Study compares different scoring rules for machine-learned weather forecasts, finding scale-awareness improves forecast realism.

problem Improving the accuracy of machine-learned probabilistic weather forecasts.
method Comparison of scoring rules (CRPS, fair global energy score, graph energy score) and analysis of their impact on forecast field spectra.
result Scale-awareness improves forecast realism, particularly in the tropics.

Score-fPINN tackles high-dimensional FPL equations using fractional score functions.

problem High-dimensional Fokker-Planck-Lévy equations with non-Brownian processes.
method Fractional score function and Physics-informed neural networks (PINN) to solve CoD and numerical overflow.
result Effective solution to high-dimensional FPL equations without fractional Laplacian.

Neural score matching improves high-dimensional causal inference by using neural networks for balancing scores.

problem Impracticality of traditional matching methods in high-dimensional datasets due to the curse of dimensionality.
method Develops neural networks to create non-trivial, multivariate balancing scores for high-dimensional causal inference.
result Neural score matching outperforms other methods in treatment effect estimation and reducing imbalance on high-dimensional datasets.

Langevin dynamics fails to produce accurate samples even with small score function errors.

problem Robustness of Langevin dynamics to score function errors.
method Analysis of Langevin dynamics and score function errors.
result Langevin dynamics produces a distribution far from the target distribution in TV distance even with small L2L^2 errors in the score function.

Paper optimizes score transformation for fair binary classification.

problem Ensuring fairness in binary classification with predicted scores.
method Formulates and solves a convex optimization problem for transforming scores to meet fairness constraints.
result Derives a closed-form expression for optimal transformed scores and provides guarantees for finite sample settings.

The paper introduces tools for designing responsible scoring mechanisms using unbiased function sampling.

problem Ensuring fairness and responsibility in scoring mechanisms used by data-driven systems.
method Unbiased function sampling and perturbation in the function space for designing responsible scoring mechanisms.
result A novel algorithm for approximating the construction of hyperplane arrangements, which is linear in the number of samples and hyperplanes.

Computational approaches to drug discovery can reduce the time and cost associated with experimental assays and enable the screening of novel chemotypes. Structure-based drug design methods rely on scoring functions to rank and predict binding affinities and poses. The ever-expanding amount of protein-ligand binding an…

2016-12-08abs ↗pdf ↗

Model selection for time series forecasting can be biased by the distribution of scores.

problem Model selection for probabilistic forecasting on time series data.
method Using proper scoring rules to aggregate scores across multiple time series.
result The mean score is immune to the skewness of the score distribution.