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

235470705940 · Jun 202019922001200920172026
48 results for noisy problems

A fast method approximates likelihood scores for noisy linear inverse problems.

problem Solving noisy linear inverse problems efficiently.
method Proposes a simple closed-form approximation to the likelihood score for diffusion and flow-based models.
result Significantly faster than baseline methods while maintaining competitive or better reconstruction performances.

Deep neural networks solve noisy, complex problems accurately.

problem Reconstructing solutions from noisy, high-dimensional, non-linear inverse problems.
method Restricting infinite-dimensional forward operators to finite-dimensional spaces, training neural networks to approximate these operators robustly to noise.
result Deep neural networks can accurately solve high-dimensional, noisy, non-linear inverse problems.

Leveraging weak or noisy supervision for building effective machine learning models has long been an important research problem. Its importance has further increased recently due to the growing need for large-scale datasets to train deep learning models. Weak or noisy supervision could originate from multiple sources i…

2019-11-10abs ↗pdf ↗

Deep neural networks (DNNs) trained on large-scale datasets have exhibited significant performance in image classification. Many large-scale datasets are collected from websites, however they tend to contain inaccurate labels that are termed as noisy labels. Training on such noisy labeled datasets causes performance de…

2018-03-30abs ↗pdf ↗

JoCoR improves deep learning with noisy labels by reducing network diversity.

problem Learning with noisy labels in deep learning.
method JoCoR uses two networks to make predictions, calculates a joint loss with Co-Regularization, and updates both networks simultaneously.
result JoCoR outperforms state-of-the-art approaches in learning with noisy labels.

Paper improves 0\ell^{0}-SSC for noisy data by proving SDP and proposing Noisy-DR-0\ell^{0}-SSC.

problem Noisy data and less restrictive subspace affinity in sparse subspace clustering.
method Proposes Noisy-DR-0\ell^{0}-SSC, which projects data onto a lower dimensional space and then applies noisy 0\ell^{0}-SSC.
result Theoretical guarantee on the correctness of noisy 0\ell^{0}-SSC in terms of SDP on noisy data.

We consider the problem of clustering noisy high-dimensional data points into a union of low-dimensional subspaces and a set of outliers. The number of subspaces, their dimensions, and their orientations are unknown. A probabilistic performance analysis of the thresholding-based subspace clustering (TSC) algorithm intr…

2013-05-15abs ↗pdf ↗

Bayes classifier cannot be learned from noisy labels without knowing noise distribution.

problem Learning a Bayes classifier from noisy labels when the noise distribution is unknown.
method Demonstrates the identifiability issues and proposes a simple algorithm for learning the Bayes decision rule.
result The Bayes decision rule is generally unidentified and cannot be learned without knowing the noise distribution.

New algorithm optimizes matrix reordering for noisy disordered matrices.

problem Optimizing matrix reordering for noisy disordered matrices in single-cell biology and metagenomics.
method Proposed a polynomial-time adaptive sorting algorithm to improve upon spectral seriation.
result Our algorithm achieves superior performance compared to existing methods in real datasets.

We present a principled framework to address resource allocation for realizing boosting algorithms on substrates with communication or computation noise. Boosting classifiers (e.g., AdaBoost) make a final decision via a weighted vote from the outputs of many base classifiers (weak classifiers). Suppose that the base cl…

2019-09-10abs ↗pdf ↗

Thompson Sampling tackles noisy context in stochastic bandits.

problem Designing an action policy for noisy, corrupted contexts in stochastic bandits.
method Introducing a Thompson Sampling algorithm for Gaussian bandits with Gaussian context noise, adopting an information-theoretic analysis.
result Demonstrates the Bayesian regret of the proposed algorithm concerning the oracle's action policy.

Most existing image denoising approaches assumed the noise to be homogeneous white Gaussian distributed with known intensity. However, in real noisy images, the noise models are usually unknown beforehand and can be much more complex. This paper addresses this problem and proposes a novel blind image denoising algorith…

2016-01-13abs ↗pdf ↗

The paper tackles learning true rankings from noisy, incomplete data.

problem Learning true rankings from incomplete and noisy data.
method Introduces a selective Mallows model for noisy rankings and derives upper and lower bounds on sample complexity.
result Strong asymptotically tight bounds on sample complexity for learning complete rankings and top-k rankings.

Subspace clustering is the problem of clustering data points into a union of low-dimensional linear/affine subspaces. It is the mathematical abstraction of many important problems in computer vision, image processing and machine learning. A line of recent work (4, 19, 24, 20) provided strong theoretical guarantee for s…

2015-04-04abs ↗pdf ↗

We investigate the problem of estimating a given real symmetric signal matrix C\textbf{C} from a noisy observation matrix M\textbf{M} in the limit of large dimension. We consider the case where the noisy measurement M\textbf{M} comes either from an arbitrary additive or multiplicative rotational invariant perturbati…

2015-02-24abs ↗pdf ↗

The ability of learning from noisy labels is very useful in many visual recognition tasks, as a vast amount of data with noisy labels are relatively easy to obtain. Traditionally, the label noises have been treated as statistical outliers, and approaches such as importance re-weighting and bootstrap have been proposed …

2017-03-07abs ↗pdf ↗

Paper tackles noisy bandit feedback for multiclass classification.

problem Learning multiclass classifier with corrupted feedback.
method Proposes an unbiased estimator technique to estimate noise rates and an end-to-end framework.
result Algorithm achieves mistake bounds of O(T)O(\sqrt{T}) in high noise and O(Ticefrac23)O(T^{ icefrac{2}{3}}) in worst case.

We address the problem of estimating the parameters of a time-homogeneous Markov chain given only noisy, aggregate data. This arises when a population of individuals behave independently according to a Markov chain, but individual sample paths cannot be observed due to limitations of the observation process or the need…

2016-04-14abs ↗pdf ↗

Paper analyzes noisy low-rank matrix optimization, improving RIP bounds and convergence rates.

problem Noisy low-rank matrix optimization with general objective functions.
method Develops new mathematical framework and proves convergence rate under RIP condition.
result Any spurious local solution is close to ground truth when RIP constant is less than 1/3.

A framework for multi-agent communication over noisy channels in reinforcement learning.

problem Effective communication between multiple agents in a noisy environment.
method A novel multi-agent partially observable Markov decision process (MA-POMDP) framework considering noisy communication channels.
result Jointly learned policies outperform separate learning of communication and decision making.

New algorithm mitigates bias in subset selection with noisy protected attributes.

problem Mitigating bias in subset selection when protected attributes are noisy.
method Formulated a denoised selection problem and developed a linear-programming based approximation algorithm.
result The approach can produce fairer subsets despite noisy protected attributes.

Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of applications, from collaborative filtering (the `Netflix problem') to structure-from-motion and positioning. We study a low complexity algorithm…

2009-06-11abs ↗pdf ↗

DiEM trains diffusion models from noisy data using EM.

problem Training diffusion models requires clean data, which is often unavailable.
method DiEM uses expectation-maximization algorithm to train diffusion models from incomplete and noisy observations.
result DiEM leads to proper diffusion models suitable for downstream tasks.

INGB improves oversampling for noisy imbalanced datasets.

problem Imbalanced, noisy, and complex datasets in classification problems.
method INGB uses granular balls to simulate spatial distribution and informed entropy for optimization, followed by nonlinear oversampling.
result INGB outperforms traditional linear sampling frameworks and algorithms on complex datasets.

Paper tackles noisy labels for non-decomposable performance measures.

problem Learning from noisy labels for non-decomposable performance measures.
method Designs algorithms for multiclass non-decomposable performance measures using Frank-Wolfe and Bisection methods, corrected for class-conditional noise.
result Noise-corrected algorithms are Bayes consistent, converging to optimal performance.