English
Related papers

Related papers: The Filtration of the split-words process

200 papers

A. Vershik discovered that filtrations indexed by the non-positive integers may have a paradoxical asymptotic behaviour near the time $-\infty$, called non-standardness. For example, two dyadic filtrations with trivial tail $\sigma$-field…

Probability · Mathematics 2012-08-02 Gael Ceillier , Christophe Leuridan

The notion of a homogeneous standard filtration of $\sigma$-algebras was introduced by the author in 1970. The main theorem asserted that a homogeneous filtration is standard, i.e., generated by a sequence of independent random variables,…

Probability · Mathematics 2015-11-24 Anatoly Vershik

We derive a practical standardness criterion for the filtration generated by a monotonic Markov process. This criterion is applied to show standardness of some adic filtrations.

Probability · Mathematics 2015-01-12 Elise Janvresse , Stéphane Laurent , Thierry De La Rue

We study the standard property of the natural filtration associated to a 0--1 valued stationary process. In our main result we show that if the process has summable memory decay, then the associated filtration is standard. We prove it by…

Probability · Mathematics 2007-06-13 X. Bressaud , A. Maass , S. Martinez , J. San Martin

Let $X$ be a stationary process with finite state-space $A$. Bressaud et al. recently provided a sufficient condition for the natural filtration of $X$ to be standard when $A$ has size 2. Their condition involves the conditional laws…

Probability · Mathematics 2015-03-17 Gaël Ceillier

The solution of the continuous time filtering problem can be represented as a ratio of two expectations of certain functionals of the signal process that are parametrized by the observation path. We introduce a class of discretization…

Probability · Mathematics 2017-11-23 Dan Crisan , Salvador Ortiz-Latorre

A filtration of a formal language L by a sequence s maps L to the set of words formed by taking the letters of words of L indexed only by s. We consider the languages resulting from filtering by all arithmetic progressions. If L is regular,…

Formal Languages and Automata Theory · Computer Science 2012-04-02 Hamoon Mousavi , Jeffrey Shallit

Separation is a classical problem asking whether, given two sets belonging to some class, it is possible to separate them by a set from a smaller class. We discuss the separation problem for regular languages. We give a Ptime algorithm to…

Formal Languages and Automata Theory · Computer Science 2013-04-26 Thomas Place , Lorijn van Rooijen , Marc Zeitoun

Thanks to the nonstandard formalization of fast oscillating functions, due to P. Cartier and Y. Perrin, an appropriate mathematical framework is derived for new non-asymptotic estimation techniques, which do not necessitate any statistical…

Computational Engineering, Finance, and Science · Computer Science 2007-05-23 Michel Fliess

Gorman and Bedrick (2019) argued for using random splits rather than standard splits in NLP experiments. We argue that random splits, like standard splits, lead to overly optimistic performance estimates. We can also split data in biased or…

Computation and Language · Computer Science 2021-04-27 Anders Søgaard , Sebastian Ebert , Jasmijn Bastings , Katja Filippova

The solution of the continuous time filtering problem can be represented as a ratio of two expectations of certain functionals of the signal process that are parametrized by the observation path. We introduce a new time discretisation of…

Probability · Mathematics 2014-08-26 Dan Crisan , Salvador Ortiz-Latorre

Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there…

Formal Languages and Automata Theory · Computer Science 2017-01-11 Thomas Place , Marc Zeitoun

The generalized filtered method of moments was developed in the recent papers by Alomari et al., 2020, and Ayache et al., 2022. It used functional data obtained from continuously sampled cyclic long-memory stochastic processes to…

Statistics Theory · Mathematics 2024-07-18 Antoine Ayache , Serhii Kravchenko , Andriy Olenko

The Split and Rephrase (SPRP) task, which consists in splitting complex sentences into a sequence of shorter grammatical sentences, while preserving the original meaning, can facilitate the processing of complex texts for humans and…

Computation and Language · Computer Science 2024-10-11 David Ponce , Thierry Etchegoyhen , Jesús Calleja Pérez , Harritxu Gete

We offer a natural and extensible measure-theoretic treatment of missingness at random. Within the standard missing data framework, we give a novel characterisation of the observed data as a stopping-set sigma algebra. We demonstrate that…

Methodology · Statistics 2018-01-23 Daniel Farewell , Rhian Daniel , Shaun Seaman

Often, when analyzing the behaviour of systems modelled as context-free languages, we wish to know if two languages overlap. To this end, we present an effective semi-decision procedure for regular separability of context-free languages,…

Formal Languages and Automata Theory · Computer Science 2014-11-20 Graeme Gange , Jorge A. Navas , Peter Schachte , Harald Sondergaard , Peter J. Stuckey

In this paper we consider the normalized lengths of the factors of some factorizations of random words. First, for the \emph{Lyndon factorization} of finite random words with $n$ independent letters drawn from a finite or infinite totally…

Probability · Mathematics 2021-11-05 Elahe Zohoorian Azad , Philippe Chassaing

In this paper we study progressive filtration expansions with random times. We show how semimartingale decompositions in the expanded filtration can be obtained using a natural link between progressive and initial expansions. The link is,…

Probability · Mathematics 2016-11-25 Younes Kchia , Martin Larsson , Philip Protter

When expanding a filtration with a stochastic process it is easily possible for semimartingale no longer to remain semimartingales in the enlarged filtration. Y. Kchia and P. Protter indicated a way to avoid this pitfall in 2015, but they…

Probability · Mathematics 2020-02-18 Léo Neufcourt , Philip Protter

To mitigate the problem of having to traverse over the full vocabulary in the softmax normalization of a neural language model, sampling-based training criteria are proposed and investigated in the context of large vocabulary word-based…

Computation and Language · Computer Science 2022-06-20 Zijian Yang , Yingbo Gao , Alexander Gerstenberger , Jintao Jiang , Ralf Schlüter , Hermann Ney
‹ Prev 1 2 3 10 Next ›