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

88176263351 · Jun 202019922001200920172026
48 results for noisy measurements

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.

Paper analyzes BIHT for noisy 1-bit CS, improving results with up to τ-fraction of incorrect measurements.

problem Estimating sparse vectors from noisy sign measurements in 1-bit compressed sensing.
method Binary Iterative Hard Thresholding (BIHT) algorithm, using Gaussian matrices and high-dimensional geometry analysis.
result BIHT provides estimates within ε+τ error with τ-fraction of incorrect measurements, maintaining universality of measurements.

This work introduces a method to learn dynamical systems from noisy sensor measurements using multiple shooting.

problem Learning dynamical systems from noisy sensor measurements is challenging due to system instability.
method A scalable method based on multiple shooting.
result Robust learning of latent representations of dynamical systems from noisy measurements.

New algorithm learns nonlinear phenomena from noisy local measurements without data exchange.

problem Learning nonlinear phenomena from noisy local measurements in a decentralized network.
method Non-parametric learning algorithm that spreads information only between neighboring nodes.
result Non-asymptotic estimation error bounds for the proposed method.

Preconditioned non-convex gradient descent improves noisy matrix estimation.

problem Estimating low-rank matrices from noisy measurements.
method Preconditioned non-convex gradient descent for noisy measurements.
result Preconditioned method converges to minimax optimal estimate at a linear rate.

Paper studies zero-sum games with noisy observations and identifies equilibrium conditions.

problem Zero-sum games with noisy observations of the leader's actions.
method Analyzes the equilibrium of games with noisy action observability, identifies necessary conditions for uniqueness, and investigates the cardinality of best responses.
result The noisy observations significantly impact the cardinality of the follower's set of best responses, and under certain conditions, this set becomes a singleton almost surely.

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.

Study proposes method to estimate causal effects from noisy treatment data.

problem Estimating causal effects from noisy treatment data without side information.
method Deep latent variable model with neural network parameterization and amortized importance-weighted variational objective.
result Causal effect estimates are identifiable without side information and measurement error variance knowledge.

The abundance of data produced daily from large variety of sources has boosted the need of novel approaches on causal inference analysis from observational data. Observational data often contain noisy or missing entries. Moreover, causal inference studies may require unobserved high-level information which needs to be …

2017-03-13abs ↗pdf ↗

Paper improves learning mixtures of sparse signals from noisy measurements.

problem Learning mixtures of sparse linear regressions from noisy measurements.
method Improves upon state-of-the-art results using sparse polynomials and error-correcting codes.
result First robust reconstruction algorithm for mixtures of more than two sparse signals.

Proposes a new model to handle noisy data in scientific research.

problem Measurement error in noisy data settings.
method Measurement error BART (meBART) integrates measurement error in Bayesian additive regression trees.
result meBART provides more accurate parameter estimation, robust uncertainty quantification, and superior predictive performance.

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…

2017-05-05abs ↗pdf ↗

ProAGAN stabilizes GANs for learning SOMs from noisy medical imaging data.

problem Learning stochastic object models from noisy and indirect medical imaging measurements.
method Developed Progressive Growing of AmbientGANs (ProAGAN) to stabilize GANs training.
result Signal detection performance improved using ProAGAN-generated images.

APGD algorithm efficiently recovers over-parameterized matrices from noisy measurements.

problem Matrix sensing problem with over-parameterization and noisy measurements.
method Alternating preconditioned gradient descent (APGD) algorithm incorporating preconditioning terms.
result APGD converges to a near-optimal error at a linear rate.

VSE estimates complex processes from noisy measurements without a model.

problem Estimating states of complex, model-free processes from noisy data.
method Variational state estimation using recurrent neural networks (RNNs) in both learning and inference phases.
result VSE provides a competitive state estimate for a benchmark process (Lorenz system) compared to known and data-driven methods.

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 ↗

Optimal transport for measures on noisy tree metrics is solved with robust approach.

problem Optimal transport problem for measures on noisy tree metrics.
method Max-min robust optimal transport approach considering uncertainty sets of tree metrics.
result Robust optimal transport admits a closed-form expression for fast computation.

Framework uses diffusion models to infer material properties from noisy mechanical measurements.

problem Inference of spatially varying material properties from noisy mechanical responses.
method Conditional score-based diffusion models approximating the score function of a conditional distribution.
result Framework can efficiently solve large-scale physics-based inverse problems.

Paper identifies latent factors from noisy measurements using tensor decomposition.

problem Identification of latent factors from noisy, correlated measurements.
method Tensor decomposition of third order cross moments, Kruskal theorem, Kotlarski identity, generalized Kruskal rank.
result Full distribution of latent factors and measurement errors identified without injective measurements.

This work explores how neural network architecture affects robustness to noisy labels.

problem The impact of neural network architecture on robustness to noisy labels.
method Formal framework connecting robustness to architecture alignments, measured by predictive power in representations.
result Network robustness to noisy labels improves when its architecture is more aligned with the target function.

PIE-PINN estimates elastic properties from noisy, low-res displacement data.

problem Estimating heterogeneous elastic properties from low-resolution, noisy data.
method Probabilistic Physics-Informed Neural Network (PIE-PINN) framework combining B-spline and hierarchical scale model.
result Robust estimation of Young's modulus and Poisson's ratio from noisy, low-resolution displacement data.

Sharp global guarantees for noisy overparameterized low-rank recovery.

problem Understanding practical success of overparameterization in noisy conditions.
method Unified proof technique combining escape directions and counterexample inexistence.
result Near-second-order points achieve minimax-optimal recovery bounds.

Randomized experiments are the gold standard for evaluating the effects of changes to real-world systems. Data in these tests may be difficult to collect and outcomes may have high variance, resulting in potentially large measurement error. Bayesian optimization is a promising technique for efficiently optimizing multi…

2017-06-21abs ↗pdf ↗

Machine learning, and more specifically deep learning, have shown remarkable performance in sensing, communications, and inference. In this paper, we consider the application of the deep unfolding technique in the problem of signal reconstruction from its one-bit noisy measurements. Namely, we propose a model-based mac…

2018-11-30abs ↗pdf ↗

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.

Recursive KalmanNet generalizes well in noisy, out-of-distribution scenarios.

problem Generalization in noisy, out-of-distribution scenarios.
method Recurrent neural network guided by a Kalman filter.
result Recursive KalmanNet performs well in scenarios with different temporal dynamics from training data.

The paper develops a robust signal estimation method for noisy measurements from generative models.

problem Signal estimation from noisy non-linear measurements with adversarial corruptions.
method Generalized Lasso approach with sub-Gaussian measurements and adversarial noise consideration.
result The method requires $O\left(\frac{k}{ε^2}\log L ight)$ samples for εε-error recovery, robust to adversarial noise.

Paper develops RGN method for estimating low-rank tensors from noisy measurements.

problem Estimating low-rank tensors from noisy linear measurements.
method Riemannian Gauss-Newton (RGN) method for efficient low-rank tensor estimation.
result First local quadratic convergence guarantee of RGN for low-rank tensor estimation in noisy settings.