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

4285127169 · Jun 202019922001200920172026
48 results for background noise

Paper explores using EEG for better speaker identification, even in noisy environments.

problem Speaker identification performance degrades in background noise.
method Uses EEG signals to enhance speaker identification systems, comparing with acoustic features.
result Speaker identification system using only EEG features outperforms one using only acoustic features in high background noise.

PCA++ improves robustness to background noise in contrastive learning.

problem Recovering shared signal subspaces from positive pairs in high-dimensional data with structured background noise.
method PCA++ uses hard uniformity-constrained contrastive learning to enforce identity covariance on projected features.
result PCA++ outperforms standard PCA and alignment-only PCA+ in simulations and real-world datasets.

CNNs trained by gradient descent can learn intrinsic image rank robustly to background noises.

problem Understanding the intrinsic dimension of data in over-parameterized CNNs.
method Theoretical analysis and experiments on synthetic and real datasets.
result CNNs trained by gradient descent can learn the intrinsic dimension of clean images robustly to background noises.

BIND removes background noise from binary matrices, improving detection accuracy and fairness.

problem Real data often violates the i.i.d assumption for binary matrix entries, leading to inaccurate detection.
method BIND optimizes detection by estimating row- and column-wise mixture distributions and eliminating background noise.
result BIND effectively removes background noise and increases detection accuracy and fairness.

Study evaluates saliency maps on artificial data with different backgrounds.

problem Objective evaluation of saliency methods on artificial data with varying backgrounds.
method Developed a framework to generate artificial data with synthetic lesions and a known ground truth map, evaluated two data sets with different backgrounds (Perlin noise and 2D brain MRI slices).
result Heatmaps vary strongly between saliency methods and backgrounds.

Real-time speech enhancement model removes various noises and reverb.

problem Real-time speech enhancement in noisy environments.
method Causal speech enhancement model using encoder-decoder architecture with skip-connections, optimized in time and frequency domains.
result The model matches state-of-the-art performance while working directly on raw waveform.

New method designs joint initial noises for diffusion models to improve diversity and alignment.

problem Independent initial noises limit diversity in generated images.
method Coupling of initial noises, maintaining Gaussian distribution while allowing dependence.
result Repulsive Gaussian coupling improves diversity without increasing sampling cost.

GDiff tackles blind denoising with Gibbs sampling and Monte Carlo inference.

problem Blind denoising of signals with unknown noise parameters.
method Gibbs Diffusion (GDiff) method that alternates sampling steps from a conditional diffusion model and a Monte Carlo sampler.
result GDiff achieves blind denoising of natural images and cosmic microwave background data.

We study an adaptive source seeking problem, in which a mobile robot must identify the strongest emitter(s) of a signal in an environment with background emissions. Background signals may be highly heterogeneous and can mislead algorithms that are based on receding horizon control. We propose AdaSearch, a general algor…

2018-09-27abs ↗pdf ↗

A wide variety of application domains are concerned with data consisting of entities and their relationships or connections, formally represented as graphs. Within these diverse application areas, a common problem of interest is the detection of a subset of entities whose connectivity is anomalous with respect to the r…

2014-01-29abs ↗pdf ↗

Recent progress in separating the speech signals from multiple overlapping speakers using a single audio channel has brought us closer to solving the cocktail party problem. However, most studies in this area use a constrained problem setup, comparing performance when speakers overlap almost completely, at artificially…

2019-07-02abs ↗pdf ↗

Proposes ConiVAT for better cluster assessment and clustering with background knowledge.

problem Challenges in cluster assessment and clustering with noise and bridge points.
method Uses background constraints to improve VAT/iVAT for complex datasets.
result Improves clustering accuracy and resolves issues with noise and bridge points.

Paper explores supervised learning methods to approximate ideal observer for joint signal detection and localization.

problem Optimizing medical imaging systems by assessing their performance using the Ideal Observer model.
method Uses supervised learning methods, specifically convolutional neural networks, to approximate the Ideal Observer for joint signal detection and localization tasks.
result Supervised learning-based methods can approximate the Ideal Observer for joint signal detection and localization tasks, as shown by comparisons to MCMC and analytical methods.

Generative adversarial networks (GANs) are a framework that learns a generative distribution through adversarial training. Recently, their class-conditional extensions (e.g., conditional GAN (cGAN) and auxiliary classifier GAN (AC-GAN)) have attracted much attention owing to their ability to learn the disentangled repr…

2018-11-27abs ↗pdf ↗

In this paper we study the pricing of exchange options under a dynamic described by stochastic correlation with random jumps. In particular, we consider a Ornstein-Uhlenbeck covariance model with Levy Background Noise Process driven by Inverse Gaussian subordinators. We use expansion in terms of Taylor polynomials and …

2017-11-27abs ↗pdf ↗

Derives path-integrals for superstrings on curved backgrounds using string geometry theory.

problem Calculating path-integrals for superstrings on curved backgrounds.
method Derives path-integrals from string geometry theory by considering fluctuations around string backgrounds.
result Derives path-integrals for perturbative superstrings on all string backgrounds.

We present a theoretical analysis of the training process for a single-layer GAN fed by high-dimensional input data. The training dynamics of the proposed model at both microscopic and macroscopic scales can be exactly analyzed in the high-dimensional limit. In particular, we prove that the macroscopic quantities measu…

2018-05-22abs ↗pdf ↗

Derives path integrals for perturbative strings on various backgrounds.

problem Calculating path integrals for strings on curved backgrounds.
method Derives path integrals from string geometry theory by considering fluctuations around string backgrounds.
result Derives path integrals of all order perturbative strings on various backgrounds.

Method generates joint posterior samples of source and foreground mass distributions for gravitational lensing.

problem Challenging inference problem for high-resolution, high signal-to-noise ratio gravitational lensing.
method Combines diffusion-based generative modeling and recurrent inference machines.
result Can model realistic gravitational lensing simulations down to the noise level.

We provide a comprehensive review of classical algorithms for compressive sensing of images, focused on Total variation methods, with a view to application in LiDAR systems. Our primary focus is providing a full review for beginners in the field, as well as simulating the kind of noise found in real LiDAR systems. To t…

2019-08-05abs ↗pdf ↗

An explorative data analysis system should be aware of what the user already knows and what the user wants to know of the data: otherwise the system cannot provide the user with the most informative and useful views of the data. We propose a principled way to do exploratory data analysis, where the user's background kn…

2018-05-20abs ↗pdf ↗

We describe the construction of a Lie superalgebra associated to an arbitrary supersymmetric M-theory background, and discuss some examples. We prove that for backgrounds with more than 24 supercharges, the bosonic subalgebra acts locally transitively. In particular, we prove that backgrounds with more than 24 supersym…

2004-09-16abs ↗pdf ↗

SRTC model for background/foreground separation with missing pixels.

problem Background/foreground separation with missing pixels in videos.
method Smooth robust tensor completion (SRTC) model with tensor proximal alternating minimization (tenPAM).
result Global convergence guarantee for the proposed algorithm.

A new method avoids noise amplification when subtracting or dividing stochastic signals.

problem Noise amplification when subtracting or dividing stochastic signals.
method Normalizing flows to approximate the distribution of the signal of interest.
result Normalizing flows can generate an approximation of the probability distribution over the signal of interest, avoiding subtraction or division.

Unsupervised learning techniques in computer vision often require learning latent representations, such as low-dimensional linear and non-linear subspaces. Noise and outliers in the data can frustrate these approaches by obscuring the latent spaces. Our main goal is deeper understanding and new development of robust ap…

2017-07-31abs ↗pdf ↗

Motivated by the search for new gravity duals to M2 branes with N>4N>4 supersymmetry --- equivalently, M-theory backgrounds with Killing superalgebra osp(N4)\mathfrak{osp}(N|4) for N>4N>4 --- we classify homogeneous M-theory backgrounds with symmetry Lie algebra so(n)so(3,2)\mathfrak{so}(n) \oplus \mathfrak{so}(3,2) for n=5,6,7n=5,6,7. We f…

2015-11-11abs ↗pdf ↗

We explore all warped AdS4×wMD4AdS_4\times_w M^{D-4} backgrounds with the most general allowed fluxes that preserve more than 16 supersymmetries in D=10D=10- and 1111-dimensional supergravities. After imposing the assumption that either the internal space MD4M^{D-4} is compact without boundary or the isometry algebra of the back…

2017-11-22abs ↗pdf ↗

b-LOAD extends local causal discovery with prior knowledge, improving causal effect estimation.

problem Local causal discovery struggles in data-scarce settings due to uncertainty and incomplete neighborhoods.
method b-LOAD incorporates prior knowledge directly into local structure learning, using Meek's rules to refine discovery.
result b-LOAD refines the admissible equivalence class and enlarges identifiable causal queries, improving causal effect estimation.

LANCA uses ANM to learn latent causal factors without supervision.

problem Learning latent causal factors without supervision.
method LANCA employs a deterministic Wasserstein Auto-Encoder coupled with a differentiable ANM Layer.
result LANCA outperforms baselines on physics and photorealistic environments.

Bayesian framework integrates spectral deconvolution with expert reasoning for robust peak estimation.

problem Challenges in extracting meaningful peaks from noisy or complex spectra.
method Bayesian spectral deconvolution coupled with a physical-property regression layer.
result Recovery of weak peaks in poly(lactic acid) IR spectra related to degradation rates.

ResUNet-CMB neural network reconstructs CMB effects from noisy data.

problem Reconstructing CMB anisotropies from noisy data.
method Convolutional neural network (ResUNet-CMB) for simultaneous reconstruction of lensing and reionization.
result ResUNet-CMB outperforms quadratic estimators at low noise levels and avoids lensing-induced bias.