REVIEW 2 cited by
Generalized conditional gradient: analysis of convergence and applications
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The objectives of this technical report is to provide additional results on the generalized conditional gradient methods introduced by Bredies et al. [BLM05]. Indeed , when the objective function is smooth, we provide a novel certificate of optimality and we show that the algorithm has a linear convergence rate. Applications of this algorithm are also discussed.
Forward citations
Cited by 2 Pith papers
-
Optimal Transport under Group Fairness Constraints
Group-fairness targets are added as constraints to entropic optimal transport, with a modified Sinkhorn algorithm and two relaxations (penalty and cost learning) that come with sample-complexity bounds.
-
Learning Clustering-based Prototypes for Compositional Zero-shot Learning
ClusPro improves compositional zero-shot learning by representing each primitive with multiple online-clustered prototypes and adding prototype-anchored contrastive and decorrelation losses.
Discussion (0). Continue with ORCID to comment.