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

Trend · papers per month

1122 · Dec 201919922001200920182026
28 results for low-SNR

Paper proposes an edge detection method for robot navigation using low-SNR thermal cameras.

problem Efficient edge detection for robot navigation using low-SNR thermal camera.
method Raw image denoising, Canny edge detection, CSS method, edge ranking, edge linking.
result Enhanced edge detection method effectively detects smooth edges of the surrounding environment.

Optimizing over-the-air convex optimization, analog schemes are nearly optimal at low SNR.

problem Optimizing over-the-air convex optimization with coded gradients.
method Analyzes coded gradients over an additive Gaussian noise channel, considers analog coding schemes.
result Analog coding schemes nearly match the optimal convergence rate at low SNR, but a slowdown is inevitable.

Random forests reduce bias and variance, especially in low SNR settings.

problem Reducing bias and variance in machine learning models, particularly in low SNR scenarios.
method Empirical study of random forests and bagging ensembles, focusing on the importance of mtrymtry tuning.
result Random forests reduce both bias and variance, outperforming bagging ensembles in high SNR settings.

The problem of Poisson denoising appears in various imaging applications, such as low-light photography, medical imaging and microscopy. In cases of high SNR, several transformations exist so as to convert the Poisson noise into an additive i.i.d. Gaussian noise, for which many effective algorithms are available. Howev…

2013-09-17abs ↗pdf ↗

EM algorithm achieves optimal sample complexity for learning two-component mixed linear regression.

problem Learning two-component mixed linear regression under varying signal-to-noise ratios.
method Analysis of EM algorithm convergence rates under different SNR regimes.
result EM algorithm achieves minimax optimal sample complexity in all SNR regimes.

This paper analyzes AJIVE for estimating shared subspace across multiple datasets, revealing its strengths and limitations.

problem Estimating shared subspace across multiple datasets with varying degrees of misalignment.
method Angle-based Joint and Individual Variation Explained (AJIVE) method, a two-stage spectral approach.
result AJIVE's performance in high signal-to-noise ratio (SNR) regimes and its non-diminishing error in low-SNR settings.

Improved predictive posterior density estimation through optimized importance sampling.

problem Low signal-to-noise ratio in posterior predictive densities.
method Optimized importance sampling using a test-time variational proxy.
result Significantly improved estimates of predictive posterior densities.

We propose a new framework for the analysis of low-rank tensors which lies at the intersection of spectral graph theory and signal processing. As a first step, we present a new graph based low-rank decomposition which approximates the classical low-rank SVD for matrices and multi-linear SVD for tensors. Then, building …

2016-11-15abs ↗pdf ↗

Dropout-based regularization methods can be regarded as injecting random noise with pre-defined magnitude to different parts of the neural network during training. It was recently shown that Bayesian dropout procedure not only improves generalization but also leads to extremely sparse neural architectures by automatica…

2017-05-20abs ↗pdf ↗

Study evaluates scikit-learn regularization frameworks for machine learning models.

problem Choosing the right regularization framework for applied machine learning models.
method Empirical evaluation of four canonical frameworks (Ridge, Lasso, ElasticNet, Post-Lasso OLS) across 134,400 simulations.
result Lasso recall is highly fragile under multicollinearity; at high condition numbers (kappa) and low SNR, Lasso recall collapses to 0.18 while ElasticNet maintains 0.93.

New framework aligns latent representations over-the-air using intelligent metasurfaces.

problem Heterogeneous transmitter-receiver models produce misaligned latent representations in semantic communication.
method Intelligent metasurfaces (SIM) emulate supervised and zero-shot semantic aligners directly in the wave domain.
result SIMs achieve up to 90% task accuracy in high SNR regimes, robust to low SNR.

KCS improves parametric maps from PET images by reducing noise and variance.

problem Improving the quality of parametric maps from PET images due to noise.
method Kinetic Compressive Sensing (KCS) method based on a hierarchical Bayesian model and novel reconstruction algorithm.
result KCS produces spatially coherent images and parametric maps with lower noise and better contrast.

Proposes a new model for testing causal structural priors and synthesizing data.

problem Testing and synthesizing causal structural priors using nonparametric knowledge and neural networks.
method Causal Structural Hypothesis Testing (C-SHT) and Causal Structural Variational Hypothesis Testing (C-SVHT) using deep neural networks.
result Demonstrates out-of-distribution generalization error as a proxy for causal structural prior hypothesis testing.

Efficient deep learning for wireless source identification using test SNR estimates.

problem Training deep classifiers for wireless signal modulation and technology identification.
method Greedy training SNR Boosting and bootstrap aggregating (Bagging) based on training SNR values.
result Uniform improvement in accuracy across all SNR values with small subsets of training SNR values.

Deep learning improves automatic modulation classification from subsampled data.

problem Automatic recognition of wireless communication signal modulations from imperfect data.
method Developed and tested Convolutional Long Short-term Deep Neural Network (CLDNN), LSTM, and ResNet architectures.
result Achieved high classification accuracy (around 90%) at high SNR with minimal training data.

We consider the problem of learning a dictionary matrix from a number of observed signals, which are assumed to be generated via a linear model with a common underlying dictionary. In particular, we derive lower bounds on the minimum achievable worst case mean squared error (MSE), regardless of computational complexity…

2015-07-20abs ↗pdf ↗

Improved tensor rank learning for CPD models using a generalized hyperbolic prior.

problem Inaccurate tensor rank determination leads to overfitting or underfitting in CPD models.
method Introduced a generalized hyperbolic prior for automatic tensor rank learning in probabilistic CPD models.
result Significantly improved performance in learning both low and high tensor ranks, even for low SNR cases.

Improved analysis of calcium imaging data with higher SNR and compression.

problem Challenges in analyzing large-scale calcium imaging datasets.
method Spatially-localized penalized matrix decomposition (PMD) for denoising and compression.
result Significant improvement in SNR and compression rates with minimal signal loss.