One-way Functions and Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions.
Yanyi LiuRafael PassPublished in: IACR Cryptol. ePrint Arch. (2023)
Keyphrases
- kolmogorov complexity
- inductive inference
- probability functions
- parametric family
- complexity measures
- probability distribution
- continuous functions
- random variables
- learning theory
- training data
- uncertain data
- information theoretic
- generative model
- np hard
- computational complexity
- power law
- probabilistic model
- machine learning
- hypervolume indicator