Stochastic recurrent neural networks with latent random variables of complex dependency structures have shown to be more successful in modeling sequential data than deterministic deep models. However, the majority of existing methods have limited expressive power due to the Gaussian assumption of latent variables. In this paper, we advocate learning implicit latent representations using semi-implicit variational inference to further increase model flexibility. Semi-implicit stochastic recurrent neural network (SIS-RNN) is developed to enrich inferred model posteriors that may have no analytic density functions, as long as independent random samples can be generated via reparameterization. Extensive experiments in different tasks on real-world datasets show that SIS-RNN outperforms the existing methods.
more »
« less
Integration on the surreals
Conway’s real closed field No of surreal numbers is a sweeping generalization of the real numbers and the ordinals to which a number of elementary functions such as log and exponentiation have been shown to extend. The problems of identifying significant classes of functions that can be so extended and of defining integration for them have proven to be formidable. In this paper we address this and related unresolved issues by showing that extensions to No, and thereby integrals, exist for most functions arising in practical applications. In particular, we show they exist for a large subclass of the resurgent functions, a subclass that contains the functions that at ∞ are semi-algebraic, semi-analytic, analytic, meromorphic, and Borel summable as well as solutions to nonresonant linear and nonlinear meromorphic systems of ODEs or of difference equations. By suitable changes of variables we deal with arbitrarily located singular points. We further establish a sufficient condition for the theory to carry over to ordered exponential subfields of No more generally and illustrate the result with structures familiar from the surreal literature. The extensions of functions and integrals that concern us are constructive in nature, which permits us to work in NBG less the Axiom of Choice (for both sets and proper classes). Following the completion of the positive portion of the paper, it is shown that the existence of such constructive extensions and integrals of substantially more general types of functions (e.g.
more »
« less
- Award ID(s):
- 2206241
- PAR ID:
- 10535584
- Editor(s):
- Springer
- Publisher / Repository:
- Advances in Mathematics
- Date Published:
- Journal Name:
- Advances in Mathematics
- Volume:
- 452
- Issue:
- C
- ISSN:
- 0001-8708
- Page Range / eLocation ID:
- 109823
- Subject(s) / Keyword(s):
- Surreal numbers Surreal integration Divergent asymptotic series Transseries
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
A realization is a triple, (A,b,c), consisting of a d−tuple, A=(A1,⋯,Ad), d∈N, of bounded linear operators on a separable, complex Hilbert space, H, and vectors b,c∈H. Any such realization defines an analytic non-commutative (NC) function in an open neighbourhood of the origin, 0:=(0,⋯,0), of the NC universe of d−tuples of square matrices of any fixed size. For example, a univariate realization, i.e., where A is a single bounded linear operator, defines a holomorphic function of a single complex variable, z, in an open neighbourhood of the origin via the realization formula b∗(I−zA)−1c . It is well known that an NC function has a finite-dimensional realization if and only if it is a non-commutative rational function that is defined at 0 . Such finite realizations contain valuable information about the NC rational functions they generate. By extending to infinite-dimensional realizations, we construct, study and characterize more general classes of analytic NC functions. In particular, we show that an NC function is (uniformly) entire if and only if it has a jointly compact and quasinilpotent realization. Restricting our results to one variable shows that a formal Taylor series extends globally to an entire or meromorphic function in the complex plane, C, if and only if it has a realization whose component operator is compact and quasinilpotent, or compact, respectively. This motivates our definition of the field of global (uniformly) meromorphic NC functions as the field of fractions generated by NC rational expressions in the ring of NC functions with jointly compact realizations. This definition recovers the field of meromorphic functions in C when restricted to one variable.more » « less
-
Abstract We show that abelian surfaces (and consequently curves of genus 2) over totally real fields are potentially modular. As a consequence, we obtain the expected meromorphic continuation and functional equations of their Hasse–Weil zeta functions. We furthermore show the modularity of infinitely many abelian surfaces $$A$$ A over $${\mathbf {Q}}$$ Q with $$\operatorname{End}_{ {\mathbf {C}}}A={\mathbf {Z}}$$ End C A = Z . We also deduce modularity and potential modularity results for genus one curves over (not necessarily CM) quadratic extensions of totally real fields.more » « less
-
null (Ed.)Abstract In this paper, we introduce an algorithm for computing $$p$$-adic integrals on bad reduction hyperelliptic curves. For bad reduction curves, there are two notions of $$p$$-adic integration: Berkovich–Coleman integrals, which can be performed locally, and abelian integrals with desirable number-theoretic properties. By covering a bad reduction hyperelliptic curve with basic wide-open sets, we reduce the computation of Berkovich–Coleman integrals to the known algorithms on good reduction hyperelliptic curves. These are due to Balakrishnan, Bradshaw, and Kedlaya and to Balakrishnan and Besser for regular and meromorphic $$1$$-forms, respectively. We then employ tropical geometric techniques due to the 1st-named author with Rabinoff and Zureick-Brown to convert the Berkovich–Coleman integrals into abelian integrals. We provide examples of our algorithm, verifying that certain abelian integrals between torsion points vanish.more » « less
-
Many synthesis and verification problems can be reduced to determining the truth of formulas over the real numbers. These formulas often involve constraints with integrals in them. To this end, we extend the framework of δ-decision procedures with techniques for handling integrals of user-specified real functions. We implement this decision procedure in the tool ∫dReal, which is built on top of dReal. We evaluate ∫dReal on a suite of problems that include formulas verifying the fairness of algorithms and the privacy and the utility of privacy mechanisms and formulas that synthesize parameters for the desired utility of privacy mechanisms. The performance of the tool in these experiments demonstrates the effectiveness of ∫dReal.more » « less
An official website of the United States government

