English
Related papers

Related papers: Sparse-TDA: Sparse Realization of Topological Data…

200 papers

High-dimensional sparse data emerge in many critical application domains such as healthcare and cybersecurity. To extract meaningful insights from massive volumes of these multi-dimensional data, scientists employ unsupervised analysis…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-18 Jan Laukemann , Ahmed E. Helal , S. Isaac Geronimo Anderson , Fabio Checconi , Yongseok Soh , Jesmin Jahan Tithi , Teresa Ranadive , Brian J Gravelle , Fabrizio Petrini , Jee Choi

Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics, etc. However, the conventional sparse coding algorithms and its manifold…

Computer Vision and Pattern Recognition · Computer Science 2013-04-04 Jing-Yan Wang

Sparse PCA is one of the most well-studied problems in high-dimensional statistics. In this problem, we are given samples from a distribution with covariance $\Sigma$, whose top eigenvector $v \in R^d$ is $s$-sparse. Existing sparse PCA…

Machine Learning · Statistics 2026-03-04 Syamantak Kumar , Purnamrita Sarkar , Kevin Tian , Peiyuan Zhang

Sparse neural networks are effective approaches to reduce the resource requirements for the deployment of deep neural networks. Recently, the concept of adaptive sparse connectivity, has emerged to allow training sparse neural networks from…

We frame the task of predicting a semantic labeling as a sparse reconstruction procedure that applies a target-specific learned transfer function to a generic deep sparse code representation of an image. This strategy partitions training…

Computer Vision and Pattern Recognition · Computer Science 2014-10-17 Michael Maire , Stella X. Yu , Pietro Perona

Subspace tracking is a fundamental problem in signal processing, where the goal is to estimate and track the underlying subspace that spans a sequence of data streams over time. In high-dimensional settings, data samples are often corrupted…

We consider $N$-way data arrays and low-rank tensor factorizations where the time mode is coded as a sparse linear combination of temporal elements from an over-complete library. Our method, Shape Constrained Tensor Decomposition (SCTD) is…

Machine Learning · Statistics 2016-08-17 Bethany Lusch , Eric C. Chi , J. Nathan Kutz

Sparse dictionary coding represents signals as linear combinations of a few dictionary atoms. It has been applied to images, time series, graph signals and multi-way spatio-temporal data by jointly employing temporal and spatial…

Machine Learning · Computer Science 2025-09-15 Boya Ma , Abram Magner , Maxwell McNeil , Petko Bogdanov

Topological Data Analysis (TDA) has been successfully used for various tasks in signal/image processing, from visualization to supervised/unsupervised classification. Often, topological characteristics are obtained from persistent homology…

Sound · Computer Science 2023-10-11 Guillem Bonafos , Jean-Marc Freyermuth , Pierre Pudlo , Samuel Tronçon , Arnaud Rey

In this paper, the problem of terahertz pulsed imaging and reconstruction is addressed. It is assumed that an incomplete (subsampled) three dimensional THz data set has been acquired and the aim is to recover all missing samples. A…

Computer Vision and Pattern Recognition · Computer Science 2015-06-17 Vahid Abolghasemi , Hao Shen , Yaochun Shen , Lu Gan

Artificial Neural Networks (ANNs) require significant amounts of data and computational resources to achieve high effectiveness in performing the tasks for which they are trained. To reduce resource demands, various techniques, such as…

Neural and Evolutionary Computing · Computer Science 2024-12-04 A. Stolarek , W. Jaworek

We present a new computational approach to approximating a large, noisy data table by a low-rank matrix with sparse singular vectors. The approximation is obtained from thresholded subspace iterations that produce the singular vectors…

Methodology · Statistics 2011-12-13 Dan Yang , Zongming Ma , Andreas Buja

We introduce a subsampling method for topological data analysis based on strong collapses of simplicial complexes. Given a point cloud and a scale parameter $\delta$, we construct a subsampling that preserves both global and local…

Computational Geometry · Computer Science 2025-11-27 Elias Gabriel Minian

Implicit neural representations are a promising new avenue of representing general signals by learning a continuous function that, parameterized as a neural network, maps the domain of a signal to its codomain; the mapping from spatial…

Machine Learning · Computer Science 2021-11-09 Jaeho Lee , Jihoon Tack , Namhoon Lee , Jinwoo Shin

Sparse principal component analysis (PCA) is a well-established dimensionality reduction technique that is often used for unsupervised feature selection (UFS). However, determining the regularization parameters is rather challenging, and…

Machine Learning · Computer Science 2025-04-07 Long Chen , Xianchao Xiu

Online learning algorithms update models via one sample per iteration, thus efficient to process large-scale datasets and useful to detect malicious events for social benefits, such as disease outbreak and traffic congestion on the fly.…

Machine Learning · Computer Science 2019-05-28 Baojian Zhou , Feng Chen , Yiming Ying

We present a way to use Topological Data Analysis (TDA) for machine learning tasks on grayscale images. We apply persistent homology to generate a wide range of topological features using a point cloud obtained from an image, its natural…

Machine Learning · Computer Science 2019-10-23 Adélie Garin , Guillaume Tauzin

Inspired by the advances in biological science, the study of sparse binary projection models has attracted considerable recent research attention. The models project dense input samples into a higher-dimensional space and output sparse…

Machine Learning · Computer Science 2020-01-28 Wenye Li

Deep neural networks have emerged as powerful tools for learning operators defined over infinite-dimensional function spaces. However, existing theories frequently encounter difficulties related to dimensionality and limited…

Machine Learning · Computer Science 2026-05-12 Jianfei Li , Shuo Huang , Han Feng , Ding-Xuan Zhou , Gitta Kutyniok

Sparse principal component analysis (sparse PCA) is a widely used technique for dimensionality reduction in multivariate analysis, addressing two key limitations of standard PCA. First, sparse PCA can be implemented in high-dimensional low…

Methodology · Statistics 2025-10-07 Jan O. Bauer