English
Related papers

Related papers: Extended Limber Approximation

200 papers

We calculate the energy spectrum of closed strings in SU(N) gauge theories with N=2,3,4,6,8 in 2+1 dimensions to a high accuracy. We attempt to control all systematic errors, and this allows us to perform a precise comparison with different…

High Energy Physics - Lattice · Physics 2009-09-29 Barak Bringoltz , Michael Teper

In this paper, we consider a "compensated" random sum that arises from numerical approximation of stochastic integrations and differential equations. We show that the compensated sum exhibits some surprising cancellations among its…

Probability · Mathematics 2024-01-30 Yanghui Liu

We study the bias of classical quantile regression and instrumental variable quantile regression estimators. While being asymptotically first-order unbiased, these estimators can have non-negligible second-order biases. We derive a…

Econometrics · Economics 2025-12-17 Grigory Franguridi , Bulat Gafarov , Kaspar Wuthrich

Measurement error is a pervasive challenge across many disciplines, yet its impact on sample size determination and the accuracy and precision of estimators regarding the association between an exposure and an outcome remains understudied…

Methodology · Statistics 2025-05-27 Honghyok Kim

In the 1990's exponential-type error bounds appeared in the theory of radial basis functions. This kind of error bounds is very powerful. However it only measures the difference between the approximant and approximand. Mathematicians and…

Numerical Analysis · Mathematics 2007-05-23 Lin-Tian Luh

A number of improvements have been added to the existing analytical model of hysteresis loop defined in parametric form. In particular, three phase shifts are included in the model, which permits to tilt the hysteresis loop smoothly by the…

Optimization and Control · Mathematics 2020-06-11 Rostislav V. Lapshin

A new loss function is proposed for neural networks on classification tasks which extends the hinge loss by assigning gradients to its critical points. We will show that for a linear classifier on linearly separable data with fixed step…

Machine Learning · Computer Science 2020-06-26 Justin Lizama

Through end-to-end training to predict the next token, LLMs have become valuable tools for various tasks. Enhancing their core training in language modeling can improve numerous downstream applications. A successful approach to enhance…

Computation and Language · Computer Science 2024-10-17 Nathan Cornille , Florian Mai , Jingyuan Sun , Marie-Francine Moens

Probability estimation is essential for every statistical data compression algorithm. In practice probability estimation should be adaptive, recent observations should receive a higher weight than older observations. We present a…

Information Theory · Computer Science 2015-01-12 Christopher Mattern

Instead of sampling a function at a single point, average sampling takes the weighted sum of function values around the point. Such a sampling strategy is more practical and more stable. In this note, we present an explicit method with an…

Information Theory · Computer Science 2014-12-23 Wenjian Chen , Haizhang Zhang

We study the complexity of high-dimensional approximation in the $L_2$-norm when different classes of information are available; we compare the power of function evaluations with the power of arbitrary continuous linear measurements. Here,…

Numerical Analysis · Mathematics 2023-03-23 David Krieg , Pawel Siedlecki , Mario Ullrich , Henryk Woźniakowski

An approximation method is presented for probabilistic inference with continuous random variables. These problems can arise in many practical problems, in particular where there are "second order" probabilities. The approximation, based on…

Artificial Intelligence · Computer Science 2013-04-10 Ross D. Shachter

The iteratively reweighted least squares method (IRLS) is a popular technique used in practice for solving regression problems. Various versions of this method have been proposed, but their theoretical analyses failed to capture the good…

Data Structures and Algorithms · Computer Science 2019-07-11 Alina Ene , Adrian Vladu

We provide an asymptotic expansion of the maximal mean squared error (MSE) of the sample median to be attained on shrinking gross error neighborhoods about an ideal central distribution. More specifically, this expansion comes in powers of…

Statistics Theory · Mathematics 2010-06-02 Peter Ruckdeschel

Empirical likelihood is a popular nonparametric or semi-parametric statistical method with many nice statistical properties. Yet when the sample size is small, or the dimension of the accompanying estimating function is high, the…

Statistics Theory · Mathematics 2010-10-05 Yukun Liu , Jiahua Chen

We present an approximation algorithm for Weighted Tree Augmentation with approximation factor $1+\ln 2 + \varepsilon < 1.7$. This is the first algorithm beating the longstanding factor of $2$, which can be achieved through many standard…

Data Structures and Algorithms · Computer Science 2021-04-16 Vera Traub , Rico Zenklusen

We consider the problem of approximating smoothing spline estimators in a nonparametric regression model. When applied to a sample of size $n$, the smoothing spline estimator can be expressed as a linear combination of $n$ basis functions,…

Computation · Statistics 2020-03-25 Cheng Meng , Xinlian Zhang , Jingyi Zhang , Wenxuan Zhong , Ping Ma

We show that the span of $\Omega(\frac{1}{\varepsilon^4})$ rows of any matrix $A \subset \mathbb{R}^{n \times d}$ sampled according to the length-squared distribution contains a rank-$1$ matrix $\tilde{A}$ such that $||A - \tilde{A}||_F^2…

Data Structures and Algorithms · Computer Science 2019-10-30 Ragesh Jaiswal , Amit Kumar

We provide faster algorithms for the problem of Gaussian summation, which occurs in many machine learning methods. We develop two new extensions - an O(Dp) Taylor expansion for the Gaussian kernel with rigorous error bounds and a new error…

Machine Learning · Computer Science 2012-07-02 Dongryeol Lee , Alexander G. Gray

We approximate the solution to some linear and degenerate quasi-linear problem involving a linear elliptic operator (like the semi-discrete in time implicit Euler approximation of Richards and Stefan equations) with measure right-hand side…

Classical Analysis and ODEs · Mathematics 2022-05-17 Robert Eymard , David Maltese , Alain Prignet