Math 2.0

Resources / preprint

Low-Budget Active Learning through Entropic Optimal Transport XZ4MRWR77Q

URIm2://res/XZ4MRWR77Q
Kindpreprint
CreatorsRim Hajal, Mathieu Besançon, Jérôme Malick
Date2026-10-01
Subjectsarxiv cs.LG, arxiv math.OC
Scopeborder

Expressions

e1: version, preprint

Date2026-10-01
IdsarXiv 2610.01199

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
Sample complexity of the Sinkhorn divergencestatementlemma 1arxiv
Entropic bias on \texttt{CCO} instancesstatementproposition 1arxiv
Strong duality, Theorem 1statementtheorem 3arxiv
Generalization bound for the Sinkhorn divergence coresetstatementtheorem 1arxiv
Swap-Directional Lipschitz constantstatementlemma 4arxiv
A0EBFZNZGXstatementproposition 5arxiv
E1RJ950SK9statementtheorem 4arxiv
GFZCAY11YKstatementproposition 4arxiv
Potential bound on verticesstatementlemma 5arxiv
K82J14DT1Zstatementproposition 6arxiv
M2AGZ2JRVWstatementlemma 2arxiv
Suboptimality of Swap Descent on Sinkhorn Divergencestatementtheorem 2arxiv
Previous methods within a OT frameworkstatementproposition 2arxiv
Convex relaxation over the hypersimplex yields a trivial boundstatementproposition 3arxiv
W3CTTMSKZ4statementlemma 3arxiv

Catalogue records