English
Related papers

Related papers: Function estimation in the empirical Bayes setting

200 papers

This paper is concerned with polynomial approximations of the spectral abscissa function (the supremum of the real parts of the eigenvalues) of a parameterized eigenvalue problem, which are closely related to polynomial chaos approximations…

Numerical Analysis · Mathematics 2020-11-03 Luca Fenzi , Wim Michiels

Ordinary differential equations (ODEs) are used to model dynamic systems appearing in engineering, physics, biomedical sciences and many other fields. These equations contain unknown parameters, say $\theta$ of physical significance which…

Statistics Theory · Mathematics 2014-03-05 Prithwish Bhaumik , Subhashis Ghosal

Generalization error predictors (GEPs) aim to predict model performance on unseen distributions by deriving dataset-level error estimates from sample-level scores. However, GEPs often utilize disparate mechanisms (e.g., regressors,…

Machine Learning · Computer Science 2023-05-30 Puja Trivedi , Danai Koutra , Jayaraman J. Thiagarajan

We consider the problems of confidence estimation and hypothesis testing on a parameter of signal observed in Gaussian white noise. For these problems we point out lower bounds of asymptotic efficiency in the zone of moderate deviation…

Statistics Theory · Mathematics 2015-01-27 Mikhail Ermakov

Bayesian optimization is an approach to optimizing objective functions that take a long time (minutes or hours) to evaluate. It is best-suited for optimization over continuous domains of less than 20 dimensions, and tolerates stochastic…

Machine Learning · Statistics 2018-07-10 Peter I. Frazier

We find two-sided estimates for Kolmogorov, Bernstein, linear and projection widths of the classes of convolutions of $2\pi$-periodic functions $\varphi$, such that $\|\varphi\|_2\le1$, with fixed generated kernels $\Psi_{\bar{\beta}}$,…

Classical Analysis and ODEs · Mathematics 2023-04-11 A. S. Serdyuk , I. V. Sokolenko

We establish lower bounds on the complexity of finding $\epsilon$-stationary points of smooth, non-convex high-dimensional functions using first-order methods. We prove that deterministic first-order methods, even applied to arbitrarily…

Optimization and Control · Mathematics 2017-11-03 Yair Carmon , John C. Duchi , Oliver Hinder , Aaron Sidford

We assess the accuracy of Bayesian polynomial extrapolations from small parameter values, x, to large values of x. We consider a set of polynomials of fixed order, intended as a proxy for a fixed-order effective field theory (EFT)…

Methodology · Statistics 2022-06-17 M. A. Connell , I. Billig , D. R. Phillips

We prove a sharp general inequality estimating the distance of two probability measures on a compact Lie group in the Wasserstein metric in terms of their Fourier transforms. We use a generalized form of the Wasserstein metric, related by…

Classical Analysis and ODEs · Mathematics 2021-03-12 Bence Borda

Bayesian estimation is increasingly popular for performing model based inference to support policymaking. These data are often collected from surveys under informative sampling designs where subject inclusion probabilities are designed to…

Methodology · Statistics 2018-07-13 Luis G. Leon-Novelo , Terrance D. Savitsky

Motivated by the goal of improving the efficiency of small sample design, we propose a novel Bayesian stochastic approximation method to estimate the root of a regression function. The method features adaptive local modelling and…

Methodology · Statistics 2017-05-08 Jin Xu , Cui Xiong , Rongji Mu

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

Minimizing a convex function of a measure with a sparsity-inducing penalty is a typical problem arising, e.g., in sparse spikes deconvolution or two-layer neural networks training. We show that this problem can be solved by discretizing the…

Optimization and Control · Mathematics 2020-11-04 Lenaic Chizat

This paper deals with the study of dependencies between two given events modeled by point processes. In particular, we focus on the context of DNA to detect favored or avoided distances between two given motifs along a genome suggesting…

Statistics Theory · Mathematics 2011-07-22 Laure Sansonnet

The purpose of this paper is to estimate the intensity of a Poisson process $N$ by using thresholding rules. In this paper, the intensity, defined as the derivative of the mean measure of $N$ with respect to $ndx$ where $n$ is a fixed…

Statistics Theory · Mathematics 2008-01-22 Patricia Reynaud-Bouret , Vincent Rivoirard

Consider a Bayesian situation in which we observe $Y \sim p_{\theta}$, where $\theta \in \Theta$, and we have a family $\{ \nu_h, \, h \in \mathcal{H} \}$ of potential prior distributions on $\Theta$. Let $g$ be a real-valued function of…

Methodology · Statistics 2018-07-09 Hani Doss , Yeonhee Park

A trust-region algorithm is presented for finding approximate minimizers of smooth unconstrained functions whose values and derivatives are subject to random noise. It is shown that, under suitable probabilistic assumptions, the new method…

Optimization and Control · Mathematics 2022-01-03 S. Bellavia , G. Gurioli , B. Morini , Ph. L. Toint

This article revisits the problem of Bayesian shape-restricted inference in the light of a recently developed approximate Gaussian process that admits an equivalent formulation of the shape constraints in terms of the basis coefficients. We…

Methodology · Statistics 2019-02-14 Pallavi Ray , Debdeep Pati , Anirban Bhattacharya

We establish new lower bounds for the normal approximation in the Wasserstein distance of random variables that are functionals of a Poisson measure. Our results generalize previous findings by Nourdin and Peccati (2012, 2015) and Bierm\'e,…

Probability · Mathematics 2015-05-13 Ehsan Azmoodeh , Giovanni Peccati

Nisan and Szegedy (CC 1994) showed that any Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ that depends on all its input variables, when represented as a real-valued multivariate polynomial $P(x_1,\ldots,x_n)$, has degree at least $\log…

Computational Complexity · Computer Science 2021-07-08 Srikanth Srinivasan , S. Venkitesh
‹ Prev 1 8 9 10 Next ›