English
Related papers

Related papers: Efficient multivariate approximation on the cube

200 papers

An important goal in algorithm design is determining the best running time for solving a problem (approximately). For some problems, we know the optimal running time, assuming certain conditional lower bounds. In this work, we study the…

Data Structures and Algorithms · Computer Science 2024-03-04 Moritz Buchem , Paul Deuker , Andreas Wiese

We consider a generic diffusion on the 1D torus and give a simple representation formula for the large deviation rate functional of its invariant probability measure, in the limit of vanishing noise. Previously, this rate functional had…

Probability · Mathematics 2010-10-12 A. Faggionato , D. Gabrielli

We consider the problem of approximating an unknown function $u\in L^2(D,\rho)$ from its evaluations at given sampling points $x^1,\dots,x^n\in D$, where $D\subset \mathbb{R}^d$ is a general domain and $\rho$ is a probability measure. The…

Numerical Analysis · Mathematics 2018-05-29 Benjamin Arras , Markus Bachmayr , Albert Cohen

In this paper we present the first known deterministic algorithm for the construction of multiple rank-1 lattices for the approximation of periodic functions of many variables. The algorithm works by converting a potentially large…

Numerical Analysis · Mathematics 2020-03-24 Craig Gross , Mark A. Iwen , Lutz Kämmerer , Toni Volkmer

We consider a Maxwell system on $\mathbb{R}^3$ with periodic and highly oscillating coefficients. It is known that the solutions converge in the weak-$\ast$ topology of $L^\infty(0,T;\,L^2(\mathbb{R}^3))$ to the solution of a similar…

Analysis of PDEs · Mathematics 2024-05-28 Juan Casado-Díaz , Nourelhouda Khedhiri , Mohamed Lazhar Tayeb

The article proves an assertion analogous to the Littlewood-Paley theorem for the orthoprojectors onto mutually orthogonal subspaces of piecewise polynomial functions on the cube $ I^d. $ This assertion provides an upper estimate for the…

Classical Analysis and ODEs · Mathematics 2011-11-28 S. N. Kudryavtsev

We give a fast oblivious L2-embedding of $A\in \mathbb{R}^{n x d}$ to $B\in \mathbb{R}^{r x d}$ satisfying $(1-\varepsilon)\|A x\|_2^2 \le \|B x\|_2^2 <= (1+\varepsilon) \|Ax\|_2^2.$ Our embedding dimension $r$ equals $d$, a constant…

Machine Learning · Computer Science 2019-09-30 Malik Magdon-Ismail , Alex Gittens

For a set $\mathbb{W} \subset L_p(\bT^d)$, $1 < p < \infty$, of multivariate periodic functions on the torus $\bT^d$ and a given function $\varphi \in L_p(\bT^d)$, we study the approximation in the $L_p(\bT^d)$-norm of functions $f \in…

Functional Analysis · Mathematics 2013-04-26 Dinh Dung , Charles Micchelli

We present an accurate and efficient framework for real-space Hubbard-corrected density functional theory. In particular, we obtain expressions for the energy, atomic forces, and stress tensor suitable for real-space finite-difference…

Computational Physics · Physics 2025-10-20 Sayan Bhowmik , Andrew J. Medford , Phanish Suryanarayana

In this paper we consider the problem of constructing numerical algorithms for approximating of convex compact bodies in d-dimensional Euclidean space by polytopes with any given accuracy. It is well known that optimal with respect to the…

Metric Geometry · Mathematics 2018-12-10 G. K. Kamenev

We study the $L_{\infty}$-approximation of $d$-variate functions from Hilbert spaces via linear functionals as information. It is a common phenomenon in tractability studies that unweighted problems (with each dimension being equally…

Numerical Analysis · Mathematics 2017-12-12 Robert J. Kunsch

A new representation is proposed for functions in a Sobolev space with dominating mixed smoothness on an $N$-dimensional hyperrectangle. In particular, it is shown that these functions can be expressed in terms of their highest-order mixed…

Numerical Analysis · Mathematics 2024-04-30 Declan S. Jagt , Matthew M. Peet

We consider the problem of approximating a function from $L^2$ by an element of a given $m$-dimensional space $V_m$, associated with some feature map $\boldsymbol{\varphi}$, using evaluations of the function at random points $x_1,…

Numerical Analysis · Mathematics 2025-08-01 Anthony Nouy , Bertrand Michel

We propose nonparametric estimators for the second-order central moments of possibly anisotropic spherical random fields, within a functional data analysis context. We consider a measurement framework where each random field among an…

Statistics Theory · Mathematics 2022-06-28 Alessia Caponera , Julien Fageot , Matthieu Simeoni , Victor M. Panaretos

Smoothness of the subdiagonals of the Cholesky factor of large covariance matrices is closely related to the degrees of nonstationarity of autoregressive models for time series and longitudinal data. Heuristically, one expects for a nearly…

Machine Learning · Statistics 2020-07-23 Aramayis Dallakyan , Mohsen Pourahmadi

In this paper, we consider an unconstrained optimization model where the objective is a sum of a large number of possibly nonconvex functions, though overall the objective is assumed to be smooth and convex. Our bid to solving such model…

Optimization and Control · Mathematics 2022-03-15 Xi Chen , Bo Jiang , Tianyi Lin , Shuzhong Zhang

This paper addresses the optimization problem of minimizing non-convex continuous functions, which is relevant in the context of high-dimensional machine learning applications characterized by over-parametrization. We analyze a randomized…

Machine Learning · Computer Science 2025-02-28 Jim Zhao , Aurelien Lucchi , Nikita Doikov

For a probability measure on a real separable Hilbert space, we are interested in "volume-based" approximations of the d-dimensional least squares error of it, i.e., least squares error with respect to a best fit d-dimensional affine…

Functional Analysis · Mathematics 2012-10-08 Gilad Lerman , J. Tyler Whitehouse

In this paper, we analyse a new exponential-type integrator for the nonlinear cubic Schr\"odinger equation on the $d$ dimensional torus $\mathbb T^d$. The scheme has recently also been derived in a wider context of decorated trees in [Y.…

Numerical Analysis · Mathematics 2021-09-06 Alexander Ostermann , Fangyan Yao , Yifei Wu

We provide fast algorithms for overconstrained $\ell_p$ regression and related problems: for an $n\times d$ input matrix $A$ and vector $b\in\mathbb{R}^n$, in $O(nd\log n)$ time we reduce the problem $\min_{x\in\mathbb{R}^d} \|Ax-b\|_p$ to…

Data Structures and Algorithms · Computer Science 2014-04-08 Kenneth L. Clarkson , Petros Drineas , Malik Magdon-Ismail , Michael W. Mahoney , Xiangrui Meng , David P. Woodruff
‹ Prev 1 4 5 6 7 8 10 Next ›