相关论文: Sharper Bounds on Four Lattice Constants

The cascaded or central-moments-based lattice Boltzmann method (CM-LBM) is a robust alternative to the more conventional BGK-LBM for the simulation of high-Reynolds number flows. Unfortunately, its original formulation makes its extension…

Robustness of deep neural networks against adversarial perturbations is a pressing concern motivated by recent findings showing the pervasive nature of such vulnerabilities. One method of characterizing the robustness of a neural network…

In 1946, Behrend gave a construction of dense finite sets of integers that do not contain 3-term arithmetic progressions. In 1961, Rankin generalized Behrend's construction to sets avoiding k-term arithmetic progressions, and in 2008 Elkin…

Zero-forcing (ZF) decoder is a commonly used approximation solution of the integer least squares problem which arises in communications and many other applications. Numerically simulations have shown that the LLL reduction can usually…

We establish sharp estimates for the convergence rate of the Kranosel'ski\v{\i}-Mann fixed point iteration in general normed spaces, and we use them to show that the asymptotic regularity bound recently proved in [11] (Israel Journal of…

The mean squared error and regularized versions of it are standard loss functions in supervised machine learning. However, calculating these losses for large data sets can be computationally demanding. Modifying an approach of J. Dick and…

Our aim is to compute the lower moments of the unpolarized and polarized deep-inelastic structure functions of the nucleon on the lattice. The theoretical basis of the calculation is the operator product expansion. To construct operators…

This is an expository paper intended to introduce the polynomial time lattice basis reduction algorithm first described by Arjen Lenstra, Hendrik Lenstra, and L\'aszl\'o Lov\'asz in 1982. We begin by introducing the shortest vector problem,…

We propose a recursive lattice reduction framework for finding short non-zero vectors or dense sublattices of a lattice. The framework works by recursively searching for dense sublattices of dense sublattices (or their duals) with…

Since the control of the Lipschitz constant has a great impact on the training stability, generalization, and robustness of neural networks, the estimation of this value is nowadays a real scientific challenge. In this paper we introduce a…

We derive upper and lower bounds on the overall compression ratio of the 1978 Lempel-Ziv (LZ78) algorithm, applied independently to $k$-blocks of a finite individual sequence. Both bounds are given in terms of normalized empirical entropies…

QCD in two dimensions is investigated using the improved fermionic lattice Hamiltonian proposed by Luo, Chen, Xu, and Jiang. We show that the improved theory leads to a significant reduction of the finite lattice spacing errors. The quark…

Let $\mathbb{R}^m$ be endowed with the Euclidean metric. The covering radius of a lattice $\Lambda \subset \mathbb{R}^m$ is the least distance $r$ such that, given any point of $\mathbb{R}^m$, the distance from that point to $\Lambda$ is…

We suggest a new derivation of a kinetic equation of Kolmogorov-Zakharov (KZ) type for the spectrum of the weakly nonlinear Schr\"odinger equation with stochastic forcing. The kynetic equation is obtained as a result of a double limiting…

Effective hyper-parameter tuning is essential to guarantee the performance that neural networks have come to be known for. In this work, a principled approach to choosing the learning rate is proposed for shallow feedforward neural…

A concise theoretical framework, the $\textit{partial}$ Gauss-Hermite quadrature (pGHQ), is established for constructing on-node lattices of the lattice Boltzmann (LB) method under a Cartesian coordinate system. Comparing with existing…

We develop a topological framework for proving lower bounds on sign-rank via $\mathbb{Z}_2$-equivariant topology, and use it to resolve the sign-rank of the Gap Hamming Distance problem up to lower-order terms. For every (partial) sign…

Lehmann, Symanzik and Zimmermann (LSZ) proved a theorem showing how to obtain the S-matrix from time-ordered Green functions. Their result, the reduction formula, is fundamental to practical calculations of scattering processes. A known…

Minkowski proved that any $n$-dimensional lattice of unit determinant has a nonzero vector of Euclidean norm at most $\sqrt{n}$; in fact, there are $2^{\Omega(n)}$ such lattice vectors. Lattices whose minimum distances come close to…

A genie-aided decoder for finite dimensional lattice codes is considered. The decoder may exhaustively search through all possible scaling factors $\alpha \in \mathbb{R}$. We show that this decoder can achieve lower word error rate (WER)…