<?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 (mraginsky)</title>
    <link>https://pinboard.in/u:mraginsky/public/</link>
    <description>recent bookmarks from mraginsky</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://www.cell.com/neuron/fulltext/S0896-6273(25)00716-0?_returnURL=https%3A%2F%2Flinkinghub.elsevier.com%2Fretrieve%2Fpii%2FS0896627325007160%3Fshowall%3Dtrue"/>
	<rdf:li rdf:resource="https://www.sciencedirect.com/science/article/pii/000510987790022X"/>
	<rdf:li rdf:resource="https://structures.uni-heidelberg.de/blog/posts/2026_02/"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2512.24945"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2508.11990"/>
	<rdf:li rdf:resource="https://link.springer.com/article/10.1007/s10450-006-9683-8"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2509.19601"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2302.10488"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2501.02267"/>
	<rdf:li rdf:resource="https://link.springer.com/article/10.1007/BF01202856"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2412.07438"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1512.08055"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2305.17628"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2304.03519"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2404.18380"/>
	<rdf:li rdf:resource="https://link.springer.com/book/10.1007/BFb0036078"/>
	<rdf:li rdf:resource="https://www.pnas.org/doi/10.1073/pnas.2311893121"/>
	<rdf:li rdf:resource="https://onlinelibrary.wiley.com/doi/10.1111/ejn.16372"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2401.14029"/>
	<rdf:li rdf:resource="https://ieeexplore.ieee.org/abstract/document/9454440"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2312.12903"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2008.05166"/>
	<rdf:li rdf:resource="https://ieeexplore.ieee.org/document/7321405"/>
	<rdf:li rdf:resource="http://videolectures.net/cyberstat2012_granada/"/>
	<rdf:li rdf:resource="https://link.springer.com/chapter/10.1007/3-540-36589-3_17"/>
	<rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/0313010?mobileUi=0"/>
	<rdf:li rdf:resource="https://www.sciencedirect.com/science/article/abs/pii/S1389041709000163?casa_token=8dkZ1O1iNBcAAAAA:gnuocqU5jszqBuwnBv1BYYua466pUhmQXOokW-3DOCA_-v5GNHpSCvptgCXuxYcYizauW6_Qzt8"/>
	<rdf:li rdf:resource="https://link.springer.com/article/10.1007/s10485-019-09565-x"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1710.10258"/>
	<rdf:li rdf:resource="https://www.annualreviews.org/doi/full/10.1146/annurev-control-060117-104856"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1506.03409"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1511.06895"/>
	<rdf:li rdf:resource="https://eudml.org/doc/208885"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2202.00817"/>
	<rdf:li rdf:resource="https://royalsocietypublishing.org/doi/10.1098/rsif.2012.0869"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2205.09241"/>
	<rdf:li rdf:resource="https://www.jmlr.org/papers/v23/20-1165.html"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2101.12606"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2104.05278"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2006.10330"/>
	<rdf:li rdf:resource="https://www.pnas.org/content/116/21/10537"/>
	<rdf:li rdf:resource="https://www.pnas.org/content/70/10/2974"/>
	<rdf:li rdf:resource="https://www.frontiersin.org/articles/10.3389/fphys.2020.00200/full"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2007.06007"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2006.06462"/>
	<rdf:li rdf:resource="http://paths.lids.mit.edu/"/>
	<rdf:li rdf:resource="https://golem.ph.utexas.edu/category/2018/06/the_behavioral_approach_to_sys.html"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1910.13886"/>
	<rdf:li rdf:resource="http://www.statslab.cam.ac.uk/~rrw1/oc/"/>
	<rdf:li rdf:resource="https://homes.cs.washington.edu/~todorov/courses/amath579/"/>
	<rdf:li rdf:resource="https://ieeexplore.ieee.org/document/1333224/"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1806.05722"/>
	<rdf:li rdf:resource="http://www.mathnet.ru/php/archive.phtml?wshow=paper&amp;jrnid=at&amp;paperid=3712&amp;option_lang=rus"/>
	<rdf:li rdf:resource="https://www.youtube.com/playlist?list=PLYq7WW565SZhPcf5PxsuBUz2PtB7Kfb5X"/>
	<rdf:li rdf:resource="http://www.jmlr.org/papers/v10/white09a.html"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1703.01670"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1611.02635"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1607.06494"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1510.04214"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1405.6881"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1408.3595"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1311.5918"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1203.1429"/>
	<rdf:li rdf:resource="http://hrl.harvard.edu/publications/"/>
	<rdf:li rdf:resource="http://books.nips.cc/papers/files/nips25/bibhtml/NIPS2012_1237.html"/>
	<rdf:li rdf:resource="http://www.ams.sunysb.edu/~feinberg/"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1204.5721"/>
	<rdf:li rdf:resource="http://www.stanford.edu/~boyd/papers/pdf/adp_iter_bellman.pdf"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1203.4626"/>
	<rdf:li rdf:resource="http://ideas.repec.org/a/fip/fedgpr/y2005p17-38.html"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://www.cell.com/neuron/fulltext/S0896-6273(25)00716-0?_returnURL=https%3A%2F%2Flinkinghub.elsevier.com%2Fretrieve%2Fpii%2FS0896627325007160%3Fshowall%3Dtrue">
    <title>It’s not the thought that counts: Allostasis at the core of brain function: Neuron</title>
    <dc:date>2026-06-02T23:33:52+00:00</dc:date>
    <link>https://www.cell.com/neuron/fulltext/S0896-6273(25)00716-0?_returnURL=https%3A%2F%2Flinkinghub.elsevier.com%2Fretrieve%2Fpii%2FS0896627325007160%3Fshowall%3Dtrue</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[n psychology and neuroscience, scientific questions are often framed in terms of mental activity (e.g., cognition, emotion, and perception); however, the brain is an organ with a particular function that only it can fulfill. Converging evidence suggests that this function is allostasis: the predictive regulation of competing demands from internal bodily systems. We review evidence for a distributed allostatic system that organizes whole-brain signaling, scaffolds psychological phenomena, and places bodily regulation at the core of brain structure. We also demonstrate, with an example from Alzheimer’s disease, how an “allostasis-first” perspective might transform hypothesis generation in the context of neurological health and disease. In sum, the common conception that the brain is primarily for thinking, or other cognitive processes, is potentially misleading, and neuroscience may benefit from a theoretical structure that centers on basic questions of how the brain coordinates and efficiently regulates the body.]]></description>
<dc:subject>papers to-read neuroscience control-theory dynamical-systems cognition</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:0eecd28934b3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neuroscience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:cognition"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.sciencedirect.com/science/article/pii/000510987790022X">
    <title>The future of control - ScienceDirect</title>
    <dc:date>2026-05-05T18:12:23+00:00</dc:date>
    <link>https://www.sciencedirect.com/science/article/pii/000510987790022X</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[The development of control is briefly reviewed. It is suggested that ‘modern’ control has two aspects: a mathematical investigation of basic properties of dynamical systems, and the development of algorithmic methods of synthesis. Reasons are given for believing that the first of these will have more enduring value than the second. Algorithmic methods which try to eliminate the skill of the designer are contrasted with alternative methods which accept his skill and make it more productive. It is finally suggested that the impact of computers upon industry may give the opportunity for a similar development of production methods which accept and enhance the skill of manual workers.]]></description>
<dc:subject>to-read control-theory engineering complex-systems computation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:5c08fa3aa2c7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complex-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://structures.uni-heidelberg.de/blog/posts/2026_02/">
    <title>STRUCTURES Blog | Predicting the Future: From Cave Paintings to DynaMix</title>
    <dc:date>2026-04-18T21:18:09+00:00</dc:date>
    <link>https://structures.uni-heidelberg.de/blog/posts/2026_02/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>blogs dynamical-systems control-theory time-series neural-networks</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:02e81ead7f43/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:blogs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:time-series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neural-networks"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2512.24945">
    <title>[2512.24945] Dynamic response phenotypes and model discrimination in systems and synthetic biology</title>
    <dc:date>2026-01-06T03:50:39+00:00</dc:date>
    <link>https://arxiv.org/abs/2512.24945</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Biological systems encode function not primarily in steady states, but in the structure of transient responses elicited by time-varying stimuli. Overshoots, biphasic dynamics, adaptation kinetics, fold-change detection, entrainment, and cumulative exposure effects often determine phenotypic outcomes, yet are poorly captured by classical steady-state or dose-response analyses. This paper develops an input-output perspective on such "dynamic phenotypes," emphasizing how qualitative features of transient behavior constrain underlying network architectures independently of detailed parameter values. A central theme is the role of sign structure and interconnection logic, particularly the contrast between monotone systems and architectures containing antagonistic pathways. We show how incoherent feedforward (IFF) motifs provide a simple and recurrent mechanism for generating non-monotonic and adaptive responses across multiple levels of biological organization, from molecular signaling to immune regulation and population dynamics. Conversely, monotonicity imposes sharp impossibility results that can be used to falsify entire classes of models from transient data alone. Beyond step inputs, we highlight how periodic forcing, ramps, and integral-type readouts such as cumulative dose responses offer powerful experimental probes that reveal otherwise hidden structure, separate competing motifs, and expose invariances such as fold-change detection. Throughout, we illustrate how control-theoretic concepts, including monotonicity, equivariance, and input-output analysis, can be used not as engineering metaphors, but as precise mathematical tools for biological model discrimination. Thus we argue for a shift in emphasis from asymptotic behavior to transient and input-driven dynamics as a primary lens for understanding, testing, and reverse-engineering biological networks. ]]></description>
<dc:subject>papers to-read systems-biology control-theory dynamical-systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:dbf668c42dc8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:systems-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2508.11990">
    <title>[2508.11990] Universal Learning of Nonlinear Dynamics</title>
    <dc:date>2025-10-22T16:19:25+00:00</dc:date>
    <link>https://arxiv.org/abs/2508.11990</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[We study the fundamental problem of learning a marginally stable unknown nonlinear dynamical system. We describe an algorithm for this problem, based on the technique of spectral filtering, which learns a mapping from past observations to the next based on a spectral representation of the system. Using techniques from online convex optimization, we prove vanishing prediction error for any nonlinear dynamical system that has finitely many marginally stable modes, with rates governed by a novel quantitative control-theoretic notion of learnability. The main technical component of our method is a new spectral filtering algorithm for linear dynamical systems, which incorporates past observations and applies to general noisy and marginally stable systems. This significantly generalizes the original spectral filtering algorithm to both asymmetric dynamics as well as incorporating noise correction, and is of independent interest. ]]></description>
<dc:subject>papers to-read system-identification control-theory learning-theory dynamical-systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:9164da4f209d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:system-identification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:learning-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://link.springer.com/article/10.1007/s10450-006-9683-8">
    <title>The Symplectic Semigroup and Riccati Differential Equations | Journal of Dynamical and Control Systems</title>
    <dc:date>2025-10-15T15:41:07+00:00</dc:date>
    <link>https://link.springer.com/article/10.1007/s10450-006-9683-8</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[In this paper, we study close connections that exist between the Riccati operator (differential) equation that arises in linear control systems and the symplectic group and its subsemigroup of symplectic Hamiltonian operators. A canonical triple factorization is derived for the symplectic Hamiltonian operators, and their closure under multiplication is deduced from this property. This semigroup of Hamiltonian operators, which we call the symplectic semigroup, is studied from the viewpoint of Lie semigroup theory, and resulting consequences for the theory of the Riccati equation are delineated. Among other things, these developments provide an elementary proof for the existence of a solution of the Riccati equation for all t ≥ 0 under rather general hypotheses.]]></description>
<dc:subject>papers to-read dynamical-systems control-theory differential-equations symplectic-geometry</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:adfbeaa3393e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:differential-equations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:symplectic-geometry"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2509.19601">
    <title>[2509.19601] Modular Machine Learning with Applications to Genetic Circuit Composition</title>
    <dc:date>2025-09-29T01:53:44+00:00</dc:date>
    <link>https://arxiv.org/abs/2509.19601</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[In several applications, including in synthetic biology, one often has input/output data on a system composed of many modules, and although the modules' input/output functions and signals may be unknown, knowledge of the composition architecture can significantly reduce the amount of training data required to learn the system's input/output mapping. Learning the modules' input/output functions is also necessary for designing new systems from different composition architectures. Here, we propose a modular learning framework, which incorporates prior knowledge of the system's compositional structure to (a) identify the composing modules' input/output functions from the system's input/output data and (b) achieve this by using a reduced amount of data compared to what would be required without knowledge of the compositional structure. To achieve this, we introduce the notion of modular identifiability, which allows recovery of modules' input/output functions from a subset of the system's input/output data, and provide theoretical guarantees on a class of systems motivated by genetic circuits. We demonstrate the theory on computational studies showing that a neural network (NNET) that accounts for the compositional structure can learn the composing modules' input/output functions and predict the system's output on inputs outside of the training set distribution. By contrast, a neural network that is agnostic of the structure is unable to predict on inputs that fall outside of the training set distribution. By reducing the need for experimental data and allowing module identification, this framework offers the potential to ease the design of synthetic biological circuits and of multi-module systems more generally. ]]></description>
<dc:subject>papers to-read systems-biology control-theory dynamical-systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:cd5e939dcbbb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:systems-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2302.10488">
    <title>[2302.10488] The informativity approach to data-driven analysis and control</title>
    <dc:date>2025-08-24T17:41:38+00:00</dc:date>
    <link>https://arxiv.org/abs/2302.10488</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[The goal of this paper is to provide a tutorial on the so-called informativity framework for direct data-driven analysis and control. This framework achieves certified data-based analysis and control by assessing system properties and determining controllers for sets of systems unfalsified by the data. We will first introduce the informativity approach at an abstract level. Thereafter, we will report case studies where we highlight the strength of the framework in the context of various problems involving both noiseless and noisy data. In particular, we will treat controllability and stabilizability, and stabilization, linear quadratic regulation, and tracking and regulation using exact input-state measurements. Thereafter, we will treat dissipativity analysis, stabilization, and H_inf control using noisy input-state data. Finally, we will study dynamic measurement feedback stabilization using noisy input-output data. We will provide several examples to illustrate the approach. In addition, we will highlight the main tools underlying the framework, such as quadratic matrix inequalities in robust control and quadratic difference forms in behavioral systems theory. ]]></description>
<dc:subject>papers to-read control-theory behavioral-control data-driven-control</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:ca74e0e3ac7a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:behavioral-control"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:data-driven-control"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2501.02267">
    <title>[2501.02267] Towards a constructive framework for control theory</title>
    <dc:date>2025-01-07T03:34:13+00:00</dc:date>
    <link>https://arxiv.org/abs/2501.02267</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[This work presents a framework for control theory based on constructive analysis to account for discrepancy between mathematical results and their implementation in a computer, also referred to as computational uncertainty. In control engineering, the latter is usually either neglected or considered submerged into some other type of uncertainty, such as system noise, and addressed within robust control. However, even robust control methods may be compromised when the mathematical objects involved in the respective algorithms fail to exist in exact form and subsequently fail to satisfy the required properties. For instance, in general stabilization using a control Lyapunov function, computational uncertainty may distort stability certificates or even destabilize the system despite robustness of the stabilization routine with regards to system, actuator and measurement noise. In fact, battling numerical problems in practical implementation of controllers is common among control engineers. Such observations indicate that computational uncertainty should indeed be addressed explicitly in controller synthesis and system analysis. The major contribution here is a fairly general framework for proof techniques in analysis and synthesis of control systems based on constructive analysis which explicitly states that every computation be doable only up to a finite precision thus accounting for computational uncertainty. A series of previous works is overviewed, including constructive system stability and stabilization, approximate optimal controls, eigenvalue problems, Caratheodory trajectories, measurable selectors. Additionally, a new constructive version of the Danskin's theorem, which is crucial in adversarial defense, is presented. ]]></description>
<dc:subject>papers to-read control-theory constructivism optimization</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:82cd11b28fee/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:constructivism"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://link.springer.com/article/10.1007/BF01202856">
    <title>Optimal interpolating and smoothing functional artificial neural networks (FANNs) based on a generalized fock space framework | Circuits, Systems, and Signal Processing</title>
    <dc:date>2024-12-27T14:03:53+00:00</dc:date>
    <link>https://link.springer.com/article/10.1007/BF01202856</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Functional artificial neural networks (FANNs) are artificial neural networks (ANNs) in which the synaptic weights are “functions” rather than numbers. Thus the signals in such networks are analog, and the action of a synapse on a signal passing through it takes place in the form of a scalar product inL 2 between the functional weight and the signal. In this paper, four classes of FANNs are introduced. They result from the solution of a nonparametric optimization problem in a generalized Fock space (GFS) of abstract Volterra series under interpolating or smoothing input-output training data constraints. Two of these classes of FANNs correspond to the interpolating case and are represented by what we call the (two-layer)optimal interpolating (OI) FANN and theoptimal multilayer neural interpolating (OMNI) FANN. The remaining two classes correspond to the smoothing case. We name their representations as the (two-layer)optimal smoothing (OS) FANN and theoptimal smoothing multilayer artificial neural (OSMAN) FANN. In addition to providing the background and the derivation of these FANNs, this paper presents a novel approach to their implementation. This approach does away with the computationally cumbersome use of functional weights. Instead, the effect of these weights is provided by linear time-invariant differential equation models of which those weights are impulse responses. These are implemented by a linear filter bank. This approach thus leads to simple and meaningful causal realizations of FANNs which we call Dynamical FANNs or simply D-FANNs.]]></description>
<dc:subject>papers to-read neural-networks nonlinear-systems dynamical-systems control-theory filtering</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:05c0de74bb6d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:nonlinear-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:filtering"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2412.07438">
    <title>[2412.07438] Flows of vector fields and the Kalman Theorem</title>
    <dc:date>2024-12-15T21:09:53+00:00</dc:date>
    <link>https://arxiv.org/abs/2412.07438</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[We investigate the relations between the Kalman Theorem and the Chow-Rashevskji Theorem or, more precisely, the general theory of flows tangent to non-integrable distributions. The main results consist of two proofs of the Kalman Theorem, which are alternative to the most common ones and which enlighten the above relations and stimulate generalisations in various directions.]]></description>
<dc:subject>papers to-read control-theory dynamical-systems differential-geometry</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:0a41e9ddec66/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:differential-geometry"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1512.08055">
    <title>[1512.08055] A Mathematical Theory of Co-Design</title>
    <dc:date>2024-11-20T02:13:43+00:00</dc:date>
    <link>https://arxiv.org/abs/1512.08055</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[One of the challenges of modern engineering, and robotics in particular, is designing complex systems, composed of many subsystems, rigorously and with optimality guarantees. This paper introduces a theory of co-design that describes "design problems", defined as tuples of "functionality space", "implementation space", and "resources space", together with a feasibility relation that relates the three spaces. Design problems can be interconnected together to create "co-design problems", which describe possibly recursive co-design constraints among subsystems. A co-design problem induces a family of optimization problems of the type "find the minimal resources needed to implement a given functionality"; the solution is an antichain (Pareto front) of resources. A special class of co-design problems are Monotone Co-Design Problems (MCDPs), for which functionality and resources are complete partial orders and the feasibility relation is monotone and Scott continuous. The induced optimization problems are multi-objective, nonconvex, nondifferentiable, noncontinuous, and not even defined on continuous spaces; yet, there exists a complete solution. The antichain of minimal resources can be characterized as a least fixed point, and it can be computed using Kleene's algorithm. The computation needed to solve a co-design problem can be bounded by a function of a graph property that quantifies the interdependence of the subproblems. These results make us much more optimistic about the problem of designing complex systems in a rigorous way. ]]></description>
<dc:subject>papers to-read categories control-theory systems optimization complex-systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:0b9bf9fb26dc/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:categories"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complex-systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2305.17628">
    <title>[2305.17628] Convex operator-theoretic methods in stochastic control</title>
    <dc:date>2024-08-20T11:05:16+00:00</dc:date>
    <link>https://arxiv.org/abs/2305.17628</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[This paper is about operator-theoretic methods for solving nonlinear stochastic optimal control problems to global optimality. These methods leverage on the convex duality between optimally controlled diffusion processes and Hamilton-Jacobi-Bellman (HJB) equations for nonlinear systems in an ergodic Hilbert-Sobolev space. In detail, a generalized Bakry-Emery condition is introduced under which one can establish the global exponential stabilizability of a large class of nonlinear systems. It is shown that this condition is sufficient to ensure the existence of solutions of the ergodic HJB for stochastic optimal control problems on infinite time horizons. Moreover, a novel dynamic programming recursion for bounded linear operators is introduced, which can be used to numerically solve HJB equations by a Galerkin projection. ]]></description>
<dc:subject>papers to-read control-theory dynamical-systems optimization functional-analysis</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:c36d6ed9e02d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:functional-analysis"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2304.03519">
    <title>[2304.03519] Robust data-driven control for nonlinear systems using the Koopman operator</title>
    <dc:date>2024-08-20T10:58:37+00:00</dc:date>
    <link>https://arxiv.org/abs/2304.03519</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Data-driven analysis and control of dynamical systems have gained a lot of interest in recent years. While the class of linear systems is well studied, theoretical results for nonlinear systems are still rare. In this paper, we present a data-driven controller design method for discrete-time control-affine nonlinear systems. Our approach relies on the Koopman operator, which is a linear but infinite-dimensional operator lifting the nonlinear system to a higher-dimensional space. Particularly, we derive a linear fractional representation of a lifted bilinear system representation based on measured data. Further, we restrict the lifting to finite dimensions, but account for the truncation error using a finite-gain argument. We derive a linear matrix inequality based design procedure to guarantee robust local stability for the resulting bilinear system for all error terms satisfying the finite-gain bound and, thus, also for the underlying nonlinear system. Finally, we apply the developed design method to the nonlinear Van der Pol oscillator. ]]></description>
<dc:subject>papers to-read control-theory dynamical-systems Koopman-operators</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:1b6cb0cfd335/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:Koopman-operators"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2404.18380">
    <title>[2404.18380] Dynamic Global Feedback Stabilization: why do the twist?</title>
    <dc:date>2024-08-13T20:11:02+00:00</dc:date>
    <link>https://arxiv.org/abs/2404.18380</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[We investigate global dynamic feedback stabilization from a topological viewpoint. In particular, we consider the general case of dynamic feedback systems, whereby the total space (which includes the state space of the system and of the controller) is a fibre bundle, and derive conditions on the topology of the bundle that are necessary for various notions of global stabilization to hold. This point of view highlight the importance of distinguishing trivial bundles and twisted bundles in the study of global dynamic feedback stabilization, as we show that dynamic feedback defined on a twisted bundle can stabilize systems that dynamic feedback on trivial bundles cannot. ]]></description>
<dc:subject>papers to-read control-theory dynamical-systems feedback geometry topology</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:1e6f0dfe9c79/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:feedback"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:topology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://link.springer.com/book/10.1007/BFb0036078">
    <title>Control Using Logic-Based Switching | SpringerLink</title>
    <dc:date>2024-08-12T18:51:27+00:00</dc:date>
    <link>https://link.springer.com/book/10.1007/BFb0036078</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[A logic-based switching controller is one whose subsystems include not only familiar dynamical components such as integrators, summers, gains etc. but event-driven logic and associated switches as well. In such a system the predominantly logical component is the supervisor, mode changer, etc. There has been growing interest in recent years in determining what could be gained from utilising "hybrid" controllers of this type. To this end a workshop was held on Block Island with the aim of bringing together individuals to discuss the research and common interest in the field. This volume not only includes contributions from those who were present at Block Island but also additional material from those who were not. Topics covered include: hybrid dynamical systems, control of hard-bound constrained and nonlinear systems, automotive problems involving switching control and system control in the face of large-scale modeling errors. ]]></description>
<dc:subject>books control-theory adaptive-systems dynamical-systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:a31bfff8e73a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:books"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:adaptive-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.pnas.org/doi/10.1073/pnas.2311893121">
    <title>The neuron as a direct data-driven controller | PNAS</title>
    <dc:date>2024-06-25T02:10:00+00:00</dc:date>
    <link>https://www.pnas.org/doi/10.1073/pnas.2311893121</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[In the quest to model neuronal function amid gaps in physiological data, a promising strategy is to develop a normative theory that interprets neuronal physiology as optimizing a computational objective. This study extends current normative models, which primarily optimize prediction, by conceptualizing neurons as optimal feedback controllers. We posit that neurons, especially those beyond early sensory areas, steer their environment toward a specific desired state through their output. This environment comprises both synaptically interlinked neurons and external motor sensory feedback loops, enabling neurons to evaluate the effectiveness of their control via synaptic feedback. To model neurons as biologically feasible controllers which implicitly identify loop dynamics, infer latent states, and optimize control we utilize the contemporary direct data-driven control (DD-DC) framework. Our DD-DC neuron model explains various neurophysiological phenomena: the shift from potentiation to depression in spike-timing-dependent plasticity with its asymmetry, the duration and adaptive nature of feedforward and feedback neuronal filters, the imprecision in spike generation under constant stimulation, and the characteristic operational variability and noise in the brain. Our model presents a significant departure from the traditional, feedforward, instant-response McCulloch–Pitts–Rosenblatt neuron, offering a modern, biologically informed fundamental unit for constructing neural networks.]]></description>
<dc:subject>papers to-read neuroscience control-theory dynamical-systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:0fe5a5c7ec9e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neuroscience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://onlinelibrary.wiley.com/doi/10.1111/ejn.16372">
    <title>Formalising the role of behaviour in neuroscience - Piantadosi - European Journal of Neuroscience - Wiley Online Library</title>
    <dc:date>2024-06-17T19:59:17+00:00</dc:date>
    <link>https://onlinelibrary.wiley.com/doi/10.1111/ejn.16372</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[We develop a mathematical approach to formally proving that certain neural computations and representations exist based on patterns observed in an organism's behaviour. To illustrate, we provide a simple set of conditions under which an ant's ability to determine how far it is from its nest would logically imply neural structures isomorphic to the natural numbers. We generalise these results to arbitrary behaviours and representations and show what mathematical characterisation of neural computation and representation is simplest while being maximally predictive of behaviour. We develop this framework in detail using a path integration example, where an organism's ability to search for its nest in the correct location implies representational structures isomorphic to two-dimensional coordinates under addition. We also study a system for processing a^nb^n strings common in comparative work. Our approach provides an objective way to determine what theory of a physical system is best, addressing a fundamental challenge in neuroscientific inference. These results motivate considering which neurobiological structures have the requisite formal structure and are otherwise physically plausible given relevant physical considerations such as generalisability, information density, thermodynamic stability and energetic cost.

ETA -- on the first read, this paper commits the fallacy of reifying the state representation.]]></description>
<dc:subject>papers to-read neuroscience control-theory dynamical-systems state-space-models</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:b2dcbfcf9013/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neuroscience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:state-space-models"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2401.14029">
    <title>[2401.14029] Towards a Systems Theory of Algorithms</title>
    <dc:date>2024-01-26T03:06:17+00:00</dc:date>
    <link>https://arxiv.org/abs/2401.14029</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Traditionally, numerical algorithms are seen as isolated pieces of code confined to an {\em in silico} existence. However, this perspective is not appropriate for many modern computational approaches in control, learning, or optimization, wherein {\em in vivo} algorithms interact with their environment. Examples of such {\em open} include various real-time optimization-based control strategies, reinforcement learning, decision-making architectures, online optimization, and many more. Further, even {\em closed} algorithms in learning or optimization are increasingly abstracted in block diagrams with interacting dynamic modules and pipelines. In this opinion paper, we state our vision on a to-be-cultivated {\em systems theory of algorithms} and argue in favour of viewing algorithms as open dynamical systems interacting with other algorithms, physical systems, humans, or databases. Remarkably, the manifold tools developed under the umbrella of systems theory also provide valuable insights into this burgeoning paradigm shift and its accompanying challenges in the algorithmic world. We survey various instances where the principles of algorithmic systems theory are being developed and outline pertinent modeling, analysis, and design challenges. ]]></description>
<dc:subject>papers to-read control-theory algorithms computation learning optimization</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:3cf791653c0d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://ieeexplore.ieee.org/abstract/document/9454440">
    <title>Feedback Maximum Principle for Ensemble Control of Local Continuity Equations: An Application to Supervised Machine Learning | IEEE Journals &amp; Magazine | IEEE Xplore</title>
    <dc:date>2024-01-14T21:02:13+00:00</dc:date>
    <link>https://ieeexplore.ieee.org/abstract/document/9454440</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[We consider an optimal control problem for a system of local continuity equations on a space of probability measures. Such systems can be viewed as macroscopic models of ensembles of non-interacting particles or homotypic individuals, representing several different “populations”. For the stated problem, we propose a necessary conditions of optimality which involve feedback controls inherent to the extremal structure designed via the standard Pontryagin's Maximum Principle. These optimality conditions admit a realization as an iterative algorithm for optimal control. As a motivating case, we discuss an application of the derived optimality condition, and the consequent numeric method to a problem of supervised machine learning via dynamic systems.]]></description>
<dc:subject>papers to-read dynamical-systems control-theory ODEs machine-learning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:2028fc5e7330/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:ODEs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2312.12903">
    <title>[2312.12903] A Minimal Control Family of Dynamical Syetem for Universal Approximation</title>
    <dc:date>2023-12-23T20:19:04+00:00</dc:date>
    <link>https://arxiv.org/abs/2312.12903</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[The universal approximation property (UAP) of neural networks is a fundamental characteristic of deep learning. It is widely recognized that a composition of linear functions and non-linear functions, such as the rectified linear unit (ReLU) activation function, can approximate continuous functions on compact domains. In this paper, we extend this efficacy to the scenario of dynamical systems with controls. We prove that the control family $\mathcal{F}_1 = \mathcal{F}_0 \cup \{ \text{ReLU}(\cdot)\} $ is enough to generate flow maps that can uniformly approximate diffeomorphisms of $\mathbb{R}^d$ on any compact domain, where $\mathcal{F}_0 = \{x \mapsto Ax+b: A\in \mathbb{R}^{d\times d}, b \in \mathbb{R}^d\}$ is the set of linear maps and the dimension $d\ge2$. Since $\mathcal{F}_1$ contains only one nonlinear function and $\mathcal{F}_0$ does not hold the UAP, we call $\mathcal{F}_1$ a minimal control family for UAP. Based on this, some sufficient conditions, such as the affine invariance, on the control family are established and discussed. Our result reveals an underlying connection between the approximation power of neural networks and control systems. ]]></description>
<dc:subject>papers to-read neural-networks dynamical-systems differential-equations control-theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:f238f721525e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:differential-equations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2008.05166">
    <title>[2008.05166] The Mathematical Foundations of Physical Systems Modeling Languages</title>
    <dc:date>2023-10-14T15:37:48+00:00</dc:date>
    <link>https://arxiv.org/abs/2008.05166</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Modern modeling languages for general physical systems, such as Modelica, Amesim, or Simscape, rely on Differential Algebraic Equations (DAE), i.e., constraints of the form f(dot{x},x,u)=0. This drastically facilitates modeling from first principles of the physics and the reuse of models. In this paper we develop the mathematical theory needed to establish the development of compilers and tools for DAE based physical modeling languages on solid mathematical bases. Unlike Ordinary Differential Equations, DAE exhibit subtle issues because of the notion of differentiation index and related latent equations -- ODE are DAE of index zero for which no latent equation needs to be considered. Prior to generating execution code and calling solvers, the compilation of such languages requires a nontrivial \emph{structural analysis} step that reduces the differentiation index to a level acceptable by DAE solvers. The models supported by tools of the Modelica class involve multiple modes with mode-dependent DAE based dynamics and state-dependent mode switching. Multimode DAE are much more difficult than DAE. The main difficulty is the handling of the events of mode change. Unfortunately, the large literature devoted to the mathematical analysis of DAEs does not cover the multimode case, typically saying nothing about mode changes. This lack of foundations causes numerous difficulties to the existing modeling tools. Some models are well handled, others are not, with no clear boundary between the two classes. In this paper, we develop a comprehensive mathematical approach supporting compilation and code generation for this class of languages. Its core is the structural analysis of multimode DAE systems. As a byproduct of this structural analysis, we propose well sound criteria for accepting or rejecting models. For our mathematical development, we rely on nonstandard analysis, which allows us to cast hybrid systems dynamics to discrete time dynamics with infinitesimal step size, thus providing a uniform framework for handling both continuous dynamics and mode change events. ]]></description>
<dc:subject>papers to-read formal-methods systems control-theory programming-languages</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:b40e1216af7b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:formal-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:programming-languages"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://ieeexplore.ieee.org/document/7321405">
    <title>Non-Gaussian properties of the real industrial control error in SISO loops | IEEE Conference Publication | IEEE Xplore</title>
    <dc:date>2023-10-14T15:16:05+00:00</dc:date>
    <link>https://ieeexplore.ieee.org/document/7321405</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[The paper presents results of the observations on behavior and properties of the control quality that is met in real industrial practice. The analysis is based on data from several hundreds of control loops operating in different process industries located in several sites all over the world. Practice shows that theoretical assumption about Gaussian properties is hardly met. The author suggest novel approach to the loop analysis and the assessment of process control quality based on the fractal approach. Alternative tools based on the R/S plots, Hurst index and fat-tail probabilistic distributions seems to be valid extension to the existing Gaussian perspective.]]></description>
<dc:subject>papers to-read control-theory philosophy-of-engineering systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:fa9ab30c0cbc/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:philosophy-of-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://videolectures.net/cyberstat2012_granada/">
    <title>Workshop on Statistical Physics of Inference and Control Theory, Granada 2012 - VideoLectures - VideoLectures.NET</title>
    <dc:date>2023-08-09T21:01:56+00:00</dc:date>
    <link>http://videolectures.net/cyberstat2012_granada/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>statistical-physics inference information control-theory learning dynamical-systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:030cd6bd49c8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:statistical-physics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:inference"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:information"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://link.springer.com/chapter/10.1007/3-540-36589-3_17">
    <title>Controllability, integrability and ergodicity | SpringerLink</title>
    <dc:date>2023-07-13T21:43:09+00:00</dc:date>
    <link>https://link.springer.com/chapter/10.1007/3-540-36589-3_17</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Systems preserving a smooth measure on the phase space, such as Hamiltonian systems of classical dynamics or incompressible flows of fluid dynamics attract a lot of interest in control theory. I describe some work on the notion of controllability in systems that are measure-preserving and possess drift. Relationship between controllability, a fundamental concept in control theory, and the concepts of integrability and ergodicity, fundamental in dynamical systems theory is addressed. The basic idea is that studying reccurence (or ergodic) properties of trajectories of the drift is key to establishing necessary and sufficient conditions for controllability in such systems. The benefit of this approach is that controllability proofs contain a constructive procedure for control.]]></description>
<dc:subject>papers to-read control-theory dynamical-systems ergodic-theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:25c08d304c7f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:ergodic-theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://epubs.siam.org/doi/abs/10.1137/0313010?mobileUi=0">
    <title>Markovian Representation of Stochastic Processes by Canonical Variables | SIAM Journal on Control and Optimization</title>
    <dc:date>2023-07-06T16:01:33+00:00</dc:date>
    <link>https://epubs.siam.org/doi/abs/10.1137/0313010?mobileUi=0</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[The structure of the information interface between the future and the past of a discrete-time stochastic process is analyzed by using the concepts of canonical correlation analysis. Two extreme Markovian representations are obtained with states defined by the sets of canonical variables which represent the past information projected on the future and the future information projected on the past, respectively. The result completely clarifies the probabilistic structure of the Faurre algorithm of realization of stochastic systems. By an extension of the basic result the Ho–Kalman algorithm of realization of general systems is also given a stochastic interpretation.]]></description>
<dc:subject>papers to-read stochastic-processes control-theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:c20c9638197d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:stochastic-processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.sciencedirect.com/science/article/abs/pii/S1389041709000163?casa_token=8dkZ1O1iNBcAAAAA:gnuocqU5jszqBuwnBv1BYYua466pUhmQXOokW-3DOCA_-v5GNHpSCvptgCXuxYcYizauW6_Qzt8">
    <title>On strong anticipation - ScienceDirect</title>
    <dc:date>2023-05-04T16:41:49+00:00</dc:date>
    <link>https://www.sciencedirect.com/science/article/abs/pii/S1389041709000163?casa_token=8dkZ1O1iNBcAAAAA:gnuocqU5jszqBuwnBv1BYYua466pUhmQXOokW-3DOCA_-v5GNHpSCvptgCXuxYcYizauW6_Qzt8</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[We examine Dubois’s [Dubois, D., 2003. Mathematical foundations of discrete and functional systems with strong and weak anticipations. Lecture Notes in Computer Science 2684, 110–132.] distinction between weak anticipation and strong anticipation. Anticipation is weak if it arises from a model of the system via internal simulations. Anticipation is strong if it arises from the system itself via lawful regularities embedded in the system’s ordinary mode of functioning. The assumption of weak anticipation dominates cognitive science and neuroscience and in particular the study of perception and action. The assumption of strong anticipation, however, seems to be required by anticipation’s ubiquity. It is, for example, characteristic of homeostatic processes at the level of the organism, organs, and cells. We develop the formal distinction between strong and weak anticipation by elaboration of anticipating synchronization, a phenomenon arising from time delays in appropriately coupled dynamical systems. The elaboration is conducted in respect to (a) strictly physical systems, (b) the defining features of circadian rhythms, often viewed as paradigmatic of biological behavior based in internal models, (c) Pavlovian learning, and (d) forward models in motor control. We identify the common thread of strongly anticipatory systems and argue for its significance in furthering understanding of notions such as “internal”, “model” and “prediction”.]]></description>
<dc:subject>papers to-read control-theory dynamical-systems ecological-psychology cognitive-science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:a614ef1065ba/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:ecological-psychology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:cognitive-science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://link.springer.com/article/10.1007/s10485-019-09565-x">
    <title>Dynamical Systems and Sheaves | SpringerLink</title>
    <dc:date>2022-10-03T02:57:57+00:00</dc:date>
    <link>https://link.springer.com/article/10.1007/s10485-019-09565-x</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[A categorical framework for modeling and analyzing systems in a broad sense is proposed. These systems should be thought of as ‘machines’ with inputs and outputs, carrying some sort of signal that occurs through some notion of time. Special cases include continuous and discrete dynamical systems (e.g. Moore machines). Additionally, morphisms between the different types of systems allow their translation in a common framework. A central goal is to understand the systems that result from arbitrary interconnection of component subsystems, possibly of different types, as well as establish conditions that ensure totality and determinism compositionally. The fundamental categorical tools used here include lax monoidal functors, which provide a language of compositionality, as well as sheaf theory, which flexibly captures the crucial notion of time.]]></description>
<dc:subject>to-read type-theory control-theory categories dynamical-systems functional-programming logic papers</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:3ee6ce48d6c5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:type-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:categories"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:functional-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:logic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1710.10258">
    <title>[1710.10258] Temporal Type Theory: A topos-theoretic approach to systems and behavior</title>
    <dc:date>2022-10-03T02:50:36+00:00</dc:date>
    <link>https://arxiv.org/abs/1710.10258</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[    This book introduces a temporal type theory, the first of its kind as far as we know. It is based on a standard core, and as such it can be formalized in a proof assistant such as Coq or Lean by adding a number of axioms. Well-known temporal logics---such as Linear and Metric Temporal Logic (LTL and MTL)---embed within the logic of temporal type theory.
    The types in this theory represent "behavior types". The language is rich enough to allow one to define arbitrary hybrid dynamical systems, which are mixtures of continuous dynamics---e.g. as described by a differential equation---and discrete jumps. In particular, the derivative of a continuous real-valued function is internally defined.
    We construct a semantics for the temporal type theory in the topos of sheaves on a translation-invariant quotient of the standard interval domain. In fact, domain theory plays a recurring role in both the semantics and the type theory. 

]]></description>
<dc:subject>books to-read type-theory control-theory categories dynamical-systems functional-programming logic</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:66d37e1343ca/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:books"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:type-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:categories"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:functional-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:logic"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.annualreviews.org/doi/full/10.1146/annurev-control-060117-104856">
    <title>The Synergy Between Neuroscience and Control Theory: The Nervous System as Inspiration for Hard Control Challenges | Annual Review of Control, Robotics, and Autonomous Systems</title>
    <dc:date>2022-08-23T16:16:04+00:00</dc:date>
    <link>https://www.annualreviews.org/doi/full/10.1146/annurev-control-060117-104856</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Here, we review the role of control theory in modeling neural control systems through a top-down analysis approach. Specifically, we examine the role of the brain and central nervous system as the controller in the organism, connected to but isolated from the rest of the animal through insulated interfaces. Though biological and engineering control systems operate on similar principles, they differ in several critical features, which makes drawing inspiration from biology for engineering controllers challenging but worthwhile. We also outline a procedure that the control theorist can use to draw inspiration from the biological controller: starting from the intact, behaving animal; designing experiments to deconstruct and model hierarchies of feedback; modifying feedback topologies; perturbing inputs and plant dynamics; using the resultant outputs to perform system identification; and tuning and validating the resultant control-theoretic model using specially engineered robophysical models.]]></description>
<dc:subject>papers to-read control-theory neuroscience robotics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:b018fd3772d0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neuroscience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:robotics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1506.03409">
    <title>[1506.03409] Bellman partial differential equation and the hill property for classical isoperimetric problems</title>
    <dc:date>2022-08-20T15:04:48+00:00</dc:date>
    <link>https://arxiv.org/abs/1506.03409</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[The goal of this note is to have a systematic approach to generating isoperimetric inequalities from two concrete type of PDEs. We call these PDEs Bellman type because a totally analogous equations happen to rule many sharp estimates for singular integrals in harmonic analysis, and such estimates were obtained with the use of Hamilton--Jacobi--Bellman PDE. We show how classical inequalities of Brascamp--Lieb, Prekopa--Leindler, Ehrhard are particular case of this scheme, which allows us to augment the stock of such inequalities. We approach the isoperimetric inequalities as a maximum (minimum) principle for special types of functions. These functions are compositions of "Bellman function" and an appropriate flow built on test functions. Then the existence of maximum (minimum) principle for such compositions can be reduced to the requirement that Bellman function satisfies a concrete class of nonlinear PDE (written down below). We are left to solve this nonlinear PDE (sometimes a possible task) to enjoy isoperimetric inequalities. The nonlinear PDE that we will describe in this article can be reduced sometimes to solving Laplacian eigenvalue problem, ∂¯-equation of certain type or just the linear heat equation. ]]></description>
<dc:subject>papers to-read isoperimetry probability measure-concentration PDEs control-theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:06fc15f4dfbf/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:isoperimetry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:probability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:measure-concentration"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:PDEs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1511.06895">
    <title>[1511.06895] Isoperimetric functional inequalities via the maximum principle: the exterior differential systems approach</title>
    <dc:date>2022-08-20T15:04:00+00:00</dc:date>
    <link>https://arxiv.org/abs/1511.06895</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[The goal of this note is to give the unified approach to the solutions of a class of isoperimetric problems by relating them to the exterior differential systems studied by R.~Bryant and P.~Griffiths. In this note we list several classical by now isopereimetric inequalities which can be proved in a unified way. This unified approach reduces them to the so-called exterior differential systems studied by Robert Bryant and Phillip Griffiths. To the best of our knowledge, this is the first article where this connection is used. After reviewing a list of classical inequalities (log-Sobolev inequality, Beckner's inequality, Bobkov's functional isoperimetric inequality and several other inequalities) we use our method to generate new isoperimetric inequalities, in particular, we found the sharpening of Beckner--Sobolev inequalities with Gaussian measure.
Key words: log-Sobolev inequality, Poincaré inequality, Bobkov's inequality, Gaussian isoperimetry, semigroups, maximum principle, Monge--Ampère equation with drift, exterior differential systems, backwards heat equation, (B) theorem 

-- published version: https://link.springer.com/chapter/10.1007/978-3-319-59078-3_14]]></description>
<dc:subject>papers to-read isoperimetry probability measure-concentration PDEs control-theory differential-geometry</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:8327effc188e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:isoperimetry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:probability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:measure-concentration"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:PDEs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:differential-geometry"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://eudml.org/doc/208885">
    <title>EUDML  |  Some optimal control applications of real-analytic stratifications and desingularization</title>
    <dc:date>2022-08-02T16:25:50+00:00</dc:date>
    <link>https://eudml.org/doc/208885</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>papers to-read geometry control-theory dynamical-systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:8b178b043c07/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2202.00817">
    <title>[2202.00817] Do Differentiable Simulators Give Better Policy Gradients?</title>
    <dc:date>2022-08-02T16:06:50+00:00</dc:date>
    <link>https://arxiv.org/abs/2202.00817</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Differentiable simulators promise faster computation time for reinforcement learning by replacing zeroth-order gradient estimates of a stochastic objective with an estimate based on first-order gradients. However, it is yet unclear what factors decide the performance of the two estimators on complex landscapes that involve long-horizon planning and control on physical systems, despite the crucial relevance of this question for the utility of differentiable simulators. We show that characteristics of certain physical systems, such as stiffness or discontinuities, may compromise the efficacy of the first-order estimator, and analyze this phenomenon through the lens of bias and variance. We additionally propose an α-order gradient estimator, with α∈[0,1], which correctly utilizes exact gradients to combine the efficiency of first-order estimates with the robustness of zero-order methods. We demonstrate the pitfalls of traditional estimators and the advantages of the α-order estimator on some numerical examples. ]]></description>
<dc:subject>papers to-read control-theory machine-learning deep-learning simulation reinforcement-learning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:7231e2b55f3d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:deep-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:reinforcement-learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://royalsocietypublishing.org/doi/10.1098/rsif.2012.0869">
    <title>The algorithmic origins of life | Journal of The Royal Society Interface</title>
    <dc:date>2022-08-02T16:00:01+00:00</dc:date>
    <link>https://royalsocietypublishing.org/doi/10.1098/rsif.2012.0869</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Although it has been notoriously difficult to pin down precisely what is it that makes life so distinctive and remarkable, there is general agreement that its informational aspect is one key property, perhaps the key property. The unique informational narrative of living systems suggests that life may be characterized by context-dependent causal influences, and, in particular, that top-down (or downward) causation—where higher levels influence and constrain the dynamics of lower levels in organizational hierarchies—may be a major contributor to the hierarchal structure of living systems. Here, we propose that the emergence of life may correspond to a physical transition associated with a shift in the causal structure, where information gains direct and context-dependent causal efficacy over the matter in which it is instantiated. Such a transition may be akin to more traditional physical transitions (e.g. thermodynamic phase transitions), with the crucial distinction that determining which phase (non-life or life) a given system is in requires dynamical information and therefore can only be inferred by identifying causal architecture. We discuss some novel research directions based on this hypothesis, including potential measures of such a transition that may be amenable to laboratory study, and how the proposed mechanism corresponds to the onset of the unique mode of (algorithmic) information processing characteristic of living systems.]]></description>
<dc:subject>papers to-read biogenesis information-theory algorithms causality control-theory dynamical-systems cybernetics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:053e8aa6fdff/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:biogenesis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:information-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:causality"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:cybernetics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2205.09241">
    <title>[2205.09241] Neural ODE Control for Trajectory Approximation of Continuity Equation</title>
    <dc:date>2022-05-23T15:18:53+00:00</dc:date>
    <link>https://arxiv.org/abs/2205.09241</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[We consider the controllability problem for the continuity equation, corresponding to neural ordinary differential equations (ODEs), which describes how a probability measure is pushedforward by the flow. We show that the controlled continuity equation has very strong controllability properties. Particularly, a given solution of the continuity equation corresponding to a bounded Lipschitz vector field defines a trajectory on the set of probability measures. For this trajectory, we show that there exist piecewise constant training weights for a neural ODE such that the solution of the continuity equation corresponding to the neural ODE is arbitrarily close to it. As a corollary to this result, we establish that the continuity equation of the neural ODE is approximately controllable on the set of compactly supported probability measures that are absolutely continuous with respect to the Lebesgue measure. ]]></description>
<dc:subject>papers to-read control-theory dynamical-systems ODEs SDEs neural-networks machine-learning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:0389d5764128/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:ODEs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:SDEs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.jmlr.org/papers/v23/20-1165.html">
    <title>Approximate Information State for Approximate Planning and Reinforcement Learning in Partially Observed Systems</title>
    <dc:date>2022-03-24T19:51:42+00:00</dc:date>
    <link>https://www.jmlr.org/papers/v23/20-1165.html</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[We propose a theoretical framework for approximate planning and learning in partially observed systems. Our framework is based on the fundamental notion of information state. We provide two definitions of information state---i) a function of history which is sufficient to compute the expected reward and predict its next value; ii) a function of the history which can be recursively updated and is sufficient to compute the expected reward and predict the next observation. An information state always leads to a dynamic programming decomposition. Our key result is to show that if a function of the history (called AIS) approximately satisfies the properties of the information state, then there is a corresponding approximate dynamic program. We show that the policy computed using this is approximately optimal with bounded loss of optimality. We show that several approximations in state, observation and action spaces in literature can be viewed as instances of AIS. In some of these cases, we obtain tighter bounds. A salient feature of AIS is that it can be learnt from data. We present AIS based multi-time scale policy gradient algorithms and detailed numerical experiments with low, moderate and high dimensional environments. ]]></description>
<dc:subject>papers to-read reinforcement-learning dynamic-programming control-theory heard-the-talk</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:50e2a0f7f6dd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:reinforcement-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamic-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:heard-the-talk"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2101.12606">
    <title>[2101.12606] Dissipativity and optimal control</title>
    <dc:date>2022-03-22T20:14:20+00:00</dc:date>
    <link>https://arxiv.org/abs/2101.12606</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[The close link between dissipativity and optimal control is already apparent in Jan C. Willems' first papers on the subject. In recent years, research on this link has been revived with a particular focus on nonlinear problems and applications in model predictive control (MPC). This paper surveys these recent developments and some of Willems' and other authors' earlier results. ]]></description>
<dc:subject>papers to-read optimization control-theory dynamical-systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:2e7dcf0b4bf5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2104.05278">
    <title>[2104.05278] Neural ODE control for classification, approximation and transport</title>
    <dc:date>2021-07-14T17:31:29+00:00</dc:date>
    <link>https://arxiv.org/abs/2104.05278</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[

    We analyze Neural Ordinary Differential Equations (NODEs) from a control theoretical perspective to address some of the main properties and paradigms of Deep Learning (DL), in particular, data classification and universal approximation. These objectives are tackled and achieved from the perspective of the simultaneous control of systems of NODEs. For instance, in the context of classification, each item to be classified corresponds to a different initial datum for the control problem of the NODE, to be classified, all of them by the same common control, to the location (a subdomain of the euclidean space) associated to each label. Our proofs are genuinely nonlinear and constructive, allowing us to estimate the complexity of the control strategies we develop. The nonlinear nature of the activation functions governing the dynamics of NODEs under consideration plays a key role in our proofs, since it allows deforming half of the phase space while the other half remains invariant, a property that classical models in mechanics do not fulfill. This very property allows to build elementary controls inducing specific dynamics and transformations whose concatenation, along with properly chosen hyperplanes, allows achieving our goals in finitely many steps. The nonlinearity of the dynamics is assumed to be Lipschitz. Therefore, our results apply also in the particular case of the ReLU activation function. We also present the counterparts in the context of the control of neural transport equations, establishing a link between optimal transport and deep neural networks. ]]></description>
<dc:subject>papers to-read neural-networks ODEs dynamical-systems control-theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:5bafc70f1ac0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:ODEs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2006.10330">
    <title>[2006.10330] A Shooting Formulation of Deep Learning</title>
    <dc:date>2021-05-03T22:22:04+00:00</dc:date>
    <link>https://arxiv.org/abs/2006.10330</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Continuous-depth neural networks can be viewed as deep limits of discrete neural networks whose dynamics resemble a discretization of an ordinary differential equation (ODE). Although important steps have been taken to realize the advantages of such continuous formulations, most current techniques are not truly continuous-depth as they assume \textit{identical} layers. Indeed, existing works throw into relief the myriad difficulties presented by an infinite-dimensional parameter space in learning a continuous-depth neural ODE. To this end, we introduce a shooting formulation which shifts the perspective from parameterizing a network layer-by-layer to parameterizing over optimal networks described only by a set of initial conditions. For scalability, we propose a novel particle-ensemble parametrization which fully specifies the optimal weight trajectory of the continuous-depth neural network. Our experiments show that our particle-ensemble shooting formulation can achieve competitive performance, especially on long-range forecasting tasks. Finally, though the current work is inspired by continuous-depth neural networks, the particle-ensemble shooting formulation also applies to discrete-time networks and may lead to a new fertile area of research in deep learning parametrization. ]]></description>
<dc:subject>papers to-read machine-learning neural-networks ODEs control-theory dynamical-systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:6f5ab0d954eb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:ODEs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.pnas.org/content/116/21/10537">
    <title>Fundamental bounds on learning performance in neural circuits | PNAS</title>
    <dc:date>2021-04-14T15:36:43+00:00</dc:date>
    <link>https://www.pnas.org/content/116/21/10537</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[How does the size of a neural circuit influence its learning performance? Larger brains tend to be found in species with higher cognitive function and learning ability. Intuitively, we expect the learning capacity of a neural circuit to grow with the number of neurons and synapses. We show how adding apparently redundant neurons and connections to a network can make a task more learnable. Consequently, large neural circuits can either devote connectivity to generating complex behaviors or exploit this connectivity to achieve faster and more precise learning of simpler behaviors. However, we show that in a biologically relevant setting where synapses introduce an unavoidable amount of noise, there is an optimal size of network for a given task. Above the optimal network size, the addition of neurons and synaptic connections starts to impede learning performance. This suggests that the size of brain circuits may be constrained by the need to learn efficiently with unreliable synapses and provides a hypothesis for why some neurological learning deficits are associated with hyperconnectivity. Our analysis is independent of specific learning rules and uncovers fundamental relationships between learning rate, task performance, network size, and intrinsic noise in neural circuits.]]></description>
<dc:subject>papers to-read neuroscience neural-networks learning control-theory dynamical-systems biology</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:05d5179c4894/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neuroscience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:biology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.pnas.org/content/70/10/2974">
    <title>A Theory of the Epigenesis of Neuronal Networks by Selective Stabilization of Synapses | PNAS</title>
    <dc:date>2021-04-14T15:13:41+00:00</dc:date>
    <link>https://www.pnas.org/content/70/10/2974</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[A formalism is introduced to represent the connective organization of an evolving neuronal network and the effects of environment on this organization by stabilization or degeneration of labile synapses associated with functioning. Learning, or the acquisition of an associative property, is related to a characteristic variability of the connective organization: the interaction of the environment with the genetic program is printed as a particular pattern of such organization through neuronal functioning. An application of the theory to the development of the neuromuscular junction is proposed and the basic selective aspect of learning emphasized.]]></description>
<dc:subject>papers to-read neuroscience biology learning control-theory dynamical-systems neural-networks</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:0715924cac17/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neuroscience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neural-networks"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.frontiersin.org/articles/10.3389/fphys.2020.00200/full">
    <title>Frontiers | Homeostasis: The Underappreciated and Far Too Often Ignored Central Organizing Principle of Physiology | Physiology</title>
    <dc:date>2021-01-02T02:48:56+00:00</dc:date>
    <link>https://www.frontiersin.org/articles/10.3389/fphys.2020.00200/full</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[The grand challenge to physiology, as was first described in an essay published in the inaugural issue of Frontiers in Physiology in 2010, remains to integrate function from molecules to intact organisms. In order to make sense of the vast volume of information derived from, and increasingly dependent upon, reductionist approaches, a greater emphasis must be placed on the traditional integrated and more holistic approaches developed by the scientists who gave birth to physiology as an intellectual discipline. Our understanding of physiological regulation has evolved over time from the Greek idea of body humors, through Claude Bernard’s “milieu intérieur,” to Walter Cannon’s formulation of the concept of “homeostasis” and the application of control theory (feedback and feedforward regulation) to explain how a constant internal environment is achieved. Homeostasis has become the central unifying concept of physiology and is defined as a self-regulating process by which an organism can maintain internal stability while adjusting to changing external conditions. Homeostasis is not static and unvarying; it is a dynamic process that can change internal conditions as required to survive external challenges. It is also important to note that homeostatic regulation is not merely the product of a single negative feedback cycle but reflects the complex interaction of multiple feedback systems that can be modified by higher control centers. This hierarchical control and feedback redundancy results in a finer level of control and a greater flexibility that enables the organism to adapt to changing environmental conditions. The health and vitality of the organism can be said to be the end result of homeostatic regulation. An understanding of normal physiology is not possible without an appreciation of this concept. Conversely, it follows that disruption of homeostatic mechanisms is what leads to disease, and effective therapy must be directed toward re-establishing these homeostatic conditions. Therefore, it is the purpose of this essay to describe the evolution of our understanding of homeostasis and the role of physiological regulation and dysregulation in health and disease.
]]></description>
<dc:subject>to-read papers cybernetics physiology biology control-theory dynamical-systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:70dfcf02ea25/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:cybernetics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:physiology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2007.06007">
    <title>[2007.06007] Universal Approximation Power of Deep Neural Networks via Nonlinear Control Theory</title>
    <dc:date>2020-08-19T18:45:41+00:00</dc:date>
    <link>https://arxiv.org/abs/2007.06007</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[ In this paper, we explain the universal approximation capabilities of deep neural networks through geometric nonlinear control. Inspired by recent work establishing links between residual networks and control systems, we provide a general sufficient condition for a residual network to have the power of universal approximation by asking the activation function, or one of its derivatives, to satisfy a quadratic differential equation. Many activation functions used in practice satisfy this assumption, exactly or approximately, and we show this property to be sufficient for an adequately deep neural network with n states to approximate arbitrarily well any continuous function defined on a compact subset of R^n. We further show this result to hold for very simple architectures, where the weights only need to assume two values. The key technical contribution consists of relating the universal approximation problem to controllability of an ensemble of control systems corresponding to a residual network, and to leverage classical Lie algebraic techniques to characterize controllability. ]]></description>
<dc:subject>papers to-read deep-learning neural-networks dynamical-systems control-theory differential-equations</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:50632fd10d08/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:deep-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:differential-equations"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2006.06462">
    <title>[2006.06462] Deep Differential System Stability -- Learning advanced computations from examples</title>
    <dc:date>2020-07-20T20:17:00+00:00</dc:date>
    <link>https://arxiv.org/abs/2006.06462</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[ Can advanced mathematical computations be learned from examples? Using transformers over large generated datasets, we train models to learn properties of differential systems, such as local stability, behavior at infinity and controllability. We achieve near perfect estimates of qualitative characteristics of the systems, and good approximations of numerical quantities, demonstrating that neural networks can learn advanced theorems and complex computations without built-in mathematical knowledge. 

-- I am skeptical, so usual caveats apply]]></description>
<dc:subject>papers to-read machine-learning deep-learning dynamical-systems control-theory state-space-models stability</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:ca3ba9610638/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:deep-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:state-space-models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:stability"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://paths.lids.mit.edu/">
    <title>Paths Ahead in the Science of Information and Decision Systems</title>
    <dc:date>2020-07-20T19:49:49+00:00</dc:date>
    <link>http://paths.lids.mit.edu/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>conferences control-theory dynamical-systems machine-learning signal-processing systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:57ab36d14bb4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:conferences"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:signal-processing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://golem.ph.utexas.edu/category/2018/06/the_behavioral_approach_to_sys.html">
    <title>The Behavioral Approach to Systems Theory | The n-Category Café</title>
    <dc:date>2020-05-22T04:29:18+00:00</dc:date>
    <link>https://golem.ph.utexas.edu/category/2018/06/the_behavioral_approach_to_sys.html</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>systems control-theory behavioral-control categories</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:e19b3b244090/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:behavioral-control"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:categories"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1910.13886">
    <title>[1910.13886] Risk bounds for reservoir computing</title>
    <dc:date>2019-11-07T03:47:54+00:00</dc:date>
    <link>https://arxiv.org/abs/1910.13886</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[We analyze the practices of reservoir computing in the framework of statistical learning theory. In particular, we derive finite sample upper bounds for the generalization error committed by specific families of reservoir computing systems when processing discrete-time inputs under various hypotheses on their dependence structure. Non-asymptotic bounds are explicitly written down in terms of the multivariate Rademacher complexities of the reservoir systems and the weak dependence structure of the signals that are being handled. This allows, in particular, to determine the minimal number of observations needed in order to guarantee a prescribed estimation accuracy with high probability for a given reservoir family. At the same time, the asymptotic behavior of the devised bounds guarantees the consistency of the empirical risk minimization procedure for various hypothesis classes of reservoir functionals.]]></description>
<dc:subject>papers to-read reservoir-computing filtering control-theory neural-networks dynamical-systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:21299680593a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:reservoir-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.statslab.cam.ac.uk/~rrw1/oc/">
    <title>Optimization and Control</title>
    <dc:date>2018-10-11T02:14:55+00:00</dc:date>
    <link>http://www.statslab.cam.ac.uk/~rrw1/oc/</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[This is a home page of resources for Richard Weber's course of 16 lectures to third year Cambridge mathematics students in winder 2016, starting January 14, 2016 (Tue/Thu @ 11 in CMS meeting room 5). This material is provided for students, supervisors (and others) to freely use in connection with this course.]]></description>
<dc:subject>teaching lecture-notes reference control-theory optimization</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:6745fd474959/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:teaching"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:lecture-notes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:reference"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://homes.cs.washington.edu/~todorov/courses/amath579/">
    <title>Intelligent control through learning and optimization (AMATH/CSE 579)</title>
    <dc:date>2018-10-11T02:14:21+00:00</dc:date>
    <link>https://homes.cs.washington.edu/~todorov/courses/amath579/</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Design of near-optimal controllers for complex dynamical systems, using analytical techniques, machine learning, and optimization. Topics from deterministic and stochastic optimal control, reinforcement learning and dynamic programming, numerical optimization in the context of control, and robotics. Prerequisite: vector calculus, linear algebra, and Matlab. Recommended: differential equations, stochastic processes, and optimization. ]]></description>
<dc:subject>teaching lecture-notes reference control-theory optimization</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:72a77bbee2ad/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:teaching"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:lecture-notes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:reference"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://ieeexplore.ieee.org/document/1333224/">
    <title>Generalized neural network for nonsmooth nonlinear programming problems - IEEE Journals &amp; Magazine</title>
    <dc:date>2018-08-09T20:34:37+00:00</dc:date>
    <link>https://ieeexplore.ieee.org/document/1333224/</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[In 1988 Kennedy and Chua introduced the dynamical canonical nonlinear programming circuit (NPC) to solve in real time nonlinear programming problems where the objective function and the constraints are smooth (twice continuously differentiable) functions. In this paper, a generalized circuit is introduced (G-NPC), which is aimed at solving in real time a much wider class of nonsmooth nonlinear programming problems where the objective function and the constraints are assumed to satisfy only the weak condition of being regular functions. G-NPC, which derives from a natural extension of NPC, has a neural-like architecture and also features the presence of constraint neurons modeled by ideal diodes with infinite slope in the conducting region. By using the Clarke's generalized gradient of the involved functions, G-NPC is shown to obey a gradient system of differential inclusions, and its dynamical behavior and optimization capabilities, both for convex and nonconvex problems, are rigorously analyzed in the framework of nonsmooth analysis and the theory of differential inclusions. In the special important case of linear and quadratic programming problems, salient dynamical features of G-NPC, namely the presence of sliding modes , trajectory convergence in finite time, and the ability to compute the exact optimal solution of the problem being modeled, are uncovered and explained in the developed analytical framework.]]></description>
<dc:subject>papers to-read neural-networks optimization dynamical-systems control-theory stability</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:336f075c4fbb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:stability"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1806.05722">
    <title>[1806.05722] Non-asymptotic Identification of LTI Systems from a Single Trajectory</title>
    <dc:date>2018-06-18T21:36:27+00:00</dc:date>
    <link>https://arxiv.org/abs/1806.05722</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[We consider the problem of learning a realization for a linear time-invariant (LTI) dynamical system from input/output data. Given a single input/output trajectory, we provide finite time analysis for learning the system's Markov parameters, from which a balanced realization is obtained using the classical Ho-Kalman algorithm. By proving a stability result for the Ho-Kalman algorithm and combining it with the sample complexity results for Markov parameters, we show how much data is needed to learn a balanced realization of the system up to a desired accuracy with high probability. ]]></description>
<dc:subject>papers to-read system-identification control-theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:75a64647a22d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:system-identification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.mathnet.ru/php/archive.phtml?wshow=paper&amp;jrnid=at&amp;paperid=3712&amp;option_lang=rus">
    <title>А. В. Буцев, А. А. Первозванский, “Локальная аппроксимация на искусственных нейросетях”, Автомат. и телемех., 1995, № 9, 127–136; Autom. Remote Control, 56:9 </title>
    <dc:date>2017-04-14T02:11:05+00:00</dc:date>
    <link>http://www.mathnet.ru/php/archive.phtml?wshow=paper&amp;jrnid=at&amp;paperid=3712&amp;option_lang=rus</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>papers to-read neural-networks control-theory dynamical-systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:15787e314d38/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.youtube.com/playlist?list=PLYq7WW565SZhPcf5PxsuBUz2PtB7Kfb5X">
    <title>Information, Control, and Learning – The Ingredients of Intelligent Behavior - YouTube</title>
    <dc:date>2017-04-04T02:08:08+00:00</dc:date>
    <link>https://www.youtube.com/playlist?list=PLYq7WW565SZhPcf5PxsuBUz2PtB7Kfb5X</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>information-theory machine-learning ai conferences control-theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:435fae84aea1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:information-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:ai"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:conferences"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.jmlr.org/papers/v10/white09a.html">
    <title>Settable Systems: An Extension of Pearl's Causal Model with Optimization, Equilibrium, and Learning</title>
    <dc:date>2017-03-22T15:56:32+00:00</dc:date>
    <link>http://www.jmlr.org/papers/v10/white09a.html</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Judea Pearl's Causal Model is a rich framework that provides deep insight into the nature of causal relations. As yet, however, the Pearl Causal Model (PCM) has had a lesser impact on economics or econometrics than on other disciplines. This may be due in part to the fact that the PCM is not as well suited to analyzing structures that exhibit features of central interest to economists and econometricians: optimization, equilibrium, and learning. We offer the settable systems framework as an extension of the PCM that permits causal discourse in systems embodying optimization, equilibrium, and learning. Because these are common features of physical, natural, or social systems, our framework may prove generally useful for machine learning. Important features distinguishing the settable system framework from the PCM are its countable dimensionality and the use of partitioning and partition-specific response functions to accommodate the behavior of optimizing and interacting agents and to eliminate the requirement of a unique fixed point for the system. Refinements of the PCM include the settable systems treatment of attributes, the causal role of exogenous variables, and the dual role of variables as causes and responses. A series of closely related machine learning examples and examples from game theory and machine learning with feedback demonstrates some limitations of the PCM and motivates the distinguishing features of settable systems.]]></description>
<dc:subject>papers to-read causality control-theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:113d7c9fda33/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:causality"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1703.01670">
    <title>[1703.01670] Control Interpretations for First-Order Optimization Methods</title>
    <dc:date>2017-03-08T04:40:33+00:00</dc:date>
    <link>https://arxiv.org/abs/1703.01670</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[First-order iterative optimization methods play a fundamental role in large scale optimization and machine learning. This paper presents control interpretations for such optimization methods. First, we give loop-shaping interpretations for several existing optimization methods and show that they are composed of basic control elements such as PID and lag compensators. Next, we apply the small gain theorem to draw a connection between the convergence rate analysis of optimization methods and the input-output gain computations of certain complementary sensitivity functions. These connections suggest that standard classical control synthesis tools may be brought to bear on the design of optimization algorithms.]]></description>
<dc:subject>papers optimization control-theory have-read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:b3310a5bc067/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:have-read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1611.02635">
    <title>[1611.02635] A Lyapunov Analysis of Momentum Methods in Optimization</title>
    <dc:date>2016-11-23T05:27:12+00:00</dc:date>
    <link>https://arxiv.org/abs/1611.02635</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Momentum methods play a central role in optimization. Several momentum methods are provably optimal, and all use a technique called estimate sequences to analyze their convergence properties. The technique of estimate sequences has long been considered difficult to understand, leading many researchers to generate alternative, "more intuitive" methods and analyses. In this paper we show there is an equivalence between the technique of estimate sequences and a family of Lyapunov functions in both continuous and discrete time. This framework allows us to develop a simple and unified analysis of many existing momentum algorithms, introduce several new algorithms, and most importantly, strengthen the connection between algorithms and continuous-time dynamical systems.]]></description>
<dc:subject>papers to-read optimization dynamical-systems control-theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:313a13a0954c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1607.06494">
    <title>[1607.06494] Stochastic Control via Entropy Compression</title>
    <dc:date>2016-07-25T00:47:49+00:00</dc:date>
    <link>http://arxiv.org/abs/1607.06494</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[We consider an agent trying to bring a system to an acceptable state by repeated probabilistic action (stochastic control). Specifically, in each step the agent observes the flaws present in the current state, selects one of them, and addresses it by probabilistically moving to a new state, one where the addressed flaw is most likely absent, but where one or more new flaws may be present. Several recent works on algorithmizations of the Lov\'{a}sz Local Lemma have established sufficient conditions for such an agent to succeed. Motivated by the paradigm of Partially Observable Markov Decision Processes (POMDPs) we study whether such stochastic control is also possible in a noisy environment, where both the process of state-observation and the process of state-evolution are subject to adversarial perturbation (noise). The introduction of noise causes the tools developed for LLL algorithmization to break down since the key LLL ingredient, the sparsity of the causality (dependence) relationship, no longer holds. To overcome this challenge we develop a new analysis where entropy plays a central role, both to measure the rate at which progress towards an acceptable state is made and the rate at which the noise undoes this progress. The end result is a sufficient condition that allows a smooth tradeoff between the intensity of the noise and the amenability of the system, recovering an asymmetric LLL condition in the noiseless case. To our knowledge, this is the first tractability result for a nontrivial class of POMDPs under stochastic memoryless control.]]></description>
<dc:subject>papers to-read control-theory Markov-decision-processes information-theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:8e90a8909489/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:Markov-decision-processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:information-theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1510.04214">
    <title>[1510.04214] LQG Control with Minimal Information: Three-Stage Separation Principle and SDP-based Solution Synthesis</title>
    <dc:date>2015-10-15T03:08:47+00:00</dc:date>
    <link>http://arxiv.org/abs/1510.04214</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[In the interest of evaluating an information-theoretic requirement for feedback control, this paper proposes a framework to synthesize a control policy that minimizes Massey's directed information from the state sequence to the control sequence while attaining required Linear-Quadratic-Gaussian (LQG) control performance. Interpretation and significance of this framework is discussed in the context of networked control theory. As the main result, we show that an optimal control policy can be realized by an attractively simple three-stage decision architecture comprising (1) a linear sensor with additive Gaussian noise, (2) a Kalman filter, and (3) a certainty equivalence controller. This result suggests an integration of two separation principles previously known in the literature: the filter-controller separation principle in the LQG control theory, and the sensor-filter separation principle in zero-delay rate-distortion theory for Gauss-Markov sources. It is also shown that an optimal policy can be synthesized by semidefinite programming (SDP). Both time-varying finite-horizon problems and time-invariant infinite-horizon problems are considered. Our results can be viewed as a generalization of the data-rate theorem for mean-square stability by Nair and Evans, extended for a control performance analysis.]]></description>
<dc:subject>papers to-read information-theory control-theory rational-inattention filtering estimation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:268e8ef145e7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:information-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:rational-inattention"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:estimation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1405.6881">
    <title>[1405.6881] Categories in Control</title>
    <dc:date>2015-06-28T03:52:01+00:00</dc:date>
    <link>http://arxiv.org/abs/1405.6881</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Control theory uses "signal-flow diagrams" to describe processes where real-valued functions of time are added, multiplied by scalars, differentiated and integrated, duplicated and deleted. These diagrams can be seen as string diagrams for the symmetric monoidal category FinVect_k of finite-dimensional vector spaces over the field of rational functions k = R(s), where the variable s acts as differentiation and the monoidal structure is direct sum rather than the usual tensor product of vector spaces. For any field k we give a presentation of FinVect_k in terms of the generators used in signal flow diagrams. A broader class of signal-flow diagrams also includes "caps" and "cups" to model feedback. We show these diagrams can be seen as string diagrams for the symmetric monoidal category FinRel_k, where objects are still finite-dimensional vector spaces but the morphisms are linear relations. We also give a presentation for FinRel_k. The relations say, among other things, that the 1-dimensional vector space k has two special commutative dagger-Frobenius structures, such that the multiplication and unit of either one and the comultiplication and counit of the other fit together to form a bimonoid. This sort of structure, but with tensor product replacing direct sum, is familiar from the "ZX-calculus" obeyed by a finite-dimensional Hilbert space with two mutually unbiased bases.]]></description>
<dc:subject>papers to-read categories control-theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:39266b4a2702/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:categories"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1408.3595">
    <title>[1408.3595] Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints</title>
    <dc:date>2014-08-19T03:28:02+00:00</dc:date>
    <link>http://arxiv.org/abs/1408.3595</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[This manuscript develops a new framework to analyze and design iterative optimization algorithms built on the notion of Integral Quadratic Constraints (IQC) from robust control theory. IQCs provide sufficient conditions for the stability of complicated interconnected systems, and these conditions can be checked by semidefinite programming. We discuss how to adapt IQC theory to study optimization algorithms, proving new inequalities about convex functions and providing a version of IQC theory adapted for use by optimization researchers. Using these inequalities, we derive upper bounds on convergence rates for the gradient method, the heavy-ball method, Nesterov's accelerated method, and related variants by solving small, simple semidefinite programming problems. We also briefly show how these techniques can be used to search for optimization algorithms with desired performance characteristics, establishing a new methodology for algorithm design.]]></description>
<dc:subject>papers to-read optimization control-theory dynamical-systems semidefinite-programming</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:2cd785e3b2a0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:semidefinite-programming"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1311.5918">
    <title>[1311.5918] Empirical Dynamic Programming</title>
    <dc:date>2013-12-02T01:23:26+00:00</dc:date>
    <link>http://arxiv.org/abs/1311.5918</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[We propose empirical dynamic programming algorithms for Markov decision processes (MDPs). In these algorithms, the exact expectation in the Bellman operator in classical value iteration is replaced by an empirical estimate to get `empirical value iteration' (EVI). Policy evaluation and policy improvement in classical policy iteration are also replaced by simulation to get `empirical policy iteration' (EPI). Thus, these empirical dynamic programming algorithms involve iteration of a random operator, the empirical Bellman operator. We introduce notions of probabilistic fixed points for such random monotone operators. We develop a stochastic dominance framework for convergence analysis of such operators. We then use this to give sample complexity bounds for both EVI and EPI. We then provide various variations and extensions to asynchronous empirical dynamic programming, the minimax empirical dynamic program, and show how this can also be used to solve the dynamic newsvendor problem. Preliminary experimental results suggest a faster rate of convergence than stochastic approximation algorithms.]]></description>
<dc:subject>papers to-read dynamic-programming control-theory Markov-decision-processes</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:344b48f7cf85/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamic-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:Markov-decision-processes"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1203.1429">
    <title>[1203.1429] Probabilistic Optimal Estimation and Filtering under Uncertainty</title>
    <dc:date>2013-10-24T01:01:34+00:00</dc:date>
    <link>http://arxiv.org/abs/1203.1429</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>papers to-read control-theory estimation system-identification complexity adaptive-systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:d9b31a46e283/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:system-identification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:adaptive-systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://hrl.harvard.edu/publications/">
    <title>Publications: Harvard Robotics Laboratory</title>
    <dc:date>2013-10-09T02:24:31+00:00</dc:date>
    <link>http://hrl.harvard.edu/publications/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>papers control-theory robotics dynamical-systems differential-geometry</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:b0c259724979/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:robotics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:differential-geometry"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://books.nips.cc/papers/files/nips25/bibhtml/NIPS2012_1237.html">
    <title>Efficient Reinforcement Learning for High Dimensional Linear Quadratic Systems (NIPS 2012)</title>
    <dc:date>2013-01-21T01:14:17+00:00</dc:date>
    <link>http://books.nips.cc/papers/files/nips25/bibhtml/NIPS2012_1237.html</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>papers to-read adaptive-systems control-theory re:adaptive_control_project</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:3eae0b85976a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:adaptive-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:re:adaptive_control_project"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.ams.sunysb.edu/~feinberg/">
    <title>Professor Eugene A. Feinberg</title>
    <dc:date>2012-08-17T21:12:20+00:00</dc:date>
    <link>http://www.ams.sunysb.edu/~feinberg/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>people homepages papers research control-theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:754e6d18e512/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:people"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:homepages"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1204.5721">
    <title>[1204.5721] Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems</title>
    <dc:date>2012-04-27T18:20:30+00:00</dc:date>
    <link>http://arxiv.org/abs/1204.5721</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Multi-armed bandit problems are the most basic examples of sequential decision problems with an exploration-exploitation trade-off. This is the balance between staying with the option that gave highest payoffs in the past and exploring new options that might give higher payoffs in the future. Although the study of bandit problems dates back to the Thirties, exploration-exploitation trade-offs arise in several modern applications, such as ad placement, website optimization, and packet routing. Mathematically, a multi-armed bandit is defined by the payoff process associated with each option. In this survey, we focus on two extreme cases in which the analysis of regret is particularly simple and elegant: i.i.d. payoffs and adversarial payoffs. Besides the basic setting of finitely many actions, we also analyze some of the most important variants and extensions, such as the contextual bandit model.]]></description>
<dc:subject>papers to-read bandit-problems online-learning control-theory dynamic-programming decision-making</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:11d540786e36/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:bandit-problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:online-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamic-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:decision-making"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.stanford.edu/~boyd/papers/pdf/adp_iter_bellman.pdf">
    <title>&quot;Approximate dynamic programming via Bellman inequalities&quot; (Wang and Boyd)</title>
    <dc:date>2012-04-17T02:12:37+00:00</dc:date>
    <link>http://www.stanford.edu/~boyd/papers/pdf/adp_iter_bellman.pdf</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA["In this paper we introduce new methods for ﬁnding functions that lower bound
the value function of a stochastic control problem, using an iterated form of the Bellman inequality. Our method is based on solving linear or semideﬁnite programs, and
produces both a bound on the optimal objective, as well as a suboptimal policy that
appears to works very well. These results extend and improve bounds obtained by
authors in a previous paper using a single Bellman inequality condition. We describe
the methods in a general setting, and show how they can be applied in speciﬁc cases
including the ﬁnite state case, constrained linear quadratic control, switched aﬃne
control, and multi-period portfolio investment."]]></description>
<dc:subject>papers to-read control-theory dynamic-programming optimization</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:b0771149d366/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamic-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1203.4626">
    <title>[1203.4626] Active Sequential Hypothesis Testing</title>
    <dc:date>2012-03-22T00:38:37+00:00</dc:date>
    <link>http://arxiv.org/abs/1203.4626</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Consider a decision maker who is responsible to dynamically collect observations so as to enhance his information in a speedy manner about an underlying phenomena of interest while accounting for the penalty of wrong declaration. The special cases of the problem are shown to be that of variable-length coding with feedback and noisy dynamic search. Due to the sequential nature of the problem, the decision maker relies on his current information state to adaptively select the most "informative" sensing action among the available ones. 
In this paper, using results in dynamic programming, a lower bound for the optimal total cost is established. Moreover, upper bounds are obtained via an analysis of heuristic policies for dynamic selection of actions. It is shown that the proposed heuristics achieve asymptotic optimality in many practically relevant problems including the problems of variable-length coding with feedback and noisy dynamic search; where asymptotic optimality implies that the relative difference between the total cost achieved by the proposed policies and the optimal total cost approaches zero as the penalty of wrong declaration or the number of hypotheses (hence the number of collected samples) increases. Furthermore, using the obtained bounds, the gain of adaptive selection of sensing actions is shown to be at least logarithmic in the penalty associated with wrong declarations.]]></description>
<dc:subject>papers to-read control-theory information-theory adaptive-systems heard-the-talk</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:f4add78bdb48/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:information-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:adaptive-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:heard-the-talk"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://ideas.repec.org/a/fip/fedgpr/y2005p17-38.html">
    <title>Certainty equivalence and model uncertainty</title>
    <dc:date>2012-02-25T16:23:11+00:00</dc:date>
    <link>http://ideas.repec.org/a/fip/fedgpr/y2005p17-38.html</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Simon’s and Theil’s certainty equivalence property justifies a convenient algorithm for solving dynamic programming problems with quadratic objectives and linear transition laws: first, optimize under perfect foresight, then substitute optimal forecasts for unknown future values. A similar decomposition into separate optimization and forecasting steps prevails when a decision maker wants a decision rule that is robust to model misspecification. Concerns about model misspecification leave the first step of the algorithm intact and affect only the second step of forecasting the future. The decision maker attains robustness by making forecasts with a distorted model that twists probabilities relative to his approximating model. The appropriate twisting emerges from a two-player zero-sum dynamic game.]]></description>
<dc:subject>papers to-read adaptive-systems control-theory dynamic-programming estimation game-theory uncertainty</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:d06e26b7fc8e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:adaptive-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamic-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:game-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:uncertainty"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>