Multi-Dictionary Learning for Low Rank Sparse Coding
arXiv:2509. 10033v2 Announce Type: replace Abstract: Sparse dictionary coding represents signals as linear combinations of a few dictionary atoms.
arXiv:2606. 10975v1 Announce Type: new Abstract: Finding convenient spaces in which certain hypotheses regarding an assumed sparse structure of natural signals hold true has become a desirable result in recent research, its implications being reflected in areas such as data compression, noise reduction and feature extraction.
arXiv:2509. 10033v2 Announce Type: replace Abstract: Sparse dictionary coding represents signals as linear combinations of a few dictionary atoms.
arXiv:2608. 13504v1 Announce Type: new Abstract: We develop the Sparse Orthogonal Regression Technique (SORT), a sparse spectral framework for learning orthonormal-basis expansions from noisy and irregularly sampled data.
Dual-energy CT (DECT) exploits attenuation differences across different X-ray spectra to provide richer material information and has been widely used in medical imaging. While sparse-view acquisition can lower radiation exposure, it makes DECT material decomposition even more challenging, as the problem is nonlinear and ill-posed.
arXiv:2606. 09077v1 Announce Type: new Abstract: The Legendre-Fenchel (LF) transform is a fundamental tool in convex analysis and machine learning that maps lower semi-continuous functions to their convex conjugates.
arXiv:2608. 03913v1 Announce Type: new Abstract: Dense pretrained transformers do not naturally expose interpretable units for circuit extraction.
arXiv:2606. 06046v1 Announce Type: cross Abstract: We investigate the approximation of solution operators for partial differential equations (PDEs) using sparse high-dimensional techniques.
arXiv:2606. 10678v1 Announce Type: new Abstract: Transformer-based models have emerged as leading paradigms in time-series forecasting in recent years, employing self-attention mechanisms to capture long-range dependencies.
arXiv:2502. 11665v3 Announce Type: replace-cross Abstract: The classical kernel ridge regression problem aims to find the best fit for the output $Y$ as a function of the input data $X\in \mathbb{R}^d$, with a fixed choice of regularization term imposed by a given choice of a reproducing kernel Hilbert space, such as a Sobolev space.
arXiv:2607. 07735v1 Announce Type: cross Abstract: Sparse precision matrix estimation provides an interpretable and computationally efficient framework for modeling conditional dependencies in high-dimensional, low-sample-size data.
arXiv:2608. 18036v1 Announce Type: cross Abstract: MRI reconstruction methods for undersampled k-space data naturally utilize complex-valued measurements.
arXiv:2606. 03936v1 Announce Type: new Abstract: Neural operator surrogates (NO) approximate PDE solutions orders of magnitude faster than numerical solvers, but suffer from spectral bias: high-frequency content is systematically attenuated, limiting reliability where fine-scale structure matters.
arXiv:2505. 12532v3 Announce Type: replace-cross Abstract: Efficiently adapting large pretrained models is critical under tight compute and memory budgets.