Related papers: Comparing DNR and WWKL

This paper studies logical aspects of the notion of better quasi order, which has been introduced by C. Nash-Williams (Mathematical Proceedings of the Cambridge Philosophical Society 1965 & 1968). A central tool in the theory of better…

Deep neural networks (DNNs) exhibit a surprising structure in their final layer known as neural collapse (NC), and a growing body of works has currently investigated the propagation of neural collapse to earlier layers of DNNs -- a…

Deep learning (DL) has had unprecedented success and is now entering scientific computing with full force. However, current DL methods typically suffer from instability, even when universal approximation properties guarantee the existence…

A new O(N) algorithm based on a recursion method, in which the computational effort is proportional to the number of atoms N, is presented for calculating the inverse of an overlap matrix which is needed in electronic structure calculations…

Experiment shows that the reverse length-lexicographical word ordering consistently yields far smaller Gr\"obner bases for modular p-group algebras than the length-lexicographical ordering. For the so-called Jennings word ordering, based on…

In this paper, we introduce a class of singular integral operators which generalize Calder\'on-Zygmund operators to the more general case, where the set of singular points of the kernel need not to be the diagonal, but instead, it can be a…

Deep neural networks (DNNs) are shown to be vulnerable to adversarial examples. A well-trained model can be easily attacked by adding small perturbations to the original data. One of the hypotheses of the existence of the adversarial…

We present a novel approach (DyNODE) that captures the underlying dynamics of a system by incorporating control in a neural ordinary differential equation framework. We conduct a systematic evaluation and comparison of our method and…

In this work, a non-gradient descent learning (NGDL) scheme was proposed for deep feedforward neural networks (DNN). It is known that an autoencoder can be used as the building blocks of the multi-layer perceptron (MLP) DNN, the MLP is…

The basic system E of dyadic deontic logic proposed by {\AA}qvist offers a simple solution to contrary-to-duty paradoxes and allows to represent norms with exceptions. We investigate E from a proof-theoretical viewpoint. We propose a…

Systems of differential equations with polynomial right-hand sides are very common in applications. In particular, when restricted to the positive orthant, they appear naturally (according to the law of mass-action kinetics) in ecology,…

We define a hierarchy of circuit complexity classes LD^i, whose depth are the inverse of a function in Ackermann hierarchy. Then we introduce extremely weak versions of length induction and construct a bounded arithmetic theory L^i_2 whose…

The non-convex quadratic orogramming problem and the non-monotone linear complementarity problem are NP-complete problems. In this paper we first show taht the inverse problem of determinning a KKT point of the non-convex quadratic…

The polynomial and the adversary methods are the two main tools for proving lower bounds on query complexity of quantum algorithms. Both methods have found a large number of applications, some problems more suitable for one method, some for…

Systems of differential equations with polynomial right-hand sides are very common in applications. On the other hand, their mathematical analysis is very challenging in general, due to the possibility of complex dynamics: multiple basins…

In earlier work, we gave an oracle separating the relational versions of BQP and the polynomial hierarchy, and showed that an oracle separating the decision versions would follow from what we called the Generalized Linial-Nisan (GLN)…

Since the day the core inverse has been known in a paper of Bakasarly and Trenkler, it has been widely researched. So far, there are four generalizations of this inverse for the case of matrices of an arbitrary index, namely, the BT…

Weyl theory for Dirac systems with rectangular matrix potentials is non-classical. The corresponding Weyl functions are rectangular matrix functions. Furthermore, they are non-expansive in the upper semi-plane. Inverse problems are treated…

Recently, Malik and Ferreyra introduced the $m$-weak core inverse for complex square matrices which generalizes the core-EP inverse, the WC inverse, and therefore the core inverse. The main aim of this paper is to extend the concept of…

Deep learning algorithms have been recently targeted by attackers due to their vulnerability. Several research studies have been conducted to address this issue and build more robust deep learning models. Non-continuous deep models are…