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

count% of corpus
0.3%0.5%0.8%0.1% · Feb 202319922001200920172026
2 results for “PLS-completeness”
The Computational Complexity of Finding Stationary Points in Non-Convex Optimizationmath.OC

This paper tackles the computational complexity of finding approximate stationary points in non-convex optimization.

problem Finding approximate stationary points in non-convex optimization problems.
method PLS-completeness, zero-order algorithms, and gradient queries.
result The query complexity of finding approximate stationary points is Θ(1/ε) for d=2.
non-convex optimizationstationary pointsquery complexityPLS-completenesszero-order algorithms
2023-10-13abs ↗pdf ↗
Dynamic Debt Swapping in Financial Networkscs.DS

Debt swaps improve financial networks by optimizing clearing payments and stability.

problem Improving financial network stability and efficiency through debt swaps.
method Analyzing computational complexity of debt swaps, focusing on semi-positive swaps and v-improving swaps.
result Polynomial length of sequences of semi-positive v-improving swaps for ranking-based clearing, but NP-hard for arbitrary v-improving swaps.
Financial networksDebt swapsGraph theoryComplexityStability
2023-02-22abs ↗pdf ↗