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

13263952 · Jun 202019922001200920172026
48 results for Extreme Deconvolution

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.

Study characterizes spike deconvolution basin for noisy data.

problem Recover spike locations from noisy convolution with PSF across multiple snapshots.
method Variable-projection formulation, explicit basin of convexity characterization, local convergence guarantees.
result Consistent estimator within basin of convexity under stochastic noise, complementary error bound under adversarial noise.

Deconvolutional layers have been widely used in a variety of deep models for up-sampling, including encoder-decoder networks for semantic segmentation and deep generative models for unsupervised learning. One of the key limitations of deconvolutional operations is that they result in the so-called checkerboard problem.…

2017-05-18abs ↗pdf ↗

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.

Deep learning improves galaxy image deconvolution in surveys.

problem Deconvolving large survey images with space-variant PSFs.
method Employed a U-Net DNN architecture for supervised galaxy image processing. Two strategies: Tikhonov deconvolution and ADMM-based iterative deconvolution.
result Deep learning approaches outperform standard convex optimization techniques in galaxy image reconstruction and shape recovery.

In image deconvolution problems, the diagonalization of the underlying operators by means of the FFT usually yields very large speedups. When there are incomplete observations (e.g., in the case of unknown boundaries), standard deconvolution techniques normally involve non-diagonalizable operators, resulting in rather …

2016-02-03abs ↗pdf ↗

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 ↗

Convolution is a central operation in Convolutional Neural Networks (CNNs), which applies a kernel to overlapping regions shifted across the image. However, because of the strong correlations in real-world image data, convolutional kernels are in effect re-learning redundant data. In this work, we show that this redund…

2019-05-28abs ↗pdf ↗

Stochastic volatility modelling of financial processes has become increasingly popular. The proposed models usually contain a stationary volatility process. We will motivate and review several nonparametric methods for estimation of the density of the volatility process. Both models based on discretely sampled continuo…

2009-10-27abs ↗pdf ↗

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.

OmniFold uses deep learning to deconvolve high-dimensional simulations.

problem Removing detector distortions and accounting for noise processes in high-dimensional simulations.
method OmniFold is a deep learning-based approach for maximum likelihood deconvolution.
result OmniFold can remove detector distortions and account for noise processes and acceptance effects.

A generative Bayesian model is developed for deep (multi-layer) convolutional dictionary learning. A novel probabilistic pooling operation is integrated into the deep model, yielding efficient bottom-up and top-down probabilistic learning. After learning the deep convolutional dictionary, testing is implemented via dec…

2014-12-18abs ↗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.

Blind deconvolution is a ubiquitous problem of recovering two unknown signals from their convolution. Unfortunately, this is an ill-posed problem in general. This paper focuses on the {\em short and sparse} blind deconvolution problem, where the one unknown signal is short and the other one is sparsely and randomly sup…

2018-06-01abs ↗pdf ↗

DDN models flexible free-form conditional distributions.

problem Difficulty in explicitly approximating arbitrary conditional distributions.
method Deconvolutional neural network framework for discretizing continuous domains.
result DDN outperforms other density-estimation methods on various tasks.

Two-stage nonconvex algorithm and convex relaxation both achieve optimal accuracy in noisy blind deconvolution.

problem Solving bilinear systems of equations with random noise under different designs.
method Two-stage nonconvex algorithm and convex relaxation.
result Both methods achieve minimax-optimal accuracy in the presence of random noise.

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.

We introduce the blind subspace deconvolution (BSSD) problem, which is the extension of both the blind source deconvolution (BSD) and the independent subspace analysis (ISA) tasks. We examine the case of the undercomplete BSSD (uBSSD). Applying temporal concatenation we reduce this problem to ISA. The associated `high …

2007-01-07abs ↗pdf ↗

Paper tackles privacy-preserving data density issues using deconvolution.

problem Privacy-preserving noise affects data density, leading to under/over-estimation.
method Develops deconvoluting kernel density estimators and regression models.
result Demonstrates improved accuracy in estimating heavy-hitters with locally differential data.

An evolutionary algorithm separates mixed DNA profiles in forensic genetics.

problem Deconvolving mixed DNA profiles from crime samples.
method Multiple population evolutionary algorithm (MEA) with guided mutation.
result The MEA successfully deconvoluted DNA profiles from crime samples.

Short-and-sparse deconvolution (SaSD) is the problem of extracting localized, recurring motifs in signals with spatial or temporal structure. Variants of this problem arise in applications such as image deblurring, microscopy, neural spike sorting, and more. The problem is challenging in both theory and practice, as na…

2019-08-28abs ↗pdf ↗

Paper solves complex signal processing problem efficiently.

problem Learning an unknown filter from multiple sparse convolutions.
method Nonconvex optimization over the sphere manifold using manifold gradient descent.
result Manifold gradient descent provably recovers the filter under random data model.

A latent-variable model is introduced for text matching, inferring sentence representations by jointly optimizing generative and discriminative objectives. To alleviate typical optimization challenges in latent-variable models for text, we employ deconvolutional networks as the sequence decoder (generator), providing l…

2017-09-21abs ↗pdf ↗

Modeling influenza spread using feature engineering and international flow deconvolution.

problem Predicting and mitigating influenza spread through feature extraction and international flow analysis.
method Discrete Fourier Transform, matrix completion, SVM, autoencoders, PCA, deconvolution of international flow.
result Significant environmental and economic features are crucial to influenza mortality.

Convolutional-deconvolution networks can be adopted to perform end-to-end saliency detection. But, they do not work well with objects of multiple scales. To overcome such a limitation, in this work, we propose a recurrent attentional convolutional-deconvolution network (RACDNN). Using spatial transformer and recurrent …

2016-04-12abs ↗pdf ↗

Scene parsing is an important and challenging prob- lem in computer vision. It requires labeling each pixel in an image with the category it belongs to. Tradition- ally, it has been approached with hand-engineered features from color information in images. Recently convolutional neural networks (CNNs), which automatica…

2014-11-15abs ↗pdf ↗

New framework for disentangling graph node and edge features.

problem Learning disentangled representations for attributed graphs with node and edge features.
method Proposes a novel variational objective and architecture for node and edge deconvolutions to disentangle latent factors.
result Demonstrates effectiveness of the proposed model and its extensions on synthetic and real-world datasets.

Learning latent representations from long text sequences is an important first step in many natural language processing applications. Recurrent Neural Networks (RNNs) have become a cornerstone for this challenging task. However, the quality of sentences during RNN-based decoding (reconstruction) decreases with the leng…

2017-08-16abs ↗pdf ↗