New knots found with tough, unsliceable discs.
problem Finding tough knots that can't be sliced smoothly.
method Constructed infinitely many knots with non-approximable slice discs.
result Smoothly sliceable knots have non-approximable slice discs.
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
6 results for “non-approximable”
Efficiently selects predictors in sparse regression without approximations.
problem High computational cost in subset selection for sparse regression.
method Conditional uncorrelation formula and efficient non-approximate method.
result Significant reduction in computational complexity for subset selection.
Gradient descent struggles to achieve zero loss in deep learning models due to non-generic data distributions.
problem Achieving zero loss minimizers in deep learning networks.
method Analysis of gradient descent algorithm in deep learning, focusing on underparametrized networks.
result Zero loss minimization cannot be achieved generically in deep learning networks.
Strict Minimum Message Length (SMML) is an information-theoretic statistical inference method widely cited (but only with informal arguments) as providing estimations that are consistent for general estimation problems. It is, however, almost invariably intractable to compute, for which reason only approximations of it…
Nyström KPCA balances computational efficiency and statistical accuracy.
problem Computational burden in large sample situations for kernel methods.
method Theoretical analysis of Nyström approximate kernel principal component analysis (KPCA).
result Nyström approximate KPCA matches statistical performance of non-approximate KPCA while being computationally beneficial.
New method improves MAP inference for CGMs on path graphs, avoiding approximation and maintaining integrality.
problem Improving MAP inference for aggregated count data in CGMs with small values.
method Formulated as a minimum cost flow problem, solved using DCA with efficient subroutines.
result Outputs higher quality solutions than conventional methods.