Fundamental limits of distributed multiclass classification from simple binary decisions

arXiv · Ioannis Papageorgiou · 3d ago · 1 min · 0 views

Signal strength 14/100

We consider the problem of constructing a $K$-class classifier from the combination of $O(\log K)$ simple binary classifiers -- this is a natural paradigm to construct a sophisticated classifier in a distributed manner with each agent performing a relatively…

PRISM indexes and ranks — it never republishes. The full piece lives with its author on arxiv.org.

Read on arxiv.org

#stat-ml #cs-it #cs-lg #math-st #paper #ai

↳

Same wavelength

Stories the engine considers adjacent to this one.

Research arXiv 1d ago

Zero-Flow Two-Sample Tests

We propose a new approach to two-sample testing for deciding whether two sets of samples are drawn from the same distribution. The test is built on a statistical discrepancy based on the zero-flow criterion, termed zero-flow discrepancy (ZFD). We prove the…

1 min 0 views

Research arXiv 2d ago

Lipschitzian SLLNs for random functions

We prove strong laws of large numbers for locally Lipschitz functions in the Lipschitz pseudometric. Our results hold under either a topological or a model-theoretic condition, with the latter encompassing functions jointly definable in o-minimal structures…

1 min 0 views

Research arXiv 3d ago

Adaptive deep nonparametric regression from dependent data under covariate shift

Covariate shift often occurs because, in many real applications, the source and the target observations may be generated from different distributions. In this case, the standard metric under the source distribution is not appropriate. This paper considers…

1 min 0 views

Research arXiv 1d ago

Expanding Flow Maps

Flow-based generative models have enabled remarkable progress in fast and controllable generation across continuous and discrete state spaces, yet existing parameterizations are constrained to fixed dimensions or fixed sequence lengths. Here, we introduce…

1 min 0 views