arXiv Statistics ML
Optimal Allocation and Volume under Surface
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Sep 25
A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle Model
The paper establishes nearly quadratic lower bounds for randomized algorithms that perform linear optimization and uniform sampling over convex bodies using a membership oracle. It shows that the lower bound for linear optimization matches the best known upper bound up to a polylogarithmic factor in the dimension, while the bound for uniform sampling improves upon the previous linear lower bound. Additionally, the authors demonstrate that their construction yields the same lower bound for volume estimation.
arXiv Machine Learning
Jul 7
Improved generalization bounds for binary linear classification via isoperimetry
arXiv:2505. 16713v3 Announce Type: replace-cross Abstract: We examine the concentration of uniform generalization errors around their expectation in binary linear classification problems via an isoperimetric argument.
arXiv Machine Learning
Jul 28
Minimax Lower Bounds of Kernel Discrepancy Estimation: MMD, HSIC, KSD
arXiv:2607. 24235v1 Announce Type: cross Abstract: Over the past 20 years, kernel discrepancies have been leveraged as a highly powerful tool for quantifying the disagreement of distributions, with numerous successful applications in two-sample, goodness-of-fit, and independence testing, among others.
arXiv Machine Learning
Jul 13
Near-optimal Delta-convex Estimation of Lipschitz Functions
arXiv:2511. 15615v2 Announce Type: replace-cross Abstract: This paper presents a tractable algorithm for estimating an unknown Lipschitz function from noisy observations and establishes an upper bound on its convergence rate.
Hugging Face Trending Papers
Sep 22
Generalized Deep Regression for Repeated Measurements
In this paper, we study the estimation of a marginal regression function from independent units with repeated binary, count, or continuous responses using ReLU deep neural networks. In the model, we a...
arXiv Statistics ML
3d ago
Local polynomial density ratio estimation
arXiv:2609. 38412v1 Announce Type: cross Abstract: We propose a novel local-polynomial estimator of the ratio $r=f/g$ of two $d$-dimensional densities $f$ and $g$, from which independent samples are available.