Related papers: An LLL algorithm with symmetries
Linear regression is effective at identifying interpretable trends in a data set, but averages out potentially different effects on subgroups within data. We propose an iterative algorithm based on the randomized Kaczmarz (RK) method to…
We describe all supergroups with the largest even supersubgroups being isomorphic to $\mathrm{GL}_2, \mathrm{SL}_2$ or $\mathrm{PSL}_2$. These results are applied to the description of centralizers of certain tori in the quasi-reductive…
The constructive Lov\'{a}sz Local Lemma has become a central tool for designing efficient distributed algorithms. While it has been extensively studied in the classic LOCAL model that uses unlimited bandwidth, much less is known in the…
A stochastic iterative algorithm approximating second-order information using von Neumann series is discussed. We present convergence guarantees for strongly-convex and smooth functions. Our analysis is much simpler in contrast to a similar…
Let $M$ be a squarefree positive integer and $P$ a prime number coprime to $M$ such that $P\sim M^\eta$ with $0 < \eta < 2/5$. We simplify the proof of subconvexity bounds for $L(\frac{1}{2},f\otimes\chi)$ when $f$ is a primitive…
The Logarithmic Linear Relaxation (LLR) algorithm is an efficient method for computing densities of states for systems with a continuous spectrum. A key feature of this method is exponential error reduction, which allows us to evaluate the…
Group sparsity combines the underlying sparsity and group structure of the data in problems. We develop a proximally linearized algorithm InISSAPL for the non-Lipschitz group sparse $\ell_{p,q}$-$\ell_r$ optimization problem.
We propose a functional description of rewriting systems where reduction rules are represented by linear maps called reduction operators. We show that reduction operators admit a lattice structure. Using this structure we define the notion…
It is shown that, given a lattice H in a totally disconnected, locally compact group G, the contraction subgroups in G and the values of the scale function on G are determined by their restrictions to H. Group theoretic properties intrinsic…
A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…
The gradient descent (GD) method -- is a fundamental and likely the most popular optimization algorithm in machine learning (ML), with a history traced back to a paper in 1847 (Cauchy, 1847). It was studied under various assumptions,…
We propose a novel algorithm with a modified Tucker decomposition for tensor network that allows for efficiently and precisely calculating the ground state and thermodynamic properties of two-dimensional (2D) quantum spin lattice systems,…
Let $L$ be an even (positive definite) lattice and $g\in O(L)$. In this article, we prove that the orbifold vertex operator algebra $V_{L}^{\hat{g}}$ has group-like fusion if and only if $g$ acts trivially on the discriminant group…
We show that any first order ordinary differential equation with a known Lie point symmetry group can be discretized into a difference scheme with the same symmetry group. In general, the lattices are not regular ones, but must be adapted…
Sparse linear regression (SLR) is a well-studied problem in statistics where one is given a design matrix $X\in\mathbb{R}^{m\times n}$ and a response vector $y=X\theta^*+w$ for a $k$-sparse vector $\theta^*$ (that is, $\|\theta^*\|_0\leq…
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…
Lattice regularizations are pivotal in the non-perturbative quantization of gauge field theories. Wilson's proposal to employ group-valued link fields simplifies the regularization of gauge fields in principal fiber bundles, preserving…
A new structure, based on joining copies of a group by means of a \emph{twist}, has recently been considered to describe the brackets of the two exceptional real Lie algebras of type $G_2$ in a highly symmetric way. In this work we show…
We give very precise bounds for the congruence subgroup growth of arithmetic groups. This allows us to determine the subgroup growth of irreducible lattices of semisimple Lie groups. In the most general case our results depend on the…
The Ginsparg-Wilson relation is extended to interacting field theories with general linear symmetries. Our relation encodes the remnant of the original symmetry in terms of the blocked fields and guides the construction of invariant lattice…