2 papers
cs.CC2024
Optimal Coding for Randomized Kolmogorov Complexity and Its Applications
Shuichi Hirahara, Zhenjian Lu, Mikito Nanashima
The coding theorem for Kolmogorov complexity states that any string sampled from a computable distribution has a description length close to its information content. A coding theor…
cs.LG2019
A Faster Algorithm Enumerating Relevant Features over Finite Fields
Mikito Nanashima
We consider the problem of enumerating relevant features hidden in other irrelevant information for multi-labeled data, which is formalized as learning juntas. A -junta function…