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,982 papers · 148 categories

Trend · papers per month

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for blind estimation

New insights into learning for blind inverse problems with theoretical guarantees.

problem Learning in blind inverse problems where both signal and operator are unknown.
method Data-driven approaches using Linear Minimum Mean Square Estimators (LMMSEs) with theoretical analysis.
result Established equivalences with Tikhonov-regularized formulations and derived finite-sample error bounds.

New method uses single quantum state for machine learning tasks, improving accuracy.

problem Challenges in unsupervised learning with quantum data.
method SIngle-Preparation Quantum Information Processing (SIPQIP) concept.
result Significantly more accurate estimation compared to traditional methods.

New CNN method improves deconvolution microscopy without PSF measurement.

problem Computational expense and blind estimation in conventional deconvolution microscopy.
method Cycle consistent CNN with explicit PSF modeling layers for blind deconvolution.
result Algorithm robustness and efficacy confirmed through experimental results.

New method solves blind inverse problems by optimizing both operator and image parameters.

problem Solving blind inverse problems with known forward operator.
method Parallel reverse diffusion guided by gradients from intermediate stages.
result State-of-the-art performance on blind deblurring and imaging through turbulence.

Algorithm finds frequencies, amplitudes, and phases of sinusoids in noisy data.

problem Finding frequencies, amplitudes, and phases of sinusoids in noisy data.
method Maximum likelihood approach to estimate tone parameters from contaminated observations. Successively estimates frequencies and jointly optimizes amplitudes and phases.
result Near-linear computational complexity (O(N)) for estimating MM number of sinusoidal sources.

A framework to quantify deployment risk in ML systems, especially for rare states.

problem Under-supported rare states in ML models lead to unreliable performance in unseen data.
method Blind-Spot Mass (B_n(tau)) using Good-Turing unseen-species estimation.
result Identifies and quantifies the risk of under-supported states in ML models.

Self-supervised method predicts clean signal and noise distribution from noisy images.

problem Blind denoising and noise estimation in biomedical images with limited clean data.
method Two neural networks jointly predict clean signal and noise distribution from noisy observations.
result Significantly outperforms state-of-the-art algorithms on six biomedical image datasets.

Our goal in this paper is to develop an effective estimator of fractal dimension. We survey existing ideas in dimension estimation, with a focus on the currently popular method of Grassberger and Procaccia for the estimation of correlation dimension. There are two major difficulties in estimation based on this method. …

2013-12-09abs ↗pdf ↗

We propose a new blind source separation algorithm based on mixtures of alpha-stable distributions. Complex symmetric alpha-stable distributions have been recently showed to better model audio signals in the time-frequency domain than classical Gaussian distributions thanks to their larger dynamic range. However, infer…

2017-11-13abs ↗pdf ↗

Blind Source Separation is a widely used technique to analyze multichannel data. In many real-world applications, its results can be significantly hampered by the presence of unknown outliers. In this paper, a novel algorithm coined rGMCA (robust Generalized Morphological Component Analysis) is introduced to retrieve s…

2015-07-08abs ↗pdf ↗

New algorithm for tensor decomposition and Gaussian mixture models.

problem Efficiently decompose overcomplete order-3 tensors and estimate parameters of Gaussian mixtures.
method Proposes Jennrich's algorithm adapted for tensor decomposition and Gaussian mixture models.
result Efficient algorithm for decomposing symmetric overcomplete order-3 tensors and estimating parameters of Gaussian mixtures.

New method uses VAEs for blind channel equalization and decoding.

problem Blind channel equalization and decoding without pilot symbols.
method Variational autoencoders (VAEs) for blind channel equalization and decoding.
result Significant improvement in error rate compared to existing methods.

A new method for accurately reconstructing signals without knowing the kernel or signal regularity.

problem Recovering signals from noisy measurements without prior knowledge of the convolution kernel or signal regularity.
method Parametrizing the convolution kernel and prior length-scales, jointly estimated in the inversion procedure.
result Accurate reconstructions of signals with varying regularity and unknown kernel size.

This paper proposes a multichannel source separation technique called the multichannel variational autoencoder (MVAE) method, which uses a conditional VAE (CVAE) to model and estimate the power spectrograms of the sources in a mixture. By training the CVAE using the spectrograms of training examples with source-class l…

2018-08-02abs ↗pdf ↗

A new method for blind source separation using hierarchical structure and KL divergence.

problem Blind source separation of complex interacting signals.
method Hierarchical log-linear model with KL divergence minimization.
result Superior performance compared to existing techniques on images and time series data.

Spatial blind source separation simplifies multivariate spatial prediction.

problem Predicting multivariate measurements at unobserved locations with spatial dependencies.
method Spatial blind source separation as a pre-processing tool compared to Cokriging and neural networks.
result Spatial blind source separation simplifies spatial prediction by avoiding cross-dependencies.

We propose a solution to the image deconvolution problem where the convolution kernel or point spread function (PSF) is assumed to be only partially known. Small perturbations generated from the model are exploited to produce a few principal components explaining the PSF uncertainty in a high dimensional space. Unlike …

2012-03-21abs ↗pdf ↗

Extracts the finest pattern of mutual independence from data.

problem Inferring the finest mutual independence pattern from data.
method Estimate the set of valid patterns of dichotomic independence and use their intersection to infer the finest pattern.
result The method can estimate the finest mutual independence pattern from i.i.d. realizations of a multivariate normal distribution.

Origami uses SGX enclaves and blinding to protect deep neural network inference privacy.

problem Protecting deep neural network inference privacy in machine learning services.
method Combines enclave execution, cryptographic blinding, and accelerator-based computation.
result Demonstrates improved privacy-preserving inference performance compared to prior work.

We revisit the Blind Deconvolution problem with a focus on understanding its robustness and convergence properties. Provable robustness to noise and other perturbations is receiving recent interest in vision, from obtaining immunity to adversarial attacks to assessing and describing failure modes of algorithms in missi…

2018-03-21abs ↗pdf ↗

This paper addresses the problem of blind and fully constrained unmixing of hyperspectral images. Unmixing is performed without the use of any dictionary, and assumes that the number of constituent materials in the scene and their spectral signatures are unknown. The estimated abundances satisfy the desired sum-to-one …

2014-03-03abs ↗pdf ↗

Optimal joint separation condition for radar and communications channels in dual-blind deconvolution.

problem Recovering information from overlaid radar and communications signals with unknown channels.
method Extremal functions from Beurling-Selberg interpolation theory for joint separation, nuclear norm minimization for matrix retrieval, and MUSIC for parameter estimation.
result Guaranteed well-conditioned Vandermonde matrix for MUSIC, validating theoretical findings.

Agents trained in simulation may make errors in the real world due to mismatches between training and execution environments. These mistakes can be dangerous and difficult to discover because the agent cannot predict them a priori. We propose using oracle feedback to learn a predictive model of these blind spots to red…

2018-05-23abs ↗pdf ↗

New algorithms recover network structure from noisy snapshots of diffusive processes.

problem Recovering network structure from nodal observations of a diffusive process without knowing the edges.
method Spectral algorithms based on latent stochastic block models and random matrix theory.
result Provable high-accuracy recovery of network partition and SBM parameters.

BDDMs eliminate noise conditioning in diffusion models, simplifying training and sampling.

problem Noise conditioning in diffusion models is ad hoc and requires unprincipled noise embeddings.
method Introduce blind denoising diffusion models (BDDMs) that do not require noise conditioning.
result BDDMs simplify training and sampling by eliminating noise conditioning.

CNNs can develop blind spots due to uneven padding in feature maps.

problem Spatial bias in convolutional networks leads to blind spots in certain tasks.
method Identified and analyzed the role of padding in convolutional networks, proposing solutions to mitigate bias.
result Mitigating spatial bias improves model accuracy, especially in tasks like small object detection.

Consider a social network where only a few nodes (agents) have meaningful interactions in the sense that the conditional dependency graph over node attribute variables (behaviors) is sparse. A company that can only observe the interactions between its own customers will generally not be able to accurately estimate its …

2017-11-15abs ↗pdf ↗

Blind deconvolution involves the estimation of a sharp signal or image given only a blurry observation. Because this problem is fundamentally ill-posed, strong priors on both the sharp image and blur kernel are required to regularize the solution space. While this naturally leads to a standard MAP estimation framework,…

2013-05-10abs ↗pdf ↗

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 adversarial training procedure proposed by Madry et al. (2018) is one of the most effective methods to defend against adversarial examples in deep neural networks (DNNs). In our paper, we shed some lights on the practicality and the hardness of adversarial training by showing that the effectiveness (robustness on t…

2019-01-15abs ↗pdf ↗

Unified framework for fair classification with group-blindness/awareness guarantees.

problem Challenges in enforcing fairness and group-blindness in binary classification.
method Unified framework based on post-processing procedure, applicable to various group fairness notions.
result Minimax rate-optimality of the proposed algorithm with controlled excess risk.

A new method for separating mixed signals in space and time.

problem Nonlinear and nonstationary spatio-temporal data challenges.
method Identifiable autoregressive variational autoencoder.
result The method outperforms existing techniques in blind source separation and spatio-temporal prediction.

We propose a new method for blind system identification. Resorting to a Gaussian regression framework, we model the impulse response of the unknown linear system as a realization of a Gaussian process. The structure of the covariance matrix (or kernel) of such a process is given by the stable spline kernel, which has b…

2014-12-12abs ↗pdf ↗

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.

AR-Flow VAE improves blind source separation with flexible autoregressive priors.

problem Unsupervised blind source separation of latent signals from mixtures.
method AR-Flow VAE uses autoregressive flows to model latent sources, enhancing flexibility and capturing complex dependencies.
result AR-Flow VAE effectively separates latent sources, demonstrating improved performance over conventional methods.