Related papers: Efficient Weighted Counting of Multiset Derangemen…
An explicit formula for a weight enumerator of linear-congruence codes is provided. This extends the work of Bibak and Milenkovic [IEEE ISIT (2018) 431-435] addressing the binary case to the non-binary case. Furthermore, the extension…
Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply to many more permutation classes and describe the Maple package WILFPLUS,…
It is shown how to compute quotients efficiently in non-commutative univariate polynomial rings. This extends earlier work where efficient generic quotients were studied with a primary focus on commutative domains. Fast algorithms are given…
We present an algorithm to compute exact literal-weighted model counts of Boolean formulas in Conjunctive Normal Form. Our algorithm employs dynamic programming and uses Algebraic Decision Diagrams as the primary data structure. We…
The Multilevel Monte Carlo (MLMC) method has been applied successfully in a wide range of settings since its first introduction by Giles (2008). When using only two levels, the method can be viewed as a kind of control-variate approach to…
The success of deep learning hinges on enormous data and large models, which require labor-intensive annotations and heavy computation costs. Subset selection is a fundamental problem that can play a key role in identifying smaller portions…
We revisit $R$-polynomials with introducing the new idea ``shifted $R$-polynomials" (or Bruhat weight) for all Bruhat intervals in finite Coxeter groups. Then, we apply these polynomials to weighted counting of Bruhat paths. Further, we…
Addressing the computational challenges inherent in training large-scale deep neural networks remains a critical endeavor in contemporary machine learning research. While previous efforts have focused on enhancing training efficiency…
In this paper, we study the weighted estimates for multilinear Calder\'{o}n-Zygmund operators %with multiple $A_{\vec{P}}$ weights from $L^{p_1}(w_1)\times...\times L^{p_m}(w_m)$ to $L^{p}(v_{\vec{w}})$, where $1<p, p_1,...,p_m<\infty$ with…
We modify the enumeration schemes of Zeilberger and Vatter so that they can efficiently enumerate many new classes of pattern-avoiding permutations including all such classes with a regular insertion encoding.
Determining the weight distribution of a code is an old and fundamental topic in coding theory that has been thoroughly studied. In 1977, Helleseth, Kl{\o}ve, and Mykkeltveit presented a weight enumerator polynomial of the lifted code over…
In this paper, the following iterated commutators $T_{*,\Pi b}$ of maximal operator for multilinear singular integral operators and $I_{\alpha, \Pi b}$ of multilinear fractional integral operator are introduced and studied $$\aligned…
We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a…
We suggest efficient and provable methods to compute an approximation for imbalanced point clustering, that is, fitting $k$-centers to a set of points in $\mathbb{R}^d$, for any $d,k\geq 1$. To this end, we utilize \emph{coresets}, which,…
We compute asymptotic non-linear shrinkage formulas for covariance and precision matrix estimators for weighted sample covariances, and the joint sample-population eigenvector overlap distribution, in the spirit of Ledoit and P\'ech\'e. We…
Weighted model integration (WMI) extends Weighted model counting (WMC) to the integration of functions over mixed discrete-continuous domains. It has shown tremendous promise for solving inference problems in graphical models and…
Permutation symmetries of deep networks make basic operations like model merging and similarity estimation challenging. In many cases, aligning the weights of the networks, i.e., finding optimal permutations between their weights, is…
We discuss a new weighted likelihood method for parametric estimation. The method is motivated by the need for generating a simple estimation strategy which provides a robust solution that is simultaneously fully efficient when the model is…
In this paper, we discuss the convergence of an Algebraic MultiGrid (AMG) method for general symmetric positive-definite matrices. The method relies on an aggregation algorithm, named \emph{coarsening based on compatible weighted matching},…
I describe an empirical-yet-rigorous, algorithm, based on Riordan's rook polynomials and the so-called C-finite ansatz, fully implemented in the accompanying Maple package (http://www.math.rutgers.edu/~zeilberg/tokhniot/MENAGES ), MENAGES,…