Related papers: From full rank subdivision schemes to multichannel…
We introduce and validate a theoretical framework for coherent control of multichannel scattering of linear waves to route waves through complex geometries with multiple scattering. We show that steady-state perfect routing solutions are…
As a generalization of orthonormal wavelets in $L_2(R)$, tight framelets (also called tight wavelet frames) are of importance in wavelet analysis and applied sciences due to their many desirable properties in applications such as image…
Multiresolution Matrix Factorization (MMF) is unusual amongst fast matrix factorization algorithms in that it does not make a low rank assumption. This makes MMF especially well suited to modeling certain types of graphs with complex…
We show how to use a balanced wavelet tree as a data structure that stores a list of numbers and supports efficient {\em range quantile queries}. A range quantile query takes a rank and the endpoints of a sublist and returns the number with…
In the unidimensional unfolding model, given m objects in general position there arise 1+m(m-1)/2 rankings. The set of rankings is called the ranking pattern of the m given objects. By changing these m objects, we can generate various…
In this paper, we propose two new algorithms for transduction with Matrix Completion (MC) problem. The joint MC and prediction tasks are addressed simultaneously to enhance the accuracy, i.e., the label matrix is concatenated to the data…
MultiResolution Low-Rank decomposition is formulated for regularization of dynamic image sequences. The decomposition applies a local low-rank decomposition on a sequence of discrete wavelet transforms. Its effective formulation as a…
This paper extends the existing theory of perfect reconstruction two-channel filter banks from bipartite graphs to non-bipartite graphs. By generalizing the concept of downsampling/upsampling we establish the frame of two-channel filter…
Matrix completion is a problem that arises in many data-analysis settings where the input consists of a partially-observed matrix (e.g., recommender systems, traffic matrix analysis etc.). Classical approaches to matrix completion assume…
In continuous-time wavelet analysis, most wavelet present some kind of symmetry. Based on the Fourier and Hartley transform kernels, a new wavelet multiresolution analysis is proposed. This approach is based on a pair of orthogonal wavelet…
An invex function generalizes a convex function in the sense that every stationary point is a global minimizer. Recently, invex functions and their subclasses have attracted attention in signal processing and machine learning. However,…
Recently introduced inpainting algorithms using a combination of applied harmonic analysis and compressed sensing have turned out to be very successful. One key ingredient is a carefully chosen representation system which provides…
In this paper we consider the problem of approximating vector-valued functions over a domain $\Omega$. For this purpose, we use matrix-valued reproducing kernels, which can be related to Reproducing kernel Hilbert spaces of vectorial…
Multiplicative cascades are often used to represent the structure of multiscaling variables in many physical systems, specially turbulent flows. In processes of this kind, these variables can be understood as the result of a successive…
Graphons offer a powerful framework for modeling large-scale networks, yet estimation remains challenging. We propose a novel approach that leverages a low-rank additive representation, yielding both a low-rank connection probability matrix…
Representation learning of networks has witnessed significant progress in recent times. Such representations have been effectively used for classic network-based machine learning tasks like node classification, link prediction, and network…
Factorization of compact wavelet matrices into primitive ones has been known for more than 20 years. This method makes it possible to generate wavelet matrix coefficients and also to specify them by their first row. Recently, a new…
This paper studies how Transformer models with Rotary Position Embeddings (RoPE) develop emergent, wavelet-like properties that compensate for the positional encoding's theoretical limitations. Through an analysis spanning model scales,…
Low-rank modeling generally refers to a class of methods that solve problems by representing variables of interest as low-rank matrices. It has achieved great success in various fields including computer vision, data mining, signal…
A matrix always has a full rank submatrix such that the rank of this matrix is equal to the rank of that submatrix. This property is one of the corner stones of the matrix rank theory. We call this property the max-full-rank-submatrix…