Co-occurring keywords · papers mentioning both
Papers
Bregman Conditional Random Fields: Sequence Labeling with Parallelizable Inference Algorithms
ACL 2025
Calm Composite Losses: Being Improper Yet Proper Composite
AISTATS 2025
Batch Greenkhorn Algorithm for Entropic-Regularized Multimarginal Optimal Transport: Linear Rate of Convergence and Iteration Complexity
ICML 2022
Project and Forget: Solving Large-Scale Metric Constrained Problems
JMLR 2022
On Robust Optimal Transport: Computational Complexity and Barycenter Computation
NeurIPS 2021
Projection Robust Wasserstein Barycenters
ICML 2021
Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes
NeurIPS 2021
Rankmax: An Adaptive Projection Alternative to the Softmax Function
NeurIPS 2020
Efficient Bregman Projections onto the Permutahedron and Related Polytopes
AISTATS 2016
Minimax Policies for Combinatorial Prediction Games
COLT 2011
Structured Prediction, Dual Extragradient and Bregman Projections
JMLR 2006
Matrix Exponentiated Gradient Updates for On-line Learning and Bregman Projection
JMLR 2005