English
Related papers

Related papers: On alternative quantization for doubly weighted ap…

200 papers

Consider the numerical integration $${\rm Int}_{\mathbb S^d,w}(f)=\int_{\mathbb S^d}f({\bf x})w({\bf x}){\rm d}\sigma({\bf x}) $$ for weighted Sobolev classes $BW_{p,w}^r(\mathbb S^d)$ with a Dunkl weight $w$ and weighted Besov classes…

Numerical Analysis · Mathematics 2024-12-24 Jiansong Li , Heping Wang

A heuristic formula for 5-point approximation of the first derivative of an unknown function whose values are measured with an error at unequally spaced points is proposed. The derivative at a given point is calculated using the effective…

Data Analysis, Statistics and Probability · Physics 2022-09-14 Emmanuil Beygelzimer , Yan Beygelzimer

The concept of probabilistic values, such as Beta Shapley values and weighted Banzhaf values, has gained recent attention in applications like feature attribution and data valuation. However, exact computation of these values is often…

Machine Learning · Computer Science 2024-11-01 Weida Li , Yaoliang Yu

We analyze the accuracy of the discrete least-squares approximation of a function $u$ in multivariate polynomial spaces $\mathbb{P}_\Lambda:={\rm span} \{y\mapsto y^\nu \,: \, \nu\in \Lambda\}$ with $\Lambda\subset \mathbb{N}_0^d$ over the…

Numerical Analysis · Mathematics 2016-10-25 Albert Cohen , Giovanni Migliorati , Fabio Nobile

This paper is about the homogenization of linear elliptic operators in divergence form with stationary random coefficients that have only slowly decaying correlations. It deduces optimal estimates of the homogenization error from optimal…

Analysis of PDEs · Mathematics 2022-02-09 Antoine Gloria , Stefan Neukamm , Felix Otto

Recent interest in the use of $L_1$ regularization in the use of value function approximation includes Petrik et al.'s introduction of $L_1$-Regularized Approximate Linear Programming (RALP). RALP is unique among $L_1$-regularized…

Artificial Intelligence · Computer Science 2014-04-25 Gavin Taylor , Connor Geer , David Piekut

We characterize the best $L_{2}$ approximation to a multivariate function by linear combinations of ridge functions multiplied by some fixed weight functions. In the special case when the weight functions are constants, we propose explicit…

Classical Analysis and ODEs · Mathematics 2007-08-27 Vugar Ismailov

We consider random discrepancy under weighted importance sampling of a class of stratified input. We give the expected $L_p-$discrepancy($2\leq p<\infty$) upper bound in weighted form under a class of stratified sampling. This result…

Probability · Mathematics 2025-11-27 Jun Xian , Xiaoda Xu

Let $f_1, f_2, ..., f_n$ be a family of independent copies of a given random variable f in a probability space $(\Omega, \mathcal{F}, \mu)$. Then, the following equivalence of norms holds whenever $1 \le q \le p < \infty$…

Operator Algebras · Mathematics 2007-07-30 Marius Junge , Javier Parcet

This paper studies best finitely supported approximations of one-dimensional probability measures with respect to the $L^r$-Kantorovich (or transport) distance, where either the locations or the weights of the approximations' atoms are…

Probability · Mathematics 2019-03-06 Chuang Xu , Arno Berger

This paper addresses the problem of approximating an unknown function from point evaluations. When obtaining these point evaluations is costly, minimising the required sample size becomes crucial, and it is unreasonable to reserve a…

Numerical Analysis · Mathematics 2025-11-06 Nando Hegemann , Anthony Nouy , Philipp Trunschke

We study finite element approximations of second-order elliptic problems with measure-valued right-hand sides supported on lower-dimensional sets. The exact solution generally lacks $H^1$-regularity due to the source singularity, which…

Numerical Analysis · Mathematics 2026-03-10 Huadong Gao , Yuhui Huang

We give a general unified method that can be used for $L_1$ {\em closeness testing} of a wide range of univariate structured distribution families. More specifically, we design a sample optimal and computationally efficient algorithm for…

Data Structures and Algorithms · Computer Science 2015-08-25 Ilias Diakonikolas , Daniel M. Kane , Vladimir Nikishkin

Randomized approximation algorithms for many #P-complete problems (such as the partition function of a Gibbs distribution, the volume of a convex body, the permanent of a $\{0,1\}$-matrix, and many others) reduce to creating random…

Computation · Statistics 2017-06-30 Mark Huber

We investigate in this paper an alternative method to simulation based recursive importance sampling procedure to estimate the optimal change of measure for Monte Carlo simulations. We propose an algorithm which combines (vector and…

Probability · Mathematics 2011-09-20 Noufel Frikha , Abass Sagna

We propose a randomized lattice algorithm for approximating multivariate periodic functions over the $d$-dimensional unit cube from the weighted Korobov space with mixed smoothness $\alpha > 1/2$ and product weights…

Numerical Analysis · Mathematics 2025-08-26 Mou Cai , Takashi Goda , Yoshihito Kazashi

Computing cross-partial derivatives using fewer model runs is relevant in modeling, such as stochastic approximation, derivative-based ANOVA, exploring complex models, and active subspaces. This paper introduces surrogates of all the…

Methodology · Statistics 2024-07-17 Matieyendou Lamboni

We establish conditions to characterize probability measures by their $L^{p}$-quantization error functions in both $\mathbb{R}^{d}$ and Hilbert settings. This characterization is two-fold: static (identity of two distributions) and dynamic…

Probability · Mathematics 2020-02-20 Yating Liu , Gilles Pagès

We consider $\gamma$-weighted anchored and ANOVA spaces of functions with mixed first order partial derivatives bounded in a weighted $L_p$ norm with $1 \leq p \leq \infty$. The domain of the functions is $D^d$, where $D \subseteq…

Numerical Analysis · Mathematics 2021-02-09 Michael Gnewuch , Mario Hefter , Aicke Hinrichs , Klaus Ritter , Grzegorz W. Wasilkowski

We prove lower bounds for the randomized approximation of the embedding $\ell_1^m \rightarrow \ell_\infty^m$ based on algorithms that use arbitrary linear (hence non-adaptive) information provided by a (randomized) measurement matrix $N \in…

Numerical Analysis · Mathematics 2024-05-24 Robert Kunsch , Erich Novak , Marcin Wnuk