By default, all terms are understood in the infinity sense (“category” means “$(\infty, 1)$-category”, etc.).
An object $A$ in a category is said to be finitely presentable (or compact) if the functor $\mathrm{Hom}(A, -)$ preserves filtered colimits.
In the (classical) $1$-truncated world, the following fact is well known: in the category of algebras of algebraic theories (aka: categories of algebras over monads of finite rank on $\mathrm{Set}$), finitely presentable objects are exactly objects having a finite presentation (given by finite generators and relations).
Is there a known generalization of this statement to the non-truncated case?
Here's what I know about it:
Finitely presentable objects in $\infty\text{-}\mathrm{Groupoid}$ are exactly retracts of $\infty$-groupoids given by a finite generators and relations (see Wall's finiteness obstruction)
I think that the forgetful functor will also preserve filtered colimits (but I haven't found a reference for this yet) and therefore the free one will preserve finitely presentable objects.
So,
Is it true that every finitely presentable object in a (finitary) algebraic category is a coequalizer of finitely generated free objects?
I see a discussion of (non-truncated) monads and algebraic categories in
but I haven’t noticed an answer to my question anywhere yet.