Initiates property testing for k-submodular functions, yielding constant-query testers in l_p distance via hypergrid junta approximation and sub-exponential testers for component properties in Hamming distance, but with a structural barrier preventing combination.
Submodular functions and convexity
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
Regret in polyhedral online convex optimization equals Θ(√((1+RS_T) T log V_max)) where RS_T counts active region switches.
Rényi entropy is subadditive on the majorization lattice for every α ∈ [0,∞] and supermodular for α ∈ {0} ∪ [1,∞]; Tsallis entropy is subadditive and supermodular for all α ∈ [0,∞).
citing papers explorer
-
Testing k-submodularity
Initiates property testing for k-submodular functions, yielding constant-query testers in l_p distance via hypergrid junta approximation and sub-exponential testers for component properties in Hamming distance, but with a structural barrier preventing combination.
-
Polyhedral Instability Governs Regret in Online Learning
Regret in polyhedral online convex optimization equals Θ(√((1+RS_T) T log V_max)) where RS_T counts active region switches.
-
Geometry of R\'enyi Entropy on the Majorization Lattice
Rényi entropy is subadditive on the majorization lattice for every α ∈ [0,∞] and supermodular for α ∈ {0} ∪ [1,∞]; Tsallis entropy is subadditive and supermodular for all α ∈ [0,∞).