Construction and Monte Carlo estimation of wavelet frames generated by a reproducing kernel

• URL: http://arxiv.org/abs/2006.09870v2
• Date: Mon, 8 Mar 2021 14:49:49 GMT
• Title: Construction and Monte Carlo estimation of wavelet frames generated by a reproducing kernel
• Authors: Ernesto De Vito, Zeljko Kereta, Valeriya Naumova, Lorenzo Rosasco, Stefano Vigogna
• Abstract summary: We introduce a construction of multiscale tight frames on general domains. We extend classical wavelets as well as generalized wavelets on non-Euclidean structures. We show that a sample frame tends to its population counterpart, and derive explicit finite-sample rates on spaces of Sobolev and Besov regularity.
• Score: 14.207723862182947
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a construction of multiscale tight frames on general domains. The frame elements are obtained by spectral filtering of the integral operator associated with a reproducing kernel. Our construction extends classical wavelets as well as generalized wavelets on both continuous and discrete non-Euclidean structures such as Riemannian manifolds and weighted graphs. Moreover, it allows to study the relation between continuous and discrete frames in a random sampling regime, where discrete frames can be seen as Monte Carlo estimates of the continuous ones. Pairing spectral regularization with learning theory, we show that a sample frame tends to its population counterpart, and derive explicit finite-sample rates on spaces of Sobolev and Besov regularity. Our results prove the stability of frames constructed on empirical data, in the sense that all stochastic discretizations have the same underlying limit regardless of the set of initial training samples.

Related papers

• Convergence of Score-Based Discrete Diffusion Models: A Discrete-Time Analysis [56.442307356162864]
  We study the theoretical aspects of score-based discrete diffusion models under the Continuous Time Markov Chain (CTMC) framework. We introduce a discrete-time sampling algorithm in the general state space $[S]d$ that utilizes score estimators at predefined time points. Our convergence analysis employs a Girsanov-based method and establishes key properties of the discrete score function.
  arXiv  Detail & Related papers  (2024-10-03T09:07:13Z)
• Quantum chaos, integrability, and late times in the Krylov basis [0.8287206589886881]
  Quantum chaotic systems are conjectured to display a spectrum whose fine-grained features are well described by Random Matrix Theory (RMT) We show that for Haar-random initial states in RMTs the mean and covariance of the Lanczos spectrum suffices to produce the full long time behavior of general survival probabilities. This analysis suggests a notion of eigenstate complexity, the statistics of which differentiate integrable systems and classes of quantum chaos.
  arXiv  Detail & Related papers  (2023-12-06T19:02:22Z)
• Reflection coupling for unadjusted generalized Hamiltonian Monte Carlo in the nonconvex stochastic gradient case [0.0]
  Contraction in Wasserstein 1-distance with explicit rates is established for generalized Hamiltonian Monte Carlo with gradients under possibly non diffusion conditions. The algorithms considered include kinetic splitting schemes of Langevin, commonly used in molecular dynamics simulations.
  arXiv  Detail & Related papers  (2023-10-28T18:25:59Z)
• Deterministic Gibbs Sampling via Ordinary Differential Equations [77.42706423573573]
  This paper presents a general construction of deterministic measure-preserving dynamics using autonomous ODEs and tools from differential geometry. We show how Hybrid Monte Carlo and other deterministic samplers follow as special cases of our theory.
  arXiv  Detail & Related papers  (2021-06-18T15:36:09Z)
• The Connection between Discrete- and Continuous-Time Descriptions of Gaussian Continuous Processes [60.35125735474386]
  We show that discretizations yielding consistent estimators have the property of invariance under coarse-graining' This result explains why combining differencing schemes for derivatives reconstruction and local-in-time inference approaches does not work for time series analysis of second or higher order differential equations.
  arXiv  Detail & Related papers  (2021-01-16T17:11:02Z)
• Quantum particle across Grushin singularity [77.34726150561087]
  We study the phenomenon of transmission across the singularity that separates the two half-cylinders. All the local realisations of the free (Laplace-Beltrami) quantum Hamiltonian are examined as non-equivalent protocols of transmission/reflection. This allows to comprehend the distinguished status of the so-called bridging' transmission protocol previously identified in the literature.
  arXiv  Detail & Related papers  (2020-11-27T12:53:23Z)
• Graph Gamma Process Generalized Linear Dynamical Systems [60.467040479276704]
  We introduce graph gamma process (GGP) linear dynamical systems to model real multivariate time series. For temporal pattern discovery, the latent representation under the model is used to decompose the time series into a parsimonious set of multivariate sub-sequences. We use the generated random graph, whose number of nonzero-degree nodes is finite, to define both the sparsity pattern and dimension of the latent state transition matrix.
  arXiv  Detail & Related papers  (2020-07-25T04:16:34Z)
• Operator-algebraic renormalization and wavelets [62.997667081978825]
  We construct the continuum free field as the scaling limit of Hamiltonian lattice systems using wavelet theory. A renormalization group step is determined by the scaling equation identifying lattice observables with the continuum field smeared by compactly supported wavelets.
  arXiv  Detail & Related papers  (2020-02-04T18:04:51Z)
• Probabilistic Contraction Analysis of Iterated Random Operators [10.442391859219807]
  Banach contraction mapping theorem is employed to establish the convergence of certain deterministic algorithms. In a class of randomized algorithms, in each iteration, the contraction map is approximated with an operator that uses independent and identically distributed samples of certain random variables. This leads to iterated random operators acting on an initial point in a complete metric space, and it generates a Markov chain.
  arXiv  Detail & Related papers  (2018-04-04T00:10:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.