2 problems
- 0 votes0 replies0 views
The AIT covering-number conjecture for optimal data-point selection
The optimal number of data points refers to the number of data points selected from an algorithmic information theory (AIT) perspective, and covering numbers are the quantities use…
- 0 votes0 replies0 views
Conjecture on a simple closed-form leverage score bound for optimal sample complexity
Simple closed-form leverage score conjecture. In general, a simple closed-form leverage score bound achieving within a constant factor of the optimal sample complexity exists.