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.

169,051 papers · 148 categories

Trend · papers per month

3957911,1861,581 · Jun 202019922001200920182026
48 results for Convolutional 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.

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.

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 ↗

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 distributed algorithm learns patterns in large images and signals.

problem High-dimensional optimization in large images and signals.
method Distributed asynchronous algorithm with locally greedy coordinate descent.
result Patterns can be learned on large scales images from the Hubble Space Telescope.

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 ↗

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 ↗

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 ↗

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.

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 ↗

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.

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.

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.

Graph convolutional network (GCN) is generalization of convolutional neural network (CNN) to work with arbitrarily structured graphs. A binary adjacency matrix is commonly used in training a GCN. Recently, the attention mechanism allows the network to learn a dynamic and adaptive aggregation of the neighborhood. We pro…

2018-02-14abs ↗pdf ↗

Study on Bayesian deep linear networks with multiple outputs and convolutional layers.

problem Characterize feature learning in finite-width Bayesian deep linear networks.
method Exact and analytical formulas for joint and posterior distributions, using large deviation theory.
result Quantitative description of feature learning in infinite-width regime.

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 ↗

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.

A new greedy method tackles 0,\ell_{0,\infty} sparse coding for better image processing.

problem Imbalanced sparsity in 0\ell_0 and 1\ell_1 norms for image processing.
method Greedy matching pursuit for 0,\ell_{0,\infty} norm optimization.
result Efficient method for 0,\ell_{0,\infty} sparse coding and dictionary learning.

Many techniques in computer vision, machine learning, and statistics rely on the fact that a signal of interest admits a sparse representation over some dictionary. Dictionaries are either available analytically, or can be learned from a suitable training set. While analytic dictionaries permit to capture the global st…

2013-03-21abs ↗pdf ↗

Bayesian method improves dictionary learning for complex problems.

problem Efficiently identifying relevant dictionary entries for complex inverse problems.
method Bayesian group sparsity coding and deflation steps to compress and identify relevant subdictionaries.
result Significant computational complexity reduction and improved glitch detection in LIGO experiment.

Sparse representations using learned dictionaries are being increasingly used with success in several data processing and machine learning applications. The availability of abundant training data necessitates the development of efficient, robust and provably good dictionary learning algorithms. Algorithmic stability an…

2013-03-03abs ↗pdf ↗

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 ↗

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 ↗

The paper tackles dictionary learning with almost sure error constraints.

problem Achieving desirable features in data representation with almost sure error constraints.
method Imposes almost sure recovery constraints and reformulates the problem as a convex-concave min-max problem, solved using gradient descent-ascent.
result Demonstrates the effectiveness of the proposed method in achieving almost sure error constraints in dictionary learning.

In sparse signal representation, the choice of a dictionary often involves a tradeoff between two desirable properties -- the ability to adapt to specific signal data and a fast implementation of the dictionary. To sparsely represent signals residing on weighted graphs, an additional design challenge is to incorporate …

2014-01-05abs ↗pdf ↗

We study the Dictionary Learning (aka Sparse Coding) problem of obtaining a sparse representation of data points, by learning \emph{dictionary vectors} upon which the data points can be written as sparse linear combinations. We view this problem from a geometry perspective as the spanning set of a subspace arrangement,…

2014-02-28abs ↗pdf ↗

Sparse coding in learned dictionaries has been established as a successful approach for signal denoising, source separation and solving inverse problems in general. A dictionary learning method adapts an initial dictionary to a particular signal class by iteratively computing an approximate factorization of a training …

2012-05-28abs ↗pdf ↗

Study shows unique sharp local minimum in 1\ell_1-minimization for dictionary learning.

problem Global recovery of a dictionary from random linear combinations of atoms.
method Norm condition, explicit bound, perturbation-based test, Block Coordinate Descent algorithm.
result Reference dictionary is the unique sharp local minimum of the 1\ell_1 objective function.

We present a two-stage approach for learning dictionaries for object classification tasks based on the principle of information maximization. The proposed method seeks a dictionary that is compact, discriminative, and generative. In the first stage, dictionary atoms are selected from an initial dictionary by maximizing…

2012-08-17abs ↗pdf ↗

In this work we propose a new deep learning tool called deep dictionary learning. Multi-level dictionaries are learnt in a greedy fashion, one layer at a time. This requires solving a simple (shallow) dictionary learning problem, the solution to this is well known. We apply the proposed technique on some benchmark deep…

2016-01-31abs ↗pdf ↗

Dictionary learning is a cutting-edge area in imaging processing, that has recently led to state-of-the-art results in many signal processing tasks. The idea is to conduct a linear decomposition of a signal using a few atoms of a learned and usually over-completed dictionary instead of a pre-defined basis. Determining …

2016-05-25abs ↗pdf ↗