BACK TO INDEX

Publications of Eduardo D. Sontag jointly with F. Albertini
Articles in journal or book chapters
  1. F. Albertini and E.D. Sontag. Continuous control-Lyapunov functions for asymptotically controllable time-varying systems. Internat. J. Control, 72(18):1630-1641, 1999. [PDF] Keyword(s): control-Lyapunov functions.
    Abstract:
    This paper shows that, for time varying systems, global asymptotic controllability to a given closed subset of the state space is equivalent to the existence of a continuous control-Lyapunov function with respect to the set.


  2. F. Albertini and E.D. Sontag. Further results on controllability properties of discrete-time nonlinear systems. Dynam. Control, 4(3):235-253, 1994. [PDF] [doi:http://dx.doi.org/10.1007/BF01985073] Keyword(s): discrete-time, nonlinear control.
    Abstract:
    Controllability questions for discrete-time nonlinear systems are addressed in this paper. In particular, we continue the search for conditions under which the group-like notion of transitivity implies the stronger and semigroup-like property of forward accessibility. We show that this implication holds, pointwise, for states which have a weak Poisson stability property, and globally, if there exists a global "attractor" for the system.


  3. F. Albertini and E.D. Sontag. State observability in recurrent neural networks. Systems Control Lett., 22(4):235-244, 1994. [PDF] [doi:http://dx.doi.org/10.1016/0167-6911(94)90054-X] Keyword(s): neural networks, recurrent neural networks, observability, identifiability.
    Abstract:
    This paper concerns recurrent networks x'=s(Ax+Bu), y=Cx, where s is a sigmoid, in both discrete time and continuous time. Our main result is that observability can be characterized, if one assumes certain conditions on the nonlinearity and on the system, in a manner very analogous to that of the linear case. Recall that for the latter, observability is equivalent to the requirement that there not be any nontrivial A-invariant subspace included in the kernel of C. We show that the result generalizes in a natural manner, except that one now needs to restrict attention to certain special "coordinate" subspaces.


  4. F. Albertini, E.D. Sontag, and V. Maillot. Uniqueness of weights for neural networks. In R. Mammone, editor, Artificial Neural Networks for Speech and Vision, pages 115-125. Chapman and Hall, London, 1993. [PDF] Keyword(s): neural networks, recurrent neural networks.
    Abstract:
    In this short expository survey, we sketch various known facts about uniqueness of weights in neural networks, including results about recurrent nets, and we provide a new and elementary complex-variable proof of a uniqueness result that applies in the single hidden layer case.


  5. F. Albertini and E.D. Sontag. Discrete-time transitivity and accessibility: analytic systems. SIAM J. Control Optim., 31(6):1599-1622, 1993. [PDF] [doi:http://dx.doi.org/10.1137/0331075]
    Abstract:
    A basic open question for discrete-time nonlinear systems is that of determining when, in analogy with the classical continuous-time "positive form of Chow's Lemma", accessibility follows from transitivity of a natural group action. This paper studies the problem, and establishes the desired implication for analytic systems in several cases: (i) compact state space, (ii) under a Poisson stability condition, and (iii) in a generic sense. In addition, the paper studies accessibility properties of the "control sets" recently introduced in the context of dynamical systems studies. Finally, various examples and counterexamples are provided relating the various Lie algebras introduced in past work.


  6. F. Albertini and E.D. Sontag. For neural networks, function determines form. Neural Networks, 6(7):975-990, 1993. [PDF] Keyword(s): neural networks, identifiability, recurrent neural networks, realization theory, observability, neural networks.
    Abstract:
    This paper shows that the weights of continuous-time feedback neural networks x'=s(Ax+Bu), y=Cx (where s is a sigmoid) are uniquely identifiable from input/output measurements. Under very weak genericity assumptions, the following is true: Assume given two nets, whose neurons all have the same nonlinear activation function s; if the two nets have equal behaviors as "black boxes" then necessarily they must have the same number of neurons and -except at most for sign reversals at each node- the same weights. Moreover, even if the activations are not a priori known to coincide, they are shown to be also essentially determined from the external measurements.


  7. F. Albertini and E.D. Sontag. Transitivity and forward accessibility of discrete-time nonlinear systems. In Analysis of controlled dynamical systems (Lyon, 1990), volume 8 of Progr. Systems Control Theory, pages 21-34. Birkhäuser Boston, Boston, MA, 1991.


Conference articles
  1. F. Albertini and E.D. Sontag. Control-Lyapunov functions for time-varying set stabilization. In Proc. European Control Conf., Brussels, July 1997, 1997. Note: (Paper WE-E A5, CD-ROM file ECC515.pdf, 6 pages). Keyword(s): control-Lyapunov functions.


  2. F. Albertini and E.D. Sontag. Controllability of discrete-time nonlinear systems. In Systems and Networks: Mathematical Theory and Applications, Proc. MTNS '93, Vol. 2, Akad. Verlag, Regensburg, pages 35-38, 1993.


  3. F. Albertini and E.D. Sontag. Identifiability of discrete-time neural networks. In Proc. European Control Conf., Groningen, June 1993, pages 460-465, 1993. Keyword(s): neural networks, recurrent neural networks.


  4. F. Albertini and E.D. Sontag. State observability in recurrent neural networks. In Proc. IEEE Conf. Decision and Control, San Antonio, Dec. 1993, IEEE Publications, 1993, pages 3706-3707, 1993. Keyword(s): neural networks, observability, recurrent neural networks.


  5. F. Albertini and E.D. Sontag. Uniqueness of weights for recurrent nets. In Systems and Networks: Mathematical Theory and Applications, Proc. MTNS '93, Vol. 2, Akad. Verlag, Regensburg, pages 599-602, 1993. Note: Full version, never submitted for publication, is here: http://www.math.rutgers.edu/(tilde)sontag/FTPDIR/93mtns-nn-extended.pdf. [PDF] Keyword(s): neural networks, identifiability, recurrent neural networks.
    Abstract:
    This paper concerns recurrent networks x'=s(Ax+Bu), y=Cx, where s is a sigmoid, in both discrete time and continuous time. The paper establishes parameter identifiability under stronger assumptions on the activation than in "For neural networks, function determines form", but on the other hand deals with arbitrary (nonzero) initial states.


  6. F. Albertini and E.D. Sontag. For neural networks, function determines form. In Proc. IEEE Conf. Decision and Control, Tucson, Dec. 1992, IEEE Publications, 1992, pages 26-31, 1992. Keyword(s): neural networks, recurrent neural networks.


  7. F. Albertini and E.D. Sontag. Accessibility of discrete-time nonlinear systems, and some relations to chaotic dynamics. In Proc. Conf. Inform. Sci. and Systems, John Hopkins University, March 1991, pages 731-736, 1991.


  8. F. Albertini and E.D. Sontag. Some connections between chaotic dynamical systems and control systems. In Proc. European Control Conf. , Vol 1, Grenoble, July 1991, pages 58-163, 1991. [PDF] Keyword(s): chaotic systems, controllability.
    Abstract:
    This paper shows how to extend recent results of Colonius and Kliemann, regarding connections between chaos and controllability, from continuous to discrete time. The extension is nontrivial because the results all rely on basic properties of the accessibility Lie algebra which fail to hold in discrete time. Thus, this paper first develops further results in nonlinear accessibility, and then shows how a theorem can be proved, which while analogous to the one given in the work by Colonius and Klieman, also exhibits some important differences. A counterexample is used to show that the theorem given in continuous time cannot be generalized in a straightforward manner.


Internal reports
  1. F. Albertini and E.D. Sontag. Some connections between chaotic dynamical systems and control systems. Technical report SYCON-90-13, Rutgers Center for Systems and Control, 1990.



BACK TO INDEX




Disclaimer:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders.




Last modified: Thu Nov 23 10:40:56 2017
Author: sontag.


This document was translated from BibTEX by bibtex2html