arXiv Machine Learning
Nonmaximal sums of maximally monotone operators under Rockafellar's constraint qualification
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
Hugging Face Trending Papers
Sep 9
Nonmaximal sums of maximally monotone operators under Rockafellar's constraint qualification
We construct counterexamples to Rockafellar's sum conjecture in which two maximally monotone operators satisfy the interior-domain condition but their sum is not maximally monotone. We give one counte...
arXiv AI
Sep 15
Edge-addition monotonicity of positive p-energy fails for every p >= 1
arXiv:2609.13476v1 Announce Type: cross Abstract: At a 2021 AIM workshop, Guo conjectured that the positive square energy s+ = E+_2 should inherit the familiar edge-addition monotonicity of the spect...
arXiv AI
Aug 6
On Hamming-Lipschitz Type Stability of the Subdominant (Minmax) Ultrametric: Theory and Simple Proofs
arXiv:2608. 04014v1 Announce Type: cross Abstract: The subdominant (minmax) ultrametric is a canonical tree-structured summary of a dissimilarity matrix, arising equivalently as the ultrametric induced by single-linkage clustering.
arXiv Statistics ML
3d ago
Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization
arXiv:2501.18183v3 Announce Type: replace-cross Abstract: We introduce a novel framework for decentralized projection-free optimization, extending projection-free methods to a broader class of upper-...
arXiv Machine Learning
Sep 18
The First-Order Oracle Complexity of Lipschitz Convex Optimization in Nondual Settings
arXiv:2609. 20687v1 Announce Type: cross Abstract: We study first-order black-box convex optimization over an $\ell_p$-ball for objectives Lipschitz in the $\ell_q$-norm, solving in the affirmative the nonsmooth version of the COLT open question (Guz15b) on whether the geometry of a smaller feasible set ($p < q$) can improve convergence rates in convex optimization, and matching prior lower bounds up to logarithmic factors.
arXiv Machine Learning
Aug 18
A Counterexample to the Tang Zhang Schatten Norm Conjecture and Sharp Positive Results
arXiv:2608. 15558v1 Announce Type: cross Abstract: For $m\geq 2$, let $c_p(m)$ be the all-dimensional best constant in $$ \left\|\sum_{k=1}^m A_k\right\|_p \leq c_p(m)\left\|\sum_{k=1}^m |A_k|\right\|_p.