Domain transfer becomes identifiable from marginals plus one anchor under Jacobian sparsity, enabled by a randomized masked finite-difference regularizer.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
years
2026 3verdicts
UNVERDICTED 3representative citing papers
A diameter criterion tied to a potential function certifies convergence of difference inclusions, enabling discrete proofs for first-order optimization methods with diminishing steps.
A learning algorithm achieves tight Õ(√T) regret for profit maximization in bilateral trade against smooth adversaries, matching stochastic rates via continuity and algorithmic chaining.
citing papers explorer
-
Domain Transfer Becomes Identifiable via a Single Alignment
Domain transfer becomes identifiable from marginals plus one anchor under Jacobian sparsity, enabled by a randomized masked finite-difference regularizer.
-
Convergence of difference inclusions via a diameter criterion
A diameter criterion tied to a potential function certifies convergence of difference inclusions, enabling discrete proofs for first-order optimization methods with diminishing steps.
-
Profit Maximization in Bilateral Trade against a Smooth Adversary
A learning algorithm achieves tight Õ(√T) regret for profit maximization in bilateral trade against smooth adversaries, matching stochastic rates via continuity and algorithmic chaining.