6 papers
Symbolic Regression via Latent Iterative Refinement
Xieting Chu, Sriram Vishwanath, Vijay Ganesh
Symbolic regression (SR) seeks closed-form mathematical expressions that fit observed data. Neural SR methods amortize the search by training an encoder to map observations directl…
MathConstraint: Automated Generation of Verified Combinatorial Reasoning Instances for LLMs
Viresh Pati, Zhengyu Li, Piyush Jha +3
We introduce MathConstraint, a hard, adaptive benchmark for evaluating the combinatorial reasoning capabilities of LLMs. We combine constraint satisfaction problems with rigorous s…
LLMStinger: Jailbreaking LLMs using RL fine-tuned LLMs
Piyush Jha, Arnav Arora, Vijay Ganesh
We introduce LLMStinger, a novel approach that leverages Large Language Models (LLMs) to automatically generate adversarial suffixes for jailbreak attacks. Unlike traditional metho…
AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems
Piyush Jha, Zhengyu Li, Zhengyang Lu +3
This paper introduces AlphaMapleSAT, a Cube-and-Conquer (CnC) parallel SAT solver that integrates Monte Carlo Tree Search (MCTS) with deductive feedback to efficiently solve challe…
RLSF: Fine-tuning LLMs via Symbolic Feedback
Piyush Jha, Prithwish Jana, Pranavkrishna Suresh +2
Large Language Models (LLMs) have transformed AI but often struggle with tasks that require domain-specific reasoning and logical alignment. Traditional fine-tuning methods do not…
Abstractions-of-Thought: Intermediate Representations for LLM Reasoning in Hardware Design
Matthew DeLorenzo, Kevin Tieu, Prithwish Jana +4
Large language models (LLMs) have achieved impressive proficiency on logic and programming tasks, often rivaling expert-level performance. However, generating functionally correct…