arXiv 2201.004152022-01-02math.NAcs.NAmath.FA

On universal sampling representation

V. N. Temlyakov

英文摘要：

For the multivariate trigonometric polynomials we study convolution with the corresponding the de la Vallee Poussin kernel from the point of view of discretization. In other words, we replace the normalized Lebesgue measure by a discrete measure in such a way, which preserves the convolution properties and provides sampling discretization of integral norms. We prove that in the two-variate case the Fibonacci point sets provide an ideal (in the sense of order) solution. We also show that the Korobov point sets provide a suboptimal (up to logarithmic factors) solution for an arbitrary number of variables.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

关于一致范数下的通用采样恢复

On universal sampling recovery in the uniform norm

本文利用一致范数下的通用采样离散化与表示结果，为多变量周期函数的各向异性Sobolev和Nikol'skii类建立通用采样恢复方法，并在二变量情形下借助Fibonacci点集获得最精确结果。

2023-07-08cs.NAmath.FAmath.NA

采样离散化误差的界及其在通用采样离散化中的应用

Bounds for the sampling discretization error and their applications to the universal sampling discretization

本文利用链式技术与熵数为函数类上 $L_p$-范数的采样离散化误差建立一般上界，并应用于混合光滑性多元函数类及通用采样离散化问题。

2024-08-09cs.NAmath.FAmath.NA

Universal sampling discretization

Let $X_N$ be an $N$-dimensional subspace of $L_2$ functions on a probability space $(Ω, μ)$ spanned by a uniformly bounded Riesz basis $Φ_N$. Given an integer $1\leq v\leq N$ and an exponent $1\leq q\leq 2$, we obtain universal discretization for integral norms $L_q(Ω,μ)$ of functions from the collection of all subspaces of $X_N$ spanned by $v$ elements of $Φ_N$ with the number $m$ of required points satisfying $m\ll v(\log N)^2(\log v)^2$. This last bound on $m$ is much better than previously known bounds which are quadratic in $v$. Our proof uses a conditional theorem on universal sampling d…

2021-07-23cs.NAmath.CAmath.FA

随机点对通用离散化是有效的

Random points are good for universal discretization

本文证明独立同分布的随机点能以高概率实现良好的通用离散化，并基于这些点提出贪心算法，在平方范数下获得优异的稀疏恢复结果。

2023-10-12cs.NAmath.CAmath.FA

稀疏采样恢复的贪婪算法

Sparse sampling recovery by greedy algorithms

本文结合弱切比雪夫贪婪算法与通用采样离散化理论，为满足特定性质的系统建立稀疏采样恢复的勒贝格型不等式及多变量函数类误差界。

2023-12-30cs.NAmath.FAmath.NA

稀疏采样恢复中的勒贝格型不等式

Lebesgue-type inequalities in sparse sampling recovery

本文将平方范数下的稀疏采样恢复结果推广到一般$L_p$范数，在巴拿赫空间框架下证明基于$L_p$-通用离散化好点的弱切比雪夫贪婪算法对$2\le p<\infty$具有良好恢复性能，并揭示了稳定恢复与采样离散化的紧密联系。

2023-07-09cs.NAmath.FAmath.NA

更多相关论文收起更多论文

有限向量空间中显式通用采样集

Explicit universal sampling sets in finite vector spaces

本文构造了有限向量空间上傅里叶信号的显式采样集及重建算法，采样集大小为O(pt²r²)和O(pt²r³log(p))，算法在t个大系数下以O(p²t²r³log(p))的复杂度逼近最佳近似。

2016-05-18cs.NAmath.NA

通用离散化与稀疏采样恢复

Universal discretization and sparse sampling recovery

本文利用有限维子空间集合的通用离散化最新结果，建立了平方范数下最优稀疏恢复与一致范数下最佳稀疏逼近之间的不等式关系。

2023-05-16cs.ITcs.NAmath.CA

若干函数类上积分范数下的稀疏采样恢复

Sparse sampling recovery in integral norms on some function classes

本研究在通用采样离散化、无条件性质及Nikol'skii型不等式假设下，证明基于$L_2$通用离散化采样点的弱正交匹配追踪算法可在$2\le p<\infty$的$L_p$范数下实现良好稀疏采样恢复，得到单函数Lebesgue型不等式与多元函数类误差界，丰富了采样恢复理论。

2024-01-26cs.NAmath.FAmath.NA

B-样条拟插值采样表示与Sobolev空间中混合光滑度的采样恢复

B-spline quasi-interpolation sampling representation and sampling recovery in Sobolev spaces of mixed smoothness

Information Technology Institute, Vietnam National University（越南国立大学信息技术研究所）

本文研究了B-样条拟插值采样表示在混合光滑度Sobolev空间中的直接与逆定理，建立了线性采样算法的逼近误差估计及渐近最优性。

2016-11-28cs.NAmath.NA

单侧离散化不等式与采样恢复

One-sided discretization inequalities and sampling recovery

本文作为综述/研究论文，重点探讨单侧离散化不等式及其在采样恢复问题中的应用，补充了现有的采样离散化综述。

2024-10-15cs.NAmath.FAmath.NA

Direct and inverse results for Kantorovich type exponential sampling series

In this article, we analyze the behaviour of the new family of Kantorovich type exponential sampling series. We obtain the point-wise approxi mation theorem and Voronovskaya type theorem for the series. Further, we obtain a representation formula and an inverse result approximation for these operators. Finally, we give some examples of kernel functions to which the theory can be applied along with the graphical representation.

2020-02-07cs.NAmath.FAmath.NA

Efficient construction of tensor ring representations from sampling

In this paper we propose an efficient method to compress a high dimensional function into a tensor ring format, based on alternating least-squares (ALS). Since the function has size exponential in $d$ where $d$ is the number of dimensions, we propose efficient sampling scheme to obtain $O(d)$ important samples in order to learn the tensor ring. Furthermore, we devise an initialization method for ALS that allows fast convergence in practice. Numerical examples show that to approximate a function with similar accuracy, the tensor ring format provided by the proposed method has less parameters th…

2019-06-27cs.NAmath.NA

一种适用于使用简单傅里叶变换重建信号的通用采样方法

A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transforms

Tel Aviv University（特拉维夫大学）；EPFL（瑞士联邦理工学院）；Microsoft Research（微软研究院）；Princeton University（普林斯顿大学）；Google Research（谷歌研究院）

本文提出了一种通用采样方法，用于通过少量离散样本重建连续信号，该方法基于信号的傅里叶结构约束，并展示了其在多带信号重建和高斯过程回归等任务中的有效性。

2018-12-20cs.DScs.LGcs.NA