相关论文: Comparing DNR and WWKL

This paper uses the framework of reverse mathematics to investigate the strength of two recurrence theorems of topological dynamics. It establishes that one of these theorems, the existence of an almost periodic point, lies strictly between…

In their Comment, Wei et al. (arXiv:1809.08360v1 [cs.LG]) claim that our original interpretation of Diffractive Deep Neural Networks (D2NN) represent a mischaracterization of the system due to linearity and passivity. In this Response, we…

Recurrent neural networks have gained widespread use in modeling sequential data. Learning long-term dependencies using these models remains difficult though, due to exploding or vanishing gradients. In this paper, we draw connections…

We show in Bishop's constructive mathematics---in particular, using countable choice---that weak K\"{o}nig's lemma implies the uniform continuity theorem.

In reverse mathematics, is is possible to have a curious situation where we know that an implication does not reverse, but appear to have no information on on how to weaken the assumption while preserving the conclusion. A main cause of…

Motivated by the very recent work of Gao, Y., Chen, J., Wang, J., Zou, H. [Comm. Algebra, 49(8) (2021) 3241-3254; MR4283143], we introduce two new generalized inverses named weak Drazin (WD) and weak Drazin Moore-Penrose (WDMP) inverses for…

If a symmetric multilinear algebra is weakly nil, then it is Engel. This result may be regarded as an infinite-dimensional analogue of the well-known Jacobian theorem, which states that if a polynomial mapping has a polynomial inverse, then…

We introduce an operator on problems in Weihrauch complexity, which we call the inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a…

We use the framework of reverse mathematics to address the question of, given a mathematical problem, whether or not it is easier to find an infinite partial solution than it is to find a complete solution. Following Flood, we say that a…

We study a general class of quasilinear elliptic equations with nonstandard growth to prove the existence of a very weak solution to such a problem. A key ingredient in the proof is a priori global weighted gradient estimate of a very weak…

In his book, John Stillwell wrote "finding the exact strength of the Brouwer invariance theorems seems to me one of the most interesting open problems in reverse mathematics." In this article, we solve Stillwell's problem by showing that…

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

We show a reduction method to construct a code for the Gray-Wyner (GW) network from a given code for the Wyner-Ahlswede-K\"orner (WAK) network. By combining this reduction with a converse bound on the GW network, we derive a converse bound…

Reverse Mathematics (RM) is a program in the foundations of mathematics founded by Friedman and developed extensively by Simpson. The aim of RM is finding the minimal axioms needed to prove a theorem of ordinary (i.e. non-set theoretical)…

We extend the Weak Adversarial Neural Pushforward Method to the Wigner transport equation governing the phase-space dynamics of quantum systems. The central contribution is a structural observation: integrating the nonlocal…

A new semiclassical approach to linear (L) and nonlinear (NL) one-dimensional Schr\"odinger equation (SE) is presented. Unlike the usual WKB solution, our solution does not diverge at the classical turning point. For LSE, our zeroth-order…

This paper presents a reverse mathematical analysis of several forms of the sorites paradox. We first illustrate how traditional formulations are reliant on H\"older's Representation Theorem for ordered Archimedean groups. While this is…

Learning effective regularization is crucial for solving ill-posed inverse problems, which arise in a wide range of scientific and engineering applications. While data-driven methods that parameterize regularizers using deep neural networks…

We show that the natural directed analogues of the KKL theorem [KKL88] and the Eldan--Gross inequality [EG20] from the analysis of Boolean functions fail to hold. This is in contrast to several other isoperimetric inequalities on the…

Deep representations have shown promising performance when transferred to downstream tasks in a black-box manner. Yet, their inherent lack of interpretability remains a significant challenge, as these features are often opaque to human…