The recently proposed Minimal Complexity Machine (MCM) finds a hyperplane classifier by minimizing an exact bound on the Vapnik-Chervonenkis (VC) dimension. The VC dimension measures the capacity of a learning machine, and a smaller VC dimension leads to improved generalization. On many benchmark datasets, the MCM gene…
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.
Trend · papers per month
New framework for weakly supervised learning from label proportions.
Arriving at the complete probabilistic knowledge of a domain, i.e., learning how all variables interact, is indeed a demanding task. In reality, settings often arise for which an individual merely possesses partial knowledge of the domain, and yet, is expected to give adequate answers to a variety of posed queries. Tha…
Selective imputation improves treatment effect estimation from missing data.
An almost Robinson structure on an -dimensional Lorentzian manifold $(\mcM,g)$, where , , is a complex -plane distribution $\mcN$ that is totally null with respect to the complexified metric, and intersects its complex conjugate in a real null line distribution $\mcK$, say. When $\mcN$ an…
BERT improves machines' ethical and moral decision-making.