Derives near-optimal nonasymptotic excess-risk bounds for Engression and reverse Markov Engression over Hölder classes via energy distance.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Augments the energy score objective for sample-based generative models with a differentiable decision loss that is itself a proper scoring rule, yielding targeted improvements on cost-sensitive regions in synthetic and real tasks.
The book presents principles from optimization and information theory to explain deep network architectures and enable new interpretable models.
citing papers explorer
-
Theoretical Analysis of Engression and Reverse Markov Engression
Derives near-optimal nonasymptotic excess-risk bounds for Engression and reverse Markov Engression over Hölder classes via energy distance.
-
Decision-Aware Training for Sample-Based Generative Models
Augments the energy score objective for sample-based generative models with a differentiable decision loss that is itself a proper scoring rule, yielding targeted improvements on cost-sensitive regions in synthetic and real tasks.
-
Principles and Practice of Deep Representation Learning: or a Mathematical Theory of Memory
The book presents principles from optimization and information theory to explain deep network architectures and enable new interpretable models.