← heapsort-ai

LLMs

720 items

RESEARCHarXiv CS.AI·4/21/2026

From Subsumption to Satisfiability: LLM-Assisted Active Learning for OWL Ontologies

This paper introduces an LLM-assisted active learning method for OWL ontologies, where subsumption queries are reformulated into verbalized counter-concepts for LLMs. LLMs provide real-world examples to approximate these counter-concepts, ensuring that only Type II errors occur, which merely delay the construction process without introducing inconsistencies.

31
RESEARCHarXiv CS.LG·4/22/2026

Discrete Tilt Matching

Discrete Tilt Matching (DTM) is a novel likelihood-free method for fine-tuning masked diffusion large language models (dLLMs), addressing the intractability of sequence-level marginal likelihoods in RL. It recasts fine-tuning as state-level matching, using a weighted cross-entropy objective with control variates for stability, and achieves strong results on various tasks like Sudoku and Countdown.

30
RESEARCHarXiv CS.AI·20d ago

Tool-Augmented Agent for Closed-loop Optimization,Simulation,and Modeling Orchestration

The COSMO-Agent framework uses tool-augmented reinforcement learning to teach LLMs to bridge the CAD-CAE semantic gap, enabling closed-loop optimization in industrial design. It leverages an interactive RL environment for CAD generation, CAE solving, result parsing, and geometry revision, guided by a multi-constraint reward for feasibility and robustness.

30
RESEARCHarXiv CS.LG·4/13/2026

Robust Reasoning Benchmark

This study proposes a new perturbation pipeline to evaluate the robustness of LLM reasoning, applying it to the AIME 2024 dataset. While frontier models show resilience, open-weight models suffer catastrophic accuracy drops, exposing structural fragility and potential issues with working memory or mechanical parsing.

30