<?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.nber.org/papers/w32754"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2206.05161"/>
	<rdf:li rdf:resource="https://www.tandfonline.com/doi/full/10.1080/01621459.2021.1974867"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2107.11253"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2107.04592"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2105.11490"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1610.00195"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2007.08974"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2008.11477"/>
	<rdf:li rdf:resource="https://projecteuclid.org/euclid.aos/1597370663"/>
	<rdf:li rdf:resource="https://doi.org/10.1111/sjos.12482"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1807.08351"/>
	<rdf:li rdf:resource="https://www.cambridge.org/us/academic/subjects/engineering/control-systems-and-optimization/stochastic-dynamics-filtering-and-optimization?format=HB"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1909.12890"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1909.11560"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1909.10287"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1909.05062"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1908.07204"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1908.07254"/>
	<rdf:li rdf:resource="https://onlinelibrary.wiley.com/doi/abs/10.1111/sjos.12408?af=R"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1903.08605"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1707.01660"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1810.06191"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1905.11436"/>
	<rdf:li rdf:resource="https://onlinelibrary.wiley.com/doi/10.1111/jtsa.12476"/>
	<rdf:li rdf:resource="http://projecteuclid.org/euclid.bj/1411134448"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1403.6585"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1403.6804"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1403.3707"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1402.0536"/>
	<rdf:li rdf:resource="http://projecteuclid.org/euclid.aos/1387313393"/>
	<rdf:li rdf:resource="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.bj/1386078601"/>
	<rdf:li rdf:resource="http://www.pnas.org/content/110/31/12535.abstract"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1305.0320"/>
	<rdf:li rdf:resource="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.ejs/1364220670"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1204.1360"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1203.6898"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/math/0609514"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/0810.2123"/>
	<rdf:li rdf:resource="http://www.mitpressjournals.org/doi/abs/10.1162/neco.2008.10-06-351"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1202.2945"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1111.6801"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/0812.0350"/>
	<rdf:li rdf:resource="http://www.jstatsoft.org/v39/i02/"/>
	<rdf:li rdf:resource="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.ss/1280841735"/>
	<rdf:li rdf:resource="http://pubs.amstat.org/doi/abs/10.1198/jasa.2009.tm08326"/>
	<rdf:li rdf:resource="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.imsc/1207580091"/>
	<rdf:li rdf:resource="http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal&amp;id=PLEEE8000079000006066206000001&amp;idtype=cvips&amp;gifs=Yes"/>
	<rdf:li rdf:resource="http://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/19860003843_1986003843.pdf"/>
	<rdf:li rdf:resource="http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal&amp;id=PLEEE8000079000005056218000001&amp;idtype=cvips&amp;gifs=Yes&amp;type=ALERT"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/0905.2181"/>
	<rdf:li rdf:resource="http://www.springer.com/math/probability/book/978-0-387-76895-3"/>
	<rdf:li rdf:resource="http://lib.stat.cmu.edu/R/CRAN/web/packages/sspir/index.html"/>
	<rdf:li rdf:resource="http://www.ec-securehost.com/SIAM/OT107.html"/>
	<rdf:li rdf:resource="http://www.labyrinthbooks.com/sale_detail.aspx?isbn=9780262730099"/>
	<rdf:li rdf:resource="http://www.oup.com/us/catalog/general/subject/Mathematics/AppliedMathematics/?view=usa&amp;ci=9780199219704"/>
	<rdf:li rdf:resource="http://www.springerlink.com/content/hk05v4j61686wk27/"/>
	<rdf:li rdf:resource="http://compbiol.plosjournals.org/perlserv/?request=get-document&amp;doi=10.1371/journal.pcbi.0030204"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/0710.4245"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/0710.5098"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://www.nber.org/papers/w32754">
    <title>Filtering with Limited Information | NBER</title>
    <dc:date>2024-11-06T19:54:03+00:00</dc:date>
    <link>https://www.nber.org/papers/w32754</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We propose a new tool to filter non-linear dynamic models that does not require the researcher to specify the model fully and can be implemented without solving the model. If two conditions are satisfied, we can use a flexible statistical model and a known measurement equation to back out the hidden states of the dynamic model. The first condition is that the state is sufficiently volatile or persistent to be recoverable. The second condition requires the possibly non-linear measurement to be sufficiently smooth and to map uniquely to the state absent measurement error. We illustrate the method through various simulation studies and an empirical application to a sudden stops model applied to Mexican data."]]></description>
<dc:subject>filtering state_estimation to_read in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:39bd0cd07ac2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<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:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2206.05161">
    <title>[2206.05161] Approximating optimal SMC proposal distributions in individual-based epidemic models</title>
    <dc:date>2022-06-13T17:33:22+00:00</dc:date>
    <link>https://arxiv.org/abs/2206.05161</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Many epidemic models are naturally defined as individual-based models: where we track the state of each individual within a susceptible population. Inference for individual-based models is challenging due to the high-dimensional state-space of such models, which increases exponentially with population size. We consider sequential Monte Carlo algorithms for inference for individual-based epidemic models where we make direct observations of the state of a sample of individuals. Standard implementations, such as the bootstrap filter or the auxiliary particle filter are inefficient due to mismatch between the proposal distribution of the state and future observations. We develop new efficient proposal distributions that take account of future observations, leveraging the properties that (i) we can analytically calculate the optimal proposal distribution for a single individual given future observations and the future infection rate of that individual; and (ii) the dynamics of individuals are independent if we condition on their infection rates. Thus we construct estimates of the future infection rate for each individual, and then use an independent proposal for the state of each individual given this estimate. Empirical results show order of magnitude improvement in efficiency of the sequential Monte Carlo sampler for both SIS and SEIR models."

--- On the one hand, individuals in an epidemic model are only independent given the infection rates if the population is well-mixed.  OTOH, maybe if we only observe a random sample of nodes in a network, the dependences will be small?]]></description>
<dc:subject>to:NB agent-based_models particle_filters monte_carlo state_estimation epidemic_models</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:fd1820c45104/</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:agent-based_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:monte_carlo"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:epidemic_models"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.tandfonline.com/doi/full/10.1080/01621459.2021.1974867">
    <title>Bagged Filters for Partially Observed Interacting Systems: Journal of the American Statistical Association: Vol 0, No 0</title>
    <dc:date>2022-06-11T04:57:01+00:00</dc:date>
    <link>https://www.tandfonline.com/doi/full/10.1080/01621459.2021.1974867</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Bagging (i.e., bootstrap aggregating) involves combining an ensemble of bootstrap estimators. We consider bagging for inference from noisy or incomplete measurements on a collection of interacting stochastic dynamic systems. Each system is called a unit, and each unit is associated with a spatial location. A motivating example arises in epidemiology, where each unit is a city: the majority of transmission occurs within a city, with smaller yet epidemiologically important interactions arising from disease transmission between cities. Monte Carlo filtering methods used for inference on nonlinear non-Gaussian systems can suffer from a curse of dimensionality (COD) as the number of units increases. We introduce bagged filter (BF) methodology which combines an ensemble of Monte Carlo filters, using spatiotemporally localized weights to select successful filters at each unit and time. We obtain conditions under which likelihood evaluation using a BF algorithm can beat a COD, and we demonstrate applicability even when these conditions do not hold. BF can out-perform an ensemble Kalman filter on a coupled population dynamics model describing infectious disease transmission. A block particle filter (BPF) also performs well on this task, though the bagged filter respects smoothness and conservation laws that a BPF can violate. "]]></description>
<dc:subject>to:NB time_series state_estimation state-space_models particle_filters ensemble_methods ionides.edward</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:737c28aede3c/</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:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ensemble_methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ionides.edward"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2107.11253">
    <title>[2107.11253] State, global and local parameter estimation using local ensemble Kalman filters: applications to online machine learning of chaotic dynamics</title>
    <dc:date>2021-07-26T14:56:43+00:00</dc:date>
    <link>https://arxiv.org/abs/2107.11253</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Recent studies have shown that it is possible to combine machine learning methods with data assimilation to reconstruct a dynamical system using only sparse and noisy observations of that system. The same approach can be used to correct the error of a knowledge-based model. The resulting surrogate model is hybrid, with a statistical part supplementing a physical part. In practice, the correction can be added as an integrated term (\textit{i.e.} in the model resolvent) or directly inside the tendencies of the physical model. The resolvent correction is easy to implement. The tendency correction is more technical, in particular it requires the adjoint of the physical model, but also more flexible. We use the two-scale Lorenz model to compare the two methods. The accuracy in long-range forecast experiments is somewhat similar between the surrogate models using the resolvent correction and the tendency correction. By contrast, the surrogate models using the tendency correction significantly outperform the surrogate models using the resolvent correction in data assimilation experiments. Finally, we show that the tendency correction opens the possibility to make online model error correction, \textit{i.e.} improving the model progressively as new observations become available. The resulting algorithm can be seen as a new formulation of weak-constraint 4D-Var. We compare online and offline learning using the same framework with the two-scale Lorenz system, and show that with online learning, it is possible to extract all the information from sparse and noisy observations."]]></description>
<dc:subject>state-space_models state_estimation misspecification time_series to_read statistics in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:b8af6c2cb494/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:misspecification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<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>
<item rdf:about="https://arxiv.org/abs/2107.04592">
    <title>[2107.04592] Statistical Estimation and Nonlinear Filtering in Environmental Pollution</title>
    <dc:date>2021-07-12T15:33:37+00:00</dc:date>
    <link>https://arxiv.org/abs/2107.04592</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["This paper studies a nonlinear filtering problem over an infinite time interval. The signal to be estimated is driven by a stochastic partial differential equation involves unknown parameters. Based on discrete observation, strongly consistent estimators of the parameters are derived at first. With the optimal filter given by Bayes formula, the uniqueness of invariant measure for the signal-filter pair has been verified. The paper then establishes approximation to the optimal filter, showing that the pathwise average distance, per unit time, of the computed approximating filter from the optimal filter converges to zero in probability. Simulation results are presented at last."]]></description>
<dc:subject>to:NB state_estimation statistical_inference_for_stochastic_processes statistics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:fbdbd601df1f/</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:state_estimation"/>
	<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:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2105.11490">
    <title>[2105.11490] Hidden Markov and semi-Markov models: When and why are these models useful to classify states in time series data?</title>
    <dc:date>2021-05-26T18:30:10+00:00</dc:date>
    <link>https://arxiv.org/abs/2105.11490</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Hidden Markov models (HMMs) and their extensions have proven to be powerful tools for classification of observations that stem from systems with temporal dependence as they take into account that observations close in time to one another are likely generated from the same state (i.e. class). In this paper, we provide details for the implementation of four models for classification in a supervised learning context: HMMs, hidden semi-Markov models (HSMMs), autoregressive-HMMs and autoregressive-HSMMs. Using simulations, we study the classification performance under various degrees of model misspecification to characterize when it would be important to extend a basic HMM to an HSMM. As an application of these techniques we use the models to classify accelerometer data from Merino sheep to distinguish between four different behaviors of interest. In particular in the field of movement ecology, collection of fine-scale animal movement data over time to identify behavioral states has become ubiquitous, necessitating models that can account for the dependence structure in the data. We demonstrate that when the aim is to conduct classification, various degrees of model misspecification of the proposed model may not impede good classification performance unless there is high overlap between the state-dependent distributions."]]></description>
<dc:subject>to:NB state-space_models time_series classifiers state_estimation misspecification to_teach:data_over_space_and_time statistics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:14bc8be5c08a/</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:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:classifiers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:misspecification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_teach:data_over_space_and_time"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1610.00195">
    <title>[1610.00195] Penalized Ensemble Kalman Filters for High Dimensional Non-linear Systems</title>
    <dc:date>2021-03-17T21:14:06+00:00</dc:date>
    <link>https://arxiv.org/abs/1610.00195</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["The ensemble Kalman filter (EnKF) is a data assimilation technique that uses an ensemble of models, updated with data, to track the time evolution of a usually non-linear system. It does so by using an empirical approximation to the well-known Kalman filter. However, its performance can suffer when the ensemble size is smaller than the state space, as is often necessary for computationally burdensome models. This scenario means that the empirical estimate of the state covariance is not full rank and possibly quite noisy. To solve this problem in this high dimensional regime, we propose a computationally fast and easy to implement algorithm called the penalized ensemble Kalman filter (PEnKF). Under certain conditions, it can be theoretically proven that the PEnKF will be accurate (the estimation error will converge to zero) despite having fewer ensemble members than state dimensions. Further, as contrasted to localization methods, the proposed approach learns the covariance structure associated with the dynamical system. These theoretical results are supported with simulations of several non-linear and high dimensional systems."]]></description>
<dc:subject>filtering state_estimation statistics time_series hero.alfred_o. in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:a3d04f3073a8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:hero.alfred_o."/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2007.08974">
    <title>[2007.08974] Inference for partially observed epidemic dynamics guided by Kalman filtering techniques</title>
    <dc:date>2021-01-19T20:05:22+00:00</dc:date>
    <link>https://arxiv.org/abs/2007.08974</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Despite the recent development of methods dealing with partially observed epidemics (unobserved model coordinates, discrete and noisy outbreak data), some limitations remain in practice, mainly related to the amount of augmented data and the adjustment of numerous tuning parameters. In particular, coordinates of dynamic epidemic models being coupled, the presence of unobserved ones leads to a statistically difficult problem. Our aim is to propose a generic inference method easily practicable and able to tackle these issues. Using the properties of epidemics in large populations, we first build a two-layer model. Through a diffusion based approach, we obtain a Gaussian approximation of the epidemic density-dependent Markovian jump process, which represents the state model. The observational model consists in noisy observations of the observed coordinates and is approximated by Gaussian distributions. Then, we develop an inference method based on an approximate likelihood using Kalman filter recursions to estimate parameters of both state and observational models. Performances of estimators of key model parameters are assessed on simulated data of SIR epidemic dynamics for different scenarios with respect to the population size and the number of observations, and compared with those obtained by the currently largely used method of maximum iterated filtering (MIF). Finally, we apply our method on a real data set of influenza outbreak in a North England boarding school in 1978."]]></description>
<dc:subject>to:NB epidemic_models filtering state_estimation to_teach:data_over_space_and_time</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:bbe857c63d82/</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:epidemic_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_teach:data_over_space_and_time"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2008.11477">
    <title>[2008.11477] Bellman filtering for state-space models</title>
    <dc:date>2021-01-12T22:36:48+00:00</dc:date>
    <link>https://arxiv.org/abs/2008.11477</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["This article presents a filter for state-space models based on Bellman's dynamic programming principle applied to the mode estimator. The proposed Bellman filter (BF) generalises the Kalman filter (KF) including its extended and iterated versions, while remaining equally inexpensive computationally. The BF is also (unlike the KF) robust under heavy-tailed observation noise and applicable to a wider range of (nonlinear and non-Gaussian) models, involving e.g. count, intensity, duration, volatility and dependence. (Hyper)parameters are estimated by numerically maximising a BF-implied log-likelihood decomposition, which is an alternative to the classic prediction-error decomposition for linear Gaussian models. Simulation studies reveal that the BF performs on par with (or even outperforms) state-of-the-art importance-sampling techniques, while requiring a fraction of the computational cost, being straightforward to implement and offering full scalability to higher dimensional state spaces."]]></description>
<dc:subject>state_estimation filtering optimization state-space_models in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:eb0e619a36af/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://projecteuclid.org/euclid.aos/1597370663">
    <title>McGoff , Nobel : Empirical risk minimization and complexity of dynamical models</title>
    <dc:date>2020-11-19T04:45:26+00:00</dc:date>
    <link>https://projecteuclid.org/euclid.aos/1597370663</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["A dynamical model consists of a continuous self-map T:→T:X→X of a compact state space X and a continuous observation function f:→ℝf:X→R. This paper considers the fitting of a parametrized family of dynamical models to an observed real-valued stochastic process using empirical risk minimization. The limiting behavior of the minimum risk parameters is studied in a general setting. We establish a general convergence theorem for minimum risk estimators and ergodic observations. We then study conditions under which empirical risk minimization can effectively separate signal from noise in an additive observational noise model. The key condition in the latter results is that the family of dynamical models has limited complexity, which is quantified through a notion of entropy for families of infinite sequences that connects covering number based entropies with topological entropy studied in dynamical systems. We establish close connections between entropy and limiting average mean widths for stationary processes, and discuss several examples of dynamical models."]]></description>
<dc:subject>learning_theory dynamical_systems state_estimation nobel.andrew to_teach:childs_garden_of_statistical_learning_theory have_read in_NB learning_under_dependence</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:8d0c6a1757d4/</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:dynamical_systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:nobel.andrew"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_teach:childs_garden_of_statistical_learning_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:learning_under_dependence"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://doi.org/10.1111/sjos.12482">
    <title>Robust estimation for discrete‐time state space models - Aeberhard - - Scandinavian Journal of Statistics - Wiley Online Library</title>
    <dc:date>2020-11-15T20:53:35+00:00</dc:date>
    <link>https://doi.org/10.1111/sjos.12482</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["State space models (SSMs) are now ubiquitous in many fields and increasingly complicated with observed and unobserved variables often interacting in nonlinear fashions. The crucial task of validating model assumptions thus becomes difficult, particularly since some assumptions are formulated about unobserved states and thus cannot be checked with data. Motivated by the complex SSMs used for the assessment of fish stocks, we introduce a robust estimation method for SSMs. We prove the Fisher consistency of our estimator and propose an implementation based on automatic differentiation and the Laplace approximation of integrals which yields fast computations. Simulation studies demonstrate that our robust procedure performs well both with and without deviations from model assumptions. Applying it to the stock assessment model for pollock in the North Sea highlights the ability of our procedure to identify years with atypical observations."]]></description>
<dc:subject>to:NB state-space_models time_series statistics state_estimation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:206d62949f9e/</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:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1807.08351">
    <title>[1807.08351] Data Assimilation: The Schrödinger Perspective</title>
    <dc:date>2020-07-22T15:01:11+00:00</dc:date>
    <link>https://arxiv.org/abs/1807.08351</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Data assimilation addresses the general problem of how to combine model-based predictions with partial and noisy observations of the process in an optimal manner. This survey focuses on sequential data assimilation techniques using probabilistic particle-based algorithms. In addition to surveying recent developments for discrete- and continuous-time data assimilation, both in terms of mathematical foundations and algorithmic implementations, we also provide a unifying framework from the perspective of coupling of measures, and Schrödinger's boundary value problem for stochastic processes in particular."]]></description>
<dc:subject>state_estimation particle_filters time_series spatio-temporal_statistics to_read to_teach:data_over_space_and_time filtering in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:879ef3d9527d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:spatio-temporal_statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_teach:data_over_space_and_time"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.cambridge.org/us/academic/subjects/engineering/control-systems-and-optimization/stochastic-dynamics-filtering-and-optimization?format=HB">
    <title>Stochastic dynamics filtering and optimization | Control systems and optimization | Cambridge University Press</title>
    <dc:date>2020-01-09T17:57:40+00:00</dc:date>
    <link>https://www.cambridge.org/us/academic/subjects/engineering/control-systems-and-optimization/stochastic-dynamics-filtering-and-optimization?format=HB</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Targeted at graduate students, researchers and practitioners in the field of science and engineering, this book gives a self-contained introduction to a measure-theoretic framework in laying out the definitions and basic concepts of random variables and stochastic diffusion processes. It then continues to weave into a framework of several practical tools and applications involving stochastic dynamical systems. These include tools for the numerical integration of such dynamical systems, nonlinear stochastic filtering and generalized Bayesian update theories for solving inverse problems and a new stochastic search technique for treating a broad class of non-convex optimization problems. MATLAB® codes for all the applications are uploaded on the companion website."]]></description>
<dc:subject>books:noted optimization filtering state_estimation stochastic_processes state-space_models re:almost_none books:suggest_to_library in_NB downloaded</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:30fbcfbf0054/</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:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:almost_none"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:books:suggest_to_library"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:downloaded"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1909.12890">
    <title>[1909.12890] A Dual Characterization of Observability for Stochastic Systems</title>
    <dc:date>2019-10-01T16:22:10+00:00</dc:date>
    <link>https://arxiv.org/abs/1909.12890</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["This paper is concerned with a characterization of the observability for a continuous-time hidden Markov model where the state evolves as a general continuous-time Markov process and the observation process is modeled as nonlinear function of the state corrupted by the Gaussian measurement noise. The main technical tool is based on the recently discovered duality relationship between minimum variance estimation and stochastic optimal control: The observability is defined as a dual of the controllability for a certain backward stochastic differential equation (BSDE). For certain cases, a test for observability is described and comparisons provided with results reported in literature. The proposed duality-based framework allows one to easily relate and compare the linear and the nonlinear cases. A side-by-side summary of this relationship is described in a tabular form."]]></description>
<dc:subject>to:NB control_theory_and_control_engineering state_estimation state-space_models markov_models stochastic_differential_equations</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:bcedaf81dac4/</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:control_theory_and_control_engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_differential_equations"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1909.11560">
    <title>[1909.11560] Real time analysis of epidemic data</title>
    <dc:date>2019-09-26T18:10:31+00:00</dc:date>
    <link>https://arxiv.org/abs/1909.11560</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Infectious diseases have severe health and economic consequences for society. It is important in controlling the spread of an emerging infectious disease to be able to both estimate the parameters of the underlying model and identify those individuals most at risk of infection in a timely manner. This requires having a mechanism to update inference on the model parameters and the progression of the disease as new data becomes available. However, Markov chain Monte Carlo (MCMC), the gold standard for statistical inference for infectious disease models, is not equipped to deal with this important problem. Motivated by the need to develop effective statistical tools for emerging diseases and using the 2001 UK Foot-and-Mouth disease outbreak as an exemplar, we introduce a Sequential Monte Carlo (SMC) algorithm to enable real-time analysis of epidemic outbreaks. Naive application of SMC methods leads to significant particle degeneracy which are successfully overcome by particle perturbation and incorporating MCMC-within-SMC updates."]]></description>
<dc:subject>to:NB epidemic_models time_series state_estimation particle_filters statistics to_teach:data_over_space_and_time</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:3a39b5bfcdbe/</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:epidemic_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_teach:data_over_space_and_time"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1909.10287">
    <title>[1909.10287] Mean Field approach to stochastic control with partial information</title>
    <dc:date>2019-09-26T18:03:50+00:00</dc:date>
    <link>https://arxiv.org/abs/1909.10287</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["The classical stochastic control problem under partial information can be formulated as a control problem for Zakai equation, whose solution is the unnormalized conditional probability distribution of the state of the system, which is not directly accessible. Zakai equation is a stochastic Fokker-Planck equation. Therefore, the problem to be solved is similar to that met in Mean Field Control theory. Since Mean Field Control theory is much posterior to the development of Stochastic Control with partial information, the tools, techniques, and concepts obtained in the last decade, for Mean Field Games and Mean field type Control theory, have not been used for the control of Zakai equation. It is the objective of this work to connect the two theories. Not only, we get the power of new tools, but also we get new insights for the problem of stochastic control with partial information. For mean field theory, we get new interesting applications, but also new problems. Indeed, Mean Field Control Theory leads to very complex equations, like the Master equation, which is a nonlinear infinite dimensional P.D.E., for which general theorems are hardly available, although active research in this direction is performed. Direct methods are useful to obtain regularity results. We will develop in detail the linear quadratic regulator problem, but because we cannot just consider the Gaussian case, well-known results, as the separation principle is not available. An interesting and important result is available in the literature, due to A. Makowsky. It describes the solution of Zakai equation for linear systems with general initial condition (non-gaussian). Curiously, this result had not been exploited for the control aspect, in the literature. We show that the separation principle can be extended for quadratic pay-off functionals, but the Kalman filter is much more complex than in the gaussian case."]]></description>
<dc:subject>to:NB control_theory_and_control_engineering stochastic_processes filtering state_estimation state-space_models</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:88d010408e74/</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:control_theory_and_control_engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1909.05062">
    <title>[1909.05062] Logarithmic Regret for Online Control</title>
    <dc:date>2019-09-15T16:42:59+00:00</dc:date>
    <link>https://arxiv.org/abs/1909.05062</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We study optimal regret bounds for control in linear dynamical systems under adversarially changing strongly convex cost functions, given the knowledge of transition dynamics. This includes several well studied and fundamental frameworks such as the Kalman filter and the linear quadratic regulator. State of the art methods achieve regret which scales as O(T‾‾√), where T is the time horizon.
"We show that the optimal regret in this setting can be significantly smaller, scaling as O(poly(logT)). This regret bound is achieved by two different efficient iterative methods, online gradient descent and online natural gradient."]]></description>
<dc:subject>to:NB control_theory_and_control_engineering low-regret_learning state_estimation hazan.elad time_series statistics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:385bfe7d4518/</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:control_theory_and_control_engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:low-regret_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:hazan.elad"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1908.07204">
    <title>[1908.07204] Forecasting observables with particle filters: Any filter will do!</title>
    <dc:date>2019-08-21T13:15:34+00:00</dc:date>
    <link>https://arxiv.org/abs/1908.07204</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We investigate the impact of filter choice on forecast accuracy in state space models. The filters are used both to estimate the posterior distribution of the parameters, via a particle marginal Metropolis-Hastings (PMMH) algorithm, and to produce draws from the filtered distribution of the final state. Multiple filters are entertained, including two new data-driven methods. Simulation exercises are used to document the performance of each PMMH algorithm, in terms of computation time and the efficiency of the chain. We then produce the forecast distributions for the one-step-ahead value of the observed variable, using a fixed number of particles and Markov chain draws. Despite distinct differences in efficiency, the filters yield virtually identical forecasting accuracy, with this result holding under both correct and incorrect specification of the model. This invariance of forecast performance to the specification of the filter also characterizes an empirical analysis of S&P500 daily returns."]]></description>
<dc:subject>time_series particle_filters prediction state_estimation state-space_models to_teach:data_over_space_and_time statistics in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:6295f6655b43/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_teach:data_over_space_and_time"/>
	<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>
<item rdf:about="https://arxiv.org/abs/1908.07254">
    <title>[1908.07254] Online pseudo Marginal Sequential Monte Carlo smoother for general state spaces. Application to recursive maximum likelihood estimation of stochastic differential equations</title>
    <dc:date>2019-08-21T13:14:45+00:00</dc:date>
    <link>https://arxiv.org/abs/1908.07254</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["This paper focuses on the estimation of smoothing distributions in general state space models where the transition density of the hidden Markov chain or the conditional likelihood of the observations given the latent state cannot be evaluated pointwise. The consistency and asymptotic normality of a pseudo marginal online algorithm to estimate smoothed expectations of additive functionals when these quantities are replaced by unbiased estimators are established. A recursive maximum likelihood estimation procedure is also introduced by combining this online algorithm with an estimation of the gradient of the filtering distributions, also known as the tangent filters, when the model is driven by unknown parameters. The performance of this estimator is assessed in the case of a partially observed stochastic differential equation."]]></description>
<dc:subject>to:NB particle_filters monte_carlo state_estimation statistics time_series</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:40edb95bb342/</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:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:monte_carlo"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://onlinelibrary.wiley.com/doi/abs/10.1111/sjos.12408?af=R">
    <title>Parallelising Particle Filters with Butterfly Interactions - Heine - - Scandinavian Journal of Statistics - Wiley Online Library</title>
    <dc:date>2019-08-19T02:44:44+00:00</dc:date>
    <link>https://onlinelibrary.wiley.com/doi/abs/10.1111/sjos.12408?af=R</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Bootstrap particle filter (BPF) is the cornerstone of many algorithms used for solving generally intractable inference problems with Hidden Markov models. The long term stability of BPF arises from particle interactions that typically make parallel implementations of BPF nontrivial.
"We propose a method whereby the particle interaction is done in several stages. With the proposed method, full interaction can be accomplished even if we allow only pairwise communications between processing elements at each stage. We show that our method preserves the consistency and the long term stability of the BPF, although our analysis suggest that the constraints on the stagewise interactions introduce error leading to a lower convergence rate than standard Monte Carlo. The proposed method also suggests a new, more flexible, adaptive resampling scheme, which according to our numerical experiments is the method of choice, displaying a notable gain in efficiency in certain parallel computing scenarios."]]></description>
<dc:subject>to:NB computational_statistics particle_filters time_series state-space_models state_estimation re:fitness_sampling</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:cef9fdc64128/</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:computational_statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:fitness_sampling"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1903.08605">
    <title>[1903.08605] Iterated Extended Kalman Smoother-based Variable Splitting for $L_1$-Regularized State Estimation</title>
    <dc:date>2019-08-05T14:12:53+00:00</dc:date>
    <link>https://arxiv.org/abs/1903.08605</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In this paper, we propose a new framework for solving state estimation problems with an additional sparsity-promoting L1-regularizer term. We first formulate such problems as minimization of the sum of linear or nonlinear quadratic error terms and an extra regularizer, and then present novel algorithms which solve the linear and nonlinear cases. The methods are based on a combination of the iterated extended Kalman smoother and variable splitting techniques such as alternating direction method of multipliers (ADMM). We present a general algorithmic framework for variable splitting methods, where the iterative steps involving minimization of the nonlinear quadratic terms can be computed efficiently by iterated smoothing. Due to the use of state estimation algorithms, the proposed framework has a low per-iteration time complexity, which makes it suitable for solving a large-scale or high-dimensional state estimation problem. We also provide convergence results for the proposed algorithms. The experiments show the promising performance and speed-ups provided by the methods."]]></description>
<dc:subject>to:NB state_estimation high-dimensional_statistics optimization statistics time_series</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:70b161506732/</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:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:high-dimensional_statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1707.01660">
    <title>[1707.01660] Particle MCMC with Poisson Resampling: Parallelization and Continuous Time Models</title>
    <dc:date>2019-08-05T13:10:10+00:00</dc:date>
    <link>https://arxiv.org/abs/1707.01660</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We introduce a new version of particle filter in which the number of "children" of a particle at a given time has a Poisson distribution. As a result, the number of particles is random and varies with time. An advantage of this scheme is that descendants of different particles can evolve independently. It makes easy to parallelize computations. Moreover, particle filter with Poisson resampling is readily adapted to the case when a hidden process is a continuous time, piecewise deterministic semi-Markov process. We show that the basic techniques of particle MCMC, namely particle independent Metropolis-Hastings, particle Gibbs Sampler and its version with ancestor sampling, work under our Poisson resampling scheme. Our version of particle Gibbs Sampler is uniformly ergodic under the same assumptions as its standard counterpart. We present simulation results which indicate that our algorithms can compete with the existing methods."]]></description>
<dc:subject>to:NB particle_filters state_estimation monte_carlo re:fitness_sampling</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:36cfb42ee50d/</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:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:monte_carlo"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:fitness_sampling"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1810.06191">
    <title>[1810.06191] Inverse Problems and Data Assimilation</title>
    <dc:date>2019-07-04T10:19:29+00:00</dc:date>
    <link>https://arxiv.org/abs/1810.06191</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["These notes are designed with the aim of providing a clear and concise introduction to the subjects of Inverse Problems and Data Assimilation, and their inter-relations, together with citations to some relevant literature in this area. The first half of the notes is dedicated to studying the Bayesian framework for inverse problems. Techniques such as importance sampling and Markov Chain Monte Carlo (MCMC) methods are introduced; these methods have the desirable property that in the limit of an infinite number of samples they reproduce the full posterior distribution. Since it is often computationally intensive to implement these methods, especially in high dimensional problems, approximate techniques such as approximating the posterior by a Dirac or a Gaussian distribution are discussed. The second half of the notes cover data assimilation. This refers to a particular class of inverse problems in which the unknown parameter is the initial condition of a dynamical system, and in the stochastic dynamics case the subsequent states of the system, and the data comprises partial and noisy observations of that (possibly stochastic) dynamical system. We will also demonstrate that methods developed in data assimilation may be employed to study generic inverse problems, by introducing an artificial time to generate a sequence of probability measures interpolating from the prior to the posterior."]]></description>
<dc:subject>inverse_problems statistics state_estimation in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:2510f120c5ae/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:inverse_problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1905.11436">
    <title>[1905.11436] Kalman Filter, Sensor Fusion, and Constrained Regression: Equivalences and Insights</title>
    <dc:date>2019-05-29T20:26:31+00:00</dc:date>
    <link>https://arxiv.org/abs/1905.11436</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["The Kalman filter (KF) is one of the most widely used tools for data assimilation and sequential estimation. In this paper, we show that the state estimates from the KF in a standard linear dynamical system setting are exactly equivalent to those given by the KF in a transformed system, with infinite process noise (a "flat prior") and an augmented measurement space. This reformulation--which we refer to as augmented measurement sensor fusion (SF)--is conceptually interesting, because the transformed system here is seemingly static (as there is effectively no process model), but we can still capture the state dynamics inherent to the KF by folding the process model into the measurement space. Apart from being interesting, this reformulation of the KF turns out to be useful in problem settings in which past states are eventually observed (at some lag). In such problems, when we use the empirical covariance to estimate the measurement noise covariance, we show that the state predictions from augmented measurement SF are exactly equivalent to those from a regression of past states on past measurements, subject to particular linear constraints (reflecting the relationships encoded in the measurement map). This allows us to port standard ideas (say, regularization methods) in regression over to dynamical systems. For example, we can posit multiple candidate process models, fold all of them into the measurement model, transform to the regression perspective, and apply ℓ1 penalization to perform process model selection. We give various empirical demonstrations, and focus on an application to nowcasting the weekly incidence of influenza in the US."]]></description>
<dc:subject>state_estimation kalman_filter regression rosenfeld.roni tibshirani.ryan kith_and_kin statistics to_teach:data_over_space_and_time in_NB have_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:4db36e40b505/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:kalman_filter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:regression"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:rosenfeld.roni"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:tibshirani.ryan"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:kith_and_kin"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_teach:data_over_space_and_time"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://onlinelibrary.wiley.com/doi/10.1111/jtsa.12476">
    <title>Order Selection and Inference with Long Memory Dependent Data - Gupta - - Journal of Time Series Analysis - Wiley Online Library</title>
    <dc:date>2019-05-27T20:39:21+00:00</dc:date>
    <link>https://onlinelibrary.wiley.com/doi/10.1111/jtsa.12476</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In empirical studies selection of the order of a model is routinely invoked. A common example is the order selection of an autoregressive model via Akaike's AIC, Schwarz's BIC or Hannan and Quinn's HIC. The criteria are based on the conditional sum of squares (CSS). However, the computation of the CSS might be difficult for some models such as Bloomfield's exponential model and/or when we allow for long memory dependence. The main aim of the article is thus to propose an alternative way to compute the criterion by using the decomposition of the variance of the innovation errors in terms of its frequency components. We show its validity to obtain the correct order the model. In addition, as a by‐product, we describe a simple (two‐step) estimator of the parameters of the model."]]></description>
<dc:subject>to:NB model_selection time_series long-range_dependence state_estimation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:a208b2bf74a4/</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:model_selection"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:long-range_dependence"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://projecteuclid.org/euclid.bj/1411134448">
    <title>Crisan , Míguez : Particle-kernel estimation of the filter density in state-space models</title>
    <dc:date>2015-01-24T14:11:26+00:00</dc:date>
    <link>http://projecteuclid.org/euclid.bj/1411134448</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Sequential Monte Carlo (SMC) methods, also known as particle filters, are simulation-based recursive algorithms for the approximation of the a posteriori probability measures generated by state-space dynamical models. At any given time t, a SMC method produces a set of samples over the state space of the system of interest (often termed “particles”) that is used to build a discrete and random approximation of the posterior probability distribution of the state variables, conditional on a sequence of available observations. One potential application of the methodology is the estimation of the densities associated to the sequence of a posteriori distributions. While practitioners have rather freely applied such density approximations in the past, the issue has received less attention from a theoretical perspective. In this paper, we address the problem of constructing kernel-based estimates of the posterior probability density function and its derivatives, and obtain asymptotic convergence results for the estimation errors. In particular, we find convergence rates for the approximation errors that hold uniformly on the state space and guarantee that the error vanishes almost surely as the number of particles in the filter grows. Based on this uniform convergence result, we first show how to build continuous measures that converge almost surely (with known rate) toward the posterior measure and then address a few applications. The latter include maximum a posteriori estimation of the system state using the approximate derivatives of the posterior density and the approximation of functionals of it, for example, Shannon’s entropy."]]></description>
<dc:subject>particle_filters density_estimation filtering state_estimation state-space_models statistics computational_statistics in_NB kernel_smoothing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:77a953685926/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:density_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:computational_statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:kernel_smoothing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1403.6585">
    <title>[1403.6585] Moment Conditions for Convergence of Particle Filters with Unbounded Importance Weights</title>
    <dc:date>2014-04-03T18:37:51+00:00</dc:date>
    <link>http://arxiv.org/abs/1403.6585</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In this paper, we derive moment conditions for particle filter importance weights, which ensure the mean square and almost sure convergence of particle filter estimates even when the importance weights are unbounded. The result extends the previously derived conditions by not requiring the boundedness of weights, but only finite second or fourth order moments. We show that the boundedness of the second order moments of the weights implies the convergence of the estimates bounded functions in the mean square sense, and the L4 convergence as well as the almost sure convergence are assured by the boundedness of the fourth order moments of the weights. We also present an example class of models and importance distributions where the moment conditions hold, but the boundedness does not. The unboundedness in these models is caused by isolated singularities in the weights which still leave the weight moments bounded. We show by using simulated data that the particle filter for this kind of model also performs well in practice."]]></description>
<dc:subject>particle_filters statistics state_estimation re:fitness_sampling in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:49ffdced3d56/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:fitness_sampling"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1403.6804">
    <title>[1403.6804] A simple modification for improving inference of non-linear dynamical systems</title>
    <dc:date>2014-04-03T18:37:17+00:00</dc:date>
    <link>http://arxiv.org/abs/1403.6804</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Particle and ensemble filters are increasingly utilized for inference, optimization, and forecast; however, both filtering methods use discrete distributions to simulate continuous state space, a drawback that can lead to degraded performance for non-linear dynamical systems. Here we propose a simple modification, applicable to both particle and ensemble filters, that compensates for this problem. The method randomly replaces one or more model variables or parameters within a fraction of simulated trajectories at each filtering cycle. This modification, termed space re-probing, expands the state space covered by the filter through the introduction of outlying trajectories. We apply the space re-probing modification to three particle filters and three ensemble filters, and use these modified filters to model and forecast influenza epidemics. For both filter types, the space re-probing improves simulation of influenza epidemic curves and the prediction of influenza outbreak peak timing. Further, as fewer particles are needed for the particle filters, the proposed modification reduces the computational cost of these filters."]]></description>
<dc:subject>particle_filters state-space_models state_estimation statistical_inference_for_stochastic_processes statistics re:fitness_sampling in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:2aa48c6a16dd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<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:re:fitness_sampling"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1403.3707">
    <title>[1403.3707] Learning the Latent State Space of Time-Varying Graphs</title>
    <dc:date>2014-03-21T15:50:15+00:00</dc:date>
    <link>http://arxiv.org/abs/1403.3707</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["From social networks to Internet applications, a wide variety of electronic communication tools are producing streams of graph data; where the nodes represent users and the edges represent the contacts between them over time. This has led to an increased interest in mechanisms to model the dynamic structure of time-varying graphs. In this work, we develop a framework for learning the latent state space of a time-varying email graph. We show how the framework can be used to find subsequences that correspond to global real-time events in the Email graph (e.g. vacations, breaks, ...etc.). These events impact the underlying graph process to make its characteristics non-stationary. Within the framework, we compare two different representations of the temporal relationships; discrete vs. probabilistic. We use the two representations as inputs to a mixture model to learn the latent state transitions that correspond to important changes in the Email graph structure over time."]]></description>
<dc:subject>to:NB network_data_analysis inference_to_latent_objects state_estimation neville.jennifer statistics re:network_differences to_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:b85ec984d74b/</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:network_data_analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:inference_to_latent_objects"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:neville.jennifer"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:network_differences"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1402.0536">
    <title>[1402.0536] Predictive Modeling of Cholera Outbreaks in Bangladesh</title>
    <dc:date>2014-03-10T02:09:24+00:00</dc:date>
    <link>http://arxiv.org/abs/1402.0536</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Despite seasonal cholera outbreaks in Bangladesh, little is known about the relationship between environmental conditions and cholera cases. We seek to develop a predictive model for cholera outbreaks in Bangladesh based on environmental predictors. To do this, we estimate the contribution of environmental variables, such as water depth and water temperature, to cholera outbreaks in the context of a disease transmission model. We implement a method which simultaneously accounts for disease dynamics and environmental variables in a Susceptible-Infected-Recovered-Susceptible (SIRS) model. The entire system is treated as a continuous-time hidden Markov model, where the hidden Markov states are the numbers of people who are susceptible, infected, or recovered at each time point, and the observed states are the numbers of cholera cases reported. We use a Bayesian framework to fit this hidden SIRS model, implementing particle Markov chain Monte Carlo methods to sample from the posterior distribution of the environmental and transmission parameters given the observed data. We test this method using both simulated data and data from Mathbaria, Bangladesh. Parameter estimates are used to make short-term predictions that capture the formation and decline of epidemic peaks. We demonstrate that our model can successfully predict an increase in the number of infected individuals in the population weeks before the observed number of cholera cases increases, which could allow for early notification of an epidemic and timely allocation of resources."]]></description>
<dc:subject>epidemic_models cholera markov_models state_estimation particle_filters statistics in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:6bab9a9276e6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:epidemic_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:cholera"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<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>
<item rdf:about="http://projecteuclid.org/euclid.aos/1387313393">
    <title>Chan , Lai : A general theory of particle filters in hidden Markov models and some applications</title>
    <dc:date>2014-02-20T22:21:27+00:00</dc:date>
    <link>http://projecteuclid.org/euclid.aos/1387313393</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["By making use of martingale representations, we derive the asymptotic normality of particle filters in hidden Markov models and a relatively simple formula for their asymptotic variances. Although repeated resamplings result in complicated dependence among the sample paths, the asymptotic variance formula and martingale representations lead to consistent estimates of the standard errors of the particle filter estimates of the hidden states."]]></description>
<dc:subject>particle_filters filtering state_estimation martingales statistical_inference_for_stochastic_processes statistics state-space_models markov_models stochastic_processes in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:76bc97fcf610/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:martingales"/>
	<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:state-space_models"/>
	<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:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.bj/1386078601">
    <title>Dubarry , Le Corff : Non-asymptotic deviation inequalities for smoothed additive functionals in nonlinear state-space models</title>
    <dc:date>2013-12-03T15:56:43+00:00</dc:date>
    <link>http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.bj/1386078601</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["The approximation of fixed-interval smoothing distributions is a key issue in inference for general state-space hidden Markov models (HMM). This contribution establishes non-asymptotic bounds for the Forward Filtering Backward Smoothing (FFBS) and the Forward Filtering Backward Simulation (FFBSi) estimators of fixed-interval smoothing functionals. We show that the rate of convergence of the Lq-mean errors of both methods depends on the number of observations T and the number of particles N only through the ratio T/N for additive functionals. In the case of the FFBS, this improves recent results providing bounds depending on T/N‾‾√."]]></description>
<dc:subject>filtering state_estimation state-space_models markov_models stochastic_processes deviation_inequalities statistical_inference_for_stochastic_processes statistics in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:2c1ce9d96796/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<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:deviation_inequalities"/>
	<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:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.pnas.org/content/110/31/12535.abstract">
    <title>Empirical intrinsic geometry for nonlinear modeling and time series filtering</title>
    <dc:date>2013-09-03T12:26:55+00:00</dc:date>
    <link>http://www.pnas.org/content/110/31/12535.abstract</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In this paper, we present a method for time series analysis based on empirical intrinsic geometry (EIG). EIG enables one to reveal the low-dimensional parametric manifold as well as to infer the underlying dynamics of high-dimensional time series. By incorporating concepts of information geometry, this method extends existing geometric analysis tools to support stochastic settings and parametrizes the geometry of empirical distributions. However, the statistical models are not required as priors; hence, EIG may be applied to a wide range of real signals without existing definitive models. We show that the inferred model is noise-resilient and invariant under different observation and instrumental modalities. In addition, we show that it can be extended efficiently to newly acquired measurements in a sequential manner. These two advantages enable us to revisit the Bayesian approach and incorporate empirical dynamics and intrinsic geometry into a nonlinear filtering framework. We show applications to nonlinear and non-Gaussian tracking problems as well as to acoustic signal localization."

- Contributed papers in PNAS are however always somewhat dubious.]]></description>
<dc:subject>time_series prediction manifold_learning dimension_reduction statistics machine_learning to_read filtering state_estimation information_geometry entableted in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:5c5423af007e/</dc:identifier>
<taxo:topics><rdf:Bag>	<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:manifold_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:dimension_reduction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:machine_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:information_geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:entableted"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1305.0320">
    <title>[1305.0320] MCMC for non-linear state space models using ensembles of latent sequences</title>
    <dc:date>2013-05-03T18:35:37+00:00</dc:date>
    <link>http://arxiv.org/abs/1305.0320</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Non-linear state space models are a widely-used class of models for biological, economic, and physical processes. Fitting these models to observed data is a difficult inference problem that has no straightforward solution. We take a Bayesian approach to the inference of unknown parameters of a non-linear state model; this, in turn, requires the availability of efficient Markov Chain Monte Carlo (MCMC) sampling methods for the latent (hidden) variables and model parameters. Using the ensemble technique of Neal (2010) and the embedded HMM technique of Neal (2003), we introduce a new Markov Chain Monte Carlo method for non-linear state space models. The key idea is to perform parameter updates conditional on an enormously large ensemble of latent sequences, as opposed to a single sequence, as with existing methods. We look at the performance of this ensemble method when doing Bayesian inference in the Ricker model of population dynamics. We show that for this problem, the ensemble method is vastly more efficient than a simple Metropolis method, as well as 1.9 to 12.0 times more efficient than a single-sequence embedded HMM method, when all methods are tuned appropriately. We also introduce a way of speeding up the ensemble method by performing partial backward passes to discard poor proposals at low computational cost, resulting in a final efficiency gain of 3.4 to 20.4 times over the single-sequence method."]]></description>
<dc:subject>filtering state-space_models state_estimation estimation time_series markov_models monte_carlo statistics neal.radford in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:02250f392083/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<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:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:neal.radford"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.ejs/1364220670">
    <title>Le Corff , Fort : Online Expectation Maximization based algorithms for inference in Hidden Markov Models</title>
    <dc:date>2013-03-25T16:52:51+00:00</dc:date>
    <link>http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.ejs/1364220670</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["The Expectation Maximization (EM) algorithm is a versatile tool for model parameter estimation in latent data models. When processing large data sets or data stream however, EM becomes intractable since it requires the whole data set to be available at each iteration of the algorithm. In this contribution, a new generic online EM algorithm for model parameter inference in general Hidden Markov Model is proposed. This new algorithm updates the parameter estimate after a block of observations is processed (online). The convergence of this new algorithm is established, and the rate of convergence is studied showing the impact of the block-size sequence. An averaging procedure is also proposed to improve the rate of convergence. Finally, practical illustrations are presented to highlight the performance of these algorithms in comparison to other online maximum likelihood procedures."]]></description>
<dc:subject>to:NB time_series markov_models em_algorithm estimation filtering state_estimation state-space_models statistics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:4c3bb13a47a2/</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:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:em_algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1204.1360">
    <title>[1204.1360] Particle filtering in high-dimensional chaotic systems</title>
    <dc:date>2012-04-14T15:57:12+00:00</dc:date>
    <link>http://arxiv.org/abs/1204.1360</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We present an efficient particle filtering algorithm for multiscale systems, that is adapted for simple atmospheric dynamics models which are inherently chaotic. Particle filters represent the posterior conditional distribution of the state variables by a collection of particles, which evolves and adapts recursively as new information becomes available. The difference between the estimated state and the true state of the system constitutes the error in specifying or forecasting the state, which is amplified in chaotic systems that have a number of positive Lyapunov exponents. The purpose of the present paper is to show that the homogenization method developed in Imkeller et al. (2011), which is applicable to high dimensional multi-scale filtering problems, along with important sampling and control methods can be used as a basic and flexible tool for the construction of the proposal density inherent in particle filtering. Finally, we apply the general homogenized particle filtering algorithm developed here to the Lorenz'96 atmospheric model that mimics mid-latitude atmospheric dynamics with microscopic convective processes."]]></description>
<dc:subject>particle_filters chaos dynamical_systems state-space_models state_estimation re:stacs in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:8112c263a832/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:chaos"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:dynamical_systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:stacs"/>
	<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.6898">
    <title>[1203.6898] Long-term stability of sequential Monte Carlo methods under verifiable conditions</title>
    <dc:date>2012-04-02T14:28:07+00:00</dc:date>
    <link>http://arxiv.org/abs/1203.6898</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["This paper discusses particle filtering in general hidden Markov models (HMMs) and presents novel theoretical results on the long-term stability of bootstrap-type particle filters. More specifically, we establish that the asymptotic variance of the Monte Carlo estimates produced by the bootstrap filter is uniformly bounded in time. On the contrary to most previous results of this type, which in general presuppose that the state space of the hidden state process is compact (an assumption that is rarely satisfied in practice), our very mild assumptions are satisfied for a large class of HMMs with possibly non-compact state space. In addition, we derive a similar time uniform bound on the asymptotic Lp error. Importantly, our results hold for misspecified models, i.e. we do not at all assume that the data entering into the particle filter originate from the model governing the dynamics of the particles or not even from an HMM."]]></description>
<dc:subject>particle_filters stochastic_processes time_series state_estimation state-space_models markov_models statistics in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:3039c8400f4c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<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>
<item rdf:about="http://arxiv.org/abs/math/0609514">
    <title>[math/0609514] Sequential Monte Carlo smoothing with application to parameter estimation in non-linear state space models</title>
    <dc:date>2012-04-01T15:31:03+00:00</dc:date>
    <link>http://arxiv.org/abs/math/0609514</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["This paper concerns the use of sequential Monte Carlo methods (SMC) for smoothing in general state space models. A well-known problem when applying the standard SMC technique in the smoothing mode is that the resampling mechanism introduces degeneracy of the approximation in the path space. However, when performing maximum likelihood estimation via the EM algorithm, all functionals involved are of additive form for a large subclass of models. To cope with the problem in this case, a modification of the standard method (based on a technique proposed by Kitagawa and Sato) is suggested. Our algorithm relies on forgetting properties of the filtering dynamics and the quality of the estimates produced is investigated, both theoretically and via simulations."]]></description>
<dc:subject>statistics time_series state_estimation state-space_models particle_filters in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:c716d9ec6d1d/</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:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/0810.2123">
    <title>[0810.2123] Forgetting of the initial distribution for non-ergodic Hidden Markov Chains</title>
    <dc:date>2012-02-29T15:58:16+00:00</dc:date>
    <link>http://arxiv.org/abs/0810.2123</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In this paper, the forgetting of the initial distribution for a non-ergodic Hidden Markov Models (HMM) is studied. A new set of conditions is proposed to establish the forgetting property of the filter, which significantly extends all the existing results. Both a pathwise-type convergence of the total variation distance of the filter started from two different initial distributions, and a convergence in expectation are considered. The results are illustrated using generic models of non-ergodic HMM and extend all the results known so far."]]></description>
<dc:subject>to:NB filtering markov_models state_estimation stochastic_processes</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:f14e6fc44982/</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:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.mitpressjournals.org/doi/abs/10.1162/neco.2008.10-06-351">
    <title>Online Learning with Hidden Markov Models</title>
    <dc:date>2012-02-21T04:20:08+00:00</dc:date>
    <link>http://www.mitpressjournals.org/doi/abs/10.1162/neco.2008.10-06-351</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We present an online version of the expectation-maximization (EM) algorithm for hidden Markov models (HMMs). The sufficient statistics required for parameters estimation is computed recursively with time, that is, in an online way instead of using the batch forward-backward procedure. This computational scheme is generalized to the case where the model parameters can change with time by introducing a discount factor into the recurrence relations. The resulting algorithm is equivalent to the batch EM algorithm, for appropriate discount factor and scheduling of parameters update. On the other hand, the online algorithm is able to deal with dynamic environments, i.e., when the statistics of the observed data is changing with time. The implications of the online algorithm for probabilistic modeling in neuroscience are briefly discussed."]]></description>
<dc:subject>to:NB markov_models filtering state_estimation statistics em_algorithm</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:a8088c3cdd66/</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:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:em_algorithm"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1202.2945">
    <title>[1202.2945] Sequential Monte Carlo smoothing for general state space hidden Markov models</title>
    <dc:date>2012-02-15T13:25:25+00:00</dc:date>
    <link>http://arxiv.org/abs/1202.2945</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Computing smoothing distributions, the distributions of one or more states conditional on past, present, and future observations is a recurring problem when operating on general hidden Markov models. The aim of this paper is to provide a foundation of particle-based approximation of such distributions and to analyze, in a common unifying framework, different schemes producing such approximations. In this setting, general convergence results, including exponential deviation inequalities and central limit theorems, are established. In particular, time uniform bounds on the marginal smoothing error are obtained under appropriate mixing conditions on the transition kernel of the latent chain. In addition, we propose an algorithm approximating the joint smoothing distribution at a cost that grows only linearly with the number of particles."]]></description>
<dc:subject>filtering statistics state_estimation particle_filters state-space_models stochastic_processes ergodic_theory moulines.eric douc.randal in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:51cf2f5a4960/</dc:identifier>
<taxo:topics><rdf:Bag>	<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:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_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:moulines.eric"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:douc.randal"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1111.6801">
    <title>[1111.6801] The direct L2 geometric structure on a manifold of probability densities with applications to Filtering</title>
    <dc:date>2011-12-01T14:25:45+00:00</dc:date>
    <link>http://arxiv.org/abs/1111.6801</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In this paper we introduce a projection method for the space of probability distributions based on the differential geometric approach to statistics. This method is based on a direct L2 metric as opposed to the usual Hellinger distance and the related Fisher Information metric. We explain how this apparatus can be used for the nonlinear filtering problem, in relationship also to earlier projection methods based on the Fisher metric. Past projection filters focused on the Fisher metric and the exponential families that made the filter correction step exact. In this work we introduce the mixture projection filter, namely the projection filter based on the direct $L^2$ metric and based on a manifold given by a mixture of pre-assigned densities. The resulting prediction step in the filtering problem is described by a linear differential equation, while the correction step can be made exact."]]></description>
<dc:subject>filtering state_estimation information_geometry time_series in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:bb72e66ca622/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:information_geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/0812.0350">
    <title>[0812.0350] Uniform Time Average Consistency of Monte Carlo Particle Filters</title>
    <dc:date>2011-10-14T04:54:28+00:00</dc:date>
    <link>http://arxiv.org/abs/0812.0350</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We prove that bootstrap type Monte Carlo particle filters approximate the optimal nonlinear filter in a time average sense uniformly with respect to the time horizon when the signal is ergodic and the particle system satisfies a tightness property. The latter is satisfied without further assumptions when the signal state space is compact, as well as in the noncompact setting when the signal is geometrically ergodic and the observations satisfy additional regularity assumptions."]]></description>
<dc:subject>state_estimation particle_filters monte_carlo stochastic_processes van_handel.ramon in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:377145bca6e2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:monte_carlo"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<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://www.jstatsoft.org/v39/i02/">
    <title>Kalman Filtering in R</title>
    <dc:date>2011-03-06T00:02:28+00:00</dc:date>
    <link>http://www.jstatsoft.org/v39/i02/</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>to:NB kalman_filter time_series statistics R state_estimation state-space_models to_teach:data_over_space_and_time</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:209124d81e75/</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:kalman_filter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:R"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_teach:data_over_space_and_time"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.ss/1280841735">
    <title>Carvalho, Johannes, Lopes, Polson: Particle Learning and Smoothing</title>
    <dc:date>2010-08-05T21:35:20+00:00</dc:date>
    <link>http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.ss/1280841735</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Particle learning (PL) provides state filtering, sequential parameter learning and smoothing in a general class of state space models. Our approach extends existing particle methods by incorporating the estimation of static parameters via a fully-adapted filter that utilizes conditional sufficient statistics for parameters and/or states as particles. State smoothing in the presence of parameter uncertainty is also solved as a by-product of PL. In a number of examples, we show that PL outperforms existing particle filtering alternatives and proves to be a competitor to MCMC."
]]></description>
<dc:subject>particle_filters filtering state-space_models state_estimation estimation time_series statistics</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:d276dc573d58/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://pubs.amstat.org/doi/abs/10.1198/jasa.2009.tm08326">
    <title>Approximate Methods for State-Space Models - Journal of the American Statistical Association - 105(489):170</title>
    <dc:date>2010-03-31T16:58:37+00:00</dc:date>
    <link>http://pubs.amstat.org/doi/abs/10.1198/jasa.2009.tm08326</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA[Huzzah!
]]></description>
<dc:subject>self-centered markov_models state_estimation filtering laplace_approximation stochastic_processes statistical_inference_for_stochastic_processes time_series statistics</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:1d0aef660408/</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:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:laplace_approximation"/>
	<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:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.imsc/1207580091">
    <title>Bengtsson, Bickel, Li: Curse-of-dimensionality revisited: Collapse of the particle filter in very large scale systems</title>
    <dc:date>2009-12-31T17:43:32+00:00</dc:date>
    <link>http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.imsc/1207580091</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>filtering state_estimation particle_filters monte_carlo time_series statistics high-dimensional_statistics have_read in_NB re:fitness_sampling</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:26e6f5824bf4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:monte_carlo"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:high-dimensional_statistics"/>
	<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:re:fitness_sampling"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal&amp;id=PLEEE8000079000006066206000001&amp;idtype=cvips&amp;gifs=Yes">
    <title>Failures of sequential Bayesian filters and the successes of shadowing filters in tracking of nonlinear deterministic and stochastic systems</title>
    <dc:date>2009-07-04T19:48:47+00:00</dc:date>
    <link>http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal&amp;id=PLEEE8000079000006066206000001&amp;idtype=cvips&amp;gifs=Yes</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Sequential Bayesian filters, such as particle filters, are often presented as an ideal means of tracking the state of nonlinear systems. Here shadowing filters are demonstrated to perform better than sequential filters at tracking under specific circumstances. The success of shadowing filters is attributed to avoiding both well-known deficiencies of particle filters, and some newly identified problems."  Huh.
]]></description>
<dc:subject>particle_filters filtering state_estimation state-space_models time_series</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:b31f250173c5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/19860003843_1986003843.pdf">
    <title>Discovery of the Kalman Filter as a Practical Tool for Aerospace and Industry (McGee and Schmidt)</title>
    <dc:date>2009-06-12T23:22:59+00:00</dc:date>
    <link>http://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/19860003843_1986003843.pdf</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA[So, how _do_ you aim for the stars and/or make sure you hit London?
]]></description>
<dc:subject>filtering state_estimation kalman_filter extended_kalman_filter apollo_project nasa history_of_technology time_series simulation scientific_computing to:blog control_theory_and_control_engineering</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:91655a81405f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:kalman_filter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:extended_kalman_filter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:apollo_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:nasa"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:history_of_technology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:scientific_computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:blog"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:control_theory_and_control_engineering"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal&amp;id=PLEEE8000079000005056218000001&amp;idtype=cvips&amp;gifs=Yes&amp;type=ALERT">
    <title>Monte Carlo method for adaptively estimating the unknown parameters and the dynamic state of chaotic systems</title>
    <dc:date>2009-06-10T19:05:21+00:00</dc:date>
    <link>http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal&amp;id=PLEEE8000079000005056218000001&amp;idtype=cvips&amp;gifs=Yes&amp;type=ALERT</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA[Some variant of particle filtering with state augmentation?
]]></description>
<dc:subject>time_series statistics dynamical_systems particle_filters state_estimation</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:874344d59328/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:dynamical_systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/0905.2181">
    <title>[0905.2181] Non-Bayesian particle filters</title>
    <dc:date>2009-05-15T16:45:24+00:00</dc:date>
    <link>http://arxiv.org/abs/0905.2181</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>state_estimation particle_filters in_NB</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:39d3c3d6696d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.springer.com/math/probability/book/978-0-387-76895-3">
    <title>Fundamentals of Stochastic Filtering</title>
    <dc:date>2009-03-20T02:15:42+00:00</dc:date>
    <link>http://www.springer.com/math/probability/book/978-0-387-76895-3</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>books:noted filtering state_estimation stochastic_processes particle_filters books:owned</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:a7d625c0adec/</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:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:books:owned"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://lib.stat.cmu.edu/R/CRAN/web/packages/sspir/index.html">
    <title>CRAN - Package sspir</title>
    <dc:date>2009-02-11T19:41:05+00:00</dc:date>
    <link>http://lib.stat.cmu.edu/R/CRAN/web/packages/sspir/index.html</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA[State-space modeling with linear/Gaussian state evolution and generalized linear models for the observations.  Looks reasonable, lacks a few improvements like diffuse initial conditions in the Kalman filter.
]]></description>
<dc:subject>state-space_models time_series R filtering state_estimation to_teach</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:3542f4bd5585/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:R"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_teach"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.ec-securehost.com/SIAM/OT107.html">
    <title>Hidden Markov Models and Dynamical Systems - Andrew Fraser</title>
    <dc:date>2008-11-18T14:26:03+00:00</dc:date>
    <link>http://www.ec-securehost.com/SIAM/OT107.html</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA[Andy's book is appearing in print at last.  (SIAM seems to indicate it's available now, the usual online bookstores say not until the end of the year.)
]]></description>
<dc:subject>markov_models dynamical_systems books:recommended state_estimation filtering state-space_models statistical_inference_for_stochastic_processes via:guslacerda kith_and_kin to_teach:complexity-and-inference fraser.andrew</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:c2232e6a78e0/</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:dynamical_systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:books:recommended"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_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:via:guslacerda"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:kith_and_kin"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_teach:complexity-and-inference"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:fraser.andrew"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.labyrinthbooks.com/sale_detail.aspx?isbn=9780262730099">
    <title>Cybernetics: Or Control &amp; Communication in the Animal &amp; the Machine - Norbert Wiener [@Labyrinth]</title>
    <dc:date>2008-08-14T13:49:27+00:00</dc:date>
    <link>http://www.labyrinthbooks.com/sale_detail.aspx?isbn=9780262730099</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA[One of those books which shape how you think about everything.
]]></description>
<dc:subject>books:recommended cybernetics stochastic_processes time_series prediction feedback autonomous_agents autonomy statistical_mechanics state_estimation self-organization machine_learning artificial_life control communication homeostasis philosophy_of_science information_theory arrow_of_time teleology teleonomy freedom_as_self-control wiener.norbert</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:e2d8476aac6f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:books:recommended"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:cybernetics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<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:feedback"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:autonomous_agents"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:autonomy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistical_mechanics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:self-organization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:machine_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:artificial_life"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:control"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:communication"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:homeostasis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:philosophy_of_science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:information_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:arrow_of_time"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:teleology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:teleonomy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:freedom_as_self-control"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:wiener.norbert"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.oup.com/us/catalog/general/subject/Mathematics/AppliedMathematics/?view=usa&amp;ci=9780199219704">
    <title>An Introduction to Stochastic Filtering Theory: Jie Xiong</title>
    <dc:date>2008-05-14T11:30:23+00:00</dc:date>
    <link>http://www.oup.com/us/catalog/general/subject/Mathematics/AppliedMathematics/?view=usa&amp;ci=9780199219704</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>books:noted filtering state_estimation stochastic_processes martingales markov_models branching_processes particle_filters</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:521df7b36eee/</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:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:martingales"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:branching_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.springerlink.com/content/hk05v4j61686wk27/">
    <title>On error-free filtering of finite-state singular processes under dependent distortions - Prelov and van der Meulen</title>
    <dc:date>2008-02-25T19:29:35+00:00</dc:date>
    <link>http://www.springerlink.com/content/hk05v4j61686wk27/</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA[When can the state of one process be recovered without error from another?  (Use of infinite time limit here is not quite relevant to my immediate needs so must see how to modify proof.)
]]></description>
<dc:subject>filtering state_estimation information_theory re:AoS_project prelov.v._v. van_der_meulen.e._c.</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:4b89cf586502/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:information_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:AoS_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:prelov.v._v."/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:van_der_meulen.e._c."/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://compbiol.plosjournals.org/perlserv/?request=get-document&amp;doi=10.1371/journal.pcbi.0030204">
    <title>PLoS Computational Biology - From Inverse Problems in Mathematical Physiology to Quantitative Differential Diagnoses</title>
    <dc:date>2007-11-09T16:55:57+00:00</dc:date>
    <link>http://compbiol.plosjournals.org/perlserv/?request=get-document&amp;doi=10.1371/journal.pcbi.0030204</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>statistics inverse_problems automated_diagnosis state_estimation have_read computational_statistics heard_the_talk identifiability in_NB zenker.sven rubin.jonathan clermont.gilles</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:5816beb59a96/</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:inverse_problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:automated_diagnosis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:computational_statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:heard_the_talk"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:identifiability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:zenker.sven"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:rubin.jonathan"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:clermont.gilles"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/0710.4245">
    <title>[0710.4245] Particle Filters for Partially Observed Diffusions</title>
    <dc:date>2007-11-09T15:00:08+00:00</dc:date>
    <link>http://arxiv.org/abs/0710.4245</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>particle_filters filtering state-space_models state_estimation stochastic_processes statistics</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:a2b3cc7647ef/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state-space_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/0710.5098">
    <title>[0710.5098] Particle Filters for Multiscale Diffusions</title>
    <dc:date>2007-10-29T14:17:18+00:00</dc:date>
    <link>http://arxiv.org/abs/0710.5098</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>particle_filters nonlinear_filtering state_estimation sequential_monte_carlo separation_of_time-scales</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:9d00976a2fc7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:particle_filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:nonlinear_filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:state_estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:sequential_monte_carlo"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:separation_of_time-scales"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>