1,564 research outputs found
Chaotic versus stochastic behavior in active-dissipative nonlinear systems
We study the dynamical state of the one-dimensional noisy generalized Kuramoto-Sivashinsky (gKS) equation by making use of time-series techniques based on symbolic dynamics and complex networks. We focus on analyzing temporal signals of global measure in the spatiotemporal patterns as the dispersion parameter of the gKS equation and the strength of the noise are varied, observing that a rich variety of different regimes, from high-dimensional chaos to pure stochastic behavior, emerge. Permutation entropy, permutation spectrum, and network entropy allow us to fully classify the dynamical state exposed to additive noise
The size ramsey number of graphs with bounded treewidth
A graph G is Ramsey for a graph H if every 2-coloring of the edges of G contains a monochromatic copy of H. We consider the following question: If H has bounded treewidth, is there a sparse graph G that is Ramsey for H? Two notions of sparsity are considered. Firstly, we show that if the maximum degree and treewidth of H are bounded, then there is a graph G with O(| V (H)| ) edges that is Ramsey for H. This was previously only known for the smaller class of graphs H with bounded bandwidth. On the other hand, we prove that in general the treewidth of a graph G that is Ramsey for H cannot be bounded in terms of the treewidth of H alone. In fact, the latter statement is true even if the treewidth is replaced by the degeneracy and H is a tree
Evaluating natural language processing models with generalization metrics that do not need access to any training or testing data
The search for effective and robust metrics has been the focus of recent
theoretical and empirical work on generalization of deep neural networks (NNs).
In this paper, we discuss the performance of natural language processing (NLP)
models, and we evaluate various existing and novel generalization metrics.
Compared to prior studies, we (i) focus on NLP instead of computer vision (CV),
(ii) focus on generalization metrics that predict test error instead of the
generalization gap, (iii) focus on generalization metrics that do not need the
access to data, and (iv) focus on the heavy-tail (HT) phenomenon that has
received comparatively less attention in the study of NNs. We extend recent
HT-based work which focuses on power law (PL) distributions, and we study
exponential and exponentially truncated power law (E-TPL) fitting to the
empirical spectral densities (ESDs) of weight matrices. Our empirical studies
are carried on (i) hundreds of Transformers trained in different settings, in
which we systematically vary different hyperparameters, (ii) a total of 51
pretrained Transformers from eight families of Huggingface NLP models,
including BERT, GPT2, etc., and (iii) a total of 28 existing and novel
generalization metrics. From our empirical analyses, we show that shape
metrics, or the metrics obtained from fitting the shape of the ESDs, perform
uniformly better at predicting generalization performance than scale metrics
commonly studied in the literature, as measured by the rank correlations with
the generalization performance. We also show that among the three HT
distributions considered in our paper, the E-TPL fitting of ESDs performs the
most robustly when the models are trained in experimental settings, while the
PL fitting achieves the best performance on well-trained Huggingface models,
and that both E-TPL and PL metrics (which are both shape metrics) outperform
scale metrics
Functionality, Polymorphism, and Concurrency: A Mathematical Investigation of Programming Paradigms
The search for mathematical models of computational phenomena often leads to problems that are of independent mathematical interest. Selected problems of this kind are investigated in this thesis. First, we study models of the untyped lambda calculus. Although many familiar models are constructed by order-theoretic methods, it is also known that there are some models of the lambda calculus that cannot be non-trivially ordered. We show that the standard open and closed term algebras are unorderable. We characterize the absolutely unorderable T-algebras in any algebraic variety T. Here an algebra is called absolutely unorderable if it cannot be embedded in an orderable algebra. We then introduce a notion of finite models for the lambda calculus, contrasting the known fact that models of the lambda calculus, in the traditional sense, are always non-recursive. Our finite models are based on Plotkin’s syntactical models of reduction. We give a method for constructing such models, and some examples that show how finite models can yield useful information about terms. Next, we study models of typed lambda calculi. Models of the polymorphic lambda calculus can be divided into environment-style models, such as Bruce and Meyer’s non-strict set-theoretic models, and categorical models, such as Seely’s interpretation in PL-categories. Reynolds has shown that there are no set-theoretic strict models. Following a different approach, we investigate a notion of non-strict categorical models. These provide a uniform framework in which one can describe various classes of non-strict models, including set-theoretic models with or without empty types, and Kripke-style models. We show that completeness theorems correspond to categorical representation theorems, and we reprove a completeness result by Meyer et al. on set-theoretic models of the simply-typed lambda calculus with possibly empty types. Finally, we study properties of asynchronous communication in networks of communicating processes. We formalize several notions of asynchrony independently of any particular concurrent process paradigm. A process is asynchronous if its input and/or output is filtered through a communication medium, such as a buffer or a queue, possibly with feedback. We prove that the behavior of asynchronous processes can be equivalently characterized by first-order axioms
Logical relations for coherence of effect subtyping
A coercion semantics of a programming language with subtyping is typically
defined on typing derivations rather than on typing judgments. To avoid
semantic ambiguity, such a semantics is expected to be coherent, i.e.,
independent of the typing derivation for a given typing judgment. In this
article we present heterogeneous, biorthogonal, step-indexed logical relations
for establishing the coherence of coercion semantics of programming languages
with subtyping. To illustrate the effectiveness of the proof method, we develop
a proof of coherence of a type-directed, selective CPS translation from a typed
call-by-value lambda calculus with delimited continuations and control-effect
subtyping. The article is accompanied by a Coq formalization that relies on a
novel shallow embedding of a logic for reasoning about step-indexing
The Chronus Quantum software package
The Chronus Quantum (ChronusQ) software package is an open source (under the GNU General Public License v2) software infrastructure which targets the solution of challenging problems that arise in ab initio electronic structure theory. Special emphasis is placed on the consistent treatment of time dependence and spin in the electronic wave function, as well as the inclusion of relativistic effects in said treatments. In addition, ChronusQ provides support for the inclusion of uniform finite magnetic fields as external perturbations through the use of gauge-including atomic orbitals. ChronusQ is a parallel electronic structure code written in modern C++ which utilizes both message passing implementation and shared memory (OpenMP) parallelism. In addition to the examination of the current state of code base itself, a discussion regarding ongoing developments and developer contributions will also be provided. This article is categorized under: Software > Quantum Chemistry Electronic Structure Theory > Ab Initio Electronic Structure Methods Electronic Structure Theory > Density Functional Theory
Gluing together proof environments: Canonical extensions of LF type theories featuring locks
© F. Honsell, L. Liquori, P. Maksimovic, I. Scagnetto This work is licensed under the Creative Commons Attribution License.We present two extensions of the LF Constructive Type Theory featuring monadic locks. A lock is a monadic type construct that captures the effect of an external call to an oracle. Such calls are the basic tool for gluing together diverse Type Theories and proof development environments. The oracle can be invoked either to check that a constraint holds or to provide a suitable witness. The systems are presented in the canonical style developed by the CMU School. The first system, CLLF/p,is the canonical version of the system LLF p, presented earlier by the authors. The second system, CLLF p?, features the possibility of invoking the oracle to obtain a witness satisfying a given constraint. We discuss encodings of Fitch-Prawitz Set theory, call-by-value λ-calculi, and systems of Light Linear Logic. Finally, we show how to use Fitch-Prawitz Set Theory to define a type system that types precisely the strongly normalizing terms
- …