Random Alloy Codes and the Fundamental Limits of Coded Distributed Tensors
We extend coded distributed computing over finite fields to allow the number of workers to be larger than the field size. We give codes that work for fully g...
Recent Posts
Algebraic Geometric Rook Codes for Coded Distributed Computing
Tensors are a fundamental operation in distributed and are commonly distributed into multiple parallel tasks for large datasets. Stragglers and other failure...
Faster Groebner bases for Lie derivatives of ODE systems via monomial orderings
Symbolic computation for systems of differential equations is often computationally expensive. Many practical differential models have a form of polynomial o...
Root-Squaring for Root-Finding
The root-squaring iterations of Dandelin (1826), Lobachevsky (1834), and Gräffe (1837) recursively produce the coefficients of polynomials whose zeros are th...
Quantile Formulation for Optimization under a Qualitative Risk Constraint
This paper focuses on the pathologies of common gradient-based algorithms for solving optimization problems under probability constraints. These problems are...