Paper analyzes a three-loop linkage, showing it's overconstrained and shaky.
problem Analyzing a three-loop spatial linkage's degree of freedom and configuration space.
method Local analysis of differential degrees of freedom, computation of kinematic tangent cone, and c-space approximation.
result The linkage has a finite degree of freedom 3 and is locally a smooth manifold, making it shaky.
Study of rigid body displacements in a projective space over dual numbers with geometric interpretations.
problem Understanding rigid body displacements in a novel geometric space.
method Projective differential geometry over the ring of dual numbers.
result Existence of non-straight curves with multiple osculating tangents.
New algorithms solve linear algebra problems in sublinear time.
problem Numerical linear algebra problems, especially with structured matrices.
method Sublinear time algorithms using matrix-vector multiplications.
result Solve problems like least squares regression and low rank approximation in sublinear time.
This paper explores how boolean formulas can be learned by deep neural networks.
problem Understanding the learnability of boolean formulas by deep neural networks.
method Analysis of boolean formulas associated with model-sampling benchmarks, combinatorial optimization problems, and random 3-CNFs.
result Neural networks outperform rule-based systems and pure symbolic approaches in learning boolean formulas.
Symmetry in neural networks affects generalization, as shown by CLT and RG transformations.
problem Improving generalization in neural networks by incorporating physical symmetries.
method Evaluation of symmetry constraints and expressivity in MLPs and GNNs using the CLT as a test case.
result Overly complex or overconstrained models generalize poorly, revealing a competition between symmetry constraints and expressivity.
In this era of large-scale data, distributed systems built on top of clusters of commodity hardware provide cheap and reliable storage and scalable processing of massive data. Here, we review recent work on developing and implementing randomized matrix algorithms in large-scale parallel and distributed environments. Ra…
We provide fast algorithms for overconstrained ℓp regression and related problems: for an n×d input matrix A and vector b∈Rn, in O(ndlogn) time we reduce the problem minx∈Rd∥Ax−b∥p to the same problem with input matrix A~ of dimension s×d and corr…
In the total least squares problem, one is given an m×n matrix A, and an m×d matrix B, and one seeks to "correct" both A and B, obtaining matrices A^ and B^, so that there exists an X satisfying the equation A^X=B^. Typically the problem is overconstrained, meanin…