y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto
🤖All96,780🧠AI22,940⛓️Crypto17,363💎DeFi1,799🤖AI × Crypto1,480📰General53,198

AI × Crypto News Feed

Real-time AI-curated news from 96,781+ articles across 50+ sources. Sentiment analysis, importance scoring, and key takeaways — updated every 15 minutes.

96781 articles
AINeutralarXiv – CS AI · May 276/10
🧠

Exploiting Local Dynamics Regularity for Reusable Skills in Offline Hierarchical RL

Researchers introduce CARL, a hierarchical reinforcement learning algorithm that discovers reusable skills by exploiting local dynamics regularity—the observation that similar action sequences solve similar local transitions across different contexts. When integrated with existing HRL methods like HIQL, CARL demonstrates improved performance on complex tasks and meaningful skill clustering in humanoid environments.

AINeutralarXiv – CS AI · May 276/10
🧠

Advancing Creative Physical Intelligence in Large Multimodal Models

Researchers introduce MM-CreativityBench, a benchmark testing whether large multimodal models can solve creative physical problems by identifying non-obvious tool uses in constrained environments. Current LMMs struggle not from lack of generation capability but from poor visual grounding, hallucinating attributes and overlooking relevant entities; the team proposes affordance-grounded alignment using preference learning to improve performance.

AINeutralarXiv – CS AI · May 276/10
🧠

From Static Context to Calibrated Interactive RL: Mitigating Distribution Shift in Multi-turn Dialogue with Aligned Simulator

Researchers propose Calibrated Interactive RL, a framework addressing distribution shift problems in multi-turn dialogue systems by combining interactive reinforcement learning with simulator alignment. The approach theoretically and empirically demonstrates that aligning simulators with human interaction patterns significantly improves LLM-based dialogue agent performance compared to static context and unaligned interactive methods.

AINeutralarXiv – CS AI · May 276/10
🧠

Reasoning, Code, or Both? How Large Language Models Handle Variations in Math Questions

A new study comparing three LLM approaches to mathematical reasoning found that pure chain-of-thought prompting outperforms code execution methods in robustness across problem variations. When math problems were modified with simple changes like different names or numbers, code-based approaches showed greater accuracy drops, challenging the assumption that code execution improves reasoning reliability.

🧠 Claude🧠 Haiku
AINeutralarXiv – CS AI · May 276/10
🧠

Which Changes Matter? Towards Trustworthy Legal AI via Relevance-Sensitive Evaluation and Solver-Grounded Reasoning

Researchers introduce LexGuard, an adversarial AI framework that improves legal reasoning in large language models by distinguishing legally relevant changes from irrelevant perturbations. The system uses formal logic and SMT solvers to ground legal decisions in statute interpretation, addressing systematic failures in existing legal AI systems to maintain appropriate sensitivity to material legal facts.

AINeutralarXiv – CS AI · May 276/10
🧠

PolyFusionAgent: A Multimodal Foundation Model and Autonomous AI Assistant for Polymer Property Prediction and Inverse Design

Researchers introduce PolyFusionAgent, a multimodal AI framework combining a foundation model (PolyFusion) with an autonomous design agent (PolyAgent) for polymer discovery. The system integrates multiple polymer representations into a shared latent space to predict properties and generate novel structures, while grounding predictions in scientific literature for actionable design decisions.

AIBullisharXiv – CS AI · May 276/10
🧠

AGORA: Adapter-Grounded Observation-Action Retention for Inference-Free Prompt Compression in LLM Agents

Researchers introduce AGORA, a new compression method for LLM agents that addresses critical failures in existing token-level compressors. Unlike general-purpose compression techniques that destroy action semantics by removing low-entropy tokens, AGORA operates at step-granularity with structural awareness, achieving 1.0-11.5x compression while retaining 75%+ performance across most test scenarios.

AIBullisharXiv – CS AI · May 276/10
🧠

FAST-GOAL: Fast and Efficient Global-local Object Alignment Learning

Researchers introduce FAST-GOAL, a fine-tuning method that improves CLIP's ability to process lengthy text descriptions through global-local semantic alignment. The approach combines object detection with token-level similarity learning and introduces GLIT100k, a new dataset linking long captions to localized image-text pairs, demonstrating significant performance gains across multiple benchmarks.

AINeutralarXiv – CS AI · May 276/10
🧠

Tail-Aware HiFloat4: W4A4 Post-Training Quantization for Wan2.2

Researchers have developed Tail-Aware HiFloat4, a post-training quantization method that compresses text-to-video generation models using W4A4 (4-bit weights and activations) while maintaining output quality. The technique introduces activation-tail-aware calibration to handle statistical outliers, enabling efficient model deployment without retraining.

AINeutralarXiv – CS AI · May 276/10
🧠

UnityMAS-O: A General RL Optimization Framework for LLM-Based Multi-Agent Systems

UnityMAS-O is a new reinforcement learning optimization framework that enables LLM-based multi-agent systems to be trained end-to-end rather than manually orchestrated. The framework treats entire agent workflows as optimization units and demonstrates performance improvements across QA, search, and code generation tasks, particularly benefiting smaller models.

AINeutralarXiv – CS AI · May 276/10
🧠

Completion vs Optimality: Policy Gradient in Long-Horizon Cumulative-Damage Problems

Researchers identify critical failure modes in policy-gradient reinforcement learning methods when applied to long-horizon problems with cumulative damage, where short-term attractive actions lead to long-term negative outcomes. The study proposes a decomposition framework separating completion (reaching terminal horizon) from optimality (achieving dynamic-programming benchmarks) and validates predictions across two distinct domains: career planning and sports performance.

AINeutralarXiv – CS AI · May 276/10
🧠

MemFail: Stress-Testing Failure Modes of LLM Memory Systems

Researchers introduce MemFail, a diagnostic benchmark for testing failure modes in LLM memory systems by isolating three core operations: summarization, storage, and retrieval. The benchmark evaluates state-of-the-art memory systems across five adversarially-designed datasets to empirically understand architectural tradeoffs, moving beyond aggregate accuracy metrics.

AINeutralarXiv – CS AI · May 276/10
🧠

Towards Feedback-to-Plan Decisions for Self-Evolving LLM Agents in CUDA Kernel Generation

Researchers introduce CUDAnalyst, a new analysis framework that reveals how large language models make planning decisions when generating CUDA kernels by decomposing feedback signals. The study demonstrates that explicit planning helps only when feedback is well-aligned and that effective planning emerges from structured multi-feedback interactions, with findings showing robustness across different models and workloads.

AINeutralarXiv – CS AI · May 276/10
🧠

It's Not the Capability: Harness Sensitivity Is Non-Monotone Across LLM Agent Tiers

A controlled study of 432 experiments across six LLM models challenges the assumption that higher-capability models require less structural guidance. The research reveals non-monotone harness sensitivity patterns, where frontier models like Gemini 2.5 Flash show performance degradation with increased harness complexity, while reasoning-focused models benefit from stricter constraints.

🧠 Gemini
AINeutralarXiv – CS AI · May 276/10
🧠

A Dataset of Robot-Patient and Doctor-Patient Medical Dialogues for Spoken Language Processing Tasks

Researchers introduce MeDial-Speech, a new 111+ hour speech dataset for training medical AI systems to conduct patient consultations across four health conditions. The study benchmarks state-of-the-art LLMs including Claude Sonnet 4, GPT-5 mini, and DeepSeek-V3, revealing that while Claude Sonnet 4 achieves 71-75% accuracy in medical dialogue tasks, all models exhibit significant overconfidence in their probabilistic predictions.

🏢 Hugging Face🧠 GPT-5🧠 Claude
AINeutralarXiv – CS AI · May 276/10
🧠

What Makes Chain-of-Thought Work at Probe Time? Local Co-occurrence Rather Than Global Derivation

Researchers investigated why chain-of-thought prompting improves language model accuracy by analyzing what happens at inference time rather than generation time. They discovered that the improvement comes primarily from lexical activation and short-range token co-occurrence (2-3 adjacent tokens) rather than from logical sentence-level reasoning, challenging assumptions about how rationales actually drive model performance.

AINeutralarXiv – CS AI · May 276/10
🧠

Helicase: Uncertainty-Guided Supply Chain Knowledge Graph Construction with Autonomous Multi-Agent LLMs

Researchers introduce Helicase, an autonomous multi-agent LLM system designed to construct supply chain knowledge graphs by synthesizing fragmented web data through multi-hop reasoning. The system incorporates uncertainty quantification across three layers to enable calibrated confidence assessment, addressing a critical gap in complex supply chain intelligence tasks that cannot be solved by single-document queries.

AINeutralarXiv – CS AI · May 276/10
🧠

Multi-Stakeholder LLM Alignment: Decomposing Estimation from Aggregation

Researchers present DecompR, a method to improve how large language models handle tasks with conflicting stakeholder preferences by separating utility estimation from aggregation. Traditional holistic LLM judges create unstable implicit weights that cause significant score variability, especially as stakeholder numbers increase; the proposed approach fixes weights based on query structure before scoring to eliminate candidate-dependent weight drift.

AINeutralarXiv – CS AI · May 276/10
🧠

On the Detection of Commutative Factors in Factor Graphs: Necessary and Sufficient Conditions

Researchers have identified critical flaws in the state-of-the-art algorithm for detecting commutative factors in factor graphs, a foundational technique for lifted probabilistic inference. The algorithm incorrectly treats a necessary condition as sufficient, potentially producing incorrect results. The authors provide corrected algorithms that maintain efficiency while ensuring correctness.

AINeutralarXiv – CS AI · May 276/10
🧠

TADDLE: A Tool-Augmented Agent for Detecting Deficient LLM-Generated Peer Reviews

Researchers introduce TADDLE, an AI system that detects quality deficiencies in LLM-generated peer reviews by decomposing analysis into specialized tools and multi-label classification. The work addresses a growing problem in academic publishing where AI-written reviews are fluent but potentially flawed, backed by the first expert-annotated benchmark of 1,800 reviews across six defect categories.

AINeutralarXiv – CS AI · May 276/10
🧠

From Norms to Indicators (N2I-RAG): An Agentic Retrieval-Augmented Generation Framework for Legal Indicator Computation

Researchers introduce N2I-RAG, an AI framework that automates computation of legal indicators from normative texts using retrieval-augmented generation with built-in validation mechanisms. The system addresses hallucination risks in traditional language models by emphasizing traceability and evidence grounding, demonstrating strong performance on French marine environmental law.

AINeutralarXiv – CS AI · May 275/10
🧠

Developing a Totally Unimodular Linear Program for Optimal Conformance Checking: When and Why It Complements A*

Researchers propose a totally unimodular linear programming approach to conformance checking in process mining as an alternative to A* search algorithms. Testing on 2.1 million instances reveals complementary performance characteristics, with the LP method achieving 38.6% average runtime improvements for longer traces with deviations while A* excels on short, well-conforming traces.

AINeutralarXiv – CS AI · May 276/10
🧠

LELA: An End-to-end LLM-based Entity Linking Framework with Zero-shot Domain Adaptation

Researchers have extended LELA, an LLM-based entity linking framework, into a practical Python library that combines zero-shot Named Entity Recognition with entity disambiguation. The end-to-end pipeline addresses limitations in existing approaches by offering domain-agnostic capabilities and demonstrating robust performance across diverse entity linking tasks, making it more applicable to real-world usage scenarios.

AINeutralarXiv – CS AI · May 276/10
🧠

Generating Robust Portfolios of Optimization Models using Large Language Models

Researchers propose an algorithm that uses large language models to generate portfolios of optimization models rather than single outputs, addressing the reliability gap in LLM-generated solutions. The method leverages LLMs in dual roles—as generative and evaluative components—with theoretical guarantees that high-quality candidates appear in the portfolio as long as either role aligns with human preferences.

$MKR
AINeutralarXiv – CS AI · May 276/10
🧠

ORCA: An End-to-End Interactive Copilot for Optimized Root Cause Analysis

Researchers have introduced ORCA, an AI copilot system designed to make causal analysis accessible to domain experts across manufacturing, medicine, and social science. The tool automates root cause analysis workflows while allowing users to control the level of automation, from fully automatic to highly guided execution, addressing a significant accessibility gap in complex analytical methods.

🏢 Microsoft
← PrevPage 1468 of 3872Next →
Filters
Sentiment
Importance
Sort
Stay Updated
Everything combined