Related papers: An improved example for an autoconvolution inequal…
It is known that the Frank-Wolfe (FW) algorithm, which is affine-covariant, enjoys accelerated convergence rates when the constraint set is strongly convex. However, these results rely on norm-dependent assumptions, usually incurring…
In a previous paper it was shown that the Forward Euler method applied to differential inclusions where the right-hand side is a Lipschitz continuous set-valued function with uniformly bounded, compact values, converges with rate one. The…
Tuning hyperparameters, such as the stepsize, presents a major challenge of training machine learning models. To address this challenge, numerous adaptive optimization algorithms have been developed that achieve near-optimal complexities,…
We test for departures from normal and independent and identically distributed (NIID) returns, when returns under the alternative hypothesis are self-affine. Self-affine returns are either fractionally integrated and long-range dependent,…
Let $f$ be a normalized, ordinary newform of weight $\ge 2$. For each prime $\mathfrak{p}$ of $F=\mathbb{Q}(a_n)_{n\in \mathbb{N}}$, there is an associated $\mathfrak{p}$-adic $L$-function $\mathcal{L}_\mathfrak{p}(f)\in \Lambda \otimes…
This article presents a randomized matrix-free method for approximating the trace of $f({\bf A})$, where ${\bf A}$ is a large symmetric matrix and $f$ is a function analytic in a closed interval containing the eigenvalues of ${\bf A}$. Our…
Let $L$ be a sectorial operator of type $\alpha$ ($0 \leq \alpha < \pi/2$) on $L^2(\mathbb{R}^d)$ with the kernels of $\{e^{-tL}\}_{t>0}$ satisfying certain size and regularity conditions. Define $$ S_{q,L}(f)(x) =…
Motivated by a discrete inequality problem proposed by Duanyang Zhang as Problem 6 of the 2022 Spring NSMO, we prove a median version of Hardy's inequality. For a nonnegative function $f\in L^p(0,\infty)$, $p>1$, let $A(t)$ be the average…
We find two-sided estimates for Kolmogorov, Bernstein, linear and projection widths of the classes of convolutions of $2\pi$-periodic functions $\varphi$, such that $\|\varphi\|_2\le1$, with fixed generated kernels $\Psi_{\bar{\beta}}$,…
Flow-based vision-language-action (VLA) models excel in embodied control but suffer from intractable likelihoods during multi-step sampling, hindering online reinforcement learning. We propose \textbf{\textit{$\boldsymbol{\pi}$-StepNFT}}…
We obtain an interesting inequalities for uniformly continuous functions in the normed spaces: $\|f(x)\|\leq a\|x\|+b$ for some $a,b> 0$.
In this paper we give a streamlined proof of an inequality recently obtained by the author: For every $\alpha \in (0,1)$ there exists a constant $C=C(\alpha,d)>0$ such that \begin{align*} \|u\|_{L^{d/(d-\alpha),1}(\mathbb{R}^d)} \leq C \|…
The error autocorrection effect means that in a calculation all the intermediate errors compensate each other, so the final result is much more accurate than the intermediate results. In this case standard interval estimates are too…
Fix a constant $0<\alpha <1$. For a $C^1$ function $f:\mathbb{R}^k\rightarrow \mathbb{R}$, a point $x$ and a positive number $\delta >0$, we say that Armijo's condition is satisfied if $f(x-\delta \nabla f(x))-f(x)\leq -\alpha \delta…
Surprisingly, recent work has shown that gradient descent can be accelerated without using momentum -- just by judiciously choosing stepsizes. An open question raised by several papers is whether this phenomenon of stepsize-based…
In our recent work, the sampling and reconstruction of non-decaying signals, modeled as members of weighted-$L_p$ spaces, were shown to be stable with an appropriate choice of the generating kernel for the shift-invariant reconstruction…
We introduce a general method, named the h-function method, to unify the constructions of level-alpha exact test and 1-alpha exact confidence interval. Using this method, any confidence interval is improved as follows: i) an approximate…
We propose an adaptive variance-reduction method, called AdaSpider, for minimization of $L$-smooth, non-convex functions with a finite-sum structure. In essence, AdaSpider combines an AdaGrad-inspired [Duchi et al., 2011, McMahan &…
The question-answering (QA) capabilities of foundation models are highly sensitive to prompt variations, rendering their performance susceptible to superficial, non-meaning-altering changes. This vulnerability often stems from the model's…
Present work contains a method to obtain Jackson and Stechkin type inequalities of approximation by integral functions of finite degree (IFFD) in some variable exponent Lebesgue space of real functions defined on $\boldsymbol{R}:=\left(…