arXiv Machine Learning By Masahiro Kato

Counterexamples and Sufficient Conditions: Comments on "Optimally-Transported Generalized Method of Moments"

Read the original on arXiv Machine Learning →

The paper critiques the optimally‑transported generalized method of moments (OTGMM) estimator introduced by Schennach & Starck (2026a), presenting counterexamples that invalidate Theorems 2–6 under their stated assumptions. It shows that the small‑error assumptions fail to guarantee consistency and asymptotic normality, and that the large‑error analysis leads to a modified‑moment GMM estimator that can diverge from the true OTGMM minimizer, even in simple scalar and overidentified models. The authors further provide a sufficient condition ensuring that solutions of the modified moment equations also solve the original constrained problem, and replace a problematic Assumption 16 with a matrix condition that restores the required bound.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
6d ago

On the SoS Certifiability of Log-Concave Distributions

arXiv:2609. 30105v1 Announce Type: new Abstract: For an arbitrary isotropic log-concave distribution $P$ on $\mathbb{R}^d$, we prove that the polynomial $(Cm)^m\|v\|_2^m - \mathbb{E}_{X\sim P}\langle X,v\rangle^m$ is a sum of squares for every even $m\ge2$, where $C>0$ is a universal constant.

By Aleksandr Storozhenko
arXiv Machine Learning
Jul 27

On the Convergence of Stochastic Low-Rank Adaptation

arXiv:2607. 21975v1 Announce Type: new Abstract: Low-rank adaptation (LoRA) optimizes $J(B,A)=\mathcal L(W_\mathrm{base}+sBA)$ over two adapters $B \in \mathbb{R}^{m \times r}$ and $A \in \mathbb{R}^{r \times n}$ that form a low-rank update to a frozen pretrained weight matrix $W_\mathrm{base} \in \mathbb{R}^{m \times n}$.

By Ru Wang, Chengchang Liu, John C. S. Lui