arXiv Machine Learning By Samuel B. Hopkins, Stefan Tiegel

Algorithms with Polynomially-Improved Approximation Factors for the $2 \rightarrow q$ Norm, and Applications

Read the original on arXiv Machine Learning →

arXiv:2605. 25303v3 Announce Type: replace-cross Abstract: The $2 \rightarrow q$ norm of a matrix $X \in \mathbb{R}^{n \times d}$ is defined as $\lVert X \rVert_{2 \rightarrow q} = \sup_{\lVert v \rVert_2 = 1} \lVert Xv \rVert_q$.

Summary generated by The Flow from the publisher's feed. 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
Aug 12

High-Dimensional Calibration from Swap Regret

arXiv:2505. 21460v2 Announce Type: replace Abstract: We study online calibration of multi-dimensional forecasts over an arbitrary convex set $P \subset \mathbb{R}^d$ relative to an arbitrary norm $|\cdot|$.

By Maxwell Fishelson, Noah Golowich, Mehryar Mohri, Jon Schneider