Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

0111 · Jul 201219922001200920172026
8 results for overconstrained

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.

We show how to solve a number of problems in numerical linear algebra, such as least squares regression, p\ell_p-regression for any p1p \geq 1, low rank approximation, and kernel regression, in time $T(A) \poly(\log(nd))$, where for a given input matrix ARn×dA \in \mathbb{R}^{n \times d}, T(A)T(A) is the time needed to com…

2019-12-12abs ↗pdf ↗

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.

We provide fast algorithms for overconstrained p\ell_p regression and related problems: for an n×dn\times d input matrix AA and vector bRnb\in\mathbb{R}^n, in O(ndlogn)O(nd\log n) time we reduce the problem minxRdAxbp\min_{x\in\mathbb{R}^d} \|Ax-b\|_p to the same problem with input matrix A~\tilde A of dimension s×ds \times d and corr…

2012-07-19abs ↗pdf ↗

In the total least squares problem, one is given an m×nm \times n matrix AA, and an m×dm \times d matrix BB, and one seeks to "correct" both AA and BB, obtaining matrices A^\hat{A} and B^\hat{B}, so that there exists an XX satisfying the equation A^X=B^\hat{A}X = \hat{B}. Typically the problem is overconstrained, meanin…

2019-09-27abs ↗pdf ↗