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

Trend · papers per month

7.6%15.2%22.9%30.5% · Jun 202019922001200920182026
48 results for Optimal dictionaries

Researchers find optimal dictionaries for minimizing average squared coefficients in random vector representations.

problem Finding optimal dictionaries for minimizing the average squared coefficients in random vector representations.
method Using rank-1 decompositions and majorization theory, the study provides a complete characterization of optimal dictionaries.
result Complete characterization of 2\ell_2-optimal dictionaries with polynomial time algorithms.

Dictionaries are collections of vectors used for representations of random vectors in Euclidean spaces. Recent research on optimal dictionaries is focused on constructing dictionaries that offer sparse representations, i.e., 0\ell_0-optimal representations. Here we consider the problem of finding optimal dictionaries …

2016-03-07abs ↗pdf ↗

New method learns histograms using optimal transport barycenters.

problem Nonlinear dictionary learning for histograms.
method Optimal transport theory, displacement interpolations, entropic regularization, gradient descent.
result Efficient and tractable method for nonlinear dictionary learning.

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.

The problem of convex optimization is studied. Usually in convex optimization the minimization is over a d-dimensional domain. Very often the convergence rate of an optimization algorithm depends on the dimension d. The algorithms studied in this paper utilize dictionaries instead of a canonical basis used in the coord…

2015-11-04abs ↗pdf ↗

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 ↗

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 ↗

CRsAE auto-encoder recovers convolutional dictionary from noisy signals.

problem Recovering a convolutional dictionary from noisy signals.
method Constrained recurrent sparse auto-encoder (CRsAE) architecture.
result CRsAE successfully recovers the underlying dictionary in the presence of noise.

The paper provides guarantees for an alternating minimization algorithm in dictionary learning.

problem Dictionary learning problem of factorizing samples into a basis and sparse vectors.
method Alternating minimization procedure switching between 1\ell_1 minimization and gradient descent.
result Local convergence guarantees for the alternating minimization algorithm under a new matrix infinity norm condition.

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.

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 ↗

Novel algorithm learns sparse signal representations over topological spaces.

problem Sparse representation of signals over combinatorial topological spaces.
method Leveraging Hodge theory, the paper embeds topology into a dictionary structure via concatenated sub-dictionaries, each as a polynomial of Hodge Laplacians, and optimizes the dictionary coefficients and sparse signal representation via iterative alternating algorithms.
result Efficiently learned sparse representations and underlying relational structure of topological signals.

We consider the problem of dictionary learning under the assumption that the observed signals can be represented as sparse linear combinations of the columns of a single large dictionary matrix. In particular, we analyze the minimax risk of the dictionary learning problem which governs the mean squared error (MSE) perf…

2014-02-17abs ↗pdf ↗

This paper studies the effect of discretizing the parametrization of a dictionary used for Matching Pursuit decompositions of signals. Our approach relies on viewing the continuously parametrized dictionary as an embedded manifold in the signal space on which the tools of differential (Riemannian) geometry can be appli…

2008-01-22abs ↗pdf ↗

Paper develops DLTF to learn optimized dictionaries for efficient thresholded feature recovery.

problem Efficiently recover sparse code support from time-consuming sparse coding.
method Formulates DLTF model to learn optimized dictionary for thresholded feature, derives log-linear time proximal operator.
result DLTF model demonstrates remarkable efficiency, effectiveness, and robustness in various tasks.

Bayesian optimization for high-dimensional combinatorial spaces using embeddings.

problem Optimizing expensive functions over large, complex input spaces.
method Dictionary-based ordinal embeddings for high-dimensional combinatorial structures, using Gaussian process models.
result The proposed method outperforms state-of-the-art BO methods on diverse real-world benchmarks.

Recently, considerable research efforts have been devoted to the design of methods to learn from data overcomplete dictionaries for sparse coding. However, learned dictionaries require the solution of an optimization problem for coding new data. In order to overcome this drawback, we propose an algorithm aimed at learn…

2010-11-16abs ↗pdf ↗

This work combines deep learning and sparse coding for CT image reconstruction.

problem Improving image quality in low-dose CT scans.
method Sparse signal representation using learned dictionaries, inspired by variational autoencoders and deep learning techniques.
result Regularization with learned dictionaries achieves competitive performance in CT reconstruction.

In the synthesis model signals are represented as a sparse combinations of atoms from a dictionary. Dictionary learning describes the acquisition process of the underlying dictionary for a given set of training samples. While ideally this would be achieved by optimizing the expectation of the factors over the underlyin…

2014-03-20abs ↗pdf ↗

This paper is a survey of dictionary screening for the lasso problem. The lasso problem seeks a sparse linear combination of the columns of a dictionary to best match a given target vector. This sparse representation has proven useful in a variety of subsequent processing and decision tasks. For a given target vector, …

2014-05-19abs ↗pdf ↗

The paper tackles energy disaggregation by improving dictionary learning with deep neural models.

problem Decomposing electricity signals of a whole home into its operating devices.
method Proposes a novel optimization program that learns both the dictionary and sparse coefficients using a deep neural model (LSTM-AE) to capture temporal energy signals.
result Significant improvement in disaggregation accuracy and F-score metrics compared to state-of-the-art methods.

The paper proposes efficient dictionary learning algorithms that avoid multiplications for sparse representations.

problem Sparse representation with reduced computational complexity.
method Factorizations of the dictionary into binary orthonormal, scaling, and shear transformations with closed-form solutions.
result The proposed methods are effective and can be compared to well-known transforms like FFT and DCT.

The paper tackles MSDA by learning dictionary atoms in Wasserstein space.

problem Mitigating data distribution shifts across multiple source domains to target domain.
method Dictionary learning and optimal transport in Wasserstein space; DaDiL algorithm for learning.
result Improved classification performance by 3.15%, 2.29%, and 7.71% in benchmarks.

A-DLISTA and VLISTA learn dictionaries and sparse representations under varying sensing matrices.

problem Learning dictionaries and sparse representations under varying sensing matrices.
method Augmented Dictionary Learning ISTA (A-DLISTA) and Variational Learning ISTA (VLISTA).
result VLISTA provides a probabilistic way to jointly learn the dictionary distribution and the reconstruction algorithm.

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.

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.

Modeling data with linear combinations of a few elements from a learned dictionary has been the focus of much recent research in machine learning, neuroscience and signal processing. For signals such as natural images that admit such sparse representations, it is now well established that these models are well suited t…

2010-09-27abs ↗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.

Graph-Dictionary model for sparse multivariate signal representation.

problem Capturing complex relational information in multivariate signals.
method Graph dictionaries and bilinear primal-dual splitting algorithm.
result Graph-dictionary model outperforms baselines in signal reconstruction and classification.

Dictionary learning algorithms have been successfully used for both reconstructive and discriminative tasks, where an input signal is represented with a sparse linear combination of dictionary atoms. While these methods are mostly developed for single-modality scenarios, recent studies have demonstrated the advantages …

2015-02-04abs ↗pdf ↗

New method learns complete orthogonal dictionary from samples with theoretical guarantees and efficiency.

problem Learning a complete orthogonal dictionary from sparsely generated signals.
method Maximizes the \(\ell^4\)-norm over the orthogonal group, using a novel algorithm based on matching, stretching, and projection (MSP).
result The MSP algorithm provably converges locally at a superlinear (cubic) rate and is significantly more efficient than existing methods.

We present a theoretical analysis and empirical evaluations of a novel set of techniques for computational cost reduction of classifiers that are based on learned transform and soft-threshold. By modifying optimization procedures for dictionary and classifier training, as well as the resulting dictionary entries, our t…

2015-04-26abs ↗pdf ↗

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.