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

65130195260 · Jun 202019922001200920172026
48 results for statistical strengths

A new method uses randomized trials to estimate the strength of unobserved confounding.

problem Unobserved confounding compromises causal conclusions from non-randomized studies.
method Designs a statistical test to detect unobserved confounding strength and estimates a lower bound.
result Estimates an asymptotically valid lower bound on unobserved confounding strength.

Study interpolating estimators for causal learning from observational data.

problem Learning causal models from observational data in complex model classes.
method Investigate min-norm interpolators and ridge-regularized regressors in a linearly confounded model.
result Interpolators cannot be optimal for causal learning under the principle of independent causal mechanisms, requiring stronger regularization.

Bayes factors and relative belief ratios are compared as measures of statistical evidence.

problem Which measure of evidence is more appropriate: Bayes factors or relative belief ratios?
method Comparison of Bayes factors and relative belief ratios, considering properties and restrictions.
result Relative belief ratio has better properties as a measure of evidence.

SLOE speeds up logistic regression in high dimensions with accurate signal strength estimation.

problem Poor performance of logistic regression in high-dimensional settings.
method SLOE reparameterizes the signal strength for faster and more accurate estimation.
result SLOE provides a fast and accurate method for dimensionality correction in logistic regression.

High throughput screening of compounds (chemicals) is an essential part of drug discovery [7], involving thousands to millions of compounds, with the purpose of identifying candidate hits. Most statistical tools, including the industry standard B-score method, work on individual compound plates and do not exploit cross…

2017-09-28abs ↗pdf ↗

A hybrid strategy forecasts short-term loads using Warm-start Gradient Tree Boosting.

problem Lack of effective short-term load forecasting methods.
method Hybrid strategy integrating four different inference models: tree-based ensemble method Warm-start Gradient Tree Boosting (WGTB).
result Demonstrates effectiveness of hybrid strategy on real datasets.

Paper explores statistical and computational limits of estimating low-rank Gaussian mixtures.

problem Estimating low-rank matrix-variate observations with optimal statistical and computational limits.
method Low-rank Gaussian mixture model (LrMM) and minimax lower bounds.
result Minimax optimality of maximum likelihood estimator and spectral aggregation method.

In this paper the correlation between education, research and macroeconomic strength of countries at a global scale is analyzed on the basis of statistical data published by the UNIDO and OECD. It uses sets of composite indicators describing the economical performance and competitiveness as well as those relevant for h…

2007-08-15abs ↗pdf ↗

For analysis of a high-dimensional dataset, a common approach is to test a null hypothesis of statistical independence on all variable pairs using a non-parametric measure of dependence. However, because this approach attempts to identify any non-trivial relationship no matter how weak, it often identifies too many rel…

2015-05-09abs ↗pdf ↗

Proposes Population Difference Criterion for visually observed subpopulation differences.

problem Statistical significance of visually observed subpopulation differences in high-dimensional and high-signal contexts.
method Balanced permutation approach and bootstrap confidence interval for quantifying uncertainty.
result Balanced permutation approach is more powerful in high-signal contexts.

In this paper, we propose a perturbation framework to measure the robustness of graph properties. Although there are already perturbation methods proposed to tackle this problem, they are limited by the fact that the strength of the perturbation cannot be well controlled. We firstly provide a perturbation framework on …

2018-12-03abs ↗pdf ↗

Identifies learning rules from neural network observables.

problem Determine the underlying plasticity rules governing learning in biological systems.
method Simulated idealized neuroscience experiments with artificial neural networks to generate a dataset of learning trajectories. Used linear and non-linear classifiers to identify learning rules from aggregate statistics of weights, activations, and activity changes.
result Different classes of learning rules can be separated solely on the basis of aggregate statistics of the weights, activations, or instantaneous layer-wise activity changes.

We propose a new variational family for Bayesian neural networks. We decompose the variational posterior into two components, where the radial component captures the strength of each neuron in terms of its magnitude; while the directional component captures the statistical dependencies among the weight parameters. The …

2019-02-07abs ↗pdf ↗

Deep heteroskedastic models overfit, showing a phase transition with regularization strength.

problem Overfitting in deep heteroskedastic regression models.
method Theoretical framework based on statistical field theory, empirical verification, and hyperparameter simplification.
result A phase transition in model behavior with varying regularization strength.

Paper optimizes private PCA for covariance estimation in statistics.

problem Private estimation of covariance matrices and principal components.
method Developed differentially private estimators for spiked covariance model.
result Established minimax rates of convergence for principal components and covariance matrix estimation.

Common statistical practice has shown that the full power of Bayesian methods is not realized until hierarchical priors are used, as these allow for greater "robustness" and the ability to "share statistical strength." Yet it is an ongoing challenge to provide a learning-theoretically sound formalism of such notions th…

2015-05-19abs ↗pdf ↗

In the context of sparse principal component detection, we bring evidence towards the existence of a statistical price to pay for computational efficiency. We measure the performance of a test by the smallest signal strength that it can detect and we propose a computationally efficient method based on semidefinite prog…

2013-04-03abs ↗pdf ↗

RealStats detects fake images rigorously, combining multiple detectors for robustness.

problem Detecting AI-generated images remains challenging due to evolving generative models.
method Combines training-free statistics to compute p-values and aggregate them for a unified real-image distribution.
result Framework produces interpretable probability scores for robust fake image detection.

Models with many signals, high-dimensional models, often impose structures on the signal strengths. The common assumption is that only a few signals are strong and most of the signals are zero or close (collectively) to zero. However, such a requirement might not be valid in many real-life applications. In this article…

2017-08-01abs ↗pdf ↗

Time series of counts arise in a variety of forecasting applications, for which traditional models are generally inappropriate. This paper introduces a hierarchical Bayesian formulation applicable to count time series that can easily account for explanatory variables and share statistical strength across groups of rela…

2014-05-15abs ↗pdf ↗

Consistent estimator derived for confounding strength in observational data.

problem Estimating confounding strength in observational data is challenging due to unobserved confounders.
method Derived and adapted a consistent estimator using tools from random matrix theory.
result The original estimator is not consistent, but an adapted one is.

New tests detect communities in dense bipartite graphs with high accuracy.

problem Detecting communities in dense bipartite graphs with high accuracy.
method Non-asymptotic upper and lower bounds, novel minimax-optimal tests, hard-thresholded nonlinear statistics.
result Non-asymptotic upper and lower bounds match for any configuration of graph sizes.

Proposes a method to calibrate data for more accurate linear correlation testing.

problem Inaccurate Pearson's correlation coefficient due to sample size and data non-normality.
method Predictive data calibration using machine learning to condition data on expected linear relationship.
result Calibrated Pearson's correlation coefficient yields a calibrated p-value and r estimate for posterior probability interpretation.

PAS improves estimation of multiple means using ML predictions and shrinkage.

problem Improving statistical estimates with limited gold-standard data and noisy ML predictions.
method Prediction-Powered Adaptive Shrinkage (PAS) that combines PPI with empirical Bayes shrinkage.
result PAS adapts to the reliability of ML predictions and outperforms traditional methods in large-scale applications.

SI-CLAD improves clustering-based anomaly detection by controlling false positives.

problem Lack of reliability in clustering-based anomaly detection.
method SI-CLAD (Statistical Inference for CLustering-based Anomaly Detection) using Selective Inference framework.
result SI-CLAD rigorously controls false detection probability below a specified significance level.

We are concerned with modeling the strength of links in networks by taking into account how often those links are used. Link usage is a strong indicator of how closely two nodes are related, but existing network models in Bayesian Statistics and Machine Learning are able to predict only wether a link exists at all. As …

2014-02-18abs ↗pdf ↗

The paper investigates causal relationships in heart failure prediction using machine learning.

problem Understanding the causal relationships between clinical variables and heart failure.
method Proposes a new computational framework for causal structure discovery (CSD) of mixed-type clinical variables for binary disease outcomes.
result Feature importance from nonlinear classifiers strongly correlates with causal strength of variables, but not differentiating cause and effect.

This paper considers the mean-reverting portfolio design problem arising from statistical arbitrage in the financial markets. The problem is formulated by optimizing a criterion characterizing the mean-reversion strength of the portfolio and taking into consideration the variance of the portfolio and an investment budg…

2016-11-25abs ↗pdf ↗

The structure of a Bayesian network encodes most of the information about the probability distribution of the data, which is uniquely identified given some general distributional assumptions. Therefore it's important to study the variability of its network structure, which can be used to compare the performance of diff…

2009-09-09abs ↗pdf ↗

Understanding tie strength in social networks, and the factors that influence it, have received much attention in a myriad of disciplines for decades. Several models incorporating indicators of tie strength have been proposed and used to quantify relationships in social networks, and a standard set of structural networ…

2017-10-11abs ↗pdf ↗

Novel method uses information theory to measure causal influences during transient neural events.

problem Characterizing network interactions during transient neural events.
method Structural Causal Models, Information Theory, Transfer Entropy, Dynamic Causal Strength, Relative Dynamic Causal Strength.
result Introduced a novel measure, relative Dynamic Causal Strength, with theoretical and empirical support.

We study sequential change-point detection procedures based on linear sketches of high-dimensional signal vectors using generalized likelihood ratio (GLR) statistics. The GLR statistics allow for an unknown post-change mean that represents an anomaly or novelty. We consider both fixed and time-varying projections, deri…

2015-05-25abs ↗pdf ↗

This paper calculates interaction strength for translation surfaces with multiple singularities.

problem Computing the interaction strength of translation surfaces with multiple singularities is challenging.
method The authors study interaction strength of specific families of translation surfaces, including regular polygons and Bouw-Möller surfaces.
result The paper provides exact computations of KVol on translation surfaces with multiple singularities.

Ranking problems, also known as preference learning problems, define a widely spread class of statistical learning problems with many applications, including fraud detection, document ranking, medicine, credit risk screening, image ranking or media memorability. In this article, we systematically review different types…

2019-09-06abs ↗pdf ↗

Investigate the evolving structure of cryptocurrency interactions using high-frequency returns.

problem Evolution of cryptocurrency interactions
method Construct directed and weighted networks from Granger causal relationships between cryptocurrency log-returns.
result Normalized returns exhibit heavy-tailed distributions.

Estimates binary labels from dependent data using Markov Random Fields.

problem Statistical estimation from dependent data across spatial, temporal, and social domains.
method Modeling dependencies as Markov Random Fields and providing efficient estimation algorithms.
result Statistically efficient estimation rates for Ising models from a single sample.

Improved anomaly detection for launch vehicle propulsion systems using LSTM and statistical relabeling.

problem Detecting anomalies in real-time telemetry data for launch vehicles.
method Utilized LSTM networks for anomaly classification, introduced a statistical detector based on Mahalanobis distance and forward-backward detection fractions to adjust training labels.
result Precision and recall of the LSTM classifier improved by 7% and 22% respectively after statistical relabeling.