Archives

June 2026

2731 articles

arXiv cs.LG·

Uncertainty-aware Multi-fidelity Closure via Conditional Normalizing Flows

Paper proposing a multi-fidelity approach using conditional normalizing flows to improve reduced-order model (ROM) accuracy. Framework learns probabilistic mapping from low-fidelity to high-fidelity ROM coefficients with uncertainty quantification. Two strategies tested on 2D Navier-Stokes equations: direct and residual learning, with residual learning outperforming direct learning.

PapersReasoningEvals
SIG
72
HYP
15
arXiv cs.LG·

SinkRec: Mitigating Semantic State Sink in Long Sequence Recommendation with Memory-Conditioned Gated Delta Networks

SinkRec introduces a hybrid memory-transition architecture for long-sequence recommendation using linear attention and conditional memory. It addresses semantic state sink—where repetitive patterns dominate recurrent state—by externalizing recurring behaviors via residual vector quantization and introducing Temporal-Aware State-Relation Differential Gated DeltaNet (TDGD) to purify state reads and writes.

ReasoningBenchmarksPapers
SIG
72
HYP
18
arXiv cs.LG·

QSplitFL: Capability Aware Deep Q-Learning for Optimal Split Point Selection in Split Federated Learning

QSplitFL introduces a Deep Q-Network framework for automatic optimal split point selection in Split Federated Learning. Using lightweight hardware metrics (CPU, memory, battery, network latency) instead of model weights, the committee-based DQN architecture improves convergence on MNIST, Fashion-MNIST, CIFAR-10/100 with CNN, ResNet50, MobileNetV4, ConvNeXt.

Reinforcement learningPapersBenchmarks
SIG
72
HYP
18
arXiv cs.AI·

Learning What to Remember: Observability-Safe Memory Retention via Constrained Optimization for Long-Horizon Language Agents

OSL-MR, a framework optimizing memory retention in long-horizon language agents. Formulates the problem as constrained stochastic optimization with budget, evidence utility, and delayed costs (miss penalties, reacquisition delays). Combines supervised learning with Mixed-Score heuristic. Outperforms recency and Generative Agents baselines on LOCOMO and LongMemEval benchmarks.

AI AgentsReasoningBenchmarks
SIG
72
HYP
18
arXiv cs.AI·

AutoPDE: Reliable Agentic PDE Solving via Explicitly Represented Solver Strategies

AutoPDE is an AI agent that solves partial differential equations (PDEs) by maintaining the numerical solver strategy as an explicitly represented, inspectable object. The approach combines PDE analysis, numerical method selection, and adaptive tuning. On PDE Agent Bench, AutoPDE achieves 54.5% pass rate, improving over the strongest baseline by 14.2 percentage points.

AI AgentsCode generationReasoning
SIG
72
HYP
25
arXiv cs.AI·

ReflectiChain: Epistemic Grounding in LLM-Driven World Models for Supply Chain Resilience

ReflectiChain bridges LLM and reinforcement learning for supply chains through a Generative Supply Chain World Model (SC-WM) in 6D latent space with physical conservation. On Semi-Sim benchmark (10 nodes, SIR risk), achieves 33% improvement in Rationale Consistency Score, 82.3% operability under adversarial shocks, anti-fragile behavior (+40.2%).

AI AgentsReinforcement learningReasoning
SIG
72
HYP
25
arXiv cs.CL·

Hidden Consensus:Preference-Validity Compression in Human Feedback

Study on human feedback aggregation in RLHF: reducing heterogeneous judgments to a single scalar reward masks legitimate cultural, linguistic, or normative disagreements. Analysis of 321 preference events in Malaysia: 79% of prompts contain multiple acceptable responses that majority aggregation discards. Proposes approach preserving plurality of valid interpretations.

Reinforcement learningAlignmentEvals
SIG
72
HYP
15
arXiv cs.AI·

Self-Distillation Policy Optimization via Visual Feedback: Bridging Code and Visual Artifacts

Visual-SDPO, a self-distillation framework using visual feedback, improves code generation for visual artifacts (charts, web pages, slides). The method traces detected visual defects back to responsible code statements and amplifies distillation signals on those statements. On ChartMimic, Design2Code, and AeSlides benchmarks, it gains +10 absolute points over zero-shot and +2.4 over GRPO.

Code generationVisionReinforcement learning
SIG
78
HYP
25
arXiv cs.CL·

Where You Inject Diversity Matters: A Unified Framework for Diverse Generation

Unified framework characterizing test-time diverse generation methods by diversity source and transmission score. Authors propose specification-level injection: generating diverse intermediate specifications then conditioning on them. Improves output diversity across 5 open-ended tasks and 4 backbone models while maintaining quality. Key factors: source diversity and source-to-output transmission.

Prompt engineeringReasoningCode generation
SIG
72
HYP
18
arXiv cs.CL·

The Confident Liar: Diagnosing Multi-Agent Debate with Log-Probabilities and LLM-as-Judge

Study of relationship between internal confidence (log-probabilities), external evaluation (LLM-as-judge), and final accuracy in multi-agent debate. Framework with Constructor and Auditor reveals role asymmetry: Constructor's confidence predicts judged reasoning quality 2× better and detects critical failures more reliably (AUROC 0.804 vs 0.634 for Auditor).

Multi-agentAI AgentsReasoning
SIG
72
HYP
15
arXiv cs.AI·

ComBench: A Benchmark for Rigorous Proof Reasoning and Constructive Realization in Olympiad-Level Combinatorics

ComBench is a benchmark of 100 Olympiad-level combinatorics problems to evaluate LLM mathematical reasoning. It distinguishes analysis-centric problems (rigorous proofs) from construction-centric problems (explicit constructions). Top models reach 65.4% average and 75.3% Best@4. Kimi-K2.6 outperforms GPT-4o on constructions but trails on proof grading.

BenchmarksReasoningEvals
SIG
82
HYP
15
arXiv cs.AI·

Moonshine: An Autonomous Mathematical Research Agent Centered on Conjecture Generation

Moonshine is an autonomous agent generating mathematical conjectures by extracting structure from classical problems and formulating significant conjectures. Applied to the Jacobian conjecture, it transfers the logic to affine-ridge sigmoid networks, formulating the Neural Jacobian Conjecture (NJC). GPT-5.5-pro and DeepSeek-V4-pro obtained complete proofs for N=n+1.

AI AgentsReasoningPapers
SIG
72
HYP
35
arXiv cs.CL·

Do Vision-Language Models See or Guess? Measuring and Reducing Textual-Prior Reliance with a Phrasing-Controlled Benchmark

arXiv study measuring VLM reliance on textual priors over visual content. 540-image benchmark with 4 question variants per image. 11 models tested: all degrade on hardest variant, open-source models drop furthest. No-image ablation reduces open models to 1–9% performance. GRPO post-training improves image-dependence across variants.

VisionEvalsBenchmarks
SIG
78
HYP
15
arXiv cs.AI·

A Unified Multi-Modal Framework for Intelligent Financial Systems: Integrating Reinforcement Learning, High-Frequency Trading, and Game-Theoretic Approaches with Cross-Modal Sentiment Analysis

Unified framework integrating PPO, time-series prediction, in-context learning, game theory, and cross-modal sentiment analysis for financial systems. Results: +23.7% portfolio optimization, -31.2% high-frequency trading error, +18.9% recommendation accuracy, +27.4% Nash convergence, +15.6% sentiment analysis.

Reinforcement learningBenchmarksReasoning
SIG
45
HYP
72
Reddit r/LocalLLaMA·

Fine-tuned Qwen2.5-7B to 96% of Claude Haiku on a domain-specific task using ~$3 of API calls and zero human labelers

Fine-tuned Qwen2.5-7B reaches 96% of Claude Haiku performance on domain-specific decision-reasoning task using ~$3 API spend and zero human annotators. DV-DPO method: 3-voice council + adversarial cross-examination generates 1,040 training pairs. Latency 11s vs 3s (T4 4-bit). Autonomous loop in production with failure detection and auto red-teaming.

QwenFine-tuningReinforcement learning
SIG
78
HYP
25