Backend
Distributionally Robust Risk Evaluation with Low-Rank Perturbations
arXiv stat.ML0 views
arXiv:2611.17447v1 Announce Type: cross Abstract: We study distributionally robust risk under perturbations restricted to low-rank matrices whose row and column spaces are shared across observations, focusing on how much worst-case risk this restriction sacrifices and how to compute the restricted worst case. Under moment or Wasserstein budgets, we derive quantitative bounds on the gap between the unrestricted and low-rank worst-case risks, characterize when the gap vanishes, and identify the smallest lossless row and column dimensions. To generate worst-case perturbations, we apply projected gradient ascent to a curvature-corrected concave problem and derive computable risk certificates. We establish global sublinear convergence for the corrected objective and linear convergence to a worst-case distribution when the budget constraint is sufficiently active.
Source:https://arxiv.org/abs/2611.17447PreviousElliptic Sampling: Optimal Interpolant Schedules for Gaussians and BeyondNextSURFACE: Preference Distribution Matching on Pareto Fronts via Scalarization Steering
Related posts
Building Mobile Connectivity in Afghanistan: A Look at Roshan
0dev.to
Your Tests Blocked System.exit With a SecurityManager and Java 25 Will Not Let You Install One
0dev.to
We autoscaled our Java pricing service on memory and it grew to twenty pods and stayed there
0dev.to
Nine small tools I stopped installing apps for
0dev.to
I built a small tool to capture website screenshots across devices
0dev.to Productivity
What a 13-agent Claude Code team taught me about agent harnesses
0dev.to Productivity