3 papers
cs.DS2026
Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs
Krzysztof Choromanski, Derek Long, Ananya Parashar +1
We present GenusSink, a new class of approximate generalized Sinkhorn algorithms with shortest-path-distance costs for bounded genus (e.g. planar) graphs, providing near-linear tim…
cs.LG2026
Manifold Random Features
Ananya Parashar, Derek Long, Dwaipayan Saha +1
We present a new paradigm for creating random features to approximate bi-variate functions (in particular, kernels) defined on general manifolds. This new mechanism of Manifold Ran…
stat.ME2025
Shift-Aware Gaussian-Supremum Validation for Wasserstein-DRO CVaR Portfolios
Derek Long
We study portfolio selection with a Conditional Value-at-Risk (CVaR) constraint under distribution shift and serial dependence. While Wasserstein distributionally robust optimizati…