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

119237356474 · Jun 202019922001200920172026
48 results for SNR estimation

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.

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.

DGPs with variational inference suffer from SNR issues that degrade gradient estimates, leading to unreliable training.

problem SNR issues in gradient estimates for DGPs with variational inference.
method Adapted doubly reparameterized gradient estimators for DGP training.
result Fix improves predictive performance of DGP models.

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 ↗

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.

Paper develops methods for estimating GLMs and SNR under proportional asymptotics.

problem Estimation of regression coefficients and SNR in high-dimensional GLMs.
method Method-of-Moments type estimators that bypass nuisance function estimation.
result Consistent and asymptotically normal estimators derived for targets of inference.

Paper improves variance control in importance weighted variational bounds.

problem Improving the variance of gradient estimators for IWAE.
method Develops a novel control variate that grows SNR as √K for large K.
result Empirically, the method yields superior variance reduction for generative models.

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 ↗

Paper improves REINFORCE for VI without restrictive assumptions.

problem Improves REINFORCE for VI without restrictive assumptions.
method Introduces VIMCO-\star gradient estimator to overcome SNR collapse.
result VIMCO-\star achieves N\sqrt{N} SNR scaling, superior to existing VIMCO.

A body of recent work has focused on constructing a variational family of filtered distributions using Sequential Monte Carlo (SMC). Inspired by this work, we introduce Particle Smoothing Variational Objectives (SVO), a novel backward simulation technique and smoothed approximate posterior defined through a subsampling…

2019-09-20abs ↗pdf ↗

The paper proposes an efficient estimator for linear regression with shuffled labels.

problem Linear regression with shuffled labels, focusing on sensing results and corresponding information.
method A one-step estimator to reconstruct (Π,B)(\mathbf Π, \mathbf B) from Y\mathbf Y and X\mathbf X.
result Sufficient conditions for correct permutation recovery under different regimes of signal-to-noise ratio (snr).

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

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 ↗

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.

We study the problem of approximate ranking from observations of pairwise interactions. The goal is to estimate the underlying ranks of nn objects from data through interactions of comparison or collaboration. Under a general framework of approximate ranking models, we characterize the exact optimal statistical error …

2017-11-30abs ↗pdf ↗

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.

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.

The paper connects DNN generalization to node SNR using information theory.

problem Exploring the reasons behind DNN generalization performance.
method Using information theory, the paper derives SNR expressions for DNN nodes and uses them to quantify weight optimization.
result Good SNR performance in DNN nodes correlates with good generalization.

The P300 Brain-Computer Interface (BCI) is a well-established communication channel for severely disabled people. The P300 event-related potential is mostly characterized by its amplitude or its area, which correlate with the spelling accuracy of the P300 speller. Here, we introduce a novel approach for estimating the …

2018-12-11abs ↗pdf ↗

Unified framework for structured principal subspace estimation with bounds and rates.

problem Structured principal subspace estimation problems.
method Unified framework, minimax lower and upper bounds, information-geometric complexity.
result Minimax rates of convergence for specific settings, including optimal rates for non-negative PCA/SVD.

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.

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.

Alignment of neural network representations is influenced by SNR and sample size.

problem Understanding how neural network representations align across different conditions.
method Controlled training of neural networks on perturbed datasets, analyzing alignment and generalization.
result Alignment varies monotonically with SNR but non-monotonically with sample size, with minimal alignment near the interpolation threshold.

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 ↗

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 ↗

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 ↗

New scheme optimizes BMI through probabilistic and geometric shaping.

problem Optimizing bit-wise mutual information (BMI) for coded modulation.
method Joint optimization of BMI through probabilistic and geometric shaping.
result Joint optimization enables a continuum of constellation geometries and probability distributions.