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

Trend · papers per month

54109163217 · Jun 202019922001200920172026
48 results for low SNR

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.

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.

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.

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 ↗

Improving scalability and stability of Stein discrepancies for scalable goodness-of-fit testing

problem Improving scalability and stability of Stein discrepancies for scalable goodness-of-fit testing
method Reformulating Stein discrepancy construction as an explicit SNR^2 maximisation problem
result Avoiding exponential SNR^2 collapse and achieving stable SNR^2

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.

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.

In this paper, we propose a general framework for tensor singular value decomposition (tensor SVD), which focuses on the methodology and theory for extracting the hidden low-rank structure from high-dimensional tensor data. Comprehensive results are developed on both the statistical and computational limits for tensor …

2017-03-08abs ↗pdf ↗

A new memory-efficient Adam variant reduces second moments when feasible.

problem Memory constraints in training machine learning models.
method Signal-to-Noise Ratio (SNR) analysis to identify dimensions where second moments can be replaced by means.
result Memory-efficient Adam variant (SlimAdam) matches performance and stability of Adam while saving up to 98% of second moments.

Particle picking is currently a critical step in the cryo-EM single particle reconstruction pipeline. Despite extensive work on this problem, for many data sets it is still challenging, especially for low SNR micrographs. We present the KLT (Karhunen Loeve Transform) picker, which is fully automatic and requires as an …

2019-12-12abs ↗pdf ↗

Classical convolutional neural networks (cCNNs) are very good at categorizing objects in images. But, unlike human vision which is relatively robust to noise in images, the performance of cCNNs declines quickly as image quality worsens. Here we propose to use recurrent connections within the convolutional layers to mak…

2018-11-21abs ↗pdf ↗

We propose a joint source and channel coding (JSCC) technique for wireless image transmission that does not rely on explicit codes for either compression or error correction; instead, it directly maps the image pixel values to the complex-valued channel input symbols. We parameterize the encoder and decoder functions b…

2018-09-04abs ↗pdf ↗

Point source detection at low signal-to-noise is challenging for astronomical surveys, particularly in radio interferometry images where the noise is correlated. Machine learning is a promising solution, allowing the development of algorithms tailored to specific telescope arrays and science cases. We present DeepSourc…

2018-07-07abs ↗pdf ↗

High signal to noise ratio (SNR) consistency of model selection criteria in linear regression models has attracted a lot of attention recently. However, most of the existing literature on high SNR consistency deals with model order selection. Further, the limited literature available on the high SNR consistency of subs…

2017-03-10abs ↗pdf ↗

In this work, we investigate the feasibility and effectiveness of employing deep learning algorithms for automatic recognition of the modulation type of received wireless communication signals from subsampled data. Recent work considered a GNU radio-based data set that mimics the imperfections in a real wireless channe…

2019-01-16abs ↗pdf ↗

Transformers can learn mixture of linear models efficiently.

problem Existence and generalization of in-context learning for mixture models.
method Theoretical analysis and gradient flow optimization.
result Transformers achieve a prediction error of O(d/n)\mathcal{O}(\sqrt{d/n}) with high probability.

This paper develops novel deep learning-based architectures and design methodologies for an orthogonal frequency division multiplexing (OFDM) receiver under the constraint of one-bit complex quantization. Single bit quantization greatly reduces complexity and power consumption, but makes accurate channel estimation and…

2018-11-02abs ↗pdf ↗

MASnet enhances speech on mobile devices with low latency.

problem Efficiently enhancing speech on mobile devices with low latency.
method MASnet processes linear-scale spectrograms, using ratio masks to enhance noisy frames, and operates in low-latency incremental inference mode.
result MASnet achieves efficient speech enhancement with low latency, reducing FMA/s operations.

Single particle reconstruction (SPR) from cryo-electron microscopy (EM) is a technique in which the 3D structure of a molecule needs to be determined from its contrast transfer function (CTF) affected, noisy 2D projection images taken at unknown viewing directions. One of the main challenges in cryo-EM is the typically…

2016-11-10abs ↗pdf ↗

Study on benign overfitting in leaky ReLUs with moderate input dimensions.

problem Understanding when overfitting is beneficial in neural networks.
method Two-layer leaky ReLU networks trained with hinge loss, considering signal-to-noise ratio.
result Characterization of conditions for benign overfitting based on signal-to-noise ratio.

SGD recovers multiple signal vectors in noisy tensor PCA.

problem Estimating multiple signal vectors from noisy tensor observations.
method Online stochastic gradient descent (SGD) in high dimensions with detailed analysis of correlations.
result Sequential elimination of correlations allows recovery of all spikes from Np2N^{p-2} samples.

New insights into statistical and computational limits for mixed sparse linear regression.

problem Recovering two sparse signals from noisy linear measurements.
method Analysis of low-degree polynomials and a simple thresholding algorithm.
result Identification of a smooth information-computation tradeoff and order-optimality of the thresholding algorithm.

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 ↗

Study of Langevin dynamics for tensor PCA recovery in high dimensions.

problem Recovering hidden signal vectors (spikes) from noisy Gaussian tensor observations.
method Langevin dynamics approach for nonconvex optimization.
result Sample complexity matches the single-spike case but degrades for all spikes.

Bayesian approach improves AdaLoRA's performance and efficiency.

problem Improving the efficiency and performance of adaptive low-rank adaptation.
method Utilized Bayesian metrics and the Improved Variational Online Newton (IVON) optimizer for adaptive parameter budget allocation.
result Bayesian counterpart outperforms sensitivity-based importance metric and is faster than AdaLoRA.