Weiming Feng

activity

20242026

collaborators

4 papers

cs.LG2026

Learning CNF Formulas from Uniform Random Solutions: Near-Tight Sample Complexity for Valiant's Algorithm

Weiming Feng, Yixiao Yu, Yiyao Zhang

We revisit Valiant's algorithm (Commun. ACM'84) for learning $n$ -variable CNF formulas with clause size $k$ and variable degree $d$ from i.i.d. uniform random solutions in the loca…

cs.LG2026

Learning $AC^{0}$ under Locally Sampleable Graphical Models

Weiming Feng, Xiongxin Yang, Yixiao Yu +1

The problem of learning constant-depth circuits holds profound implications for computational learning theory. In a seminal result, by introducing the low-degree algorithm, Linial,…

cs.DS2025

Learning CNF formulas from uniform random solutions in the local lemma regime

Weiming Feng, Xiongxin Yang, Yixiao Yu +1

We study the problem of learning a $n$ -variables $k$ -CNF formula $Φ$ from its i.i.d. uniform random solutions, which is equivalent to learning a Boolean Markov random field (MRF) w…

cs.DS2024

Approximately Counting Knapsack Solutions in Subquadratic Time

Weiming Feng, Ce Jin

We revisit the classic #Knapsack problem, which asks to count the Boolean points $(x_{1}, \dots, x_{n}) \in {0, 1}^{n}$ in a given half-space $\sum_{i = 1}^{n} W_{i} x_{i} \leq T$ . This #P-complete pro…

Learning CNF Formulas from Uniform Random Solutions: Near-Tight Sample Complexity for Valiant's Algorithm

Learning AC0 under Locally Sampleable Graphical Models

Learning CNF formulas from uniform random solutions in the local lemma regime

Approximately Counting Knapsack Solutions in Subquadratic Time

Learning $AC^{0}$ under Locally Sampleable Graphical Models