English
Related papers

Related papers: Higher-order asymptotics for the parametric comple…

200 papers

We develop a sequential low-complexity inference procedure for Dirichlet process mixtures of Gaussians for online clustering and parameter estimation when the number of clusters are unknown a-priori. We present an easily computable, closed…

Machine Learning · Statistics 2015-09-15 Theodoros Tsiligkaridis , Keith W. Forsythe

We develop a qualitative theory of Markov Decision Processes (MDPs) and Partially Observable MDPs that can be used to model sequential decision making tasks when only qualitative information is available. Our approach is based upon an…

Artificial Intelligence · Computer Science 2013-01-07 Blai Bonet , Judea Pearl

We develop symbolic methods of asymptotic approximations for solutions of linear ordinary differential equations and use to them stabilize numerical calculations. Our method follows classical analysis for first-order systems and…

Symbolic Computation · Computer Science 2011-10-12 Christopher J. Winfield

We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. The model considered in the paper is very general as we do not impose any…

Statistics Theory · Mathematics 2007-05-23 Teo Sharia

This work develops algorithms for non-parametric confidence regions for samples from a univariate distribution whose support is a discrete mesh bounded on the left. We generalize the theory of Learned-Miller to preorders over the sample…

Computation · Statistics 2026-02-11 George Bissias

By combining the Malliavin calculus with Fourier techniques, we develop a high-order asymptotic expansion theory for a sequence of vector-valued random variables. Our asymptotic expansion formulas give the development of the characteristic…

Probability · Mathematics 2019-09-20 Ciprian Tudor , Nakahiro Yoshida

We demonstrate some novel links between entropy and description complexity, a notion referring to the minimal formula length for specifying given properties. Let MLU be the logic obtained by extending propositional logic with the universal…

Logic · Mathematics 2022-09-27 Reijo Jaakkola , Antti Kuusisto , Miikka Vilander

For suitable families of locally infinitely divisible Markov processes $\{\xi^{{\epsilon}}_t\}_{0\leq t\leq T}$ with frequent small jumps depending on a small parameter $\epsilon>0,$ precise asymptotics for large deviations of integral…

Probability · Mathematics 2012-11-27 Xiangfeng Yang

For a finite function class we describe the large sample limit of the sequential Rademacher complexity in terms of the viscosity solution of a $G$-heat equation. In the language of Peng's sublinear expectation theory, the same quantity…

Machine Learning · Computer Science 2016-05-13 Dmitry B. Rokhlin

Many sparse linear discriminant analysis (LDA) methods have been proposed to overcome the major problems of the classic LDA in high-dimensional settings. However, the asymptotic optimality results are limited to the case that there are only…

Statistics Theory · Mathematics 2015-08-06 Ruiyan Luo , Xin Qi

Laguerre and Laguerre-type polynomials are orthogonal polynomials on the interval $[0,\infty)$ with respect to a weight function of the form $w(x) = x^{\alpha} e^{-Q(x)}, Q(x) = \sum_{k=0}^m q_k x^k, \alpha > -1, q_m > 0$. The classical…

Numerical Analysis · Computer Science 2018-01-16 Daan Huybrechs , Peter Opsomer

The system of equations for parametric sub-resonant growth of the amplitude of oscillations was obtained. The time of turning point from the growing of the amplitude to the bounded oscillations in the slow variable was found. The comparison…

General Mathematics · Mathematics 2022-06-22 P. Y. Astafyeva , O. K. Kiselev

We study approximation properties of sequences of centered random elements $X_d$, $d\in\mathbb N$, with values in separable Hilbert spaces. We focus on sequences of tensor product-type and, in particular, degree-type random elements, which…

Probability · Mathematics 2014-10-17 A. A. Khartov

This paper studies parametric Markov decision processes (pMDPs), an extension to Markov decision processes (MDPs) where transitions probabilities are described by polynomials over a finite set of parameters. Fixing values for all parameters…

Logic in Computer Science · Computer Science 2019-04-03 Tobias Winkler , Sebastian Junges , Guillermo A. Pérez , Joost-Pieter Katoen

Formal asymptotics are substantiated that describe typical dropping cusp singularity of quasiclassical approximations to solutions of two cases of the integrable nonlinear Schr\"odinger equation…

Mathematical Physics · Physics 2023-11-17 Sergej Melikhov , Bulat Suleimanov , Azamat Shavlukov

We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…

Information Theory · Computer Science 2022-03-30 Jiachun Pan , Yonglong Li , Vincent Y. F. Tan

Learning of continuous exponential family distributions with unbounded support remains an important area of research for both theory and applications in high-dimensional statistics. In recent years, score matching has become a widely used…

Machine Learning · Computer Science 2026-05-15 Devin Smedira , Abhijith Jayakumar , Sidhant Misra , Marc Vuffray , Andrey Y. Lokhov

This article carries out a large dimensional analysis of standard regularized discriminant analysis classifiers designed on the assumption that data arise from a Gaussian mixture model with different means and covariances. The analysis…

Machine Learning · Statistics 2019-06-19 Khalil Elkhalil , Abla Kammoun , Romain Couillet , Tareq Y. Al-Naffouri , Mohamed-Slim Alouini

Asymptotic expansion of a variation with anticipative weights is derived by the theory of asymptotic expansion for Skorohod integrals having a mixed normal limit. The expansion formula is expressed with the quasi-torsion, quasi-tangent and…

Probability · Mathematics 2021-01-05 Nakahiro Yoshida

We extend the framework for complexity of operators in analysis devised by Kawamura and Cook (2012) to allow for the treatment of a wider class of representations. The main novelty is to endow represented spaces of interest with an…

Computational Complexity · Computer Science 2019-06-13 Eike Neumann , Florian Steinberg