paper-with-me

Papers

Minimization of Boolean Complexity in In-Context Concept Learning

2024-12-03 · Leroy Z. Wang, R. Thomas McCoy, Shane Steinert-Threlkeld

What factors contribute to the relative success and corresponding difficulties of in-context learning for Large Language Models (LLMs)? Drawing on insights from the literature on human concept learning, we test LLMs on carefully designed concept learning tasks, and show that task performance highly correlates with the Boolean complexity of the concept. This suggests that in-context learning exhibits a learning bias for simplicity in a way similar to humans.

📄 PDF Abstract BibTeX arXiv:2412.02823

Code (0)

등록된 구현이 없습니다.

Tasks

In-Context Learning

Similar Papers 제목 키워드 기반

Superredundancy: A tool for Boolean formula minimization complexity analysis

2022-05-02 · Paolo Liberatore

A superredundant clause is a clause that is redundant in the resolution closure of a formula. The converse concept of superirredundancy ensures membership of the clause in all minimal CNF formulae that are equivalent to …

A Heuristic Approach to Two Level Boolean Minimization Derived from Karnaugh Mapping

2020-08-21 · Ethan L. Childerhose, Jingzhou Liu

The following paper presents a heuristic method by which sum-of-product Boolean expressions can be simplified with a specific focus on the removal of redundant and selective prime implicants. Existing methods, such as th…

Learning from Satisfying Assignments Using Risk Minimization

2021-01-10 · Manjish Pal. Subham Pokhriyal

In this paper we consider the problem of Learning from Satisfying Assignments introduced by \cite{1} of finding a distribution that is a close approximation to the uniform distribution over the satisfying assignments of …

parameter estimation

Quadratization of Symmetric Pseudo-Boolean Functions

2014-04-25 · Martin Anthony, Endre Boros, Yves Crama, Aritanan Gruber

A pseudo-Boolean function is a real-valued function $f(x)=f(x_1,x_2,\ldots,x_n)$ of $n$ binary variables; that is, a mapping from $\{0,1\}^n$ to $\mathbb{R}$. For a pseudo-Boolean function $f(x)$ on $\{0,1\}^n$, we say t…

Learning Boolean functions with concentrated spectra

2015-07-15 · Dustin G. Mixon, Jesse Peterson

This paper discusses the theory and application of learning Boolean functions that are concentrated in the Fourier domain. We first estimate the VC dimension of this function class in order to establish a small sample co…

General Classification