Result · SOFT-RANDOMIZED-FIM
Soft assignments define a randomized quantizer
Proved herepublication: internal
Meaning
The soft information objective corresponds to an actual randomized labelling mechanism.
Scientific context
Replacing a hard assignment by an assignment probability is not a smoothing trick: the resulting soft assignment is the exact Fisher information of a genuinely randomized quantizer, provided the randomization does not itself depend on the parameter. This gives a gradient-based route to a rule that hard-boundary optimization cannot supply directly.
Statement
For probabilities r_ib, W_b=Σ_i w_i r_ib and m_b=Σ_i w_i r_ib s_i give I_soft=Σ_b m_bm_b^T/W_b, the Fisher information of the corresponding randomized categorical observation when the randomization rule is theta-independent.
Assumptions
nonnegative assignments
rows sum to one
theta-independent randomization rule
Closest prior work
Nearest prior work
Relationships
Enables
- Exact soft-assignment gradientSOFT-ASSIGNMENT-GRADIENT
- Atomic randomization gapOPEN-ATOMIC-RANDOMIZATION-GAP
Raises
Open next door
- Atomic randomization gapOPEN-ATOMIC-RANDOMIZATION-GAP
- Quantitative A finite-geometry necessity boundOPEN-A-QUANTITATIVE-BOUND
- Characterize criteria with finite exchange => first-order geometryOPEN-CRITERION-CHARACTERIZATION
- Parameterized complexity of global finite D quantizationOPEN-D-PARAMETERIZED-COMPLEXITY
- Exact bit complexity of the variable-dimension tilt-DP dualOPEN-DS-TILT-DUAL-EXACT-COMPLEXITY
- Quantitative E necessity bound under spectral gapOPEN-E-SPECTRAL-GAP-BOUND
- Stronger branch-and-bound upper boundsOPEN-STRONGER-BB
- Stronger local neighborhoodsOPEN-STRONGER-LOCAL-NEIGHBORHOODS
Local graph
Proof
S1. Soft assignments are an actual randomized quantizer
For , ,
This is exactly the Fisher information of the corresponding randomized categorical observation at the reference point, provided the randomization rule is held fixed with respect to .