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

Trend · papers per month

0.3%0.5%0.8%0.4% · Jun 201019922001200920172026
6 results for Covertype

Do two data samples come from different distributions? Recent studies of this fundamental problem focused on embedding probability distributions into sufficiently rich characteristic Reproducing Kernel Hilbert Spaces (RKHSs), to compare distributions by the distance between their embeddings. We show that Regularized Ma…

2013-05-02abs ↗pdf ↗

Paper tackles Byzantine attacks in distributed learning with a new ADMM method.

problem Byzantine workers sending arbitrary messages bias distributed learning.
method Byzantine-robust stochastic ADMM exploiting separable problem structure.
result Proposed method converges to optimal solution at O(1/k) rate.

Abc-boost is a new line of boosting algorithms for multi-class classification, by utilizing the commonly used sum-to-zero constraint. To implement abc-boost, a base class must be identified at each boosting step. Prior studies used a very expensive procedure based on exhaustive search for determining the base class at …

2010-06-25abs ↗pdf ↗

Signed Evidence Flow (SEF) combines fitted prediction with signed feature attributions to measure evidence conflict and stability.

problem Modern data analysis lacks mechanisms to show the clarity, conflict, or stability of evidence behind predictions.
method Signed Evidence Flow (SEF) combines fitted prediction with signed feature attributions.
result SEF measures conflict and stability, and shows that conflict can improve loss prediction beyond confidence.

A new method for multi-expert learning-to-defer avoids optimization issues.

problem Optimization issues in multi-expert learning-to-defer systems.
method A decoupled surrogate with a softmax classifier head and independent sigmoid heads per expert.
result First multi-expert L2D guarantee with a constant not growing with the expert pool.