General Quantification of Covariate and Concept Shifts
Paper proposes γ*-concept shifts via entropic optimal transport, deriving estimable generalization bounds unifying covariate and concept shift under distribution shift.
3 stories, newest first · one card per story
Paper proposes γ*-concept shifts via entropic optimal transport, deriving estimable generalization bounds unifying covariate and concept shift under distribution shift.
Theory paper derives nearly tight Rademacher complexity bounds for sparsely activated one-hidden-layer ReLU networks.
Researchers close the Kearns–Roth–Ryu gap for agentic networked information aggregation, proving excess error is constant up to depth M^2 then Θ(M^2/D).
Today 1.6K readers · 2.5K views · 779 reads · all time 189K views