16 citations · 66 across the 23 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Stronger Hardness for Submodular Maximization Subject to a Matroid Constraint
Moran Feldman, Alan Kuhnle
Maximizing a submodular function subject to a matroid constraint is a cornerstone problem in combinatorial optimization. The state-of-the-art algorithm for this problem obtains $0.…
stat.ML2026
How Inefficient Is Natural Gradient Descent? From Exact Optimality to Θ( \sqrt{ \log d } ) Divergence
Guni Sharon, Alan Kuhnle
Natural gradient descent (NGD) underlies common methods in ML. For dually flat families, idealized NGD on the forward Kullback--Leibler objective follows the mixture geodesic which…