1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.CL2024
Fast Analysis of the OpenAI O1-Preview Model in Solving Random K-SAT Problem: Does the LLM Solve the Problem Itself or Call an External SAT Solver?
Raffaele Marino
In this manuscript, I present an analysis on the performance of OpenAI O1-preview model in solving random K-SAT instances for K as a function of where is t…
cs.CL2024
The Garden of Forking Paths: Observing Dynamic Parameters Distribution in Large Language Models
Carlo Nicolini, Jacopo Staiano, Bruno Lepri +1
A substantial gap persists in understanding the reasons behind the exceptional performance of the Transformer architecture in NLP. A particularly unexplored area involves the mecha…
cond-mat.dis-nn2023★ 1 cited
Where do hard problems really exist?
Raffaele Marino
This chapter delves into the realm of computational complexity, exploring the world of challenging combinatorial problems and their ties with statistical physics. Our exploration s…