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,742 papers · 148 categories

Trend · papers per month

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for relative signal strength

Noise-ignorant empirical risk minimization achieves state-of-the-art performance on noisy data.

problem Learning with noisy labels in multi-class classification problems.
method Introducing relative signal strength (RSS) to quantify transferability and applying Noise Ignorant Empirical Risk Minimization (NI-ERM).
result NI-ERM achieves state-of-the-art performance on CIFAR-N data challenge.

VGRSI uses price visibility graphs to generate profitable trading signals.

problem Ineffective traditional technical analysis indicators in financial markets.
method Visibility Graphs Relative Strength Index (VGRSI) based on backward visibility relations in price data.
result VGRSI signals generated substantial profits across different asset classes.

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 ↗

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.

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 ↗

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.

A number of applications in engineering, social sciences, physics, and biology involve inference over networks. In this context, graph signals are widely encountered as descriptors of vertex attributes or features in graph-structured data. Estimating such signals in all vertices given noisy observations of their values…

2016-05-23abs ↗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.

New algorithms detect and estimate rank-one signals with prior directional information.

problem Detecting and estimating rank-one signals with directional prior information.
method Construct nonlinear Laplacians and examine top eigenvalues and eigenvectors.
result Nonlinear Laplacian algorithms outperform direct spectral methods for biased signals.

Wi-GATr learns to simulate wireless signals with high accuracy and speed.

problem Inaccurate wireless signal propagation models limit modern communication system design.
method Wi-GATr uses a Geometric Algebra Transformer to learn from scene primitives.
result Wi-GATr achieves more accurate predictions than existing methods.

Study on signal-plus-noise decomposition in nonlinear spiked random matrices.

problem Nonlinear spiked random matrix models with rank-one signal and noise.
method Signal-plus-noise decomposition and phase transition analysis.
result Identified precise phase transitions in signal components at critical thresholds.

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.

This article provides an overview of relative strengths of polynomial invariants of knots and links, such as the Alexander, Jones, Homflypt, Kaufman two-variable polynomial, and Khovanov polynomial.

2011-06-20abs ↗pdf ↗

New theory for PCA under weak latent factors, improving inference and testing.

problem Statistical inference for PCA with weak latent factors and cross-sectional dependence.
method Comprehensive estimation and inference theory for PCA under nearly minimal factor strength, non-asymptotic.
result Asymptotic normality of PCA-based estimator for NTN\asymp T with SNR growth rate.

This paper optimizes cryptocurrency portfolios by integrating sentiment analysis with technical indicators.

problem Effective portfolio management in volatile cryptocurrency markets.
method Dynamic portfolio strategy using technical indicators and sentiment analysis.
result The integrated approach outperforms traditional benchmarks and achieves stronger risk-adjusted returns.

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.

This article provides an overview of relative strengths of polynomial invariants of knots and links, such as the Alexander, Jones, Homflypt, and Kaufman two-variable polynomial, Khovanov homology, factorizability of the polynomials, and knot primeness detection.

2011-07-10abs ↗pdf ↗

Improved KAN model explains brain dynamics through edge learning and synaptic strength.

problem Explaining brain dynamics and frequencies in different brain regions.
method ELKAN (Edge Learning KNN) model with edge learning and trimming, inspired by brain science.
result ELKAN model outperforms KAN in explaining brain frequencies and dynamics.

New method uncovers small but significant local activities in time-series data.

problem Reconstructing small but important local activities in time-series data.
method Neural state-space models with latent causal-effect disentanglement.
result Demonstrated proof-of-concept on reconstructing ectopic foci in cardiac electrical propagation.

For localization and mapping of indoor environments through WiFi signals, locations are often represented as likelihoods of the received signal strength indicator. In this work we compare various measures of distance between such likelihoods in combination with different methods for estimation and representation. In pa…

2018-09-19abs ↗pdf ↗

PLS-SVD struggles with missing data in multimodal datasets, showing a phase transition in performance.

problem Missing data in PLS-SVD for multimodal datasets.
method Replica-symmetric analysis of spiked rectangular random matrices with missing entries.
result PLS-SVD performance transitions from uninformative to informative singular vectors at a critical signal-to-noise threshold.

A new method predicts stock ranking uncertainty to improve trading performance during regime shifts.

problem Ranking models fail during regime shifts, leading to suboptimal performance.
method Adapting DEUP to rankers, predicting rank displacement and uncertainty, and proposing a two-level deployment policy.
result The two-level deployment policy improves risk-adjusted performance and indicates DEUP adds value mainly as a tail-risk guard.

'Sharing of statistical strength' is a phrase often employed in machine learning and signal processing. In sensor networks, for example, missing signals from certain sensors may be predicted by exploiting their correlation with observed signals acquired from other sensors. For humans, our hands move synchronously with …

2018-03-13abs ↗pdf ↗

We provide a unified analysis of the predictive risk of ridge regression and regularized discriminant analysis in a dense random effects model. We work in a high-dimensional asymptotic regime where p,np, n \to \infty and p/nγ(0,)p/n \to γ\in (0, \, \infty), and allow for arbitrary covariance among the features. For both metho…

2015-07-10abs ↗pdf ↗

We study the property of the Fused Lasso Signal Approximator (FLSA) for estimating a blocky signal sequence with additive noise. We transform the FLSA to an ordinary Lasso problem. By studying the property of the design matrix in the transformed Lasso problem, we find that the irrepresentable condition might not hold, …

2012-11-22abs ↗pdf ↗

In high-dimensional data, structured noise caused by observed and unobserved factors affecting multiple target variables simultaneously, imposes a serious challenge for modeling, by masking the often weak signal. Therefore, (1) explaining away the structured noise in multiple-output regression is of paramount importanc…

2014-10-27abs ↗pdf ↗

Paper proposes efficient methods for clustering and signal recovery in high-dimensional data with block structures.

problem High-dimensional clustering and signal recovery under block signal structures.
method CFA-PCA and MA-PCA methods for sparse and dense block signals.
result Proposed methods achieve computational minimax optimality for clustering and signal recovery.

A new model clusters network nodes based on relative edge weights.

problem Clustering networks ignores node capacities, leading to biased results.
method Proposes a Dirichlet stochastic block model for composition-weighted networks.
result Validated on simulated and real-world networks, showing improved clustering accuracy.

We propose a novel objective function for learning robust deep representations of data based on information theory. Data is projected into a feature-vector space such that the mutual information of all subsets of features relative to the supervising signal is maximized. This objective function gives rise to robust repr…

2019-05-30abs ↗pdf ↗

Hypothesis testing in the linear regression model is a fundamental statistical problem. We consider linear regression in the high-dimensional regime where the number of parameters exceeds the number of samples (p>np> n). In order to make informative inference, we assume that the model is approximately sparse, that is th…

2017-04-26abs ↗pdf ↗

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.

Improved language identification accuracy through signal combination methods.

problem Enhancing speech recognition accuracy across multiple languages.
method Combining low-level acoustic signals with language-specific recognizer signals using lattice-based ensemble models and deep neural networks.
result Deep neural network model outperforms lattice-based ensemble model, reducing error rate from 5.5% to 4.3%.

We consider the problems of detection and localization of a contiguous block of weak activation in a large matrix, from a small number of noisy, possibly adaptive, compressive (linear) measurements. This is closely related to the problem of compressed sensing, where the task is to estimate a sparse vector using a small…

2012-09-15abs ↗pdf ↗

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.

Autonomous systems can be used to search for sparse signals in a large space; e.g., aerial robots can be deployed to localize threats, detect gas leaks, or respond to distress calls. Intuitively, search algorithms may increase efficiency by collecting aggregate measurements summarizing large contiguous regions. However…

2016-12-02abs ↗pdf ↗