Page 52 of 144

AllHigh signalRecent
5756 articles
arXiv cs.AI·

Better Later Than Sooner: Neuro-Symbolic Knowledge Graph Construction via Ontology-grounded Post-extraction Correction

Neuro-symbolic framework for ontology-grounded knowledge graph construction combining open-domain extraction, embedding-based canonicalization, and targeted LLM-based correction of ontology violations. Defers corrections to post-extraction stage to reduce token usage, improve KG consistency, and preserve QA quality for multi-hop reasoning and symbolic operations.

RAGReasoningEmbeddings
SIG
72
HYP
18
arXiv cs.CL·

Structured Prompt Optimization Meets Reinforcement Learning for Global and Local Interpretability over Complex Text

eXTC combines structured prompt optimization and reinforcement learning for text classification. The system learns a natural language rulebook first, then distills reasoning from a teacher LLM into a compact model, then expands capabilities via RL. Result: fast inference with local reasoning traces and global modular explanations of learned domain rules.

Prompt engineeringReinforcement learningReasoning
SIG
72
HYP
28
arXiv cs.LG·

Parallel Adaptive Multi-Objective Evolutionary Learning of Discretized Bayesian Network Classifiers for Clinical Data

Baymex, a multi-objective evolutionary algorithm, learns discretized Bayesian networks for clinical classification. Parallelized on 16 cores (54× speedup), it optimizes cross-entropy and BIC complexity. On real datasets (RADCURE, SUPPORT), it matches or outperforms decision trees, logistic regression, and random forests while producing interpretable models.

Benchmarks
SIG
72
HYP
15
arXiv cs.LG·

Return-to-Go Is More Than a Number: Q-Guided Alignment for Return-Conditioned Supervised Learning

Q-ALIGN DT aligns conditioned sequence models by ensuring the Q-value of the output policy matches the input return-to-go (RTG). The method uses a Q function for dense guidance and RTG-perturbation fine-tuning. Results: improved controllability on D4RL benchmark and generalization to velocity-tracking tasks where prior methods fail.

Reinforcement learningReasoningBenchmarks
SIG
72
HYP
18
arXiv cs.LG·

CosmicFish-HRM: Adaptive Reasoning via Hierarchical Recurrent Mechanisms in Compact Language Models

CosmicFish-HRM is a compact model with a Hierarchical Reasoning Module (HRM) that dynamically allocates computational effort during inference. The model learns when to halt based on input complexity, combining high-level and low-level reasoning cycles with Grouped Query Attention, RoPE, and SwiGLU. Results show non-uniform reasoning behavior adapted to tasks and inputs.

ReasoningFine-tuningBenchmarks
SIG
72
HYP
25
arXiv cs.LG·

Cycle-Space Informed Detection of Autoencoded Blind False Data Injection Attacks on Power Systems

Detection of False Data Injection Attacks on power systems using cycle-space informed detection. Authors propose a topology-aware Cycle-Space Detector (CSD) robust against autoencoder-based attacks that exploit the Jacobian null space, leveraging network topology and Minimum Cycle Basis to enhance detection with optimal generalization error on IEEE 14-, 30-, 57-, 118-bus systems.

AI safetyBenchmarksPapers
SIG
72
HYP
15
arXiv cs.AI·

Harmonizing Real-Time Constraints and Long-Horizon Reasoning: An Asynchronous Agentic Framework for Dynamic Scheduling

RACE-Sched, an asynchronous multi-agent framework, solves dynamic scheduling by decoupling real-time execution (symbolic heuristics) from long-horizon reasoning (LLM). A semantic rule repository of validated heuristics improves transferability across problem scales. Outperforms Deep RL and LLM baselines on GEN-Bench, MK-Bench, JMS-Bench.

AI AgentsMulti-agentReasoning
SIG
72
HYP
28
arXiv cs.CL·

Slogans or Stance? A Label-Light Diagnostic for Entrepreneurial-Discourse Measurement on Chinese SOE Speeches

Diagnostic tool for measuring constructs like "entrepreneurial spirit" in Chinese state-owned enterprise speeches. On 80 speeches from SOE leaders, authors test LDA, dictionary scorers, and Qwen3.5:9b. The LLM reaches d=1.09 in paired contrast, but half the effect stems from speaker idiolect. Corpus of 2,190 segments and slogan lexicon released.

BenchmarksEvalsQwen
SIG
72
HYP
15
arXiv cs.CL·

Analyzing Persona Effects in Generated Explanations from Multimodal LLM Agents in Urban Perception

Study of persona effects on explanations generated by multimodal LLM agents in urban perception. Analysis of 59,808 annotations from 1,200 persona-conditioned agents: captions show strong convergence, justifications display systematic variation tied to socioeconomic and political attributes, perception tags show no significant persona-related differences.

VisionAI AgentsPrompt engineering
SIG
72
HYP
15
arXiv cs.CL·

GPF-LiveNews: A Streaming Evaluation Protocol for Group-Conditioned Framing in Large Language Models

GPF-LiveNews is a streaming evaluation protocol to audit how LLMs frame emerging news events for different audiences. Tested on 23 models across 12 monitoring runs, it measures semantic and sentiment variations across 42 identity labels. Results show Policy/Action prompts produce strongest semantic movement, while sentiment variation remains flat across dimensions.

EvalsAI safetyAlignment
SIG
72
HYP
18
arXiv cs.CL·

Thoughts-as-Planning: Latent World Models for Chain-of-Thoughts Optimization via Reinforcement Planning

Thoughts-as-Planning formalizes reasoning chain optimization as sequential decision-making over latent semantic space. The framework learns a latent world model simulating effects of reasoning chain edits on outputs, supporting multi-scale edits (token, segment, instruction) via gradient descent or reinforcement learning planning.

ReasoningReinforcement learningPrompt engineering
SIG
72
HYP
28
arXiv cs.CL·

Assessing Dutch Syllabification Algorithms and Improving Accuracy by Combining Phonetic and Orthographic Information through Deep Learning

Comparative assessment of four Dutch syllabification algorithms (Brandt Corstius, Liang, Trogkanis-Elkan CRF, and a novel deep learning model). The deep learning model combining phonetic and orthographic information achieves 99.65% word accuracy (+0.14% improvement over literature). Data-driven algorithms outperform knowledge-based approaches.

PapersBenchmarksCode generation
SIG
72
HYP
15
arXiv cs.CL·

A Modular Architecture for Typologically Controlled Lexicon Generation

Modular framework for generating pronounceable, typologically plausible artificial lexicons. Samples phoneme inventories from PHOIBLE, applies three phonological grammars (deterministic, OT, MaxEnt), and assigns meanings via Swadesh-Leipzig-Jakarta ontology. Evaluation on character n-gram perplexity and KL divergence: probabilistic grammars outperform baselines on 100-5,000 word forms.

PapersBenchmarks
SIG
72
HYP
15
arXiv cs.LG·

Designing Active Tether-Net Systems for Space Debris Capture with Graph-Learning-Aided Mixed-Combinatorial Optimization

Active tether-net system for space debris capture using Graph Neural Network (GNN) to jointly optimize net morphology, thruster masses of maneuverable units, and controller aiming points. GNN reduces mixed combinatorial nonlinear programming (MCNLP) to nonlinear programming (NLP) solved via Particle Swarm Optimization with gradient-based refinement, achieving faster convergence than direct MCNLP solving.

PapersReasoning
SIG
72
HYP
15
arXiv cs.LG·

Causal Intelligence for Constraint-Aware Intervention Design to Induce State Transitions

COAST is a causal-intelligence approach for designing constrained interventions that induce state transitions. The system learns context-specific causal graphs, attributes distributional shifts to mechanism-level causal drivers, and uses multi-objective optimization balancing transition efficacy, intervention complexity, and target-state stability. Validated on synthetic benchmarks and real biological datasets.

ReasoningBenchmarks
SIG
72
HYP
18
arXiv cs.LG·

LoRe: Adaptive Interaction-Evaluation Routing with Per-Step Interaction Budgets for Iterative Graph Solvers

LoRe is a training-free inference-time wrapper optimizing diffusion-based neural solvers for combinatorial optimization. It enforces per-step interaction-evaluation budgeting, dynamically routing computation to high-conflict/high-uncertainty interactions. On MIS and TSP, LoRe achieves ×8 speedup, ×12 peak-memory reduction (MIS) and ×15 speedup, ×44 memory reduction (TSP n=1000).

ReasoningBenchmarksPapers
SIG
72
HYP
18