Shannon sampling and function reconstruction from point values
From MaRDI portal
Interpolation in approximation theory (41A05) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42B10) Linear regression; mixed models (62J05) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Sampling theory in information and communication theory (94A20)
Recommendations
Cites work
- Best choices for regularization parameters in learning theory: on the bias-variance problem.
- Capacity of reproducing kernel spaces in learning theory
- Convergence of stochastic processes
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Hilbert distances and positive definite functions
- scientific article; zbMATH DE number 3776165 (Why is no real title available?)
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 3540341 (Why is no real title available?)
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 1246230 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 710673 (Why is no real title available?)
- scientific article; zbMATH DE number 1169068 (Why is no real title available?)
- scientific article; zbMATH DE number 3802533 (Why is no real title available?)
- scientific article; zbMATH DE number 2115040 (Why is no real title available?)
- scientific article; zbMATH DE number 2115052 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- Newton's method and some complexity aspects of the zero-finding problem
- Non-uniform weighted average sampling and reconstruction in shift-invariant and wavelet spaces
- Nonuniform sampling and reconstruction in shift-invariant spaces
- On the mathematical foundations of learning
- On the stability of multivariate trigonometric systems
- Probability Inequalities for the Sum of Independent Random Variables
- Regularization networks and support vector machines
- Ten Lectures on Wavelets
- The covering number in learning theory
- Theory of Reproducing Kernels
Cited in
(only showing first 100 items - show all)- Estimates of the approximation error using Rademacher complexity: Learning vector-valued functions
- Learning from uniformly ergodic Markov chains
- General A-P iterative algorithm in shift-invariant spaces
- Reconstructing signals with finite rate of innovation from noisy samples
- Estimates of the norm of the Mercer kernel matrices with discrete orthogonal transforms
- High order Parzen windows and randomized sampling
- Learning a function from noisy samples at a finite sparse set of points
- Gradient learning in a classification setting by gradient descent
- Metric duality between positive definite kernels and boundary processes
- Analysis of approximation by linear operators on variable \(L_\rho^{p(\cdot)}\) spaces and applications in learning theory
- The generalization performance of ERM algorithm with strongly mixing observations
- Uniform bounds of aliasing and truncated errors in sampling series of functions from anisotropic Besov class
- Random sampling and reconstruction of concentrated signals in a reproducing kernel space
- Sampling discretization and related problems
- Sampling and reconstruction by means of weighted inverses
- Exact asymptotic orders of various randomized widths on Besov classes
- Approximation of Lyapunov functions from noisy data
- Random sampling in reproducing kernel subspaces of \(L^p(\mathbb{R}^n)\)
- Approximation properties of mixed sampling-Kantorovich operators
- Worst-case recovery guarantees for least squares approximation using random samples
- Sampling and reconstruction of signals in a reproducing kernel subspace of \(L^p(\mathbb R^d)\)
- Least-square regularized regression with non-iid sampling
- Universality of deep convolutional neural networks
- Average sampling and reconstruction of reproducing kernel signals in mixed Lebesgue spaces
- Realizations and factorizations of positive definite kernels
- Local reconstruction for sampling in shift-invariant spaces
- Fully online classification by regularization
- Optimal shift invariant spaces and their Parseval frame generators
- Learning with sample dependent hypothesis spaces
- Application of integral operator for regularized least-square regression
- The convergence rates of Shannon sampling learning algorithms
- Distributed learning with multi-penalty regularization
- Spatially distributed sampling and reconstruction
- On approximation by reproducing kernel spaces in weighted L^p spaces
- Learning rates of regularized regression for exponentially strongly mixing sequence
- Convergence analysis of online algorithms
- Learning gradients by a gradient descent algorithm
- Approximation with polynomial kernels and SVM classifiers
- Relevant sampling of band-limited functions
- A universal envelope for Gaussian processes and their kernels
- Approximating and learning by Lipschitz kernel on the sphere
- The information-based complexity of approximation problem by adaptive Monte Carlo methods
- Shannon sampling. II: Connections to learning theory
- Learning dynamical systems using local stability priors
- A sheaf-theoretic perspective on sampling
- A signal theory approach to support vector classification: the sinc kernel
- Proper subspaces and compatibility
- Sampling and reconstruction for shift-invariant stochastic processes
- Improved sampling and reconstruction in spline subspaces
- Local sampling set conditions in weighted shift-invariant signal spaces
- Regression learning with non-identically and non-independently sampling
- Optimal rate of the regularized regression learning algorithm
- Rademacher Chaos Complexities for Learning the Kernel Problem
- Multi-penalty regularization in learning theory
- Generalization bounds of regularization algorithms derived simultaneously through hypothesis space complexity, algorithmic stability and data quality
- Online regularized generalized gradient classification algorithms
- Local learning estimates by integral operators
- Regularized restoration for two dimensional band-limited signals
- DISCRETIZATION ERROR ANALYSIS FOR TIKHONOV REGULARIZATION
- Spectral Algorithms for Supervised Learning
- Sampling in Paley-Wiener spaces on combinatorial graphs
- Applications of the Bernstein-Durrmeyer operators in estimating the norm of Mercer kernel matrices
- Local sampling and reconstruction in shift-invariant spaces and their applications in spline subspaces
- ONLINE LEARNING WITH MARKOV SAMPLING
- Learning rates of regularized regression on the unit sphere
- Regularized least square regression with unbounded and dependent sampling
- The learning rate of \(l_2\)-coefficient regularized classification with strong loss
- scientific article; zbMATH DE number 12705 (Why is no real title available?)
- Generalization bounds of ERM algorithm with Markov chain samples
- Learning from regularized regression algorithms with \(p\)-order Markov chain sampling
- Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains
- Boosted kernel ridge regression: optimal learning rates and early stopping
- SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
- Global solutions of approximation problems in Hilbert spaces
- Error analysis of the kernel regularized regression based on refined convex losses and RKBSs
- Regularization: From Inverse Problems to Large-Scale Machine Learning
- The kernel regularized learning algorithm for solving Laplace equation with Dirichlet boundary
- scientific article; zbMATH DE number 7626740 (Why is no real title available?)
- Sobolev norm learning rates for regularized least-squares algorithms
- Robust kernel-based distribution regression
- Average sampling and reconstruction in a reproducing kernel subspace of homogeneous type space
- AN ERROR ANALYSIS OF LAVRENTIEV REGULARIZATION IN LEARNING THEORY
- Learning theory of distributed spectral algorithms
- Kernel methods for the approximation of nonlinear systems
- Learning rates for multi-kernel linear programming classifiers
- Constrained ERM learning of canonical correlation analysis: a least squares perspective
- Generalized Mercer kernels and reproducing kernel Banach spaces
- Sampling error analysis and some properties of non-bandlimited signals that are reconstructed by generalized sinc functions
- Learning from non-identical sampling for classification
- Frames, Riesz bases, and sampling expansions in Banach spaces via semi-inner products
- The ill-posedness of restoring lost samples and regularized restoration for band-limited signals
- Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces
- Online classification with varying Gaussians
- Stability bounds for reconstruction from sampling erasures
- Spherical random sampling of localized functions on 𝕊ⁿ⁻¹
- Error estimates from noise samples for iterative algorithm in shift-invariant signal spaces
- Random sampling of bandlimited functions
- Estimates on learning rates for multi-penalty distribution regression
- Deep learning theory of distribution regression with CNNs
- Least square regression with indefinite kernels and coefficient regularization
This page was built for publication: Shannon sampling and function reconstruction from point values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4813564)
