arXiv Machine Learning By Spencer Compton, Tselil Schramm

Algorithms for adaptive and heteroskedastic linear regression at the computational threshold

Read the original on arXiv Machine Learning →

arXiv:2608. 18402v1 Announce Type: cross Abstract: We study finite-sample linear regression in the presence of varied and unknown label noise, focusing on the heteroskedastic and adaptive linear regression models.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jun 18

How fast can you find a good hypothesis?

arXiv:2509. 03734v3 Announce Type: replace-cross Abstract: In the hypothesis selection problem, we are given sample and query access to finite set of candidate distributions (hypotheses), $\mathcal{H} = \{H_1, \ldots, H_n\}$, and samples from an unknown distribution $P$, both over a domain $\mathcal{X}$.

By Anders Aamand, Maryam Aliakbarpour, Justin Y. Chen, Sandeep Silwal
arXiv Machine Learning
Jul 14

Demixing Sparse Signals from Nonlinear Observations using Generalized Non-convex Regularization

arXiv:2607. 10618v1 Announce Type: cross Abstract: We consider the recovery of a pair of sparse vectors from a limited number of nonlinear observations of their superposition: $y_i=g(\inner{\ba_i}{\bPhi\bw^\ast+\bPsi\bz^\ast})+e_i$, $i=1,\dots,m$, with $m\ll n$, incoherent orthonormal bases $\bPhi,\bPsi$, a scalar link $g$, and noise $e_i$ that may be heavy-tailed or contaminated.

By Raziyeh Takbiri
arXiv Statistics ML
Oct 1

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.

By Hajo Holzmann, Alexander Meister