English
Related papers

Related papers: Semi-Finite Length Analysis for Information Theore…

200 papers

We prove that there exists an entire function for which every complex number is an asymptotic value and whose growth is arbitrarily slow subject only to the necessary condition that the function is of infinite order.

Complex Variables · Mathematics 2022-01-17 Aimo Hinkkanen , Joseph Miles

We study optimal estimation when the likelihood may be misspecified. Building on tools from the theory of decision-making under uncertainty, we analyze a class of axiomatically grounded optimality criteria which nests several existing…

Econometrics · Economics 2026-04-28 Isaiah Andrews , Ricky Li , Yucheng Shang

Monte Carlo approximations for random linear elliptic PDE constrained optimization problems are studied. We use empirical process theory to obtain best possible mean convergence rates $O(n^{-\frac{1}{2}})$ for optimal values and solutions,…

Optimization and Control · Mathematics 2021-06-14 Werner Römisch , Thomas M. Surowiec

Uniform asymptotic expansions are derived for the zeros of the reverse generalized Bessel polynomials of large degree $n$ and real parameter $a$. It is assumed that $-\Delta_{1} n+\frac{3}{2} \leq a \leq \Delta_{2} n$ for fixed arbitrary…

Classical Analysis and ODEs · Mathematics 2025-11-04 T. M. Dunster , Amparo Gil , Diego Ruiz-Antolin , Javier Segura

In this paper, insight is given in the techniques used to compute asymptotic expansions. In a broad fashion the technique is described. Most of the results apply to the paper "An expansion for the maximum likelihood estimator and its…

Methodology · Statistics 2007-10-05 Shanti Venetiaan

We consider the Ordered Open End Bin Packing problem. Items of sizes in $(0,1]$ are presented one by one, to be assigned to bins in this order. An item can be assigned to any bin for which the current total size strictly below $1$. This…

Data Structures and Algorithms · Computer Science 2020-10-15 János Balogh , Leah Epstein , Asaf Levin

Asymptotic expansions are derived for associated Legendre functions of degree $\nu$ and order $\mu$, where one or the other of the parameters is large. The expansions are uniformly valid for unbounded real and complex values of the argument…

Classical Analysis and ODEs · Mathematics 2025-07-04 T. M. Dunster

We derive the complete asymptotic expansion in terms of powers of $N$ for the Riesz $s$-energy of $N$ equally spaced points on the unit circle as $N\to \infty$. For $s\ge -2$, such points form optimal energy $N$-point configurations with…

Mathematical Physics · Physics 2011-11-02 J. S. Brauchart , D. P. Hardin , E. B. Saff

We study maximum-likelihood-type estimation for diffusion processes when the coefficients are nonrandom and observation occurs in nonsynchronous manner. The problem of nonsynchronous observations is important when we consider the analysis…

Statistics Theory · Mathematics 2022-07-04 Teppei Ogihara

Consider a network of agents that all want to guess the correct value of some ground truth state. In a sequential order, each agent makes its decision using a single private signal which has a constant probability of error, as well as…

Social and Information Networks · Computer Science 2024-10-08 Kevin Lu , Jordan Chong , Matt Lu , Jie Gao

In this paper, we consider the sphericity test for a one-sample problem under high-dimensional two-step monotone incomplete data. Existing asymptotic expansions for the null distributions of the likelihood ratio test (LRT) statistic and…

Statistics Theory · Mathematics 2026-04-01 Tetsuya Sato , Tomoyuki Nakagawa

A sequential design problem for rank aggregation is commonly encountered in psychology, politics, marketing, sports, etc. In this problem, a decision maker is responsible for ranking $K$ items by sequentially collecting pairwise noisy…

Methodology · Statistics 2017-10-18 Xi Chen , Yunxiao Chen , Xiaoou Li

We derive nearly tight and non-asymptotic convergence bounds for solutions of entropic semi-discrete optimal transport. These bounds quantify the stability of the dual solutions of the regularized problem (sometimes called Sinkhorn…

Artificial Intelligence · Computer Science 2022-05-05 Alex Delalande

In this paper we study a semilinear elliptic problem on a bounded domain in $\R^2$ with large exponent in the nonlinear term. We consider positive solutions obtained by minimizing suitable functionals. We prove some asymtotic estimates…

Analysis of PDEs · Mathematics 2007-05-23 Khalil El Mehdi , Massimo Grossi

Let $\overline{p}(n)$ denote the overpartition function. In this paper, we study the asymptotic growth of finite difference of logarithm of $\sqrt[n]{\overline{p}(n)/n^{\alpha}}$ for $\alpha$ being a non-negative real number, namely…

Number Theory · Mathematics 2024-01-12 Gargi Mukherjee

Recent results concerning asymptotic Bayes-optimality under sparsity (ABOS) of multiple testing procedures are extended to fairly generally distributed effect sizes under the alternative. An asymptotic framework is considered where both the…

Statistics Theory · Mathematics 2011-07-13 Florian Frommlet , Arijit Chakrabarti , Magdalena Murawska , Malgorzata Bogdan

We fix a maximal order $\mathcal O$ in $\F=\R,\C$ or $\mathbb{H}$, and an $\F$-hermitian form $Q$ of signature $(n,1)$ with coefficients in $\mathcal O$. Let $k\in\N$. By applying a lattice point theorem on the $\F$-hyperbolic space, we…

Number Theory · Mathematics 2014-01-03 Emilio A. Lauret

We established and estimate the full asymptotic expansion in integer powers of 1 N of the [ $\sqrt$ N ] first marginals of N-body evolutions lying in a general paradigm containing Kac models and non-relativistic quantum evolution. We prove…

Quantum Physics · Physics 2017-10-11 Thierry Paul , Mario Pulvirenti

A long line of work in the past two decades or so established close connections between several different pseudorandom objects and applications. These connections essentially show that an asymptotically optimal construction of one central…

Computational Complexity · Computer Science 2023-05-31 Xin Li

Theoretical guarantees in reinforcement learning (RL) are known to suffer multiplicative blow-up factors with respect to the misspecification error of function approximation. Yet, the nature of such \emph{approximation factors} --…

Machine Learning · Computer Science 2023-12-18 Philip Amortila , Nan Jiang , Csaba Szepesvári
‹ Prev 1 4 5 6 7 8 10 Next ›