相关论文: Variants of Solovay reducibility

The Hardy-Littlewood maximal operator satisfies the classical Sawyer-type estimate $$ \left \Vert \frac{Mf}{v}\right \Vert_{L^{1,\infty}(uv)} \leq C_{u,v} \Vert f \Vert_{L^{1}(u)}, $$ where $u\in A_1$ and $uv\in A_{\infty}$. We prove a…

We present a multi-variable extension of Rubio de Francia's restricted weak-type extrapolation theory that does not involve Rubio de Francia's iteration algorithm; instead, we rely on the following Sawyer-type inequality for the weighted…

Given a bivariate random pair $(X,Y)$, a natural problem is to estimate, from a single sample $(X_i,Y_i)_{1\le i\le n}$, quantities such as $\mathbb{E}\left[ \mathbb{E}[ Y\mid X ]^2 \right]$. More broadly, sensitivity indices are designed…

We introduce a finite version of free probability and show the link between recent results using polynomial convolutions and the traditional theory of free probability. One tool for accomplishing this is a seemingly new transformation that…

We propose a program for bridging the gap between the perturbative BV-BFV quantization of Chern-Simons theory and the non-perturbative Reshetikhin-Turaev (RT) invariants of 3-manifolds, passing through factorization homology of…

Rowmotion is a certain well-studied bijective operator on the distributive lattice $J(P)$ of order ideals of a finite poset $P$. We introduce the rowmotion Markov chain ${\bf M}_{J(P)}$ by assigning a probability $p_x$ to each $x\in P$ and…

We formulate a classification conjecture for conformally invariant families of measures on simple loops that builds on a conjecture of Kontsevich and Suhov. The main example in this class of objects was constructed by Werner as boundaries…

We present a general subadditivity inequality for log-Sobolev constants of convolution measures. As a corollary, we show that the log-Sobolev constant is monotone along the sequence of standardized convolutions in the central limit theorem.

Virtually all state-of-the-art methods for training supervised machine learning models are variants of SGD enhanced with a number of additional tricks, such as minibatching, momentum, and adaptive stepsizes. One of the tricks that works so…

We show that under certain boundedness condition, a $C^{r}$ conservative irrational pseudo-rotations on $\mathbb{T}^2$ with a generic rotation vector is $C^{r-1}$-rigid. We also obtain $C^0$-rigidity for H\"older pseudo-rotations with…

This paper explores a novel definition of Schnorr randomness for noncomputable measures. We say $x$ is uniformly Schnorr $\mu$-random if $t(\mu,x)<\infty$ for all lower semicomputable functions $t(\mu,x)$ such that $\mu\mapsto\int…

Recent works have shown that Neural Machine Translation (NMT) models achieve impressive performance, however, questions about understanding the behavior of these models remain unanswered. We investigate the unexpected volatility of NMT…

Semiclassical asymptotics for linear Schr\"odinger equations with non-smooth potentials give rise to ill-posed formal semiclassical limits. These problems have attracted a lot of attention in the last few years, as a proxy for the treatment…

The celebrated theorem of Kechris, Pestov and Todor\v{c}evi\'c connecting structural Ramsey theory with topological dynamics has as a consequence that the Fra\"{\i}ss\'e limit of a Ramsey class of non-trivial finite relational structures…

This work investigates the invariance of the non-necessarily finite uniform dimension and related concepts for subextensions in skew polynomial rings \mbox{$ \mathbb{S}=R[ \mathbf{\mathrm{X}}; \mathbf{\alpha} , \mathbf{\delta} ]$} of…

The $\epsilon$-logic (which is called $\epsilon$E-logic in this paper) of Kuyper and Terwijn is a variant of first order logic with the same syntax, in which the models are equipped with probability measures and in which the $\forall x$…

It is well-known that duality in the Monge-Kantorovich transport problem holds true provided that the cost function $c:X\times Y\to [0,\infty]$ is lower semi-continuous or finitely valued, but it may fail otherwise. We present a suitable…

An explanation to the boundness of minimal log discrepancies conjectured by V.V. Shokurov would be that the minimal log discrepancies of a variety in its closed points define a lower semi-continuous function. We check this lower…

Word reordering is one of the most difficult aspects of statistical machine translation (SMT), and an important factor of its quality and efficiency. Despite the vast amount of research published to date, the interest of the community in…

We give a sufficient and necessary condition for a probability measure $\mu$ on the real line to satisfy the logarithmic Sobolev inequality for convex functions. The condition is expressed in terms of the unique left-continuous and…