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

4609201,3801,840 · Jun 202019922001200920172026
48 results for Convolutional Dictionary Pair Learning Network

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.

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.

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.

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.

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 ↗

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.

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 ↗

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 ↗

Discriminative Dictionary Learning (DL) methods have been widely advocated for image classification problems. To further sharpen their discriminative capabilities, most state-of-the-art DL methods have additional constraints included in the learning stages. These various constraints, however, lead to additional computa…

2019-03-07abs ↗pdf ↗

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 ↗

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 ↗

We propose a generalization of neural network sequence models. Instead of predicting one symbol at a time, our multi-scale model makes predictions over multiple, potentially overlapping multi-symbol tokens. A variation of the byte-pair encoding (BPE) compression algorithm is used to learn the dictionary of tokens that …

2017-07-03abs ↗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.

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 ↗

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.

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 ↗

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.

Detects financial fraud schemes in networks using graph structure learning.

problem Identifying financial fraud schemes in complex networks.
method Adapting dictionary learning to network topologies, imposing Laplacian structure on dictionaries.
result Proposed methods effectively represent graph structure information for anomaly detection.

Principal component analysis, dictionary learning, and auto-encoders are all unsupervised methods for learning representations from a large amount of training data. In all these methods, the higher the dimensions of the input data, the longer it takes to learn. We introduce a class of neural networks, termed RandNet, f…

2019-08-25abs ↗pdf ↗

We consider the problem of distributed dictionary learning, where a set of nodes is required to collectively learn a common dictionary from noisy measurements. This approach may be useful in several contexts including sensor networks. Diffusion cooperation schemes have been proposed to solve the distributed linear regr…

2013-04-12abs ↗pdf ↗

New MHSNs extract multiscale features from complex data for robust classification.

problem Signal classification and domain classification on complex data.
method Layered structure with multiscale basis dictionaries, pooling operations, and invariant features.
result High-accuracy classification with fewer parameters than traditional graph neural networks.

Wide neural networks learn features under μμP, identifying weights and decomposing support.

problem Feature learning in wide neural networks under μμP.
method Proving mean-field limit, characterizing identifiability, sparse-dictionary decomposition, and feature-learning-error decomposition.
result The triple (w,Dorb,S)(w^*, D^*_{\mathrm{orb}}, S^*) identifies the natural learning cell of the architecture-data pair (σ,ρ)(σ, ρ).

Unified model combines neural networks and dictionary learning for clinical predictions from brain data.

problem Predicting clinical severity from brain imaging data.
method Combines neural networks with dictionary learning to model patient-specific and shared features.
result Unified model outperforms state-of-the-art methods in predicting clinical severity.

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.

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 ↗

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 ↗

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 ↗

New models explain residual and dilated dense neural networks using sparse coding.

problem Lack of theoretical understanding of residual and dilated dense neural networks.
method Proposed Res-CSC and MSD-CSC models, derived mathematical relationships, implemented ISTA.
result Mathematical understanding of residual and dilated dense neural networks.

In sparse recovery we are given a matrix AA (the dictionary) and a vector of the form AXA X where XX is sparse, and the goal is to recover XX. This is a central notion in signal processing, statistics and machine learning. But in applications such as sparse coding, edge detection, compression and super resolution, t…

2013-08-28abs ↗pdf ↗

We consider the dictionary learning problem, where the aim is to model the given data as a linear combination of a few columns of a matrix known as a dictionary, where the sparse weights forming the linear combination are known as coefficients. Since the dictionary and coefficients, parameterizing the linear model are …

2019-02-28abs ↗pdf ↗

OMF algorithm adapts to Markovian data streams for efficient feature extraction.

problem Convergence of OMF algorithms for dependent data streams.
method Non-convex generalization of OMF for Markovian data, convergence to critical points.
result OMF converges to critical points of expected loss function for Markovian data.

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 ↗

Study analyzes feedback complexity for sparse feature retrieval in deep networks.

problem Learning sparse superposed features with feedback.
method Analysis of feedback complexity in sparse settings, including triplet comparisons.
result Establishes tight bounds and strong upper bounds for feature recovery.