Related papers: Optimization and Identification of Lattice Quantiz…
In this paper we describe an algorithm that quickly computes a maximal a-valued lattice in an F-vector space equipped with a non-degenerate bilinear form, where a is a fractional ideal in a number field F. We then apply this construction to…
Recently, convex formulations of low-rank matrix factorization problems have received considerable attention in machine learning. However, such formulations often require solving for a matrix of the size of the data matrix, making it…
Recent work in machine learning community proposed multiple methods for performing lossy compression (quantization) of large matrices. This quantization is important for accelerating matrix multiplication (main component of large language…
Lattices are a popular field of study in mathematical research, but also in more practical areas like cryptology or multiple-input/multiple-output (MIMO) transmission. In mathematical theory, most often lattices over real numbers are…
We introduce an efficient lattice regularization scheme for quantum Monte Carlo calculations of realistic electronic systems. The kinetic term is discretized by a finite difference Laplacian with two mesh sizes, a and a', where a'/a is an…
A lattice reduction is an algorithm that transforms the given basis of the lattice to another lattice basis such that problems like finding a shortest vector and closest vector become easier to solve. Some of the famous lattice reduction…
Motivated by lattice mixture identification and grain boundary detection, we present a framework for lattice pattern representation and comparison, and propose an efficient algorithm for lattice separation. We define new scale and shape…
A non-perturbative algebraic theory of lattice Boltzmann method is developed based on a symmetry of a product. It involves three steps: (i) Derivation of admissible lattices in one spatial dimension through a matching condition which…
We present a novel methodology for convex optimization algorithm design using ideas from electric RLC circuits. Given an optimization problem, the first stage of the methodology is to design an appropriate electric circuit whose…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
We consider a deformation $E_{L,\Lambda}^{(m)}(it)$ of the Dedekind eta function depending on two $d$-dimensional simple lattices $(L,\Lambda)$ and two parameters $(m,t)\in (0,\infty)$, initially proposed by Terry Gannon. We show that the…
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…
Certain types of neurons, called "grid cells", have been shown to fire on a triangular grid when an animal is navigating on a two-dimensional environment, whereas recent studies suggest that the face-centred-cubic (FCC) lattice is the good…
The nearest lattice point problem in $\mathbb{R}^n$ is formulated in a distributed network with $n$ nodes. The objective is to minimize the probability that an incorrect lattice point is found, subject to a constraint on inter-node…
It is well-known that any Lennard-Jones type potential energy must have a periodic ground state given by a triangular lattice in dimension 2. In this paper, we describe a computer-assisted method that rigorously shows such global minimality…
A popular approach for predicting the future of dynamical systems involves mapping them into a lower-dimensional "latent space" where prediction is easier. We show that the information-theoretically optimal approach uses different mappings…
A lattice of integers is the collection of all linear combinations of a set of vectors for which all entries of the vectors are integers and all coefficients in the linear combinations are also integers. Lattice reduction refers to the…
We present an algorithm for minimizing an objective with hard-to-compute gradients by using a related, easier-to-access function as a proxy. Our algorithm is based on approximate proximal point iterations on the proxy combined with…
The Euclidean algorithm is one of the oldest algorithms known to mankind. Given two integral numbers $a_1$ and $a_2$, it computes the greatest common divisor (gcd) of $a_1$ and $a_2$ in a very elegant way. From a lattice perspective, it…
This work presents a computational method for the design of architected truss lattice materials where each strut can be made of one of a set of available materials. We design the lattices to extremize effective properties. As customary in…