Averaged Mirror Descent and Dual Gradient Methods: Convergent Algorithms for Entropic Gromov-Wasserstein Problem
cs.LG, math.OC
Submitted: 2026-09-25
Updated: 2026-09-25
Terminology
Sources
- Sliced Inner Product Gromov-Wasserstein Distances
- Approximation Analysis of the Entropic Penalty in Quadratic Programming
- Limit Laws for Gromov-Wasserstein Alignment with Applications to Testing Graph Isomorphisms
- Discrete Gromov-Wasserstein Duality: Algorithms and Isomorphism Testing
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks