相关论文: BMM is stronger than BSPFA

The relationship between overparameterization, stability, and generalization remains incompletely understood in the setting of discontinuous classifiers. We address this gap by establishing a generalization bound for finite function classes…

Constrained reinforcement learning is to maximize the expected reward subject to constraints on utilities/costs. However, the training environment may not be the same as the test one, due to, e.g., modeling error, adversarial attack,…

Supervaluational fixed-point theories of formal truth aim to amend an important shortcoming of fixed-point theories based on the Strong Kleene logic, namely, accounting for the truth of classical validities. In a celebrated paper, Andrea…

We investigate the effects of hidden matter condensation on supersymmetry breaking in supergravity models derived from free fermionic strings. We find that the minimum of the effective potential in the modulus direction depends strongly on…

In the absence of the Axiom of Choice, the "small" cardinal $\omega_1$ can exhibit properties more usually associated with large cardinals, such as strong compactness and supercompactness. For a local version of strong compactness, we say…

In the absence of the axiom of choice, the set-theoretic status of many natural statements about metrizable compact spaces is investigated. Some of the statements are provable in $\mathbf{ZF}$, some are shown to be independent of…

We introduce a probabilistic robustness measure for Bayesian Neural Networks (BNNs), defined as the probability that, given a test point, there exists a point within a bounded set such that the BNN prediction differs between the two. Such a…

We consider a deterministic system with two conserved quantities and infinity many invariant measures. However the systems possess a unique invariant measure when enough stochastic forcing and balancing dissipation are added. We then show…

Arguments about the conservation laws of energy and momentum in the micro-world being statistical or strict began in 1924, and conflicting viewpoints remain today. The former is mainly supported theoretically, but the latter has been proved…

I recently proposed a method of bosonization based on the use of coherent states of fermion composites, whose validity was restricted to smooth structure functions. In the present paper I remove this limitation and derive results which hold…

A More Sums Than Differences (MSTD, or sum-dominant) set is a finite set $A\subset \mathbb{Z}$ such that $|A+A|<|A-A|$. Though it was believed that the percentage of subsets of $\{0,...,n\}$ that are sum-dominant tends to zero, in 2006…

We continue [Sh:b, Ch XIII] and [Sh:410]. Let W be an inner model of ZFC. Let kappa be a cardinal in V. We say that kappa-covering holds between V and W iff for all X in V with X subseteq ON and V models |X|< kappa, there exists Y in W such…

It is shown that if every projective set of reals is Lebesgue measurable and has the property of Baire, if every projective set in the plane has a projective uniformization, and if Steel's K exists, then J^K_{\omega_1} \models "there are…

Deep Foundation Models (DFMs) offer unprecedented capabilities but their increasing complexity presents profound challenges to understanding their internal workings-a critical need for ensuring trust, safety, and accountability. As we…

We show that it is consistent from an inaccessible cardinal that classical Namba forcing has the weak $\omega_1$-approximation property. In fact, this is the case if $\aleph_1$-preserving forcings do not add cofinal branches to…

As an analogy of best separable approximation (BSA) in the framework of entanglement theory, here we concentrate on the notion of best incoherent approximation, with application to characterizing and quantifying quantum coherence. From both…

In this paper we consider the Foreman's maximality principle, which says that any non-trivial forcing notion either adds a new real or collapses some cardinals. We prove the consistency of some of its consequences. We prove that it is…

Whenever a mathematical proposition to be proved requires more information than it is contained in an axiomatic system, it can neither be proved nor disproved, i.e. it is undecidable, or logically undetermined, within this axiomatic system.…

We present a new proof of descent for stably dominated types in any theory, dropping the hypothesis of the existence of global invariant extensions. Additionally, we give a much simpler proof of descent for stably dominated types in…

Conformal prediction has emerged as a popular technique for facilitating valid predictive inference across a spectrum of machine learning models, under minimal assumption of exchangeability. Recently, Hoff (2023) showed that full conformal…