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

4398791,3181,757 · Jun 202019922001200920172026
48 results for Convolutional Analysis Dictionary Learning

DeepCAM learns convolutional dictionaries for image processing.

problem Processing high-dimensional signals like images efficiently.
method Introduces a Deep Convolutional Analysis Dictionary Model (DeepCAM) using convolutional dictionaries.
result DeepCAM achieves performance comparable to other methods on single image super-resolution.

Proposes DCADL for efficient image classification with reduced complexity.

problem Efficiency and discriminative capability in DL methods for image classification.
method Jointly learns a convolutional analysis dictionary and a universal classifier, reducing time complexity.
result Achieves competitive accuracy with reduced computational cost.

CDPL-Net integrates CNN and DL for better image representation.

problem Improving image representation learning by combining CNN and DL.
method CDPL-Net architecture combining CNN and DPL layers, using l1-norm for sparse representation, and efficient stochastic gradient descent.
result Enhanced performance compared to state-of-the-art methods.

A multi-way factor analysis model is introduced for tensor-variate data of any order. Each data item is represented as a (sparse) sum of Kruskal decompositions, a Kruskal-factor analysis (KFA). KFA is nonparametric and can infer both the tensor-rank of each dictionary atom and the number of dictionary atoms. The model …

2016-12-08abs ↗pdf ↗

Tensor methods have emerged as a powerful paradigm for consistent learning of many latent variable models such as topic models, independent component analysis and dictionary learning. Model parameters are estimated via CP decomposition of the observed higher order input moments. However, in many domains, additional inv…

2015-06-10abs ↗pdf ↗

We solve the compressive sensing problem via convolutional factor analysis, where the convolutional dictionaries are learned {\em in situ} from the compressed measurements. An alternating direction method of multipliers (ADMM) paradigm for compressive sensing inversion based on convolutional factor analysis is develope…

2017-01-11abs ↗pdf ↗

PerCDL learns personalized dictionaries for physiological signals combining global and local structures.

problem Representing datasets with both global and local structures in human physiological signals.
method Personalized Convolutional Dictionary Learning (PerCDL) that combines a global and personalized local dictionary.
result PerCDL effectively learns interpretable representations for human locomotion data.

GPCDL uses Gaussian Processes to learn smooth templates from data.

problem Lack of smoothness in learned templates leads to overfitting and poor predictive performance.
method GPCDL incorporates Gaussian Process priors to enforce smoothness in the learned templates.
result GPCDL outperforms unregularized CDL in accuracy and predictive performance across various SNRs and applications.

UNHaP removes noise from physiological events using Hawkes processes.

problem Challenges in identifying true events from spurious ones in physiological signal analysis.
method UNHaP uses marked Hawkes processes to distinguish and unmix true events from noise.
result UNHaP significantly reduces false detection rates and enhances event understanding.

A deep network classifies images by scattering and dictionary learning.

problem Classifying images with high accuracy using deep learning.
method Sparse scattering transform followed by 1\ell^1 dictionary learning in a deep convolutional network.
result Higher classification accuracy than AlexNet on ImageNet dataset.

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 ↗

This paper tackles spatio-temporal information preservation in machine learning.

problem Conventional machine learning assumes orthogonal data attributes, disrupting spatio-temporal information.
method Shift-invariant k-means, convolutional dictionary learning, and spatio-temporal hypercomplex encoding schemes are proposed.
result Gabor feature extraction outperforms convolutional dictionary learning in spatio-temporal information preservation.

Convolutional operator learning is gaining attention in many signal processing and computer vision applications. Learning kernels has mostly relied on so-called patch-domain approaches that extract and store many overlapping patches across training signals. Due to memory demands, patch-domain methods have limitations w…

2018-02-15abs ↗pdf ↗

Sparse dictionary learning (SDL) has become a popular method for adaptively identifying parsimonious representations of a dataset, a fundamental problem in machine learning and signal processing. While most work on SDL assumes a training dataset of independent and identically distributed samples, a variant known as con…

2017-08-29abs ↗pdf ↗

A generative model is developed for deep (multi-layered) convolutional dictionary learning. A novel probabilistic pooling operation is integrated into the deep model, yielding efficient bottom-up (pretraining) and top-down (refinement) probabilistic learning. Experimental results demonstrate powerful capabilities of th…

2015-04-15abs ↗pdf ↗

Proposes a hierarchical deep generative model for natural images.

problem Analyzing piecewise smooth signals like natural images.
method Hierarchical deep generative model with alternating minimization algorithm.
result Demonstrates the model's representation capabilities and classification performance.

We present a probabilistic modeling and inference framework for discriminative analysis dictionary learning under a weak supervision setting. Dictionary learning approaches have been widely used for tasks such as low-level signal denoising and restoration as well as high-level classification tasks, which can be applied…

2018-02-05abs ↗pdf ↗

This work learns sparse tensor representations using mixtures of separable dictionaries.

problem Learning sparse representations of tensor data with structured models.
method Proposes and explores learning a mixture of separable dictionaries with sufficient conditions for local identifiability.
result Developed computational algorithms for batch and online learning.

CRsAE autoencoder learns dictionary for image denoising and brain spike detection.

problem Sparse dictionary learning for image and neural signal processing.
method CRsAE architecture, alternating E-step and M-step, FISTA for sparse coding, EM-inspired regularization.
result CRsAE outperforms conventional methods in image denoising and spike detection.

Convolutional auto-encoders learn natural exponential family distributions.

problem Learning latent variables for non-Gaussian data.
method Inspired by CDL, combines CNN and deep learning for natural exponential family data.
result Improved unsupervised and competitive supervised performance.

A deep generative model is developed for representation and analysis of images, based on a hierarchical convolutional dictionary-learning framework. Stochastic {\em unpooling} is employed to link consecutive layers in the model, yielding top-down image generation. A Bayesian support vector machine is linked to the top-…

2015-12-23abs ↗pdf ↗

Paper learns dictionaries for sparse signal recovery using automatic differentiation.

problem Learning dictionaries for sparse signal recovery from noisy data.
method Approximates reconstructions using FB algorithm and learns dictionaries with projected gradient descent.
result Successfully learns 1D TV dictionary from piecewise constant signals.

RandNet learns from compressed image data, improving efficiency and accuracy.

problem Efficiency and accuracy in training neural networks with large datasets.
method RandNet uses compressed random measurements of images to train neural networks efficiently.
result RandNet achieves comparable accuracy to full data training with minimal loss.

Paper proposes clustering model for ICC based on histologic patterns.

problem Challenges in grading rare cancers like ICC due to small sample sizes and difficulty in extracting patterns.
method Unsupervised deep convolutional autoencoder clustering model trained on 246 ICC digitized slides.
result Three clusters significantly associated with recurrence-free survival in Cox-proportional hazard models.

This paper studies the convergence behaviour of dictionary learning via the Iterative Thresholding and K-residual Means (ITKrM) algorithm. On one hand it is proved that ITKrM is a contraction under much more relaxed conditions than previously necessary. On the other hand it is shown that there seem to exist stable fixe…

2018-04-19abs ↗pdf ↗

This paper concerns dictionary learning, i.e., sparse coding, a fundamental representation learning problem. We show that a subgradient descent algorithm, with random initialization, can provably recover orthogonal dictionaries on a natural nonsmooth, nonconvex 1\ell_1 minimization formulation of the problem, under mi…

2018-10-25abs ↗pdf ↗

Dictionary learning and component analysis are part of one of the most well-studied and active research fields, at the intersection of signal and image processing, computer vision, and statistical machine learning. In dictionary learning, the current methods of choice are arguably K-SVD and its variants, which learn a …

2017-03-22abs ↗pdf ↗

The kernel least-mean-square (KLMS) algorithm is an appealing tool for online identification of nonlinear systems due to its simplicity and robustness. In addition to choosing a reproducing kernel and setting filter parameters, designing a KLMS adaptive filter requires to select a so-called dictionary in order to get a…

2013-10-31abs ↗pdf ↗

Study optimization landscapes for overcomplete representations, showing benign geometric structures.

problem Optimizing overcomplete representations in high-dimensional data analysis.
method Formulate as 4\ell^4-norm optimization problems with spherical constraint, analyze geometric properties.
result Nonconvex objectives have benign geometric structures, ensuring local search algorithms find target solutions.

PUDLE method analyzes and improves unrolled sparse coding networks for dictionary learning.

problem Dictionary learning problem, representing data as a combination of few atoms.
method PUDLE method addresses challenges in unrolled sparse coding networks through theoretical analysis and practical strategies.
result PUDLE method provides conditions for recovering and preserving the support of the latent code, and resolves bias and instability issues.

We describe new results and algorithms for two different, but related, problems which deal with circulant matrices: learning shift-invariant components from training data and calculating the shift (or alignment) between two given signals. In the first instance, we deal with the shift-invariant dictionary learning probl…

2018-12-03abs ↗pdf ↗

In signal analysis and synthesis, linear approximation theory considers a linear decomposition of any given signal in a set of atoms, collected into a so-called dictionary. Relevant sparse representations are obtained by relaxing the orthogonality condition of the atoms, yielding overcomplete dictionaries with an exten…

2014-11-01abs ↗pdf ↗

Dictionary learning and component analysis models are fundamental for learning compact representations that are relevant to a given task (feature extraction, dimensionality reduction, denoising, etc.). The model complexity is encoded by means of specific structure, such as sparsity, low-rankness, or nonnegativity. Unfo…

2018-01-18abs ↗pdf ↗

We develop methods to learn dictionaries invariant under group symmetries, useful in cryo-EM and tracking.

problem Learning dictionaries invariant under group symmetries.
method Representation theory, non-abelian Fourier analysis, matrix orbitopes, alternating minimization.
result Effective dictionary learning for SO(3) symmetries with guarantees.