<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (cshalizi)</title>
    <link>https://pinboard.in/u:cshalizi/public/</link>
    <description>recent bookmarks from cshalizi</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://www.jstor.org/stable/1403785?seq=1"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2602.04250"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2510.02471"/>
	<rdf:li rdf:resource="https://link.springer.com/article/10.1007/s11203-025-09329-6"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2203.04395"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2109.02224"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2303.08992"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2203.04163"/>
	<rdf:li rdf:resource="https://oxford.universitypressscholarship.com/view/10.1093/oso/9780192844507.001.0001/oso-9780192844507?rskey=nzm83v&amp;result=113"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2108.00997"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2106.13947"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2011.00308"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2106.07054"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2104.12929"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2007.10874"/>
	<rdf:li rdf:resource="https://onlinelibrary.wiley.com/doi/abs/10.1111/jtsa.12583?campaign=wolacceptedarticle"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1909.11773"/>
	<rdf:li rdf:resource="https://projecteuclid.org/euclid.bj/1569398764"/>
	<rdf:li rdf:resource="https://link.springer.com/article/10.1007/s11203-018-9194-8"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1810.04496"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1908.00845"/>
	<rdf:li rdf:resource="https://global.oup.com/academic/product/functional-gaussian-approximation-for-dependent-structures-9780198826941?cc=us&amp;lang=en#"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1808.08811"/>
	<rdf:li rdf:resource="http://www.springer.com/gp/book/9783662543221?wt_mc=Alerts.NBA.Sep-13"/>
	<rdf:li rdf:resource="http://www.mitpressjournals.org/doi/abs/10.1162/NECO_a_00870"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1308.4117"/>
	<rdf:li rdf:resource="http://link.springer.com/article/10.1007/s11203-015-9120-2?wt_mc=alerts.TOCjournals"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1506.02903"/>
	<rdf:li rdf:resource="https://infostructuralist.wordpress.com/2014/05/03/information-flow-on-graphs/"/>
	<rdf:li rdf:resource="http://projecteuclid.org/euclid.bj/1402488943"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1501.03059"/>
	<rdf:li rdf:resource="http://www.cims.nyu.edu/~vitaly/pub/fts.pdf"/>
	<rdf:li rdf:resource="https://www.ma.utexas.edu/mp_arc/c/05/05-65.pdf"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1405.0608"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1404.2802"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1404.0645"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1404.0295"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/0707.0322"/>
	<rdf:li rdf:resource="http://projecteuclid.org/euclid.aop/1393251303"/>
	<rdf:li rdf:resource="http://link.springer.com/article/10.1007/s10959-012-0450-3?wt_mc=alerts.TOCjournals"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1209.0633"/>
	<rdf:li rdf:resource="http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6675825"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1312.2128"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1309.4859"/>
	<rdf:li rdf:resource="http://www.jstor.org/discover/10.2307/2999460?uid=3739864&amp;uid=2129&amp;uid=2&amp;uid=70&amp;uid=4&amp;uid=3739256&amp;sid=21102630678603"/>
	<rdf:li rdf:resource="http://www.nowpublishers.com/articles/foundations-and-trends-in-stochastic-systems/STO-004"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1109.2694"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1304.7960"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1304.5113"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1304.2621"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1303.6999"/>
	<rdf:li rdf:resource="http://dx.doi.org/10.1103/RevModPhys.61.981"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1303.4537"/>
	<rdf:li rdf:resource="http://link.springer.com/chapter/10.1007%2F978-3-642-33305-7_10"/>
	<rdf:li rdf:resource="http://link.springer.com/article/10.1007/s00440-011-0371-6"/>
	<rdf:li rdf:resource="http://www.springerlink.com/content/1v2n1v06776kp01u/"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1208.1720"/>
	<rdf:li rdf:resource="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.aoap/1344614202"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1204.0608"/>
	<rdf:li rdf:resource="https://netfiles.uiuc.edu/meyn/www/spm_files/Papers_pdf/markovISIT05.pdf"/>
	<rdf:li rdf:resource="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.aihp/1334148205"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1203.5245"/>
	<rdf:li rdf:resource="http://www.numdam.org/item?id=AIHPB_1995__31_2_393_0"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1202.4283"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1201.4579"/>
	<rdf:li rdf:resource="http://archive.numdam.org/article/RSMUP_2003__110__97_0.pdf"/>
	<rdf:li rdf:resource="http://www.springerlink.com/content/c38664053l348582/"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/math/0305026"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1110.2529"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1107.1794"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://www.jstor.org/stable/1403785?seq=1">
    <title>Markov and the Birth of Chain Dependence Theory on JSTOR</title>
    <dc:date>2026-06-01T13:58:12+00:00</dc:date>
    <link>https://www.jstor.org/stable/1403785?seq=1</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>in_NB markov_models history_of_mathematics markov.a.a. ergodic_theory mixing free_will</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:b76b51010206/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:history_of_mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov.a.a."/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:free_will"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2602.04250">
    <title>[2602.04250] A Note on Physical Dependence and Mixing Conditions for Triangular Arrays</title>
    <dc:date>2026-02-05T14:10:03+00:00</dc:date>
    <link>https://arxiv.org/abs/2602.04250</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Under mild structural assumptions and regularity conditions on the marginal and conditional densities, an explicit bound on the β-mixing coefficients in terms of the physical dependence measure is provided. Consequently, weak physical dependence implies β-mixing and strong mixing for triangular arrays, complementing Hill (2025), who proved the converse implication under moment assumptions."]]></description>
<dc:subject>to_read mixing re:codename:catherine_wheel in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:a231e8b97c1d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:codename:catherine_wheel"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2510.02471">
    <title>[2510.02471] Predictive inference for time series: why is split conformal effective despite temporal dependence?</title>
    <dc:date>2025-11-10T14:26:55+00:00</dc:date>
    <link>https://arxiv.org/abs/2510.02471</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We consider the problem of uncertainty quantification for prediction in a time series: if we use past data to forecast the next time point, can we provide valid prediction intervals around our forecasts? To avoid placing distributional assumptions on the data, in recent years the conformal prediction method has been a popular approach for predictive inference, since it provides distribution-free coverage for any iid or exchangeable data distribution. However, in the time series setting, the strong empirical performance of conformal prediction methods is not well understood, since even short-range temporal dependence is a strong violation of the exchangeability assumption. Using predictors with "memory" -- i.e., predictors that utilize past observations, such as autoregressive models -- further exacerbates this problem. In this work, we examine the theoretical properties of split conformal prediction in the time series setting, including the case where predictors may have memory. Our results bound the loss of coverage of these methods in terms of a new "switch coefficient", measuring the extent to which temporal dependence within the time series creates violations of exchangeability. Our characterization of the coverage probability is sharp over the class of stationary, β-mixing processes. Along the way, we introduce tools that may prove useful in analyzing other predictive inference methods for dependent data."]]></description>
<dc:subject>to:NB time_series prediction mixing conformal_prediction barber.rina_foygel</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:09b188b2229e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:conformal_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:barber.rina_foygel"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://link.springer.com/article/10.1007/s11203-025-09329-6">
    <title>Statistical learning for $$psi $$ -weakly dependent processes | Statistical Inference for Stochastic Processes</title>
    <dc:date>2025-09-03T14:22:34+00:00</dc:date>
    <link>https://link.springer.com/article/10.1007/s11203-025-09329-6</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["The purpose of this paper is to study the generalization performance of the Empirical Risk Minimization (ERM) algorithm from $\psi$-weakly dependent processes. These processes unify a large class of weak dependence conditions, including strong mixing and association. We first establish the exponential bound on the rate of relative uniform convergence and the consistency of the ERM algorithm. Secondly, we derive generalization bounds and provide the learning rate. Under some Hölder class of hypothesis, we obtain an asymptotic rate close to $O(n^{-1/2})$. Finally, we present some application and simulation results with examples of causal models within the context of time series prediction."]]></description>
<dc:subject>to:NB learning_theory mixing time_series</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:47b97e670aaa/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2203.04395">
    <title>[2203.04395] Equivalences of Geometric Ergodicity of Markov Chains</title>
    <dc:date>2024-12-11T16:02:48+00:00</dc:date>
    <link>https://arxiv.org/abs/2203.04395</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["This paper gathers together different conditions which are all equivalent to geometric ergodicity of time-homogeneous Markov chains on general state spaces. A total of 34 different conditions are presented (27 for general chains plus 7 just for reversible chains), some old and some new, in terms of such notions as convergence bounds, drift conditions, spectral properties, etc., with different assumptions about the distance metric used, finiteness of function moments, initial distribution, uniformity of bounds, and more. Proofs of the connections between the different conditions are provided, mostly self-contained but using some results from the literature where appropriate."]]></description>
<dc:subject>to:NB markov_models mixing ergodic_theory re:almost_none</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:bb278df058e6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:almost_none"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2109.02224">
    <title>[2109.02224] On Empirical Risk Minimization with Dependent and Heavy-Tailed Data</title>
    <dc:date>2023-12-14T11:31:16+00:00</dc:date>
    <link>https://arxiv.org/abs/2109.02224</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In this work, we establish risk bounds for the Empirical Risk Minimization (ERM) with both dependent and heavy-tailed data-generating processes. We do so by extending the seminal works of Mendelson [Men15, Men18] on the analysis of ERM with heavy-tailed but independent and identically distributed observations, to the strictly stationary exponentially β-mixing case. Our analysis is based on explicitly controlling the multiplier process arising from the interaction between the noise and the function evaluations on inputs. It allows for the interaction to be even polynomially heavy-tailed, which covers a significantly large class of heavy-tailed models beyond what is analyzed in the learning theory literature. We illustrate our results by deriving rates of convergence for the high-dimensional linear regression problem with dependent and heavy-tailed data."

--- NeurIPS version: https://proceedings.neurips.cc/paper_files/paper/2021/hash/4afa19649ae378da31a423bcd78a97c8-Abstract.html]]></description>
<dc:subject>to:NB to_read learning_theory mixing heavy_tails learning_under_dependence</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:9123f4f94745/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:heavy_tails"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_under_dependence"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2303.08992">
    <title>[2303.08992] Law of large numbers and central limit theorem for ergodic quantum processes</title>
    <dc:date>2023-04-22T13:55:53+00:00</dc:date>
    <link>https://arxiv.org/abs/2303.08992</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["A discrete quantum process is represented by a sequence of quantum operations, which are completely positive maps that are not necessarily trace preserving. We consider quantum processes that are obtained by repeated iterations of a quantum operation with noise. Such ergodic quantum processes generalize independent quantum processes. An ergodic theorem describing convergence to equilibrium for a general class of such processes was recently obtained by Movassagh and Schenker. Under irreducibility and mixing conditions, we obtain a central limit type theorem describing fluctuations around the ergodic limit."

--- Last tag means "mention in further reading, if this checks out".]]></description>
<dc:subject>stochastic_processes quantum_mechanics ergodic_theory mixing central_limit_theorem re:almost_none in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:0ab8f9922f41/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:quantum_mechanics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:central_limit_theorem"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:almost_none"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2203.04163">
    <title>[2203.04163] Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains</title>
    <dc:date>2022-06-09T08:19:32+00:00</dc:date>
    <link>https://arxiv.org/abs/2203.04163</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Two recent and seemingly-unrelated techniques for proving mixing bounds for Markov chains are: (i) the framework of Spectral Independence, introduced by Anari, Liu and Oveis Gharan, and its numerous extensions, which have given rise to several breakthroughs in the analysis of mixing times of discrete Markov chains and (ii) the Stochastic Localization technique which has proven useful in establishing mixing and expansion bounds for both log-concave measures and for measures on the discrete hypercube. In this paper, we introduce a framework which connects ideas from both techniques. Our framework unifies, simplifies and extends those two techniques. In its center is the concept of a localization scheme which, to every probability measure, assigns a martingale of probability measures which localize in space as time evolves. As it turns out, to every such scheme corresponds a Markov chain, and many chains of interest appear naturally in this framework. This viewpoint provides tools for deriving mixing bounds for the dynamics through the analysis of the corresponding localization process. Generalizations of concepts of Spectral Independence and Entropic Independence naturally arise from our definitions, and in particular we recover the main theorems in the spectral and entropic independence frameworks via simple martingale arguments (completely bypassing the need to use the theory of high-dimensional expanders). We demonstrate the strength of our proposed machinery by giving short and (arguably) simpler proofs to many mixing bounds in the recent literature, including giving the first O(nlogn) bound for the mixing time of Glauber dynamics on the hardcore-model (of arbitrary degree) in the tree-uniqueness regime."]]></description>
<dc:subject>to:NB stochastic_processes mixing markov_models martingales</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:03c6185cd447/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:martingales"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://oxford.universitypressscholarship.com/view/10.1093/oso/9780192844507.001.0001/oso-9780192844507?rskey=nzm83v&amp;result=113">
    <title>Stochastic Limit Theory: An Introduction for Econometricians - Oxford Scholarship</title>
    <dc:date>2022-01-12T02:14:25+00:00</dc:date>
    <link>https://oxford.universitypressscholarship.com/view/10.1093/oso/9780192844507.001.0001/oso-9780192844507?rskey=nzm83v&amp;result=113</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["This book aims to introduce modern asymptotic theory to students and practitioners of econometrics. It falls broadly into two parts. The first provides a handbook and reference for the underlying mathematics (Part I, Chapters 1–6), statistical theory (Part II, Chapters 7–11), and stochastic process theory (Part III, Chapters 12–18). The second half provides a treatment of the main convergence theorems used in analysing the large sample behaviour of econometric estimators and tests. These are the law of large numbers (Part IV, Chapters 19–22), the central limit theorem (Part V, Chapters 23–26), and the functional central limit theorem (Part VI, Chapters 27–32). The focus in this treatment is on the nonparametric approach to time series properties, covering topics such as nonstationarity, mixing, martingales, and near‐epoch dependence. While the approach is not elementary, care is taken to keep the treatment self‐contained. Proofs are provided for almost all the results."

--- Revised, 2021 edition of what I've often seen cited as a standard reference, but never read.]]></description>
<dc:subject>to:NB books:noted stochastic_processes convergence_of_stochastic_processes asymptotics ergodic_theory martingales mixing to_download</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:51efb0da9d46/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:books:noted"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:convergence_of_stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:asymptotics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:martingales"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_download"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2108.00997">
    <title>[2108.00997] Generalization bounds for nonparametric regression with $β-$mixing samples</title>
    <dc:date>2021-08-11T18:56:55+00:00</dc:date>
    <link>https://arxiv.org/abs/2108.00997</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In this paper we present a series of results that permit to extend in a direct manner uniform deviation inequalities of the empirical process from the independent to the dependent case characterizing the additional error in terms of β−mixing coefficients associated to the training sample. We then apply these results to some previously obtained inequalities for independent samples associated to the deviation of the least-squared error in nonparametric regression to derive corresponding generalization bounds for regression schemes in which the training sample may not be independent.
"These results provide a framework to analyze the error associated to regression schemes whose training sample comes from a large class of β−mixing sequences, including geometrically ergodic Markov samples, using only the independent case. More generally, they permit a meaningful extension of the Vapnik-Chervonenkis and similar theories for independent training samples to this class of β−mixing samples."

--- From the abstract, I don't understand how this differs from what Yu, Vidyasagar &c. did back in the early 1990s, so there has to be more.]]></description>
<dc:subject>in_NB to_read learning_theory ergodic_theory mixing statistics learning_under_dependence</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:5d2f8d41532e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_under_dependence"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2106.13947">
    <title>[2106.13947] Optimal prediction of Markov chains with and without spectral gap</title>
    <dc:date>2021-06-30T02:57:36+00:00</dc:date>
    <link>https://arxiv.org/abs/2106.13947</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We study the following learning problem with dependent data: Observing a trajectory of length n from a stationary Markov chain with k states, the goal is to predict the next state. For 3≤k≤O(n‾√), using techniques from universal compression, the optimal prediction risk in Kullback-Leibler divergence is shown to be Θ(k2nlognk2), in contrast to the optimal rate of Θ(loglognn) for k=2 previously shown in Falahatgar et al., 2016. These rates, slower than the parametric rate of O(k2n), can be attributed to the memory in the data, as the spectral gap of the Markov chain can be arbitrarily small. To quantify the memory effect, we study irreducible reversible chains with a prescribed spectral gap. In addition to characterizing the optimal prediction risk for two states, we show that, as long as the spectral gap is not excessively small, the prediction risk in the Markov model is O(k2n), which coincides with that of an iid model with the same number of parameters."]]></description>
<dc:subject>to:NB prediction time_series mixing markov_models statistics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:be4dfa48c5ee/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2011.00308">
    <title>[2011.00308] Mixing it up: A general framework for Markovian statistics</title>
    <dc:date>2021-06-25T14:55:04+00:00</dc:date>
    <link>https://arxiv.org/abs/2011.00308</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Up to now, the nonparametric analysis of multidimensional continuous-time Markov processes has focussed strongly on specific model choices, mostly related to symmetry of the semigroup. While this approach allows to study the performance of estimators for the characteristics of the process in the minimax sense, it restricts the applicability of results to a rather constrained set of stochastic processes and in particular hardly allows incorporating jump structures. As a consequence, for many models of applied and theoretical interest, no statement can be made about the robustness of typical statistical procedures beyond the beautiful, but limited framework available in the literature. To close this gap, we identify β-mixing of the process and heat kernel bounds on the transition density as a suitable combination to obtain sup-norm and L2 kernel invariant density estimation rates matching the case of reversible multidimenisonal diffusion processes and outperforming density estimation based on discrete i.i.d. or weakly dependent data. Moreover, we demonstrate how up to log-terms, optimal sup-norm adaptive invariant density estimation can be achieved within our general framework based on tight uniform moment bounds and deviation inequalities for empirical processes associated to additive functionals of Markov processes. The underlying assumptions are verifiable with classical tools from stability theory of continuous time Markov processes and PDE techniques, which opens the door to evaluate statistical performance for a vast amount of Markov models. We highlight this point by showing how multidimensional jump SDEs with Lévy driven jump part under different coefficient assumptions can be seamlessly integrated into our framework, thus establishing novel adaptive sup-norm estimation rates for this class of processes."]]></description>
<dc:subject>to:NB to_read markov_models minimax empirical_processes statistical_inference_for_stochastic_processes re:almost_none mixing statistics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:60fea291f30b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:minimax"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:empirical_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistical_inference_for_stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:almost_none"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2106.07054">
    <title>[2106.07054] Inferring the mixing properties of an ergodic process</title>
    <dc:date>2021-06-21T16:21:49+00:00</dc:date>
    <link>https://arxiv.org/abs/2106.07054</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We propose strongly consistent estimators of the ℓ1 norm of the sequence of α-mixing (respectively β-mixing) coefficients of a stationary ergodic process. We further provide strongly consistent estimators of individual α-mixing (respectively β-mixing) coefficients for a subclass of stationary α-mixing (respectively β-mixing) processes with summable sequences of mixing coefficients. The estimators are in turn used to develop strongly consistent goodness-of-fit hypothesis tests. In particular, we develop hypothesis tests to determine whether, under the same summability assumption, the α-mixing (respectively β-mixing) coefficients of a process are upper bounded by a given rate function. Moreover, given a sample generated by a (not necessarily mixing) stationary ergodic process, we provide a consistent test to discern the null hypothesis that the ℓ1 norm of the sequence α of α-mixing coefficients of the process is bounded by a given threshold γ∈[0,∞) from the alternative hypothesis that ‖α‖>γ. An analogous goodness-of-fit test is proposed for the ℓ1 norm of the sequence of β-mixing coefficients of a stationary ergodic process. Moreover, the procedure gives rise to an asymptotically consistent test for independence."

--- Well, at least they cite us (even if they say we're too vague to follow!).]]></description>
<dc:subject>to:NB to_read mixing dependence_measures lugosi.gabor statistics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:5ad1449205e5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:dependence_measures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:lugosi.gabor"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2104.12929">
    <title>[2104.12929] Central Limit Theorems for High Dimensional Dependent Data</title>
    <dc:date>2021-04-29T03:27:23+00:00</dc:date>
    <link>https://arxiv.org/abs/2104.12929</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Motivated by statistical inference problems in high-dimensional time series analysis, we derive non-asymptotic error bounds for Gaussian approximations of sums of high-dimensional dependent random vectors on hyper-rectangles, simple convex sets and sparsely convex sets. We investigate the quantitative effect of temporal dependence on the rates of convergence to normality over three different dependency frameworks (α-mixing, m-dependent, and physical dependence measure). In particular, we establish new error bounds under the α-mixing framework and derive faster rate over existing results under the physical dependence measure. To implement the proposed results in practical statistical inference problems, we also derive a data-driven parametric bootstrap procedure based on a kernel-type estimator for the long-run covariance matrices."]]></description>
<dc:subject>to:NB central_limit_theorem mixing stochastic_processes</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:1888293e2873/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:central_limit_theorem"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2007.10874">
    <title>[2007.10874] Central limit theorems for stationary random fields under weak dependence with application to ambit and mixed moving average fields</title>
    <dc:date>2021-04-08T14:25:42+00:00</dc:date>
    <link>https://arxiv.org/abs/2007.10874</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We obtain central limit theorems for stationary random fields employing a novel measure of dependence called θ-lex weak dependence. We show that this dependence notion is more general than strong mixing, i.e., it applies to a broader class of models. Moreover, we discuss hereditary properties for θ-lex and η-weak dependence and illustrate the possible applications of the weak dependence notions to the study of the asymptotic properties of stationary random fields. Our general results apply to mixed moving average fields (MMAF in short) and ambit fields. We show general conditions such that MMAF and ambit fields, with the volatility field being an MMAF or a p-dependent random field, are weakly dependent. For all the models mentioned above, we give a complete characterization of their weak dependence coefficients and sufficient conditions to obtain the asymptotic normality of their sample moments. Finally, we give explicit computations of the weak dependence coefficients of MSTOU processes and analyze under which conditions the developed asymptotic theory applies to CARMA fields."]]></description>
<dc:subject>to:NB mixing dependence_measures random_fields central_limit_theorem stochastic_processes to_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:f6d72975cae5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:dependence_measures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:random_fields"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:central_limit_theorem"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://onlinelibrary.wiley.com/doi/abs/10.1111/jtsa.12583?campaign=wolacceptedarticle">
    <title>On some basic features of strictly stationary, reversible Markov chains - Bradley - - Journal of Time Series Analysis - Wiley Online Library</title>
    <dc:date>2021-01-10T19:43:19+00:00</dc:date>
    <link>https://onlinelibrary.wiley.com/doi/abs/10.1111/jtsa.12583?campaign=wolacceptedarticle</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["It has been well known for some time that for strictly stationary Markov chains that are “reversible", the special symmetry (with the distribution of the Markov chain as a whole being invariant under a reversal of the “direction of time") provides special extra features in the mathematical theory. This paper here is in part an exposition of some of the basic aspects of that special theory. The mathematical techniques employed in this review are relatively gentle, involving only some basic measure‐theoretic probability theory. To that special theory, a couple of new results are contributed here that are connected with the Rosenblatt strong mixing condition; and those new results in turn assist in bringing further clarity to the exposition of the theory."]]></description>
<dc:subject>to:NB stochastic_processes markov_models mixing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:34be5d457c2b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1909.11773">
    <title>[1909.11773] Rapid mixing of a Markov chain for an exponentially weighted aggregation estimator</title>
    <dc:date>2019-10-01T17:34:33+00:00</dc:date>
    <link>https://arxiv.org/abs/1909.11773</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["The Metropolis-Hastings method is often used to construct a Markov chain with a given π as its stationary distribution. The method works even if π is known only up to an intractable constant of proportionality. Polynomial time convergence results for such chains (rapid mixing) are hard to obtain for high dimensional probability models where the size of the state space potentially grows exponentially with the model dimension. In a Bayesian context, Yang, Wainwright, and Jordan (2016) (=YWJ) used the path method to prove rapid mixing for high dimensional linear models. This paper proposes a modification of the YWJ approach that simplifies the theoretical argument and improves the rate of convergence. The new approach is illustrated by an application to an exponentially weighted aggregation estimator."]]></description>
<dc:subject>to:NB markov_models monte_carlo mixing computational_statistics statistics pollard.david</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:6dad1ea4a033/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:monte_carlo"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:computational_statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:pollard.david"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://projecteuclid.org/euclid.bj/1569398764">
    <title>Merlevède , Peligrad , Utev : Functional CLT for martingale-like nonstationary dependent structures</title>
    <dc:date>2019-09-26T00:58:23+00:00</dc:date>
    <link>https://projecteuclid.org/euclid.bj/1569398764</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In this paper, we develop non-stationary martingale techniques for dependent data. We shall stress the non-stationary version of the projective Maxwell–Woodroofe condition, which will be essential for obtaining maximal inequalities and functional central limit theorem for the following examples: nonstationary ρρ-mixing sequences, functions of linear processes with non-stationary innovations, locally stationary processes, quenched version of the functional central limit theorem for a stationary sequence, evolutions in random media such as a process sampled by a shifted Markov chain."]]></description>
<dc:subject>to:NB central_limit_theorem mixing non-stationarity stochastic_processes</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:4365022dd63e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:central_limit_theorem"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:non-stationarity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://link.springer.com/article/10.1007/s11203-018-9194-8">
    <title>Testing nonstationary and absolutely regular nonlinear time series models | SpringerLink</title>
    <dc:date>2019-08-28T15:10:22+00:00</dc:date>
    <link>https://link.springer.com/article/10.1007/s11203-018-9194-8</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We study some general methods for testing the goodness-of-fit of a general nonstationary and absolutely regular nonlinear time series model. These testing methods are based on some marked empirical processes that we show to converge in distribution to a zero-mean Gaussian process with respect to the Skorohod topology. We investigate the behavior of this process under fixed alternatives and under a sequence of local alternatives. Our results are applied to testing a general class of nonlinear semiparametric time series models. A simulation experiment shows that the Cramér–von Mises test studied behaves well on the examples considered."]]></description>
<dc:subject>to:NB time_series goodness-of-fit mixing statistics empirical_processes</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:8b738190090b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:goodness-of-fit"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:empirical_processes"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1810.04496">
    <title>[1810.04496] On maxima of stationary fields</title>
    <dc:date>2019-08-20T14:52:31+00:00</dc:date>
    <link>https://arxiv.org/abs/1810.04496</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Let {Xn:n∈ℤd} be a weakly dependent stationary field with maxima MA:=sup{Xi:i∈A} for finite A⊂ℤd and Mn:=sup{Xi:1≤i≤n} for n∈ℕd. In a general setting we prove that P(M(n,n,…,n)≤vn)=exp(−ndP(X0>vn,MAn≤vn))+o(1), for some increasing sequence of sets An of size o(nd). For a class of fields satisfying a local mixing condition, including m-dependent ones, the theorem holds with a constant finite A replacing An. The above results lead to new formulas for the extremal index for random fields."]]></description>
<dc:subject>to:NB extreme_values random_fields stochastic_processes mixing re:almost_none</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:b48b11d4a911/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:extreme_values"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:random_fields"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:almost_none"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1908.00845">
    <title>[1908.00845] Iterations of dependent random maps and exogeneity in nonlinear dynamics</title>
    <dc:date>2019-08-05T14:13:32+00:00</dc:date>
    <link>https://arxiv.org/abs/1908.00845</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We discuss existence and uniqueness of stationary and ergodic nonlinear autoregressive processes when exogenous regressors are incorporated in the dynamic. To this end, we consider the convergence of the backward iterations of dependent random maps. In particular, we give a new result when the classical condition of contraction on average is replaced with a contraction in conditional expectation. Under some conditions, we also derive an explicit control of the functional dependence of Wu (2005) which guarantees a wide range of statistical applications. Our results are illustrated with CHARME models, GARCH processes, count time series, binary choice models and categorical time series for which we provide many extensions of existing results."]]></description>
<dc:subject>to:NB stochastic_processes ergodic_theory mixing time_series dynamical_systems statistics statistical_inference_for_stochastic_processes</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:47d385d293f6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:dynamical_systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistical_inference_for_stochastic_processes"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://global.oup.com/academic/product/functional-gaussian-approximation-for-dependent-structures-9780198826941?cc=us&amp;lang=en#">
    <title>Functional Gaussian Approximation for Dependent Structures - Florence Merlevede; Magda Peligrad; Sergey Utev - Oxford University Press</title>
    <dc:date>2019-05-24T23:55:52+00:00</dc:date>
    <link>https://global.oup.com/academic/product/functional-gaussian-approximation-for-dependent-structures-9780198826941?cc=us&amp;lang=en#</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Functional Gaussian Approximation for Dependent Structures develops and analyses mathematical models for phenomena that evolve in time and influence each another. It provides a better understanding of the structure and asymptotic behaviour of stochastic processes. 
"Two approaches are taken. Firstly, the authors present tools for dealing with the dependent structures used to obtain normal approximations. Secondly, they apply normal approximations to various examples. The main tools consist of inequalities for dependent sequences of random variables, leading to limit theorems, including the functional central limit theorem and functional moderate deviation principle. The results point out large classes of dependent random variables which satisfy invariance principles, making possible the statistical study of data coming from stochastic processes both with short and long memory.
"The dependence structures considered throughout the book include the traditional mixing structures, martingale-like structures, and weakly negatively dependent structures, which link the notion of mixing to the notions of association and negative dependence. Several applications are carefully selected to exhibit the importance of the theoretical results. They include random walks in random scenery and determinantal processes. In addition, due to their importance in analysing new data in economics, linear processes with dependent innovations will also be considered and analysed."]]></description>
<dc:subject>to:NB central_limit_theorem stochastic_processes convergence_of_stochastic_processes mixing ergodic_theory re:almost_none books:noted</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:a47e5db7c861/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:central_limit_theorem"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:convergence_of_stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:almost_none"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:books:noted"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1808.08811">
    <title>[1808.08811] Exponential inequalities for nonstationary Markov Chains</title>
    <dc:date>2018-09-19T14:24:12+00:00</dc:date>
    <link>https://arxiv.org/abs/1808.08811</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Exponential inequalities are main tools in machine learning theory. To prove exponential inequalities for non i.i.d random variables allows to extend many learning techniques to these variables. Indeed, much work has been done both on inequalities and learning theory for time series, in the past 15 years. However, for the non independent case, almost all the results concern stationary time series. This excludes many important applications: for example any series with a periodic behaviour is non-stationary. In this paper, we extend the basic tools of Dedecker and Fan (2015) to nonstationary Markov chains. As an application, we provide a Bernstein-type inequality, and we deduce risk bounds for the prediction of periodic autoregressive processes with an unknown period."]]></description>
<dc:subject>to:NB to_read markov_models mixing learning_theory to_teach:childs_garden_of_statistical_learning_theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:90d514e3a092/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_teach:childs_garden_of_statistical_learning_theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.springer.com/gp/book/9783662543221?wt_mc=Alerts.NBA.Sep-13">
    <title>Asymptotic Theory of Weakly Dependent Random Processes | Emmanuel Rio | Springer</title>
    <dc:date>2017-09-13T22:39:50+00:00</dc:date>
    <link>http://www.springer.com/gp/book/9783662543221?wt_mc=Alerts.NBA.Sep-13</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Presenting tools to aid understanding of asymptotic theory and weakly dependent processes, this book is devoted to inequalities and limit theorems for sequences of random variables that are strongly mixing in the sense of Rosenblatt, or absolutely regular.
"The first chapter introduces covariance inequalities under strong mixing or absolute regularity. These covariance inequalities are applied in Chapters 2, 3 and 4 to moment inequalities, rates of convergence in the strong law, and central limit theorems. Chapter 5 concerns coupling. In Chapter 6 new deviation inequalities and new moment inequalities for partial sums via the coupling lemmas of Chapter 5 are derived and applied to the bounded law of the iterated logarithm. Chapters 7 and 8 deal with the theory of empirical processes under weak dependence. Lastly, Chapter 9 describes links between ergodicity, return times and rates of mixing in the case of irreducible Markov chains. Each chapter ends with a set of exercises.
"The book is an updated and extended translation of the French edition entitled "Théorie asymptotique des processus aléatoires faiblement dépendants" (Springer, 2000). It will be useful for students and researchers in mathematical statistics, econometrics, probability theory and dynamical systems who are interested in weakly dependent processes."]]></description>
<dc:subject>books:noted stochastic_processes mixing ergodic_theory markov_models in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:6799ddedf364/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:books:noted"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.mitpressjournals.org/doi/abs/10.1162/NECO_a_00870">
    <title>Learning Theory Estimates with Observations from General Stationary Stochastic Processes | Neural Computation | MIT Press Journals</title>
    <dc:date>2016-11-23T18:21:15+00:00</dc:date>
    <link>http://www.mitpressjournals.org/doi/abs/10.1162/NECO_a_00870</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["This letter investigates the supervised learning problem with observations drawn from certain general stationary stochastic processes. Here by general, we mean that many stationary stochastic processes can be included. We show that when the stochastic processes satisfy a generalized Bernstein-type inequality, a unified treatment on analyzing the learning schemes with various mixing processes can be conducted and a sharp oracle inequality for generic regularized empirical risk minimization schemes can be established. The obtained oracle inequality is then applied to derive convergence rates for several learning schemes such as empirical risk minimization (ERM), least squares support vector machines (LS-SVMs) using given generic kernels, and SVMs using gaussian kernels for both least squares and quantile regression. It turns out that for independent and identically distributed (i.i.d.) processes, our learning rates for ERM recover the optimal rates. For non-i.i.d. processes, including geometrically -mixing Markov processes, geometrically -mixing processes with restricted decay, -mixing processes, and (time-reversed) geometrically -mixing processes, our learning rates for SVMs with gaussian kernels match, up to some arbitrarily small extra term in the exponent, the optimal rates. For the remaining cases, our rates are at least close to the optimal rates. As a by-product, the assumed generalized Bernstein-type inequality also provides an interpretation of the so-called effective number of observations for various mixing processes."]]></description>
<dc:subject>stochastic_processes learning_theory dependence_measures mixing ergodic_theory statistics re:XV_for_mixing re:your_favorite_dsge_sucks in_NB to_teach:childs_garden_of_statistical_learning_theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:5c929691bae6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:dependence_measures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:XV_for_mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:your_favorite_dsge_sucks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_teach:childs_garden_of_statistical_learning_theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1308.4117">
    <title>[1308.4117] Comparison Theorems for Gibbs Measures</title>
    <dc:date>2016-09-07T14:49:37+00:00</dc:date>
    <link>http://arxiv.org/abs/1308.4117</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["The Dobrushin comparison theorem is a powerful tool to bound the difference between the marginals of high-dimensional probability distributions in terms of their local specifications. Originally introduced to prove uniqueness and decay of correlations of Gibbs measures, it has been widely used in statistical mechanics as well as in the analysis of algorithms on random fields and interacting Markov chains. However, the classical comparison theorem requires validity of the Dobrushin uniqueness criterion, essentially restricting its applicability in most models to a small subset of the natural parameter space. In this paper we develop generalized Dobrushin comparison theorems in terms of influences between blocks of sites, in the spirit of Dobrushin-Shlosman and Weitz, that substantially extend the range of applicability of the classical comparison theorem. Our proofs are based on the analysis of an associated family of Markov chains. We develop in detail an application of our main results to the analysis of sequential Monte Carlo algorithms for filtering in high dimension."]]></description>
<dc:subject>statistical_mechanics stochastic_processes ergodic_theory mixing van_handel.ramon in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:11c81a1313cd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistical_mechanics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:van_handel.ramon"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://link.springer.com/article/10.1007/s11203-015-9120-2?wt_mc=alerts.TOCjournals">
    <title>Blockwise bootstrap of the estimated empirical process based on psi -weakly dependent observations - Springer</title>
    <dc:date>2016-03-14T18:13:05+00:00</dc:date>
    <link>http://link.springer.com/article/10.1007/s11203-015-9120-2?wt_mc=alerts.TOCjournals</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["The distributional convergence of the bootstrapped estimated empirical process is shown and bootstrap consistency in the sup-norm for test statistics based on that process. Bootstrapping the estimated empirical process has up to now been considered by assuming independence of the observations, where we give up this assumption now and allow the observations to be ψ-weakly dependent in the sense of Doukhan and Louhichi (Stoch Proc Appl 84:313–342, 1999). Due to the fact that no model assumptions on the original process are made, a nonparametric blockwise bootstrap procedure is used, which has previously been used in empirical process theory based on mixing observations. Here, we succeeded in proving that assuming l=o(n) and l→∞ as only conditions for the blocklength is sufficient to show convergence of the bootstrap process to the same limit as for the original process under H0, which is the weakest condition that has been imposed in that context up to now."]]></description>
<dc:subject>to:NB empirical_processes bootstrap mixing stochastic_processes statistical_inference_for_stochastic_processes</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:5a3cc34601d4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:empirical_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:bootstrap"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistical_inference_for_stochastic_processes"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1506.02903">
    <title>[1506.02903] Mixing Time Estimation in Reversible Markov Chains from a Single Sample Path</title>
    <dc:date>2015-07-14T09:40:58+00:00</dc:date>
    <link>http://arxiv.org/abs/1506.02903</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["This article provides the first procedure for computing a fully data-dependent interval that traps the mixing time tmix of a finite reversible ergodic Markov chain at a prescribed confidence level. The interval is computed from a single finite-length sample path from the Markov chain, and does not require the knowledge of any parameters of the chain. This stands in contrast to previous approaches, which either only provide point estimates, or require a reset mechanism, or additional prior knowledge. The width of the interval converges to zero at a n‾‾√ rate, where n is the length of the sample path. Upper and lower bounds are given on the number of samples required to achieve constant-factor multiplicative accuracy. The lower bounds indicate that, unless further restrictions are placed on the chain, no procedure can achieve this accuracy level before seeing each state at least Ω(tmix) times on the average. Finally, future directions of research are identified."]]></description>
<dc:subject>to:NB mixing markov_models statistical_inference_for_stochastic_processes monte_carlo kontorovich.aryeh kith_and_kin</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:e1dbbfcc18e8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistical_inference_for_stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:monte_carlo"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:kontorovich.aryeh"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:kith_and_kin"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://infostructuralist.wordpress.com/2014/05/03/information-flow-on-graphs/">
    <title>Information flow on graphs | The Information Structuralist</title>
    <dc:date>2015-05-20T16:00:24+00:00</dc:date>
    <link>https://infostructuralist.wordpress.com/2014/05/03/information-flow-on-graphs/</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA[That's a very nice sufficient condition for a cellular automaton to be mixing --- actually it'd work for any Markov random field on a graph...]]></description>
<dc:subject>information_theory cellular_automata stochastic_processes mixing random_fields markov_models to:blog</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:270fa18b9ed2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:information_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:cellular_automata"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:random_fields"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:blog"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://projecteuclid.org/euclid.bj/1402488943">
    <title>Dehling , Durieu , Tusche : Approximating class approach for empirical processes of dependent sequences indexed by functions</title>
    <dc:date>2015-01-24T14:13:31+00:00</dc:date>
    <link>http://projecteuclid.org/euclid.bj/1402488943</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We study weak convergence of empirical processes of dependent data (Xi)i≥0, indexed by classes of functions. Our results are especially suitable for data arising from dynamical systems and Markov chains, where the central limit theorem for partial sums of observables is commonly derived via the spectral gap technique. We are specifically interested in situations where the index class  is different from the class of functions f for which we have good properties of the observables (f(Xi))i≥0. We introduce a new bracketing number to measure the size of the index class  which fits this setting. Our results apply to the empirical process of data (Xi)i≥0 satisfying a multiple mixing condition. This includes dynamical systems and Markov chains, if the Perron–Frobenius operator or the Markov operator has a spectral gap, but also extends beyond this class, for example, to ergodic torus automorphisms."]]></description>
<dc:subject>empirical_processes approximation stochastic_processes markov_models dynamical_systems ergodic_theory mixing in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:b57eb1847383/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:empirical_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:approximation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:dynamical_systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1501.03059">
    <title>[1501.03059] A Bernstein-type Inequality for Some Mixing Processes and Dynamical Systems with an Application to Learning</title>
    <dc:date>2015-01-19T15:13:56+00:00</dc:date>
    <link>http://arxiv.org/abs/1501.03059</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We establish a Bernstein-type inequality for a class of stochastic processes that include the classical geometrically ϕ-mixing processes, Rio's generalization of these processes, as well as many time-discrete dynamical systems. Modulo a logarithmic factor and some constants, our Bernstein-type inequality coincides with the classical Bernstein inequality for i.i.d.~data. We further use this new Bernstein-type inequality to derive an oracle inequality for generic regularized empirical risk minimization algorithms and data generated by such processes. Applying this oracle inequality to support vector machines using the Gaussian kernels for both least squares and quantile regression, it turns out that the resulting learning rates match, up to some arbitrarily small extra term in the exponent, the optimal rates for i.i.d.~processes."]]></description>
<dc:subject>deviation_inequalities stochastic_processes mixing learning_theory statistics in_NB to_teach:childs_garden_of_statistical_learning_theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:4ffd5aaf0d45/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:deviation_inequalities"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_teach:childs_garden_of_statistical_learning_theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cims.nyu.edu/~vitaly/pub/fts.pdf">
    <title>Forecasting Nonstationary Time Series: From Theory to Algorithms</title>
    <dc:date>2014-12-17T18:09:44+00:00</dc:date>
    <link>http://www.cims.nyu.edu/~vitaly/pub/fts.pdf</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Generalization bounds for time series prediction and other non-i.i.d. learning sce- narios that can be found in the machine learning and statistics literature assume that observations come from a (strictly) stationary distribution. The first bounds for completely non-stationary setting were proved in [6]. In this work we present an extension of these results and derive novel algorithms for forecasting non- stationary time series. Our experimental results show that our algorithms sig- nificantly outperform standard autoregressive models commonly used in practice."

--- Assumes mixing but not stationary.]]></description>
<dc:subject>to:NB mixing learning_theory re:your_favorite_dsge_sucks re:XV_for_mixing time_series have_read to_teach:childs_garden_of_statistical_learning_theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:5aee25e7a5fb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:your_favorite_dsge_sucks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:XV_for_mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_teach:childs_garden_of_statistical_learning_theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.ma.utexas.edu/mp_arc/c/05/05-65.pdf">
    <title>Concentration Inequalities and Estimation of Conditional Probabilities</title>
    <dc:date>2014-06-14T14:08:29+00:00</dc:date>
    <link>https://www.ma.utexas.edu/mp_arc/c/05/05-65.pdf</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We prove concentration inequalities inspired from [DP] to obtain estimators of conditional probabilities for weak dependant se- quences. This generalize results from Csisza ́r ([Cs]). For Gibbs mea- sures and dynamical systems, these results lead to construct estimators of the potential function and also to test the nullity of the asymptotic variance of the system."]]></description>
<dc:subject>concentration_of_measure stochastic_processes re:AoS_project have_read mixing in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:4ae738278aa9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:AoS_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1405.0608">
    <title>[1405.0608] Approximate tensorization of entropy at high temperature</title>
    <dc:date>2014-05-09T20:53:01+00:00</dc:date>
    <link>http://arxiv.org/abs/1405.0608</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We show that for weakly dependent random variables the relative entropy functional satisfies an approximate version of the standard tensorization property which holds in the independent case. As a corollary one obtains a family of dimensionless logarithmic Sobolev inequalities. In the context of spin systems on a graph the weak dependence requirements resemble the well known Dobrushin uniqueness conditions. Our results can be considered as the discrete counterpart of a recent work of Katalin Marton."]]></description>
<dc:subject>stochastic_processes to_read entableted concentration_of_measure mixing in_NB via:mraginsky</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:52e3b1fab041/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:entableted"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:via:mraginsky"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1404.2802">
    <title>[1404.2802] Mixing and Concentration by Ricci Curvature</title>
    <dc:date>2014-04-20T18:33:15+00:00</dc:date>
    <link>http://arxiv.org/abs/1404.2802</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We generalise the coarse Ricci curvature method of Ollivier by considering the coarse Ricci curvature of multiple steps in the Markov chain. This implies new spectral bounds and concentration inequalities. We also extend this approach to the bounds for MCMC empirical averages obtained by Joulin and Ollivier. We prove a recursive lower bound on the coarse Ricci curvature of multiple steps in the Markov chain, making our method broadly applicable. Applications include the split-merge random walk on partitions, Glauber dynamics with random scan and systemic scan for statistical physical spin models, and random walk on a binary cube with a forbidden region."]]></description>
<dc:subject>to:NB mixing markov_models stochastic_processes</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:61d9b456af96/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1404.0645">
    <title>[1404.0645] Moment bounds and concentration inequalities for slowly mixing dynamical systems</title>
    <dc:date>2014-04-14T19:42:20+00:00</dc:date>
    <link>http://arxiv.org/abs/1404.0645</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We obtain optimal moment bounds for Birkhoff sums, and optimal concentration inequalities, for a large class of slowly mixing dynamical systems, including those that admit anomalous diffusion in the form of a stable law or a central limit theorem with nonstandard scaling (nlogn)1/2."]]></description>
<dc:subject>mixing concentration_of_measure dynamical_systems central_limit_theorem stochastic_processes in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:6437bba409a5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:dynamical_systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:central_limit_theorem"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1404.0295">
    <title>[1404.0295] Hitting time statistics for observations of dynamical systems</title>
    <dc:date>2014-04-14T19:41:47+00:00</dc:date>
    <link>http://arxiv.org/abs/1404.0295</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In this paper we study the distribution of hitting and return times for observations of dynamical systems. We apply this results to get an exponential law for the distribution of hitting and return times for rapidly mixing random dynamical systems. In particular, it allows us to obtain an exponential law for random toral automorphisms, random circle maps expanding in average and randomly perturbed dynamical systems."]]></description>
<dc:subject>to:NB mixing recurrence_times dynamical_systems stochastic_processes</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:21b41cb1cb4a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:recurrence_times"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:dynamical_systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/0707.0322">
    <title>[0707.0322] Consistency of support vector machines for forecasting the evolution of an unknown ergodic dynamical system from observations with unknown noise</title>
    <dc:date>2014-03-12T20:37:56+00:00</dc:date>
    <link>http://arxiv.org/abs/0707.0322</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We consider the problem of forecasting the next (observable) state of an unknown ergodic dynamical system from a noisy observation of the present state. Our main result shows, for example, that support vector machines (SVMs) using Gaussian RBF kernels can learn the best forecaster from a sequence of noisy observations if (a) the unknown observational noise process is bounded and has a summable α-mixing rate and (b) the unknown ergodic dynamical system is defined by a Lipschitz continuous function on some compact subset of ℝd and has a summable decay of correlations for Lipschitz continuous functions. In order to prove this result we first establish a general consistency result for SVMs and all stochastic processes that satisfy a mixing notion that is substantially weaker than α-mixing."]]></description>
<dc:subject>dynamical_systems mixing ergodic_theory nonparametrics statistics prediction support-vector_machines steinwart.ingo time_series statistical_inference_for_stochastic_processes re:your_favorite_dsge_sucks re:XV_for_mixing to_read in_NB entableted</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:a11e92b7fc51/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:dynamical_systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:nonparametrics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:support-vector_machines"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:steinwart.ingo"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistical_inference_for_stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:your_favorite_dsge_sucks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:XV_for_mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:entableted"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://projecteuclid.org/euclid.aop/1393251303">
    <title>Berkes , Liu , Wu : Komlós–Major–Tusnády approximation under dependence</title>
    <dc:date>2014-03-12T19:14:12+00:00</dc:date>
    <link>http://projecteuclid.org/euclid.aop/1393251303</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["The celebrated results of Komlós, Major and Tusnády [Z. Wahrsch. Verw. Gebiete 32 (1975) 111–131; Z. Wahrsch. Verw. Gebiete 34 (1976) 33–58] give optimal Wiener approximation for the partial sums of i.i.d. random variables and provide a powerful tool in probability and statistics. In this paper we extend KMT approximation for a large class of dependent stationary processes, solving a long standing open problem in probability theory. Under the framework of stationary causal processes and functional dependence measures of Wu [Proc. Natl. Acad. Sci. USA 102 (2005) 14150–14154], we show that, under natural moment conditions, the partial sum processes can be approximated by Wiener process with an optimal rate. Our dependence conditions are mild and easily verifiable. The results are applied to ergodic sums, as well as to nonlinear time series and Volterra processes, an important class of nonlinear processes."]]></description>
<dc:subject>to:NB mixing ergodic_theory convergence_of_stochastic_processes central_limit_theorem stochastic_processes re:almost_none</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:e3a22f3fd2d2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:convergence_of_stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:central_limit_theorem"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:almost_none"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://link.springer.com/article/10.1007/s10959-012-0450-3?wt_mc=alerts.TOCjournals">
    <title>An Empirical Process Central Limit Theorem for Multidimensional Dependent Data - Springer</title>
    <dc:date>2014-03-10T15:11:23+00:00</dc:date>
    <link>http://link.springer.com/article/10.1007/s10959-012-0450-3?wt_mc=alerts.TOCjournals</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Let (Un(t))t∈ℝd be the empirical process associated to an ℝ d -valued stationary process (X i ) i≥0. In the present paper, we introduce very general conditions for weak convergence of (Un(t))t∈ℝd , which only involve properties of processes (f(X i )) i≥0 for a restricted class of functions f∈ . Our results significantly improve those of Dehling et al. (Stoch. Proc. Appl. 119(10):3699–3718, 2009) and Dehling and Durieu (Stoch. Proc. Appl. 121(5):1076–1096, 2011) and provide new applications.
"The central interest in our approach is that it does not need the indicator functions which define the empirical process (Un(t))t∈ℝd to belong to the class   . This is particularly useful when dealing with data arising from dynamical systems or functionals of Markov chains. In the proofs we make use of a new application of a chaining argument and generalize ideas first introduced in Dehling et al. (Stoch. Proc. Appl. 119(10):3699–3718, 2009) and Dehling and Durieu (Stoch. Proc. Appl. 121(5):1076–1096, 2011).
"Finally we will show how our general conditions apply in the case of multiple mixing processes of polynomial decrease and causal functions of independent and identically distributed processes, which could not be treated by the preceding results in Dehling et al. (Stoch. Proc. Appl. 119(10):3699–3718, 2009) and Dehling and Durieu (Stoch. Proc. Appl. 121(5):1076–1096, 2011)."]]></description>
<dc:subject>empirical_processes stochastic_processes mixing re:almost_none in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:143a1f4e33e0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:empirical_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:almost_none"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1209.0633">
    <title>[1209.0633] Nonparametric regression on hidden phi-mixing variables: identifiability and consistency of a pseudo-likelihood based estimation procedure</title>
    <dc:date>2014-02-20T01:04:28+00:00</dc:date>
    <link>http://arxiv.org/abs/1209.0633</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["This paper outlines a new nonparametric estimation procedure for unobserved phi-mixing processes. It is assumed that the only information on the stationary hidden states (Xk) is given by the process (Yk), where Yk is a noisy observation of f(Xk). The paper introduces a maximum pseudo-likelihood procedure to estimate the function f and the distribution of the hidden states using blocks of observations of length b. The identifiability of the model is studied in the particular cases b=1 and b=2. The consistency of the estimators of f and of the distribution of the hidden states as the number of observations grows to infinity is established."]]></description>
<dc:subject>to:NB statistical_inference_for_stochastic_processes time_series filtering statistics mixing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:4a6c43d17081/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistical_inference_for_stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6675825">
    <title>IEEE Xplore - Recursive Nonparametric Estimation for Time Series</title>
    <dc:date>2014-01-28T01:20:56+00:00</dc:date>
    <link>http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6675825</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["This paper considers online kernel estimation for both short- and long-range dependent time series data. Utilizing the predictive dependence measure of Wu, we carefully study the asymptotic properties of recursive kernel density and regression estimators for a general class of stationary processes. In particular, we prove that the proposed estimators have the asymptotic normality and the corresponding central limit theorems are provided. In addition, we establish the sharp laws of the iterated logarithms that precisely characterize the asymptotic almost sure behavior of the proposed estimators."]]></description>
<dc:subject>to:NB nonparametrics statistical_inference_for_stochastic_processes statistics mixing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:99f7fbd379b7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:nonparametrics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistical_inference_for_stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1312.2128">
    <title>[1312.2128] On the rate of convergence in Wasserstein distance of the empirical measure</title>
    <dc:date>2013-12-11T15:54:58+00:00</dc:date>
    <link>http://arxiv.org/abs/1312.2128</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Let μN be the empirical measure associated to a N-sample of a given probability distribution μ on ℝd. We are interested in the rate of convergence of μN to μ, when measured in the Wasserstein distance of order p>0. We provide some satisfying non-asymptotic Lp-bounds and concentration inequalities, for any values of p>0 and d≥1. We extend also the non asymptotic Lp-bounds to stationary ρ-mixing sequences, Markov chains, and to some interacting particle systems."]]></description>
<dc:subject>probability stochastic_processes mixing deviation_inequalities markov_models in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:a7c197e4d1ae/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:probability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:deviation_inequalities"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1309.4859">
    <title>[1309.4859] Predictive PAC Learning and Process Decompositions</title>
    <dc:date>2013-09-20T12:59:20+00:00</dc:date>
    <link>http://arxiv.org/abs/1309.4859</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We informally call a stochastic process learnable if it admits a generalization error approaching zero in probability for any concept class with finite VC-dimension (IID processes are the simplest example). A mixture of learnable processes need not be learnable itself, and certainly its generalization error need not decay at the same rate. In this paper, we argue that it is natural in predictive PAC to condition not on the past observations but on the mixture component of the sample path. This definition not only matches what a realistic learner might demand, but also allows us to sidestep several otherwise grave problems in learning from dependent data. In particular, we give a novel PAC generalization bound for mixtures of learnable processes with a generalization error that is not worse than that of each mixture component. We also provide a characterization of mixtures of absolutely regular ($\beta$-mixing) processes, of independent probability-theoretic interest."]]></description>
<dc:subject>self-centered in_NB mixing ergodic_theory stochastic_processes learning_theory mixture_models prediction kontorovich.aryeh</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:761883d720df/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:self-centered"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixture_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:kontorovich.aryeh"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.jstor.org/discover/10.2307/2999460?uid=3739864&amp;uid=2129&amp;uid=2&amp;uid=70&amp;uid=4&amp;uid=3739256&amp;sid=21102630678603">
    <title>Bayesian Representations of Stochastic Processes Under Learning: de Finetti Revisited (Jackson, Kalai and Smorodinsky, Econometrica 67 (1999): 875--893)</title>
    <dc:date>2013-09-09T03:34:37+00:00</dc:date>
    <link>http://www.jstor.org/discover/10.2307/2999460?uid=3739864&amp;uid=2129&amp;uid=2&amp;uid=70&amp;uid=4&amp;uid=3739256&amp;sid=21102630678603</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["A probability distribution governing the evolution of a stochastic process has infinitely many Bayesian representations of the form <tex-math>$\mu =\int_{\Theta}\mu _{\theta }d\lambda (\theta)$</tex-math>. Among these, a natural representation is one whose components <tex-math>$(\mu _{\theta}\text{'}{\rm s})$</tex-math> are "learnable" (one can approximate μ <sub>θ</sub> by conditioning μ on observation of the process) and "sufficient for prediction" (<tex-math>$\mu _{\theta}\text{'}{\rm s}$</tex-math> predictions are not aided by conditioning on observation of the process). We show the existence and uniqueness of such a representation under a suitable asymptotic mixing condition on the process. This representation can be obtained by conditioning on the tail-field of the process, and any learnable representation that is sufficient for prediction is asymptotically like the tail-field representation. This result is related to the celebrated de Finetti theorem, but with exchangeability weakened to an asymptotic mixing condition, and with his conclusion of a decomposition into i.i.d. component distributions weakened to components that are learnable and sufficient for prediction."

- A bit astonishing there's no mention of de-Finetti-like theorems for partial exchangeability, or even of the ergodic decomposition.]]></description>
<dc:subject>stochastic_processes mixing learning_theory re:almost_none jackson.matthew_o. ergodic_theory re:pac-and-mar not_quite_scooped_exactly have_read in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:5645e3ec2909/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:almost_none"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:jackson.matthew_o."/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:pac-and-mar"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:not_quite_scooped_exactly"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.nowpublishers.com/articles/foundations-and-trends-in-stochastic-systems/STO-004">
    <title>now publishers – Long Range Dependence</title>
    <dc:date>2013-08-15T15:19:37+00:00</dc:date>
    <link>http://www.nowpublishers.com/articles/foundations-and-trends-in-stochastic-systems/STO-004</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["The notion of long range dependence is discussed from a variety of points of view, and a new approach is suggested. A number of related topics is also discussed, including connections with non-stationary processes, with ergodic theory, self-similar processes and fractionally differenced processes, heavy tails and light tails, limit theorems and large deviations."]]></description>
<dc:subject>to:NB long-range_dependence stochastic_processes ergodic_theory mixing to_read large_deviations</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:dfd6679f032a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:long-range_dependence"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:large_deviations"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1109.2694">
    <title>[1109.2694] Kernel density estimation for stationary random fields</title>
    <dc:date>2013-07-29T19:57:46+00:00</dc:date>
    <link>http://arxiv.org/abs/1109.2694</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In this paper, under natural and easily verifiable conditions, we prove the $\mathbb{L}^1$-convergence and the asymptotic normality of the Parzen-Rosenblatt density estimator for stationary random fields of the form $X_k = g(\varepsilon_{k-s}, s \in \Z^d)$, $k\in\Z^d$, where $(\varepsilon_i)_{i\in\Z^d}$ are i.i.d real random variables and $g$ is a measurable function defined on $\R^{\Z^d}$. Such kind of processes provides a general framework for stationary ergodic random fields. A Berry-Esseen's type central limit theorem is also given for the considered estimator."]]></description>
<dc:subject>to:NB density_estimation statistics random_fields mixing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:5d228c8d75c8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:density_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:random_fields"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1304.7960">
    <title>[1304.7960] A strictly stationary $beta$-mixing process satisfying the central limit theorem but not the weak invariance principle</title>
    <dc:date>2013-05-01T16:31:13+00:00</dc:date>
    <link>http://arxiv.org/abs/1304.7960</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In 1983, N. Herrndorf proved that for a $\phi$-mixing sequence satisfying the central limit theorem and $\phi(1)<1$, the weak invariance principle takes place. The question whether for strictly stationary sequences with finite second moments and a weaker type ($\alpha$, $\beta$, $\rho$) of mixing the central limit theorem implies the weak invariance principle remained open. "
We construct a strictly stationary $\beta$-mixing sequence with finite second moments for which the central limit theorem takes place but not the weak invariance principle.]]></description>
<dc:subject>to:NB mixing central_limit_theorem re:almost_none</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:4f6bd9420402/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:central_limit_theorem"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:almost_none"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1304.5113">
    <title>[1304.5113] A note on weak convergence of the sequential multivariate empirical process under strong mixing</title>
    <dc:date>2013-04-22T17:23:25+00:00</dc:date>
    <link>http://arxiv.org/abs/1304.5113</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["This article investigates weak convergence of the sequential $d$-dimensional empirical process under strong mixing. Weak convergence is established for mixing rates $\alpha_n = O(n^{-a})$, where $a>1$, which slightly improves upon existing results in the literature that are based on mixing rates depending on the dimension $d$."]]></description>
<dc:subject>to:NB mixing ergodic_theory empirical_processes stochastic_processes</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:c7b219da085f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:empirical_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1304.2621">
    <title>[1304.2621] Central limit theorems in linear dynamics</title>
    <dc:date>2013-04-10T21:29:11+00:00</dc:date>
    <link>http://arxiv.org/abs/1304.2621</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Given a bounded operator $T$ on a Banach space $X$, we study the existence of a probability measure $\mu$ on $X$ such that, for many functions $f:X\to\mathbb K$, the sequence $(f+\dots+f\circ T^{n-1})/\sqrt n$ converges in distribution to a Gaussian random variable."]]></description>
<dc:subject>to:NB mixing central_limit_theorem ergodic_theory stochastic_processes dynamical_systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:ee98841bea95/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:central_limit_theorem"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:dynamical_systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1303.6999">
    <title>[1303.6999] Exponential ergodicity for Markov processes with random switching</title>
    <dc:date>2013-03-29T17:10:00+00:00</dc:date>
    <link>http://arxiv.org/abs/1303.6999</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We study a Markov process with two components: the first component evolves according to one of finitely many underlying Markovian dynamics, with a choice of dynamics that changes at the jump times of the second component. The second component is discrete and its jump rates may depend on the position of the whole process. Under regularity assumptions on the jump rates and Wasserstein contraction conditions for the underlying dynamics, we provide a concrete criterion for the convergence to equilibrium in terms of Wasserstein distance. The proof is based on a coupling argument and a weak form of the Harris Theorem. In particular, we obtain exponential ergodicity in situations which do not verify any hypoellipticity assumption, but are not uniformly contracting either. We also obtain a bound in total variation distance under a suitable regularising assumption. Some examples are given to illustrate our result, including a class of piecewise deterministic Markov processes."]]></description>
<dc:subject>to:NB markov_models stochastic_processes ergodic_theory mixing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:e119a9841a75/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://dx.doi.org/10.1103/RevModPhys.61.981">
    <title>Rev. Mod. Phys. 61, 981 (1989): The dynamic origin of increasing entropy</title>
    <dc:date>2013-03-26T19:34:38+00:00</dc:date>
    <link>http://dx.doi.org/10.1103/RevModPhys.61.981</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Thermodynamic states are assumed to be characterized by densities. Recent ergodic-theory results on the evolution of densities are used to give a unified treatment of the origin of classical nonequilibrium thermodynamic behavior. Asymptotic periodicity is sufficient for the existence of at least one state of (metastable) thermodynamic equilibrium and for the evolution of the entropy to a relative maximum that depends on the way the system is prepared. Ergodicity is necessary and sufficient for a unique state of thermodynamic equilibrium to exist. Exactness, a property of chaotic semidynamical (irreversible) systems, is necessary and sufficient for the global evolution of the entropy to its unique maximum for all initial states. Since all of the laws of physics are formulated as (reversible) dynamical systems, it is unclear why entropy is observed to approach a maximum. Setting aside the possibility that all of the laws of physics are incorrectly formulated, it is demonstrated that either observation of a subset of the complete dynamics (trivial coarse graining) or interactions with an external heat bath (addition of noise) may induce exactness with a consequent evolution of entropy to a maximal state."

--- Basically a precis of his book _Time's Arrow_, and marked "have_read" on that basis.]]></description>
<dc:subject>have_read ergodic_theory mixing arrow_of_time statistical_mechanics non-equilibrium mackey.michael_c. in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:627b52250eb8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:arrow_of_time"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistical_mechanics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:non-equilibrium"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mackey.michael_c."/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1303.4537">
    <title>[1303.4537] A Sequential Empirical Central Limit Theorem for Multiple Mixing Processes with Application to B-Geometrically Ergodic Markov Chains</title>
    <dc:date>2013-03-20T01:56:30+00:00</dc:date>
    <link>http://arxiv.org/abs/1303.4537</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We investigate the convergence in distribution of sequential empirical processes of dependent data indexed by a class of functions F. Our technique is suitable for processes that satisfy a multiple mixing condition on a space of functions which differs from the class F. This situation occurs in the case of data arising from dynamical systems or Markov chains, for which the Perron--Frobenius or Markov operator, respectively, has a spectral gap on a restricted space. We provide applications to iterative Lipschitz models that contract on average."]]></description>
<dc:subject>to:NB stochastic_processes empirical_processes mixing ergodic_theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:6d870f677691/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:empirical_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://link.springer.com/chapter/10.1007%2F978-3-642-33305-7_10">
    <title>Central Limit Theorems for Weakly Dependent Random Fields - Springer</title>
    <dc:date>2013-02-12T01:43:44+00:00</dc:date>
    <link>http://link.springer.com/chapter/10.1007%2F978-3-642-33305-7_10</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["This chapter is a primer on the limit theorems for dependent random fields. First, dependence concepts such as mixing, association and their generalizations are introduced. Then, moment inequalities for sums of dependent random variables are stated which yield e.g. the asymptotic behaviour of the variance of these sums which is essential for the proof of limit theorems. Finally, central limit theorems for dependent random fields are given. Applications to excursion sets of random fields and Newman’s conjecture in the absence of finite susceptibility are discussed as well."]]></description>
<dc:subject>to:NB central_limit_theorem stochastic_processes mixing random_fields</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:d234ea141b38/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:central_limit_theorem"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:random_fields"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://link.springer.com/article/10.1007/s00440-011-0371-6">
    <title>Central limit theorem for triangular arrays of non-homogeneous Markov chains - Springer</title>
    <dc:date>2012-12-03T00:09:31+00:00</dc:date>
    <link>http://link.springer.com/article/10.1007/s00440-011-0371-6</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In this paper we obtain the central limit theorem for triangular arrays of non-homogeneous Markov chains under a condition imposed to the maximal coefficient of correlation. The proofs are based on martingale techniques and a sharp lower bound estimate for the variance of partial sums. The results complement an important central limit theorem of Dobrushin based on the contraction coefficient."]]></description>
<dc:subject>to:NB central_limit_theorem mixing markov_models stochastic_processes</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:269b080dba60/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:central_limit_theorem"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.springerlink.com/content/1v2n1v06776kp01u/">
    <title>Geometric ergodicity and the spectral gap of non-reversible Markov chains</title>
    <dc:date>2012-10-12T13:52:16+00:00</dc:date>
    <link>http://www.springerlink.com/content/1v2n1v06776kp01u/</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA[We argue that the spectral theory of non-reversible Markov chains may often be more effectively cast within the framework of the naturally associated weighted-L ∞ space LV , instead of the usual Hilbert space L 2 = L 2(π), where π is the invariant measure of the chain. This observation is, in part, based on the following results. A discrete-time Markov chain with values in a general state space is geometrically ergodic if and only if its transition kernel admits a spectral gap in LV . If the chain is reversible, the same equivalence holds with L 2 in place of LV . In the absence of reversibility it fails: There are (necessarily non-reversible, geometrically ergodic) chains that admit a spectral gap in LV but not in L 2. Moreover, if a chain admits a spectral gap in L 2, then for any hL2 there exists a Lyapunov function VhL1 such that V h dominates h and the chain admits a spectral gap in LVh . The relationship between the size of the spectral gap in LV or L 2, and the rate at which the chain converges to equilibrium is also briefly discussed.]]></description>
<dc:subject>markov_models stochastic_processes ergodic_theory mixing in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:10a41762541a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1208.1720">
    <title>[1208.1720] Mixing Coefficients Between Discrete and Real Random Variables: Computation and Properties</title>
    <dc:date>2012-09-04T02:42:20+00:00</dc:date>
    <link>http://arxiv.org/abs/1208.1720</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In this paper we study the problem of estimating the mixing coefficients between two random variables. Three different mixing coefficients are studied, namely alpha-mixing, beta-mixing and phi-mixing coefficients. The random variables can either assume values in a finite set or the set of real numbers. We derive upper and lower bounds for both the alpha-mixing and the phi-mixing coefficients. Moreover, in case the marginal distributions of the two random variables are uniform, an exact expression is given for the phi-mixing coefficient. This situation arises when empirically generated samples are binned using percentile binning. We also prove analogs of the data-processing inequality from information theory for each of the three kinds of mixing coefficients. Then we move on to real-valued random variables, and show that by using percentile binning and allowing the number of bins to increase more slowly than the number of samples, we can generate empirical estimates that are consistent, i.e., converge to the true values as the number of samples approaches infinity."]]></description>
<dc:subject>to:NB to_read mixing statistical_inference_for_stochastic_processes nonparametrics vidyasagar.mathukumalli</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:34584e82bf9b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistical_inference_for_stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:nonparametrics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:vidyasagar.mathukumalli"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.aoap/1344614202">
    <title>Tong , van Handel : Ergodicity and stability of the conditional distributions of nondegenerate Markov chains</title>
    <dc:date>2012-08-10T17:53:03+00:00</dc:date>
    <link>http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.aoap/1344614202</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We consider a bivariate stationary Markov chain (Xn,Yn)n≥0 in a Polish state space, where only the process (Yn)n≥0 is presumed to be observable. The goal of this paper is to investigate the ergodic theory and stability properties of the measure-valued process (Πn)n≥0, where Πn is the conditional distribution of Xn given Y0,…,Yn. We show that the ergodic and stability properties of (Πn)n≥0 are inherited from the ergodicity of the unobserved process (Xn)n≥0 provided that the Markov chain (Xn,Yn)n≥0 is nondegenerate, that is, its transition kernel is equivalent to the product of independent transition kernels. Our main results generalize, subsume and in some cases correct previous results on the ergodic theory of nonlinear filters."]]></description>
<dc:subject>to_read ergodic_theory mixing filtering markov_models stochastic_processes re:almost_none van_handel.ramon in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:884d46bd9925/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:almost_none"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:van_handel.ramon"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1204.0608">
    <title>[1204.0608] Mixing times in evolutionary game dynamics</title>
    <dc:date>2012-04-14T17:47:48+00:00</dc:date>
    <link>http://arxiv.org/abs/1204.0608</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Without mutation and migration, evolutionary dynamics ultimately leads to the extinction of all but one species. Such fixation processes are well understood and can be characterized analytically with methods from statistical physics. However, many biological arguments focus on stationary distributions in a mutation-selection equilibrium. Here, we address the equilibration time required to reach stationarity in the presence of mutation, this is known as the mixing time in the theory of Markov processes. We show that mixing times in evolutionary games have the opposite behaviour from fixation times when the intensity of selection increases: In coordination games with bistabilities, the fixation time decreases, but the mixing time increases. In coexistence games with metastable states, the fixation time increases, but the mixing time decreases. Our results are based on simulations and the WKB approximation of the master equation."]]></description>
<dc:subject>to:NB evolutionary_game_theory markov_models mixing re:do-institutions-evolve stochastic_processes metastability</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:43be49123f9d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:evolutionary_game_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:do-institutions-evolve"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:metastability"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://netfiles.uiuc.edu/meyn/www/spm_files/Papers_pdf/markovISIT05.pdf">
    <title>Relative Entropy and Exponential Deviation Bounds for General Markov Chains</title>
    <dc:date>2012-04-11T18:21:22+00:00</dc:date>
    <link>https://netfiles.uiuc.edu/meyn/www/spm_files/Papers_pdf/markovISIT05.pdf</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We develop explicit, general bounds for the prob- ability that the normalized partial sums of a function of a Markov chain on a general alphabet will exceed the steady-state mean of that function by a given amount. Our bounds combine simple information-theoretic ideas together with techniques from optimization and some fairly elementary tools from analysis. In one direction, we obtain a general bound for the important class of Doeblin chains; this bound is optimal, in the sense that in the special case of independent and identically distributed random variables it essentially reduces to the classical Hoeffding bound. In another direction, motivated by important problems in simulation, we develop a series of bounds in a form which is particularly suited to these problems, and which apply to the more general class of “geometrically ergodic” Markov chains."]]></description>
<dc:subject>markov_models stochastic_processes meyn.sean kontoyiannis.ioannis mixing information_theory have_read in_NB deviation_inequalities via:mraginsky</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:d1e83ba94bee/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:meyn.sean"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:kontoyiannis.ioannis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:information_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:deviation_inequalities"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:via:mraginsky"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.aihp/1334148205">
    <title>Ferré , Hervé , Ledoux : Limit theorems for stationary Markov processes with L2-spectral gap</title>
    <dc:date>2012-04-11T13:54:23+00:00</dc:date>
    <link>http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.aihp/1334148205</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Let  be a discrete or continuous-time Markov process with state space where  is an arbitrary measurable set. Its transition semigroup is assumed to be additive with respect to the second component, i.e.  is assumed to be a Markov additive process. In particular, this implies that the first component  is also a Markov process. Markov random walks or additive functionals of a Markov process are special instances of Markov additive processes. In this paper, the process  is shown to satisfy the following classical limit theorems:

(a) the central limit theorem,

(b) the local limit theorem,

(c) the one-dimensional Berry–Esseen theorem,

(d) the one-dimensional first-order Edgeworth expansion,

provided that we have  with the expected order α with respect to the independent case (up to some ε > 0 for (c) and (d)). For the statements (b) and (d), a Markov nonlattice condition is also assumed as in the independent case. All the results are derived under the assumption that the Markov process  has an invariant probability distribution π, is stationary and has the -spectral gap property (that is, (Xt)t∈ℕ is ρ-mixing in the discrete-time case). The case where  is non-stationary is briefly discussed. As an application, we derive a Berry–Esseen bound for the M-estimators associated with ρ-mixing Markov chains."]]></description>
<dc:subject>stochastic_processes markov_models ergodic_theory mixing statistical_inference_for_stochastic_processes in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:c621855f5656/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistical_inference_for_stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1203.5245">
    <title>[1203.5245] Qualitative robustness of statistical functionals under strong mixing</title>
    <dc:date>2012-03-26T00:44:51+00:00</dc:date>
    <link>http://arxiv.org/abs/1203.5245</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["A new concept of qualitative robustness for plug-in estimators based on identically distributed possibly {em dependent} observations is introduced, and it is shown that Hampel's theorem for general metrics $d$ still holds. Since Hampel's theorem assumes the UGC property w.r.t. $d$, i.e. convergence in probability of the empirical probability measure to the true marginal distribution w.r.t. $d$ uniformly in the class of all admissible laws on the sample path space, this property is shown for a large class of strongly mixing laws for three different metrics $d$. For real-valued observations the UGC property is established for both the Kolomogorov $phi$-metric and the L'evy $psi$-metric, and for observations in a general locally compact and second countable Hausdorff space the UGC property is established for a certain metric generating the $psi$-weak topology. The key is a new uniform weak LLN for strongly mixing random variables. The latter is of independent interest and relies on Rio's maximal inequality."]]></description>
<dc:subject>statistics mixing statistical_inference_for_stochastic_processes learning_theory in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:65a50e88573d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistical_inference_for_stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.numdam.org/item?id=AIHPB_1995__31_2_393_0">
    <title>Doukhan, Massart, Rio: Invariance principles for absolutely regular empirical processes</title>
    <dc:date>2012-02-24T05:15:01+00:00</dc:date>
    <link>http://www.numdam.org/item?id=AIHPB_1995__31_2_393_0</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>empirical_processes stochastic_processes mixing central_limit_theorem to_read re:your_favorite_dsge_sucks in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:227ed863c23e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:empirical_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:central_limit_theorem"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:your_favorite_dsge_sucks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1202.4283">
    <title>[1202.4283] Fast rates in learning with dependent observations</title>
    <dc:date>2012-02-21T03:42:32+00:00</dc:date>
    <link>http://arxiv.org/abs/1202.4283</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In this paper we tackle the problem of fast rates in time series forecasting from a statistical learning perspective. In a serie of papers (e.g. Meir 2000, Modha and Masry 1998, Alquier and Wintenberger 2012) it is shown that the main tools used in learning theory with iid observations can be extended to the prediction of time series. The main message of these papers is that, given a family of predictors, we are able to build a new predictor that predicts the series as well as the best predictor in the family, up to a remainder of order $1/sqrt{n}$. It is known that this rate cannot be improved in general. In this paper, we show that in the particular case of the least square loss, and under a strong assumption on the time series (phi-mixing) the remainder is actually of order $1/n$. Thus, the optimal rate for iid variables, see e.g. Tsybakov 2003, and individual sequences, see cite{lugosi} is, for the first time, achieved for uniformly mixing processes. We also show that our method is optimal for aggregating sparse linear combinations of predictors."

--- Assumes observations are in the interval [-B,B] and gets a bound which is O(B^3), and so useless for our purposes.]]></description>
<dc:subject>learning_theory mixing ergodic_theory re:your_favorite_dsge_sucks re:XV_for_mixing have_read in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:d4316c2a0b5b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:your_favorite_dsge_sucks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:XV_for_mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1201.4579">
    <title>[1201.4579] Limit theorems for stationary Markov processes with L2-spectral gap</title>
    <dc:date>2012-01-28T16:51:17+00:00</dc:date>
    <link>http://arxiv.org/abs/1201.4579</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Let $(X_t, Y_t)_{tin T}$ be a discrete or continuous-time Markov process with state space $X times R^d$ where $X$ is an arbitrary measurable set. Its transition semigroup is assumed to be additive with respect to the second component, i.e. $(X_t, Y_t)_{tin T}$ is assumed to be a Markov additive process. In particular, this implies that the first component $(X_t)_{tin T}$ is also a Markov process. Markov random walks or additive functionals of a Markov process are special instances of Markov additive processes. In this paper, the process $(Y_t)_{tin T}$ is shown to satisfy the following classical limit theorems: (a) the central limit theorem, (b) the local limit theorem, (c) the one-dimensional Berry-Esseen theorem, (d) the one-dimensional first-order Edgeworth expansion, provided that we have sup{tin(0,1]cap T : E{pi,0}[|Y_t| ^{alpha}] < 1 with the expected order with respect to the independent case (up to some $varepsilon > 0$ for (c) and (d)). For the statements (b) and (d), a Markov nonlattice condition is also assumed as in the independent case. All the results are derived under the assumption that the Markov process $(X_t)_{tin T}$ has an invariant probability distribution $pi$, is stationary and has the $L^2(pi)$-spectral gap property (that is, $(X_t)tin N}$ is $rho$-mixing in the discrete-time case). The case where $(X_t)_{tin T}$ is non-stationary is briefly discussed. As an application, we derive a Berry-Esseen bound for the M-estimators associated with $rho$-mixing Markov chains."]]></description>
<dc:subject>markov_models stochastic_processes central_limit_theorem mixing ergodic_theory in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:b63611506168/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:central_limit_theorem"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://archive.numdam.org/article/RSMUP_2003__110__97_0.pdf">
    <title>A Lemma and a Conjecture on the Cost of Rearrangements</title>
    <dc:date>2012-01-05T02:28:48+00:00</dc:date>
    <link>http://archive.numdam.org/article/RSMUP_2003__110__97_0.pdf</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>mathematics mixing via:slaniel in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:c7df1bf2fa64/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:via:slaniel"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.springerlink.com/content/c38664053l348582/">
    <title>A Bernstein type inequality and moderate deviations for weakly dependent sequences</title>
    <dc:date>2011-11-07T18:56:14+00:00</dc:date>
    <link>http://www.springerlink.com/content/c38664053l348582/</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In this paper we present a Bernstein-type tail inequality for the maximum of partial sums of a weakly dependent sequence of random variables that is not necessarily bounded. The class considered includes geometrically and subgeometrically strongly mixing sequences. The result is then used to derive asymptotic moderate deviation results. Applications are given for classes of Markov chains, iterated Lipschitz models and functions of linear processes with absolutely regular innovations."  Also: http://arxiv.org/abs/0902.0582]]></description>
<dc:subject>to_read re:XV_for_mixing re:your_favorite_dsge_sucks concentration_of_measure mixing ergodic_theory stochastic_processes moderate_deviations in_NB deviation_inequalities</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:23f7c782d807/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:XV_for_mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:your_favorite_dsge_sucks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:moderate_deviations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:deviation_inequalities"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/math/0305026">
    <title>[math/0305026] Chains with complete connections: General theory, uniqueness, loss of memory and mixing properties</title>
    <dc:date>2011-10-28T21:26:55+00:00</dc:date>
    <link>http://arxiv.org/abs/math/0305026</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA[Published version: J. Stat. Phys., 118 (2005): 555--588 (http://www.springerlink.com/content/l030820529171605/).  Changes seem minor.]]></description>
<dc:subject>in_NB chains_with_complete_connections re:AoS_project markov_models stochastic_processes re:almost_none mixing ergodic_theory have_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:8532b3f414ae/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:chains_with_complete_connections"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:AoS_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:almost_none"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1110.2529">
    <title>[1110.2529] The Generalization Ability of Online Algorithms for Dependent Data</title>
    <dc:date>2011-10-13T12:33:26+00:00</dc:date>
    <link>http://arxiv.org/abs/1110.2529</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We study the generalization performance of arbitrary online learning algorithms trained on samples coming from a dependent source of data. We show that the generalization error of any stable online algorithm concentrates around its regret--an easily computable statistic of the online performance of the algorithm--when the underlying ergodic process is $beta$- or $phi$-mixing. We show high probability error bounds assuming the loss function is convex, and we also establish sharp convergence rates and deviation bounds for strongly convex losses and several linear prediction problems such as linear and logistic regression, least-squares SVM, and boosting on dependent data. In addition, our results have straightforward applications to stochastic optimization with dependent data, and our analysis requires only martingale convergence arguments; we need not rely on more powerful statistical tools such as empirical process theory."]]></description>
<dc:subject>learning_theory individual_sequence_prediction ergodic_theory mixing re:growing_ensemble_project re:XV_for_mixing stability_of_learning concentration_of_measure have_read re:your_favorite_dsge_sucks in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:0891bd9c9846/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:XV_for_mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stability_of_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:your_favorite_dsge_sucks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1107.1794">
    <title>[1107.1794] Some Aspects of Modeling Dependence in Copula-based Markov chains</title>
    <dc:date>2011-07-12T15:53:12+00:00</dc:date>
    <link>http://arxiv.org/abs/1107.1794</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Dependence coefficients have been widely studied for Markov processes defined by a set of transition probabilities and an initial distribution. This work clarifies some aspects of the theory of dependence structure of Markov chains generated by copulas... relationship between the notions of geometric ergodicity and geometric {rho}-mixing ... for a large number of well known copulas, such as Clayton, Gumbel or Student, these notions are equivalent. Some of the results published in the last years appear to be redundant if one takes into account this fact. We apply this equivalence to show that any mixture of Clayton, Gumbel or Student copulas generate both geometrically ergodic and geometric {rho}-mixing stationary Markov chains, answering in this way an open question in the literature. We shall also point out that a sufficient condition for {rho}-mixing, used in the literature, actually implies Doeblin recurrence."
]]></description>
<dc:subject>markov_models copulas ergodic_theory mixing statistics in_NB</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:c748acf8a876/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:copulas"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>