Related papers: Random Tight Frames
Although recent provable methods have been developed to compute preimage bounds for neural networks, their scalability is fundamentally limited by the #P-hardness of the problem. In this work, we adopt a novel probabilistic perspective,…
Finite-precision floating point arithmetic unavoidably introduces rounding errors which are traditionally bounded using a worst-case analysis. However, worst-case analysis might be overly conservative because worst-case errors can be…
We describe a general framework for probabilistic modeling of complex scenes and inference from ambiguous observations. The approach is motivated by applications in image analysis and is based on the use of priors defined by stochastic…
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…
We consider frames in a finite-dimensional Hilbert space Hn where frames are exactly the spanning sets of the vector space. The diagram vector of a vector in R2 was previously defined using polar coordinates and was used to characterize…
We show that, within a finite window of parameter space, random matrix theory (RMT) statistics emerge in observables of a finite-volume massive free scalar field theory after a local operator quench. The spacing-ratio distribution of…
We present a general-purpose framework for image modelling and vision tasks based on probabilistic frame prediction. Our approach unifies a broad range of tasks, from image segmentation, to novel view synthesis and video interpolation. We…
Bordered and framed Toeplitz/Hankel determinants have the same structure as Toeplitz/Hankel determinants except in small number of matrix rows and/or columns. We review these structured determinants and their connections to orthogonal…
The estimation of categorical distributions under marginal constraints summarizing some sample from a population in the most-generalizable way is key for many machine-learning and data-driven approaches. We provide a parameter-agnostic…
In most cases the ultrafast dynamics of resonantly excited molecules are considered, and almost always computed in the molecular frame, while experiments are carried out in the laboratory frame. Here we provide a formalism in terms of a lab…
This paper begins with a description of methods for estimating image probability density functions that reflects the observation that such data is usually constrained to lie in restricted regions of the high-dimensional image space-not…
We consider existence and uniqueness of symmetric approximation of frames by normalized tight frames and of symmetric orthogonalization of bases by orthonormal bases in Hilbert spaces H . More precisely, we determine whether a given frame…
A different general philosophy, to be called Full Randomness (FR), for the analysis of random effects models is presented, involving a notion of reducing or preferably eliminating fixed effects, at least formally. For example, under FR…
In this paper, we introduce a method known as polynomial frame approximation for approximating smooth, multivariate functions defined on irregular domains in $d$ dimensions, where $d$ can be arbitrary. This method is simple, and relies only…
Decision Trees and Random Forests are among the most widely used machine learning models, and often achieve state-of-the-art performance in tabular, domain-agnostic datasets. Nonetheless, being primarily discriminative models they lack…
Hilbert space fusion frames are a natural extension of Hilbert space frames, extending the notion from a set of vectors in a Hilbert space to a set of subspaces of a Hilbert space with analogous notions of overcompleteness and boundedness.…
Fuzzy simplicial sets have become an object of interest in dimensionality reduction and manifold learning, most prominently through their role in UMAP. However, their definition through tools from algebraic topology without a clear…
Iterative Proportional Fitting (IPF), combined with EM, is commonly used as an algorithm for likelihood maximization in undirected graphical models. In this paper, we present two iterative algorithms that generalize upon IPF. The first one…
The aim of this paper is twofold: In the first part, we leverage recent results on scenario design to develop randomized algorithmsfor approximating the image set of a nonlinear mapping, that is, a (possibly noisy) mapping of a set via a…
The gap probabilities at the hard and soft edges of scaled random matrix ensembles with orthogonal symmetry are known in terms of $\tau$-functions. Extending recent work relating to the soft edge, it is shown that these $\tau$-functions,…