Vladimir N. Temlyakov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Vladimir N. Temlyakov has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Feng Dai
Department of Mathematical and Statistical Sciences, University of Alberta, Edmonton, Canada
3 shared publications - Anton Dereventsov
Lirio AI Research, Lirio LLC
2 shared publications - Alexei P. Solodov
Lomonosov Moscow State University, Moscow Center of Fundamental and Applied Mathematics, Moscow, Russia
1 shared publication - Alexei Shadrin
DAMTP, University of Cambridge, Cambridge, UK
1 shared publication B. Kashin
Steklov Institute of Mathematics, Moscow, Russia
1 shared publicationDinh Dũng
Information Technology Institute Vietnam National University Hanoi Vietnam
1 shared publication
Latest Publications
- 23 April 2026
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 299 (3) , 344-362
LEBESGUE TYPE INEQUALITIES IN SPARSE SAMPLING RECOVERY
- 23 April 2026
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 299 (3) , 344-362
LEBESGUE TYPE INEQUALITIES IN SPARSE SAMPLING RECOVERY
- Open Access
A survey on sampling recovery
The reconstruction of unknown functions from a finite number of samples is a fundamental challenge in pure and applied mathematics. This survey provides a comprehensive overview of recent developments in sampling recovery, focusing on the accuracy of various algorithms and the relationship between optimal recovery errors, nonlinear approximation, and the Kolmogorov widths of function classes. A central theme is the synergy between the theory of universal sampling discretization and Lebesgue-type inequalities for greedy algorithms. We discuss three primary algorithmic frameworks: weighted least squares and $\ell_p$ minimization, sparse approximation methods, and greedy algorithms such as the Weak Orthogonal Matching Pursuit (WOMP) in Hilbert spaces and the Weak Tchebychev Greedy Algorithm (WCGA) in Banach spaces. These methods are applied to function classes defined by structural conditions, like the $A_β^r$ and Wiener-type classes, as well as classical Sobolev-type classes with dominated mixed derivatives. Notably, we highlight recent findings showing that nonlinear sampling recovery can provide superior error guarantees compared to linear methods for certain multivariate function classes.Open AccessA survey on sampling recovery
The reconstruction of unknown functions from a finite number of samples is a fundamental challenge in pure and applied mathematics. This survey provides a comprehensive overview of recent developments in sampling recovery, focusing on the accuracy of various algorithms and the relationship between optimal recovery errors, nonlinear approximation, and the Kolmogorov widths of function classes. A central theme is the synergy between the theory of universal sampling discretization and Lebesgue-type inequalities for greedy algorithms. We discuss three primary algorithmic frameworks: weighted least squares and $\ell_p$ minimization, sparse approximation methods, and greedy algorithms such as the Weak Orthogonal Matching Pursuit (WOMP) in Hilbert spaces and the Weak Tchebychev Greedy Algorithm (WCGA) in Banach spaces. These methods are applied to function classes defined by structural conditions, like the $A_β^r$ and Wiener-type classes, as well as classical Sobolev-type classes with dominated mixed derivatives. Notably, we highlight recent findings showing that nonlinear sampling recovery can provide superior error guarantees compared to linear methods for certain multivariate function classes. - Open Access
Sampling recovery on classes defined by integral operators and sparse approximation with adaptive dictionaries
In this paper we continue to develop the following general approach. We study asymptotic behavior of the errors of sampling recovery not for an individual smoothness class, how it is usually done, but for the collection of classes, which are defined by integral operators with kernels coming from a given class of functions. Earlier, such approach was realized for the Kolmogorov widths and very recently for the entropy numbers. It turns out that the above problem is closely related to the sparse approximation problem with respect to different redundant dictionaries. Specifically, the problem of sampling recovery is connected with sparse nonlinear approximation with respect to adaptive dictionaries, which means that the dictionary depends on the function under approximation.
Open AccessSampling recovery on classes defined by integral operators and sparse approximation with adaptive dictionaries
In this paper we continue to develop the following general approach. We study asymptotic behavior of the errors of sampling recovery not for an individual smoothness class, how it is usually done, but for the collection of classes, which are defined by integral operators with kernels coming from a given class of functions. Earlier, such approach was realized for the Kolmogorov widths and very recently for the entropy numbers. It turns out that the above problem is closely related to the sparse approximation problem with respect to different redundant dictionaries. Specifically, the problem of sampling recovery is connected with sparse nonlinear approximation with respect to adaptive dictionaries, which means that the dictionary depends on the function under approximation.
- Open Access
On stability of Weak Greedy Algorithm in the presence of noise
This paper is devoted to the theoretical study of the efficiency, namely, stability of some greedy algorithms. In the greedy approximation theory researchers are mostly interested in the following two important properties of an algorithm -- convergence and rate of convergence. In this paper we present some results on one more important property of an algorithm -- stability. Stability means that small perturbations do not result in a large change in the outcome of the algorithm. In this paper we discuss one kind of perturbations -- noisy data.
Open AccessOn stability of Weak Greedy Algorithm in the presence of noise
This paper is devoted to the theoretical study of the efficiency, namely, stability of some greedy algorithms. In the greedy approximation theory researchers are mostly interested in the following two important properties of an algorithm -- convergence and rate of convergence. In this paper we present some results on one more important property of an algorithm -- stability. Stability means that small perturbations do not result in a large change in the outcome of the algorithm. In this paper we discuss one kind of perturbations -- noisy data.
- 1 December 2025
- Published by Pleiades Publishing Ltd in Proceedings of the Steklov Institute of Mathematics
- Vol. 331 (1) , 270-283
Sparse Approximation and Sampling Recovery on Function Classes with a Structural Condition
In nonlinear approximation, it is common to consider classes of functions given by their expansion coefficients with respect to some basis \(\Psi=(\psi_{\mathbf k})\), i.e., \(f = \sum_{\mathbf k\in\mathbb Z^d} a_{\mathbf k} \psi_{\mathbf k}\), with certain structural conditions imposed on the coefficients \((a_{\mathbf k})\) and certain conditions imposed on the basis \((\psi_{\mathbf k})\). A classical example is given by absolutely convergent series \(\sum_{\mathbf k\in\mathbb Z^d}\mathopen|a_{\mathbf k}|<\infty\) with respect to an orthogonal or a Riesz basis \((\psi_{\mathbf k})\), or even a redundant set of functions. Here, we study the classes of functions \(\mathbf A_\beta^{r,b}(\Psi,\mathcal G)\) with the property where the index sets \(\mathcal G=(G_j)\) satisfy \(G_{j-1}\subset G_j\) and \(\bigcup_{j=1}^\infty G_j = \mathbb Z^d\). It has been shown recently that universal sampling discretization and nonlinear sparse approximation are useful in the sampling recovery problem for this type of functions, namely, when \((G_j)\) are dyadic cubes or dyadic hyperbolic crosses. In this paper, we generalize these particular results to the classes of functions defined by index sets \((G_j)\) of a rather general structure.- 1 December 2025
- Published by Pleiades Publishing Ltd in Proceedings of the Steklov Institute of Mathematics
- Vol. 331 (1) , 270-283
Sparse Approximation and Sampling Recovery on Function Classes with a Structural Condition
In nonlinear approximation, it is common to consider classes of functions given by their expansion coefficients with respect to some basis \(\Psi=(\psi_{\mathbf k})\), i.e., \(f = \sum_{\mathbf k\in\mathbb Z^d} a_{\mathbf k} \psi_{\mathbf k}\), with certain structural conditions imposed on the coefficients \((a_{\mathbf k})\) and certain conditions imposed on the basis \((\psi_{\mathbf k})\). A classical example is given by absolutely convergent series \(\sum_{\mathbf k\in\mathbb Z^d}\mathopen|a_{\mathbf k}|<\infty\) with respect to an orthogonal or a Riesz basis \((\psi_{\mathbf k})\), or even a redundant set of functions. Here, we study the classes of functions \(\mathbf A_\beta^{r,b}(\Psi,\mathcal G)\) with the property where the index sets \(\mathcal G=(G_j)\) satisfy \(G_{j-1}\subset G_j\) and \(\bigcup_{j=1}^\infty G_j = \mathbb Z^d\). It has been shown recently that universal sampling discretization and nonlinear sparse approximation are useful in the sampling recovery problem for this type of functions, namely, when \((G_j)\) are dyadic cubes or dyadic hyperbolic crosses. In this paper, we generalize these particular results to the classes of functions defined by index sets \((G_j)\) of a rather general structure.- 12 April 2025
- Published by Springer Nature in Advances in Operator Theory
- Vol. 10 (2) , 1-17
Sampling recovery of functions with mixed smoothness
- 12 April 2025
- Published by Springer Nature in Advances in Operator Theory
- Vol. 10 (2) , 1-17
Sampling recovery of functions with mixed smoothness
- 1 April 2025
- Published by Pleiades Publishing Ltd in Mathematical Notes
- Vol. 117 (3-4) , 603-616
Sampling Recovery on Function Classes with a Structural Condition
In this paper, we study recovery from values at points (sampling recovery) on some function classes. Function classes are usually defined by smoothness conditions. In the theory of nonlinear approximation, it has been noted that structural conditions in the form of controlling the number of large coefficients of the expansion of a function in a given system play an important role. The sampling recovery on classes of smooth functions is an actively developing area of research, and some problems, especially for classes with mixed smoothness, are still open. It has recently been found that universal sampling discretization and nonlinear sparse approximations are useful in the problem of sampling recovery. This motivated us to systematically study the sampling recovery on classes of functions with a structural condition. Some results in this direction are already known. In particular, classes defined by conditions on coefficients with indices from domains that are differences of two dyadic cubes have been studied in a recent paper by the second author. This paper studies function classes defined by conditions on coefficients with indices from domains that are differences of two hyperbolic crosses.
- 1 April 2025
- Published by Pleiades Publishing Ltd in Mathematical Notes
- Vol. 117 (3-4) , 603-616
Sampling Recovery on Function Classes with a Structural Condition
In this paper, we study recovery from values at points (sampling recovery) on some function classes. Function classes are usually defined by smoothness conditions. In the theory of nonlinear approximation, it has been noted that structural conditions in the form of controlling the number of large coefficients of the expansion of a function in a given system play an important role. The sampling recovery on classes of smooth functions is an actively developing area of research, and some problems, especially for classes with mixed smoothness, are still open. It has recently been found that universal sampling discretization and nonlinear sparse approximations are useful in the problem of sampling recovery. This motivated us to systematically study the sampling recovery on classes of functions with a structural condition. Some results in this direction are already known. In particular, classes defined by conditions on coefficients with indices from domains that are differences of two dyadic cubes have been studied in a recent paper by the second author. This paper studies function classes defined by conditions on coefficients with indices from domains that are differences of two hyperbolic crosses.
- Open Access
Brief introduction in greedy approximation
Sparse approximation is important in many applications because of concise form of an approximant and good accuracy guarantees. The theory of compressed sensing, which proved to be very useful in the image processing and data sciences, is based on the concept of sparsity. A fundamental issue of sparse approximation is the problem of construction of efficient algorithms, which provide good approximation. It turns out that greedy algorithms with respect to dictionaries are very good from this point of view. They are simple in implementation and there are well developed theoretical guarantees of their efficiency. This survey/tutorial paper contains brief description of different kinds of greedy algorithms and results on their convergence and rate of convergence. Also, Chapter IV gives some typical proofs of convergence and rate of convergence results for important greedy algorithms and Chapter V gives some open problems.
Open AccessBrief introduction in greedy approximation
Sparse approximation is important in many applications because of concise form of an approximant and good accuracy guarantees. The theory of compressed sensing, which proved to be very useful in the image processing and data sciences, is based on the concept of sparsity. A fundamental issue of sparse approximation is the problem of construction of efficient algorithms, which provide good approximation. It turns out that greedy algorithms with respect to dictionaries are very good from this point of view. They are simple in implementation and there are well developed theoretical guarantees of their efficiency. This survey/tutorial paper contains brief description of different kinds of greedy algorithms and results on their convergence and rate of convergence. Also, Chapter IV gives some typical proofs of convergence and rate of convergence results for important greedy algorithms and Chapter V gives some open problems.
- Open Access
Sparse sampling recovery by greedy algorithms
In this paper we analyze approximation and recovery properties with respect to systems satisfying universal sampling discretization property and a special incoherence property. We apply a powerful nonlinear approximation method -- the Weak Chebyshev Greedy Algorithm (WCGA). We establish that the WCGA based on good points for the $L_p$-universal discretization provides good recovery in the $L_p$ norm. For our recovery algorithms we obtain both the Lebesgue-type inequalities for individual functions and the error bounds for special classes of multivariate functions. The main point of the paper is that we combine here two deep and powerful techniques -- Lebesgue-type inequalities for the WCGA and theory of the universal sampling dicretization -- in order to obtain new results in sampling recovery.Open AccessSparse sampling recovery by greedy algorithms
In this paper we analyze approximation and recovery properties with respect to systems satisfying universal sampling discretization property and a special incoherence property. We apply a powerful nonlinear approximation method -- the Weak Chebyshev Greedy Algorithm (WCGA). We establish that the WCGA based on good points for the $L_p$-universal discretization provides good recovery in the $L_p$ norm. For our recovery algorithms we obtain both the Lebesgue-type inequalities for individual functions and the error bounds for special classes of multivariate functions. The main point of the paper is that we combine here two deep and powerful techniques -- Lebesgue-type inequalities for the WCGA and theory of the universal sampling dicretization -- in order to obtain new results in sampling recovery. - Open Access
- 1 December 2023
- Published by Pleiades Publishing Ltd in Proceedings of the Steklov Institute of Mathematics
- Vol. 323 (1) , 206-216
On Universal Sampling Recovery in the Uniform Norm
It is known that results on universal sampling discretization of the square norm are useful in sparse sampling recovery with error measured in the square norm. In this paper we demonstrate how known results on universal sampling discretization of the uniform norm and recent results on universal sampling representation allow us to provide good universal methods of sampling recovery for anisotropic Sobolev and Nikol’skii classes of periodic functions of several variables. The sharpest results are obtained in the case of functions of two variables, where the Fibonacci point sets are used for recovery.
- 1 December 2023
- Published by Pleiades Publishing Ltd in Proceedings of the Steklov Institute of Mathematics
- Vol. 323 (1) , 206-216
Open AccessOn Universal Sampling Recovery in the Uniform Norm
It is known that results on universal sampling discretization of the square norm are useful in sparse sampling recovery with error measured in the square norm. In this paper we demonstrate how known results on universal sampling discretization of the uniform norm and recent results on universal sampling representation allow us to provide good universal methods of sampling recovery for anisotropic Sobolev and Nikol’skii classes of periodic functions of several variables. The sharpest results are obtained in the case of functions of two variables, where the Fibonacci point sets are used for recovery.