Related papers: Module Lattice Security (Part II): Module Lattice …
Incorporating a non-Euclidean variable metric to first-order algorithms is known to bring enhancement. However, due to the lack of an optimal choice, such an enhancement appears significantly underestimated. In this work, we establish a…
We seek shifted lattice rules that are good for high dimensional integration over the unit cube in the setting of an unanchored weighted Sobolev space of functions with square-integrable mixed first derivatives. Many existing studies rely…
We study the problem of estimating a low-rank positive semidefinite (PSD) matrix from a set of rank-one measurements using sensing vectors composed of i.i.d. standard Gaussian entries, which are possibly corrupted by arbitrary outliers.…
We propose a localized divide and conquer algorithm for inverse factorization $S^{-1} = ZZ^*$ of Hermitian positive definite matrices $S$ with localized structure, e.g. exponential decay with respect to some given distance function on the…
Following G.~Gr\"atzer and E.~Knapp, 2009, a planar semimodular lattice $L$ is \emph{rectangular}, if~the left boundary chain has exactly one doubly-irreducible element, $c_l$, and the right boundary chain has exactly one doubly-irreducible…
Recent work have shown that the quantization for matrix multiplication problem can be optimally solved by quantizing each column in each matrix using a nested lattice code, and then multiplying the de-quantized matrices. It was further…
A method for finding an optimum $n$-dimensional commutative group code of a given order $M$ is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of…
Low-density parity-check (LDPC) codes form part of the IRIG-106 standard and have been successfully deployed for the Telemetry Group version of shaped-offset quadrature phase shift keying (SOQPSK-TG) modulation. Recently, LDPC code…
We systematically examine various proposals which aim at increasing the accuracy in the determination of the renormalization of two-fermion lattice operators. We concentrate on three finite quantities which are particularly suitable for our…
A number of old and new methods for computing $K\to\pi\pi$ amplitudes on the lattice are reevaluated. They all involve a non-perturbative determination of matching coefficients. I will show how problems related to operator mixing can be…
Low-rank matrix completion consists of computing a matrix of minimal complexity that recovers a given set of observations as accurately as possible. Unfortunately, existing methods for matrix completion are heuristics that, while highly…
Several more and more efficient component--by--component (CBC) constructions for suitable rank-1 lattices were developed during the last decades. On the one hand, there exist constructions that are based on minimizing some error functional.…
Lattice reduction (LR) is a preprocessing technique for multiple-input multiple-output (MIMO) symbol detection to achieve better bit error-rate (BER) performance. In this paper, we propose a customized homogeneous multiprocessor for LR. The…
Lattice reduction is a combinatorial optimization problem aimed at finding the most orthogonal basis in a given lattice. The Lenstra-Lenstra-Lov\'asz (LLL) algorithm is the best algorithm in the literature for solving this problem. In light…
Lattice QCD should allow a derivation of the $\Delta I=1/2$ rule from first principles, but numerical calculations to date have been plagued by a variety of problems. After a brief review of these problems, we present several new methods…
We explore the breaking of rotational symmetry on the lattice for bound state energies and practical methods for suppressing this breaking. We demonstrate the general problems associated with lattice discretization errors and finite-volume…
Lattice reduction is a popular preprocessing strategy in multiple-input multiple-output (MIMO) detection. In a quest for developing a low-complexity reduction algorithm for large-scale problems, this paper investigates a new framework…
The study of the CKM matrix elements with increasing precision requires a reliable evaluation of hadronic matrix elements of axial and vector currents which can be done with Lattice QCD. The tiniest entry, |V_{ub}|, can be estimated…
For constrained, not necessarily monotone submodular maximization, all known approximation algorithms with ratio greater than $1/e$ require continuous ideas, such as queries to the multilinear extension of a submodular function and its…
Transformer-based PDE surrogates achieve remarkable performance but face two key challenges: fixed patch sizes cause systematic error accumulation at harmonic frequencies, and computational costs remain inflexible regardless of problem…