Related papers: Approximating class approach for empirical process…
We propose a new perspective for the evaluation of matching procedures by considering the complexity of the function class they belong to. Under this perspective we provide theoretical guarantees on post-matching covariate balance through a…
We address the general problem of formulating the dynamical large deviations of non-Markovian systems in a closed form. Specifically, we consider a broad class of ``self-interacting'' jump processes whose dynamics depends on the past…
We investigate the asymptotic properties of the integrated periodogram calculated from a sequence of indicator functions of dependent extremal events. An event in Euclidean space is extreme if it occurs far away from the origin. We use a…
We present a multivariate central limit theorem for a general class of interacting Markov chain Monte Carlo algorithms used to solve nonlinear measure-valued equations. These algorithms generate stochastic processes which belong to the…
Let $(X_k)_{k\geq1}$ be a Gaussian long-range dependent process with $EX_1=0$, $EX_1^2=1$ and covariance function $r(k)=k^{-D}L(k)$. For any measurable function $G$ let $(Y_k)_{k\geq1}=(G(X_k))_{k\geq1}$. We study the asymptotic behaviour…
Statistical inference can be seen as information processing involving input information and output information that updates belief about some unknown parameters. We consider the Bayesian framework for making inferences about dynamical…
Here we propose the Donsker-Varadhan-type compactness conditions and prove the joint large deviation principle for the empirical measure and empirical flow of Markov renewal processes (semi-Markov processes) with a countable state space,…
Consider a system of $n$ weakly interacting particles driven by independent Brownian motions. In many instances, it is well known that the empirical measure converges to the solution of a partial differential equation, usually called…
This paper presents a novel theoretical Monte Carlo Markov chain procedure in the framework of graphs. It specifically deals with the construction of a Markov chain whose empirical distribution converges to a given reference one. The Markov…
In this paper, the weak convergence of impulsive recurrent process with semi-Markov switching in the scheme of Levy approximation is proved. Singular perturbation problem for the compensating operator of the extended Markov renewal process…
Gradient matching is a promising tool for learning parameters and state dynamics of ordinary differential equations. It is a grid free inference approach, which, for fully observable systems is at times competitive with numerical…
We present a sample path dependent measure of causal influence between time series. The proposed causal measure is a random sequence, a realization of which enables identification of specific patterns that give rise to high levels of causal…
Two approaches to studying the correlation functions of the binary Markov sequences are considered. The first of them is based on the study of probability of occurring different ''words'' in the sequence. The other one uses recurrence…
The Markov assumption (MA) is fundamental to the empirical validity of reinforcement learning. In this paper, we propose a novel Forward-Backward Learning procedure to test MA in sequential decision making. The proposed test does not assume…
For a strictly stationary sequence of nonnegative regularly varying random variables $(X_{n})$ we study functional weak convergence of partial maxima processes $M_{n}(t) = \bigvee_{i=1}^{\lfloor nt \rfloor}X_{i},\,t \in [0,1]$ in the space…
We consider the problem of inference in discrete probabilistic models, that is, distributions over subsets of a finite ground set. These encompass a range of well-known models in machine learning, such as determinantal point processes and…
Predicting the effect of unseen interventions is a fundamental research question across the data sciences. It is well established that in general such questions cannot be answered definitively from observational data. This realization has…
In this paper we propose a method of proving impossibility results based on applying strong data-processing inequalities to estimate mutual information between sets of variables forming certain Markov random fields. The end result is that…
For a Gaussian process $X$ and smooth function $f$, we consider a Stratonovich integral of $f(X)$, defined as the weak limit, if it exists, of a sequence of Riemann sums. We give covariance conditions on $X$ such that the sequence converges…
Inferring the causal structure that links n observables is usually based upon detecting statistical dependences and choosing simple graphs that make the joint measure Markovian. Here we argue why causal inference is also possible when only…