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.

169,341 papers · 148 categories

Trend · papers per month

count% of corpus
1122 · Jun 201819922001200920182026
3 results for “k-DNF”
Conditional Sparse ℓp\ell_p-norm Regression With Optimal Probabilitycs.LG

New algorithms find conditions and linear rules with high probability and loss.

problem Finding conditions and rules with high probability and loss in conditional sparse regression.
method Efficient algorithms for identifying conditions and rules with optimal probability and loss.
result Achieved algorithms that nearly match the probability of the ideal condition and improve the approximation to the target loss.
Conditional Sparse Regressionk-DNFOptimal ProbabilityLoss ApproximationSparse Regression
2018-06-26abs ↗pdf ↗
Conditional Sparse Linear Regressioncs.LG

The paper tackles identifying a small segment of a population with sparse linear regression.

problem Identifying a small segment of a population with a sparse linear regression fit.
method Algorithms for joint identification of a significant segment of a population with a sparse linear regression fit under the sup norm, using k-DNF conditions and s-sparse regression fits.
result Preliminary algorithms and challenges for future work in non-sparse regression and expected error.
sparse linear regressionpopulation segmentationsup normk-DNFsparse fit
2016-08-18abs ↗pdf ↗