搜索结果: 1-6 共查到“Sparse Approximation”相关记录6条 . 查询时间(0.059 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Graph Refinement via Simultaneously Low-rank and Sparse Approximation
低秩 稀疏近似 图细化
2023/4/18
Graphs play an important role in many fields of machine learning such as clustering. Many graph-based machine learning approaches assume that the graphs have hidden group structures. However, the grou...
Sparse approximation and recovery by greedy algorithms in Banach spaces
Sparse approximation recovery greedy algorithms Banach spaces
2013/4/28
We study sparse approximation by greedy algorithms. We prove the Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA), a generalization of the Weak Orthogonal Matching Pursuit to ...
Convergence and Rate Analysis of Neural Networks for Sparse Approximation
Locally Competitive Algorithm sparse approximation global stability exponential convergence non-smooth objective
2011/9/23
Abstract: We present an analysis of the Locally Competitive Algorithm (LCA), a Hopfield-style neural network that solves sparse approximation problems (e.g., approximating a vector from a dictionary u...
Sparse approximation property and stable recovery of sparse signals from noisy measurements
Sparse approximation property noisy measurements Information Theory
2011/9/21
Abstract: In this paper, we introduce a sparse approximation property of order $s$ for a measurement matrix ${\bf A}$: $$\|{\bf x}_s\|_2\le D \|{\bf A}{\bf x}\|_2+ \beta \frac{\sigma_s({\bf x})}{\sqrt...
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
Submodular meets Spectral Greedy Algorithms for Subset Selection Sparse Approximation Dictionary Selection
2011/3/23
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can be viewed in the cont...
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
Greedy Algorithms Subset Selection Dictionary Selection
2011/3/22
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can be viewed in the cont...