We introduce a new approach for designing computationally efficient learning algorithms that are tolerant to noise, and demonstrate its effectiveness by designing algorithms with improved noise tolerance guarantees for learning linear separators. We consider both the malicious noise model and the adversarial label nois…
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
48 results for “Noise Separation”
Adversarial noises are linearly separable for random neural networks.
problem The challenge of adversarial examples in neural networks.
method Theoretical proof and empirical evidence for two-layer networks with random initialization and neural tangent kernel setup.
result Adversarial noises are linearly separable with corresponding labels.
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…
Improved speech separation and enhancement using neural beamforming.
problem Challenging speech separation and enhancement in reverberant environments.
method Sequential neural beamforming combining spectral and spatial separation methods.
result Average improvement of 2.75 dB in scale-invariant signal-to-noise ratio and 14.2% absolute reduction in speech recognition metric.
The successive projection algorithm (SPA) has been known to work well for separable nonnegative matrix factorization (NMF) problems arising in applications, such as topic extraction from documents and endmember detection in hyperspectral images. One of the reasons is in that the algorithm is robust to noise. Gillis and…
New method improves deep learning models robustness to label noise.
problem Improving deep learning models' robustness to corrupted labels.
method Sparse over-parameterization and implicit regularization.
result State-of-the-art test accuracy against label noise on various datasets.
Poly-GNNs achieve similar performance regardless of depth, highlighting graph noise's dominance.
problem Performance of poly-GNNs in semi-supervised node classification.
method Analysis of poly-GNNs under a contextual stochastic block model (CSBM).
result For a sufficiently large graph, depth poly-GNNs exhibit the same rate of separation as depth counterparts.
Deep learning methods improve overlapping speaker separation across languages and noise.
problem Overlapping speaker separation in realistic scenarios.
method Deep clustering and deep attractor networks.
result Deep learning methods are effective for a broad range of languages and can handle untrained languages with common features.
We present a new method for the separation of superimposed, independent, auto-correlated components from noisy multi-channel measurement. The presented method simultaneously reconstructs and separates the components, taking all channels into account and thereby increases the effective signal-to-noise ratio considerably…
The study investigates noise effects on parameter estimation for Ornstein-Uhlenbeck processes.
problem Impact of noise on parameter fitting for Ornstein-Uhlenbeck processes.
method Proposed algorithms to distinguish between thermal and multiplicative noise.
result Effective methods to estimate parameters even when multiplicative noise dominates.
The paper cleans label noise in supervised classification using Bernoulli sampling.
problem Label noise degrades supervised classifier performance.
method Proposes a label noise cleaning method based on Bernoulli random sampling.
result The method separates clean and noisy observations without prior label information.
We present a simple noise-robust margin-based active learning algorithm to find homogeneous (passing the origin) linear separators and analyze its error convergence when labels are corrupted by noise. We show that when the imposed noise satisfies the Tsybakov low noise condition (Mammen, Tsybakov, and others 1999; Tsyb…
We present a numerical algorithm for nonnegative matrix factorization (NMF) problems under noisy separability. An NMF problem under separability can be stated as one of finding all vertices of the convex hull of data points. The research interest of this paper is to find the vectors as close to the vertices as possible…
Improved SINDy autoencoder for identifying noisy dynamical systems.
problem Robust identification of noisy dynamical systems from data.
method Incorporates noise-separating neural network structures into SINDy autoencoder architecture.
result Accurately recovers latent dynamics and estimates measurement noise from noisy observations.
Grokking occurs in simple binary logistic classification near linear separability and noise.
problem Delayed generalization in binary logistic classification.
method Analytical and empirical insights into gradient descent dynamics near critical points.
result Logistic regression exhibits grokking when training data is nearly linearly separable from the origin with strong noise.
Nonnegative matrix factorization (NMF) under the separability assumption can provably be solved efficiently, even in the presence of noise, and has been shown to be a powerful technique in document classification and hyperspectral unmixing. This problem is referred to as near-separable NMF and requires that there exist…
New algorithms improve blind source separation for linear-quadratic mixtures.
problem Blind source separation of linear-quadratic mixtures under separability assumptions.
method Proposed two algorithms: SNPALQ and BF. SNPALQ generalizes SNPA for LQ model, BF post-processes SNPALQ.
result Proven robustness and computational tractability of SNPALQ in separating sources even with noise.
Method separates target signal properties from noisy mixtures.
problem Signal recovery from noisy mixtures with specific statistical properties.
method Statistical component separation method using noise samples and matching statistics.
result Method outperforms standard denoising methods in recovering target signal properties.
Single-channel signal separation and deconvolution aims to separate and deconvolve individual sources from a single-channel mixture and is a challenging problem in which no prior knowledge of the mixing filters is available. Both individual sources and mixing filters need to be estimated. In addition, a mixture may con…
New algorithms SVCA and SSPA improve robustness to noise in nonnegative matrix factorization.
problem Estimating vertices from noisy data points in convex hull.
method Smoothed VCA (SVCA) and Smoothed SPA (SSPA) algorithms.
result Improved robustness to noise compared to existing methods.
A new method for joint noise removal and trend estimation from sparse signals.
problem Jointly removing noise and estimating trends from sparse signals.
method PENDANTSS combines SOOT/SPOQ penalties with BEADS algorithm in a Trust-Region block alternating variable metric forward-backward approach.
result Outperforms comparable methods in deconvolving analytical chemistry signals.
Confidence-based filtering reveals latent structure in diffusion models.
problem Unclear latent structure in diffusion models.
method Confidence scores from a classifier.
result Class-relevant latent structure emerges under confidence-based filtering.
Study shows multi-distribution learning has slower rates than single-task learning.
problem Understanding the statistical complexity of learning from heterogeneous sources.
method Structured hypothesis-testing framework to capture the statistical cost of certifying near-optimality under bounded noise.
result Learning across multiple distributions incurs slow rates scaling with , even under constant noise levels.
CORES2 removes noisy labels by sieving out corrupted examples.
problem Instance-dependent label noise degrades DNN performance.
method CORES2 (COnfidence REgularized Sample Sieve) progressively sieves out corrupted examples.
result CORES2 provides theoretical guarantees for filtering out corrupted examples.
Blind source separation (BSS) is one of the most important and established research topics in signal processing and many algorithms have been proposed based on different statistical properties of the source signals. For second-order statistics (SOS) based methods, canonical correlation analysis (CCA) has been proved to…
Statistical Query Hardness of Multiclass Linear Classification with Random Classification Noisecs.LG
Study shows SQ hardness for multiclass linear classification with random noise.
problem Complexity of multiclass linear classification with random noise.
method Proves super-polynomial SQ lower bounds for MLC with RCN.
result Super-polynomial SQ lower bounds for MLC with RCN.
Bayesian approach uses generative models as priors for better source separation.
problem Artifacts in source separation for richly structured data.
method Bayesian approach with generative models as priors and noise-annealed Langevin dynamics.
result Achieves state-of-the-art performance for MNIST digit separation.
Blind source separation (BSS) aims at recovering signals from mixtures. This problem has been extensively studied in cases where the mixtures are contaminated with additive Gaussian noise. However, it is not well suited to describe data that are corrupted with Poisson measurements such as in low photon count optics or …
We present a noise-injected version of the Expectation-Maximization (EM) algorithm: the Noisy Expectation Maximization (NEM) algorithm. The NEM algorithm uses noise to speed up the convergence of the EM algorithm. The NEM theorem shows that injected noise speeds up the average convergence of the EM algorithm to a local…
The separability assumption (Donoho & Stodden, 2003; Arora et al., 2012) turns non-negative matrix factorization (NMF) into a tractable problem. Recently, a new class of provably-correct NMF algorithms have emerged under this assumption. In this paper, we reformulate the separable NMF problem as that of finding the ext…
In many applications one may acquire a composition of several signals that may be corrupted by noise, and it is a challenging problem to reliably separate the components from one another without sacrificing significant details. Adding to the challenge, in a compressive sensing framework, one is given only an undersampl…
A new convex model tackles noisy separable NMF with provable correctness.
problem Noisy separable NMF with multiple data points near basis vectors.
method Smooth separability assumption, convex model, fast gradient method.
result The convex model provably recovers factors in the presence of noise.
Measures three types of noise in LLM evaluations.
problem Separating signal from noise in LLM experiments.
method Defined and measured three types of noise: prediction, data, and total noise. Proposed the all-pairs paired method for statistical power.
result Total noise level is characteristic and predictable across all model pairs.
A prototypical blind signal separation problem is the so-called cocktail party problem, with n people talking simultaneously and n different microphones within a room. The goal is to recover each speech signal from the microphone inputs. Mathematically this can be modeled by assuming that we are given samples from an n…
The paper explores how different patterns of heterophily affect Graph Neural Networks.
problem Understanding the impact of heterophily on Graph Neural Networks.
method Theoretical analysis and experiments with Heterophilous Stochastic Block Models (HSBM).
result The impact of heterophily on classification depends on the Euclidean distance of neighborhood distributions and the averaged node degree.
Power Assisted Trend Followingq-fin.TR
Develops a new trend power indicator using DSP techniques.
problem Determining the strength and reversibility of trends.
method Derives a novel indicator using digital signal processing.
result Accuracy of the new indicator correlates with PNL performance.
New approach uses under-trained deep ensembles to learn from noisy labels.
problem Improper labelling hinders reliable generalization in supervised learning.
method Under-trained deep ensembles, each trained on a subset of data, combine to form better labels.
result Significant performance improvement in accuracy and kappa for noisy label tasks.
Paper proves min-vol NMF robust to noise under expanded condition.
problem Robustness of min-vol NMF to noise.
method Proved robustness under expanded sufficiently scattered condition.
result Proves min-vol NMF identifies groundtruth factors in noise.
The paper improves prediction and testing for signals from a linear combination of translated features with Gaussian noise.
problem Predicting and testing signals from a linear combination of translated features with varying scale parameter and Gaussian noise.
method Extends previous off-the-grid prediction results, improves minimal distance between features, proposes a goodness-of-fit test with upper bounds.
result Upper bounds on the minimax separation rate match those for the high-dimensional linear model, matching the lower bound.
SGD-trained neural networks generalize well even with adversarial label noise.
problem Generalization of neural networks trained on adversarial label noise.
method Training a one-hidden-layer neural network with SGD on arbitrary width networks.
result SGD-trained networks achieve classification accuracy competitive with the best halfspace over adversarial label noise.
NR-GANs learn clean images from noisy data.
problem Learning clean images from noisy training data.
method Introduced a noise generator and distribution/transformation constraints.
result NR-GANs can generate clean images from noisy data.
This paper simplifies complex game dynamics by using a recursive representation.
problem Difficulties in finite-player dynamic games with private information.
method Provides a recursive representation and noise-state model.
result Equilibrium becomes a deterministic fixed point in impulse-response functions.
AMP algorithm for matrix tensor product model provides recovery conditions.
problem Generalization of standard spiked matrix models with multiple pairwise observations.
method Approximate message passing with optimal weighing and combining of estimates.
result Asymptotically exact performance description and necessary/sufficient recovery conditions.
Unified view on learning unnormalized distributions using NCE.
problem Learning unnormalized distributions across different communities.
method Noise-Contrastive Estimation (NCE) for a unified perspective.
result Established finite-sample convergence rates for exponential families.
Study evaluates Tree-Ring Watermarking in rectified flow-based models, revealing detection and separability limitations.
problem Detecting and separating Tree-Ring Watermarks in rectified flow-based models.
method Extensive experimentation comparing SD 2.1 and FLUX.1-dev models with various text guidance configurations and augmentation attacks.
result Inversion limitations affect watermark recovery and statistical separation.
Study of asymmetric rank-one tensor models with non-Gaussian noise.
problem Analyzing maximum-likelihood estimators for asymmetric rank-one tensor models.
method Spectrally separated branch analysis, resolvent methods, cumulant expansions, Efron-Stein-type variance bounds.
result Asymptotic singular value and mode-wise alignments are robust to non-Gaussian noise.
Recently, a family of tractable NMF algorithms have been proposed under the assumption that the data matrix satisfies a separability condition Donoho & Stodden (2003); Arora et al. (2012). Geometrically, this condition reformulates the NMF problem as that of finding the extreme rays of the conical hull of a finite set …
A method for noise reduction in functional time series using FPCA.
problem Noise contamination in functional time series.
method Extending FPCA to separate signal and noise components.
result Optimal projection minimizes mean integrated squared error.