Sampling and Learning for Boolean Function

01/21/2020
by   Chuyu Xiong, et al.
0

In this article, we continue our study on universal learning machine by introducing new tools. We first discuss boolean function and boolean circuit, and we establish one set of tools, namely, fitting extremum and proper sampling set. We proved the fundamental relationship between proper sampling set and complexity of boolean circuit. Armed with this set of tools, we then introduce much more effective learning strategies. We show that with such learning strategies and learning dynamics, universal learning can be achieved, and requires much less data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/01/2021

Sampling and Complexity of Partition Function

The number partition problem is a well-known problem, which is one of 21...
research
06/25/2023

A Circuit Complexity Formulation of Algorithmic Information Theory

Inspired by Solomonoffs theory of inductive inference, we propose a prio...
research
08/11/2017

Lower bound for monotone Boolean convolution

Any monotone Boolean circuit computing the n-dimensional Boolean convolu...
research
09/26/2019

Circuit equivalence in 2-nilpotent algebras

The circuit equivalence problem of a finite algebra A is the computation...
research
12/02/2021

Maximum Consensus by Weighted Influences of Monotone Boolean Functions

Robust model fitting is a fundamental problem in computer vision: used t...
research
03/06/2018

Local negative circuits and cyclic attractors in Boolean networks with at most five components

We consider the following question on the relationship between the asymp...
research
06/23/2021

Small tile sets that compute while solving mazes

We ask the question of how small a self-assembling set of tiles can be y...

Please sign up or login with your details

Forgot password? Click here to reset