Shannon sampling and function reconstruction from point values

DOI10.1090/S0273-0979-04-01025-0zbMath1107.94007OpenAlexW2000021956MaRDI QIDQ4813564

Publication date: 13 August 2004

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0273-0979-04-01025-0

zbMATH Keywords

interpolation learning theory kernel function regularization method sampling theorem

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42B10) Interpolation in approximation theory (41A05) Sampling theory in information and communication theory (94A20)

Related Items (only showing first 100 items - show all)

Local sampling set conditions in weighted shift-invariant signal spaces ⋮ A signal theory approach to support vector classification: the sinc kernel ⋮ LOCAL LEARNING ESTIMATES BY INTEGRAL OPERATORS ⋮ Improved sampling and reconstruction in spline subspaces ⋮ Sampling discretization and related problems ⋮ Multi-penalty regularization in learning theory ⋮ Weyl eigenvalue asymptotics and sharp adaptation on vector bundles ⋮ Geometry on probability spaces ⋮ Local reconstruction for sampling in shift-invariant spaces ⋮ Fully online classification by regularization ⋮ Optimal shift invariant spaces and their Parseval frame generators ⋮ Hermite learning with gradient data ⋮ Regularized least square regression with dependent samples ⋮ Sampling theory, oblique projections and a question by Smale and Zhou ⋮ Regularized restoration for two dimensional band-limited signals ⋮ Learning with sample dependent hypothesis spaces ⋮ Application of integral operator for regularized least-square regression ⋮ The convergence rates of Shannon sampling learning algorithms ⋮ Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm ⋮ Multi-kernel regularized classifiers ⋮ 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 ⋮ Error estimates from noise samples for iterative algorithm in shift-invariant signal spaces ⋮ Random sampling of bandlimited functions ⋮ Distributed learning with multi-penalty regularization ⋮ Sampling and reconstruction by means of weighted inverses ⋮ Least square regression with indefinite kernels and coefficient regularization ⋮ Generalization bounds of ERM algorithm with Markov chain samples ⋮ Learning theory approach to a system identification problem involving atomic norm ⋮ Exact asymptotic orders of various randomized widths on Besov classes ⋮ Approximation of Lyapunov functions from noisy data ⋮ Spatially distributed sampling and reconstruction ⋮ Regression learning with non-identically and non-independently sampling ⋮ Random sampling in reproducing kernel subspaces of \(L^p(\mathbb{R}^n)\) ⋮ On approximation by reproducing kernel spaces in weighted \(L^p\) spaces ⋮ On complex-valued 2D eikonals. IV: continuation past a caustic ⋮ Learning rates of regularized regression for exponentially strongly mixing sequence ⋮ Spectral Algorithms for Supervised Learning ⋮ Multi-variate Hardy-type lattice point summation and Shannon-type sampling ⋮ Learning from regularized regression algorithms with \(p\)-order Markov chain sampling ⋮ Metric duality between positive definite kernels and boundary processes ⋮ Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains ⋮ Learning dynamical systems using local stability priors ⋮ Approximation properties of mixed sampling-Kantorovich operators ⋮ The generalization performance of ERM algorithm with strongly mixing observations ⋮ Sampling in Paley-Wiener spaces on combinatorial graphs ⋮ Applications of the Bernstein-Durrmeyer operators in estimating the norm of Mercer kernel matrices ⋮ Analysis of approximation by linear operators on variable \(L_\rho^{p(\cdot)}\) spaces and applications in learning theory ⋮ The role of frame force in quantum detection ⋮ Convergence rate of kernel canonical correlation analysis ⋮ Convergence analysis of online algorithms ⋮ Reproducing kernel Hilbert spaces associated with analytic translation-invariant Mercer kernels ⋮ Derivative reproducing properties for kernel methods in learning theory ⋮ Optimal rate of the regularized regression learning algorithm ⋮ Worst-case recovery guarantees for least squares approximation using random samples ⋮ Orthogonality from disjoint support in reproducing kernel Hilbert spaces ⋮ A regularized two-dimensional sampling algorithm ⋮ Parzen windows for multi-class classification ⋮ Random sampling in shift invariant spaces ⋮ Learning gradients by a gradient descent algorithm ⋮ Local Sampling and Reconstruction in Shift-Invariant Spaces and Their Applications in Spline Subspaces ⋮ Learning rates for multi-kernel linear programming classifiers ⋮ Learning from non-identical sampling for classification ⋮ Moving least-square method in learning theory ⋮ 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 ⋮ Uniform bounds of aliasing and truncated errors in sampling series of functions from anisotropic Besov class ⋮ Sampling and reconstruction of signals in a reproducing kernel subspace of \(L^p(\mathbb R^d)\) ⋮ Least-square regularized regression with non-iid sampling ⋮ Approximation with polynomial kernels and SVM classifiers ⋮ Rademacher Chaos Complexities for Learning the Kernel Problem ⋮ Relevant sampling of band-limited functions ⋮ A universal envelope for Gaussian processes and their kernels ⋮ A Sheaf-Theoretic Perspective on Sampling ⋮ Random sampling and reconstruction of concentrated signals in a reproducing kernel space ⋮ Variational splines and Paley-Wiener spaces on Combinatorial graphs ⋮ Approximating and learning by Lipschitz kernel on the sphere ⋮ Proper subspaces and compatibility ⋮ ONLINE LEARNING WITH MARKOV SAMPLING ⋮ The information-based complexity of approximation problem by adaptive Monte Carlo methods ⋮ Estimates of the approximation error using Rademacher complexity: Learning vector-valued functions ⋮ DISCRETIZATION ERROR ANALYSIS FOR TIKHONOV REGULARIZATION ⋮ Universality of deep convolutional neural networks ⋮ GENERALIZATION BOUNDS OF REGULARIZATION ALGORITHMS DERIVED SIMULTANEOUSLY THROUGH HYPOTHESIS SPACE COMPLEXITY, ALGORITHMIC STABILITY AND DATA QUALITY ⋮ 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 ⋮ Online regularized generalized gradient classification algorithms ⋮ Average sampling and reconstruction of reproducing kernel signals in mixed Lebesgue spaces ⋮ Sampling, Marcinkiewicz-Zygmund inequalities, approximation, and quadrature rules ⋮ Realizations and factorizations of positive definite kernels ⋮ 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 ⋮ Unnamed Item ⋮ Shannon sampling. II: Connections to learning theory ⋮ Sampling and reconstruction for shift-invariant stochastic processes

Cites Work

This page was built for publication: Shannon sampling and function reconstruction from point values