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

2585177751,033 · Jun 202019922001200920172026
48 results for Measurement improvement

Improves risk and variability measures continuity and consistency.

problem Improving the continuity and consistency of risk and variability measures.
method Analyzes convex and order bounded above functionals on Frechet lattices and Orlicz spaces.
result Order-continuous, law-invariant functionals on Orlicz spaces are strongly consistent everywhere.

We propose a modification that corrects for split-improvement variable importance measures in Random Forests and other tree-based methods. These methods have been shown to be biased towards increasing the importance of features with more potential splits. We show that by appropriately incorporating split-improvement as…

2019-03-12abs ↗pdf ↗

Logistic regression is a widely used method in several fields. When applying logistic regression to imbalanced data, for which majority classes dominate over minority classes, all class labels are estimated as `majority class.' In this article, we use an F-measure optimization method to improve the performance of logis…

2019-05-07abs ↗pdf ↗

Investor sentiment improves model accuracy but complexity doesn't always boost predictive power.

problem Determining the optimal complexity of investor sentiment measures in asset pricing models.
method Comprehensive review of 71 papers from 2000-2021, analyzing various sentiment measures and models.
result Higher complexity of sentiment measures does not necessarily improve predictive power.

Improved measure of predictive uncertainty for machine learning models.

problem Current measure of predictive uncertainty assumes BMA predictive distribution is equivalent to true model's distribution.
method Introduced a new measure based on information theory to correct the assumption.
result Our measure behaves more reasonably in synthetic tasks and is advantageous in real-world applications.

This paper improves support recovery in universal one-bit compressed sensing.

problem Support recovery in one-bit compressed sensing for sparse signals.
method Proposes approximate support recovery and superset recovery algorithms with polynomial-time complexity.
result Achieves improved support recovery with fewer measurements compared to existing methods.

Task-specific scores are often used to optimize for and evaluate the performance of conditional text generation systems. However, such scores are non-differentiable and cannot be used in the standard supervised learning paradigm. Hence, policy gradient methods are used since the gradient can be computed without requiri…

2019-09-09abs ↗pdf ↗

Measuring uncertainty is a promising technique for detecting adversarial examples, crafted inputs on which the model predicts an incorrect class with high confidence. But many measures of uncertainty exist, including predictive en- tropy and mutual information, each capturing different types of uncertainty. We study th…

2018-03-22abs ↗pdf ↗

Over the last decade there has been increasing concern about the biases embodied in traditional evaluation methods for Natural Language Processing/Learning, particularly methods borrowed from Information Retrieval. Without knowledge of the Bias and Prevalence of the contingency being tested, or equivalently the expecta…

2015-04-03abs ↗pdf ↗

Deep ROC analysis improves model selection and interpretation in medical and AI applications.

problem Inadequate performance measures for binary classifiers.
method Deep ROC analysis, translating AUC and partial AUC into balanced average accuracy and post-test measures.
result Deep ROC analysis provides balanced average accuracy, average sensitivity, and average specificity.

Method identifies low-dimensional structure in high-dimensional probability measures.

problem Identifying low-dimensional structure in high-dimensional probability measures.
method Extends prior work on minimizing majorizations of the Kullback-Leibler divergence to identify optimal approximations within a specific class of measures.
result Connection between dimensional logarithmic Sobolev inequality and approximations with the ansatz.

This paper improves confidence measurement in deep metric learning models.

problem Measuring confidence in deep metric learning models is challenging.
method Approximates class distributions using Gaussian kernel smoothing and calibrates the confidence metric.
result Improves generalization and robustness of deep metric learning models.

Improved statistical inference for expensive data using machine learning predictions.

problem Statistical inference under adaptive two-phase multiwave sampling with expensive measurements.
method Multiwave Predict-Then-Debias estimator combining proxy information and expensive measurements.
result Valid estimators and confidence intervals for M-estimation under adaptive sampling.

Confidence intervals improve evaluation of binary prediction rules in data mining.

problem Uncertainty in performance measures estimation from finite datasets.
method Asymptotic normal approximations for confidence intervals, with a blurring correction.
result Improved finite sample coverage probabilities and general performance measures inference.

Improved binning technique boosts nUV measure performance.

problem Improving the performance of the nUV measure in real applications.
method Introduced the nUV measure, provided theoretical optimal binning techniques, and proposed algorithms for approximate solutions.
result Approximate binning techniques show 4-13% increase in AUC scores with statistical significance.

New stability measures for similar features improve feature selection accuracy.

problem Existing stability measures fail to distinguish similar features in highly correlated datasets.
method Introduce new adjusted stability measures that consider feature similarities.
result One new stability measure considers highly similar features as interchangeable.

Low-cost sensors improve air quality prediction accuracy significantly.

problem Improving air quality monitoring networks with affordable sensors.
method Developed a high-resolution air quality prediction engine using low-cost sensors and official data.
result The use of low-cost sensors improves prediction accuracy by 25% and 15% for PM2.5 and PM10 respectively in densely monitored areas.

Bayesian framework improves robustness in nonlinear regression models.

problem Measurement error, model misspecification, and distributional misspecification in regression analyses.
method Joint Dirichlet process prior on latent covariate-response distribution, updating with posterior pseudo-samples.
result Improved stability and consistency in estimators under increasing measurement error.

Improved nested simulation for financial risk measurement.

problem Efficiently estimating nested risk measures in financial engineering.
method Reusing inner simulation outputs to improve efficiency and accuracy.
result The proposed approach outperforms standard nested simulation and regression methods.

Improved time series causal discovery with bootstrap aggregation and confidence measures.

problem Uncertainty estimation in time series causal discovery.
method Bootstrap aggregation and confidence measures for time series causal discovery.
result Bagged-PCMCI+ improves precision and recall compared to PCMCI+.

Improved 3D LiDAR data classification using product coefficients.

problem Enhancing accuracy in 3D LiDAR data classification.
method Introducing product coefficients derived from measure theory as additional features in the classification process, alongside PCA.
result Significant improvement in classification accuracy with product coefficients.

Fourier representation improves KSD for infinite-dimensional data.

problem Applying KSD to infinite-dimensional data.
method Combining measure equations with kernel methods for a Fourier representation of KSD.
result KSD can separate measures in infinite-dimensional Hilbert spaces.

MASF improves score-based filters for high-dimensional nonlinear systems with spatially sparse measurements.

problem Challenges in data assimilation for nonlinear, high-dimensional systems with spatially sparse measurements.
method Developed a forward process tailored for filtering that transforms the system state toward the measurement space, enabling a theoretically sound formulation of the likelihood score.
result MASF shows improved performance over existing score-based filters and ensemble-type Kalman filters, achieving up to a 28.2× wall-clock speedup.

Deep kernel learning refers to a Gaussian process that incorporates neural networks to improve the modelling of complex functions. We present a method that makes this approach feasible for problems where the data consists of line integral measurements of the target function. The performance is illustrated on computed t…

2019-09-04abs ↗pdf ↗

SGLBO optimizes quantum circuits with fewer measurements, improving accuracy and noise resilience.

problem Efficiently optimizing parameterized quantum circuits with reduced measurement shots and noise.
method Developed SGLBO combining SGD and BO, with adaptive measurement-shot strategy and suffix averaging.
result Significantly reduces measurement-shot cost while improving accuracy and noise resilience.

Compressed sensing (CS) provides an elegant framework for recovering sparse signals from compressed measurements. For example, CS can exploit the structure of natural images and recover an image from only a few random measurements. CS is flexible and data efficient, but its application has been restricted by the strong…

2019-05-16abs ↗pdf ↗

Improved persistence spheres map measures to functions, stable under partial transport.

problem Representing and comparing measures in topological machine learning.
method Persistence spheres map measures to continuous functions on the sphere, stable under 1-Wasserstein partial transport.
result Persistence spheres provide a stable, parameter-free representation of measures, improving upon existing methods.

Decisions by Machine Learning (ML) models have become ubiquitous. Trusting these decisions requires understanding how algorithms take them. Hence interpretability methods for ML are an active focus of research. A central problem in this context is that both the quality of interpretability methods as well as trust in ML…

2019-01-20abs ↗pdf ↗

Active learning improves neutron spectroscopy experiments by automating measurement selection.

problem Efficiently searching for signals in neutron scattering experiments with limited beam time.
method Probabilistic active learning using log-Gaussian processes.
result Automated selection of informative measurements improves experimental efficiency.

We develop correlated random measures, random measures where the atom weights can exhibit a flexible pattern of dependence, and use them to develop powerful hierarchical Bayesian nonparametric models. Hierarchical Bayesian nonparametric models are usually built from completely random measures, a Poisson-process based c…

2015-07-02abs ↗pdf ↗