For binary classification, the optimal tradeoff curve between stored bits and class information is achieved by binning the posterior class probability into contiguous intervals.
Latent Representations of Dynamical Systems: When Two is Better Than One
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
A popular approach for predicting the future of dynamical systems involves mapping them into a lower-dimensional "latent space" where prediction is easier. We show that the information-theoretically optimal approach uses different mappings for present and future, in contrast to state-of-the-art machine-learning approaches where both mappings are the same. We illustrate this dichotomy by predicting the time-evolution of coupled harmonic oscillators with dissipation and thermal noise, showing how the optimal 2-mapping method significantly outperforms principal component analysis and all other approaches that use a single latent representation, and discuss the intuitive reason why two representations are better than one. We conjecture that a single latent representation is optimal only for time-reversible processes, not for e.g. text, speech, music or out-of-equilibrium physical systems.
fields
cs.LG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Pareto-optimal data compression for binary classification tasks
For binary classification, the optimal tradeoff curve between stored bits and class information is achieved by binning the posterior class probability into contiguous intervals.