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,657 papers · 148 categories

Trend · papers per month

0111 · Apr 201719922001200920172026
7 results for Spectrahedron

Efficiently implements MEG for low-rank matrix optimization problems.

problem Optimization over spectrahedron with low-rank matrices.
method Matrix Exponentiated Gradient (MEG) method with efficient implementations.
result Methods converge from a warm-start initialization with similar rates to full-SVD-based counterparts.

We study the structure of the set of algebraic curvature operators satisfying a sectional curvature bound under the light of the emerging field of Convex Algebraic Geometry. More precisely, we determine in which dimensions nn this convex semialgebraic set is a spectrahedron or a spectrahedral shadow; in particular, fo…

2019-08-10abs ↗pdf ↗

We consider the problem of learning a low-rank matrix, constrained to lie in a linear subspace, and introduce a novel factorization for modeling such matrices. A salient feature of the proposed factorization scheme is it decouples the low-rank and the structural constraints onto separate factors. We formulate the optim…

2017-04-24abs ↗pdf ↗

Study on likelihood functions, associative equations, and Frobenius manifolds.

problem Maximum likelihood estimation and associativity equations in statistical models.
method Analyzes the cone of concentration matrices, log-likelihood function, and Frobenius manifolds.
result Maximum likelihood degree is indexed by components of Frobenius residuals.

Spectrahedral regression fits convex functions via a non-convex optimization problem.

problem Fitting convex functions to data sets.
method Fitting a spectrahedral function (maximum eigenvalue of an affine matrix expression) to the data via an alternating minimization algorithm.
result The alternating minimization algorithm converges geometrically to a small ball around the optimal parameter.

A new sampling method for log-concave distributions with warm starts and barriers.

problem Sampling from log-concave distributions constrained by convex bodies with barriers.
method Robust sampling framework using spectral approximations to Hessian of barrier functions.
result Improved mixing times for polytopes and spectrahedra, faster than previous methods.