y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto
🤖All99,091🧠AI22,940⛓️Crypto17,363💎DeFi1,799🤖AI × Crypto1,480📰General55,509

AI × Crypto News Feed

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

99091 articles
AINeutralarXiv – CS AI · May 126/10
🧠

OPT-BENCH: Evaluating the Iterative Self-Optimization of LLM Agents in Large-Scale Search Spaces

Researchers introduce OPT-BENCH, a benchmark evaluating whether large language models can self-improve through iterative feedback in complex problem spaces. Testing 19 LLMs across machine learning and NP-hard problems reveals that while stronger models adapt better, even the most advanced systems remain constrained by their base capabilities and fall short of human expert performance.

AINeutralarXiv – CS AI · May 126/10
🧠

Internalizing Safety Understanding in Large Reasoning Models via Verification

Researchers propose Safety Internal (SInternal), a framework that trains large reasoning models to verify the safety of their own outputs rather than relying on external compliance mechanisms. The approach demonstrates that models can internalize safety understanding through verification tasks, significantly improving robustness against adversarial jailbreaks and out-of-domain attacks.

AINeutralarXiv – CS AI · May 126/10
🧠

PnP-Corrector: A Universal Correction Framework for Coupled Spatiotemporal Forecasting

Researchers introduce PnP-Corrector, a framework that improves long-term forecasting for coupled dynamical systems by separating error correction from physics simulation. The method achieves 29% error reduction in 300-day ocean-atmosphere forecasts by training a correction agent to counteract systematic biases that accumulate when multiple interacting systems compound prediction errors.

AINeutralarXiv – CS AI · May 126/10
🧠

Can We Formally Verify Neural PDE Surrogates? SMT Compilation of Small Fourier Neural Operators

Researchers demonstrate that Fourier Neural Operators (FNOs) used for PDE simulation can be formally verified using SMT solvers by exploiting their piecewise-linear structure once weights are fixed. While exact encoding provides sound proofs and counterexamples on small models, scalability remains limited, revealing a fundamental tradeoff between formal verification rigor and practical applicability for production neural operators.

AIBearisharXiv – CS AI · May 126/10
🧠

Agentic AI Scientists Are Not Built For Autonomous Scientific Discovery

A new position paper argues that despite functioning as useful co-scientists, agentic AI systems are fundamentally not designed for truly autonomous scientific discovery due to challenges in problem selection bias, insufficient tacit knowledge in training data, compressed output diversity, and lack of real-world experimental feedback loops.

AIBullisharXiv – CS AI · May 126/10
🧠

Latency Analysis and Optimization of Alpamayo 1 via Efficient Trajectory Generation

Researchers have optimized Alpamayo 1, a reasoning-based autonomous driving system, by redesigning it from multi-reasoning to single-reasoning architecture while accelerating diffusion-based action generation. The optimization achieves a 69.23% latency reduction while maintaining trajectory diversity and prediction quality, demonstrating that system-level efficiency improvements are critical for practical autonomous driving deployment.

AIBullisharXiv – CS AI · May 126/10
🧠

Learning to Explore: Scaling Agentic Reasoning via Exploration-Aware Policy Optimization

Researchers introduce EAPO, an exploration-aware reinforcement learning framework that enables LLM agents to selectively explore uncertain scenarios before acting. The method uses fine-grained reward functions and adaptive exploration mechanisms to improve decision-making across text and GUI-based agent benchmarks.

🏢 Hugging Face
AINeutralarXiv – CS AI · May 125/10
🧠

Sufficient conditions for a Heuristic Rating Estimation Method application

Researchers have formalized the sufficient conditions for applying the Heuristic Rating Estimation (HRE) method, a decision-making framework that evaluates alternatives through pairwise comparisons and reference weights. The study examines both arithmetic and geometric computational approaches for complete and incomplete comparison datasets, demonstrating that arithmetic variants provide optimal inconsistency estimates.

AINeutralarXiv – CS AI · May 126/10
🧠

Re$^2$Math: Benchmarking Theorem Retrieval in Research-Level Mathematics

Researchers introduce Re²Math, a new benchmark for evaluating large language models' ability to retrieve relevant mathematical theorems and lemmas from academic literature during proof construction. The benchmark reveals significant gaps in current AI systems, with the best model achieving only 7.0% accuracy despite retrieving valid statements, indicating AI struggles to verify applicability to specific proof contexts.

AINeutralarXiv – CS AI · May 126/10
🧠

CATO: Charted Attention for Neural PDE Operators

Researchers introduce CATO (Charted Axial Transformer Operator), a neural operator architecture that solves partial differential equations (PDEs) on complex geometries more efficiently than existing methods. By learning geometry-adaptive coordinate transformations and incorporating derivative-aware physics supervision, CATO achieves 26.76% performance improvement over competing approaches while reducing parameters by 82%.

AIBullisharXiv – CS AI · May 126/10
🧠

SearchSkill: Teaching LLMs to Use Search Tools with Evolving Skill Banks

SearchSkill is a new framework that teaches language models to perform more effective web searches by explicitly planning queries through reusable skill cards rather than treating search as an undifferentiated action. The system maintains an evolving skill bank that improves from failure patterns, demonstrating better performance on knowledge-intensive QA tasks with fewer wasted queries and improved reasoning accuracy.

AINeutralarXiv – CS AI · May 126/10
🧠

UxSID: Semantic-Aware User Interests Modeling for Ultra-Long Sequence

UxSID is a new machine learning framework that models long user behavior sequences using semantic grouping and dual-level attention, achieving state-of-the-art performance with a 0.337% revenue lift in large-scale advertising tests. The approach balances computational efficiency with semantic awareness by using Semantic IDs rather than item-specific search methods.

AIBullisharXiv – CS AI · May 126/10
🧠

Constant-Target Energy Matching: A Unified Framework for Continuous and Discrete Density Estimation

Researchers introduce Constant-Target Energy Matching (CTEM), a unified framework for density estimation that handles continuous, discrete, and mixed-variable data types within a single objective function. CTEM replaces traditional density-ratio regression with a bounded energy-difference transform, eliminating instability issues and partition-function estimation requirements while delivering improved sample quality across diverse data domains.

AINeutralarXiv – CS AI · May 126/10
🧠

When (and How) to Trust the Expert: Diagnosing Query-Time Expert-Guided Reinforcement Learning

Researchers conduct a comprehensive benchmarking study of expert-guided reinforcement learning methods, revealing three critical failure modes that single-paper evaluations miss. They propose a decision rule based on pre-training observables to guide method selection, introducing EDGE as a new design point that exposes exploitable architectural dimensions.

AINeutralarXiv – CS AI · May 126/10
🧠

MCP-Cosmos: World Model-Augmented Agents for Complex Task Execution in MCP Environments

Researchers present MCP-Cosmos, a framework integrating World Models into the Model Context Protocol ecosystem to enhance LLM agent planning and execution. The approach demonstrates measurable improvements in tool success rates and parameter accuracy across multiple benchmark tasks by enabling agents to simulate outcomes before taking actions.

AINeutralarXiv – CS AI · May 126/10
🧠

BoostAPR: Boosting Automated Program Repair via Execution-Grounded Reinforcement Learning with Dual Reward Models

BoostAPR is a new AI framework that improves automated program repair by using dual reward models and reinforcement learning to identify which code edits actually fix bugs. The system achieves significant improvements on multiple benchmarks, including 40.7% on SWE-bench Verified, demonstrating that more granular feedback mechanisms can substantially enhance AI's ability to repair software vulnerabilities.

AINeutralarXiv – CS AI · May 126/10
🧠

Open Ontologies: Tool-Augmented Ontology Engineering with Stable Matching Alignment

Open Ontologies is an open-source Rust-based system that combines LLM-driven ontology engineering with formal OWL reasoning and stable matching alignment. The research demonstrates that stable 1-to-1 matching is the critical factor for ontology alignment quality, achieving F1 scores competitive with state-of-the-art systems, while structured tool access via Model Context Protocol significantly outperforms raw file reading for LLM interaction.

AINeutralarXiv – CS AI · May 126/10
🧠

Emergent Semantic Role Understanding in Language Models

Researchers demonstrate that language models develop semantic role understanding (who-did-what-to-whom comprehension) primarily during pre-training, though fine-tuning still improves performance. Using linear probes on frozen transformer models, they find semantic role information emerges from language modeling objectives alone, with representation structure becoming more distributed as models scale.

AINeutralarXiv – CS AI · May 126/10
🧠

Learning the Preferences of a Learning Agent

Researchers present a theoretical framework for inferring the preferences and reward functions of learning agents through observation, extending inverse reinforcement learning beyond its traditional assumption that observed agents act optimally. The work establishes mathematical guarantees for preference learning algorithms when agents are either no-regret learners or converge to optimal Boltzmann policies.

AINeutralarXiv – CS AI · May 126/10
🧠

How Much is Brain Data Worth for Machine Learning?

Researchers present a mathematical framework quantifying the value of brain imaging data for training machine learning models, deriving scaling laws that establish exchange rates between neural recordings and task samples. The work identifies specific conditions where brain data improves model performance and robustness, providing theoretical foundations for when neural data collection is economically justified.

AINeutralarXiv – CS AI · May 126/10
🧠

SeePhys Pro: Diagnosing Modality Transfer and Blind-Training Effects in Multimodal RLVR for Physics Reasoning

Researchers introduce SeePhys Pro, a benchmark revealing that advanced AI models significantly degrade in physics reasoning when visual information replaces text, with visual grounding as the primary failure point. The study further demonstrates that multimodal reinforcement learning improvements can stem from non-visual textual cues rather than genuine visual understanding, challenging current evaluation methodologies.

AINeutralarXiv – CS AI · May 126/10
🧠

Shaping Schema via Language Representation as the Next Frontier for LLM Intelligence Expanding

A new arXiv paper argues that optimizing how language represents tasks—rather than scaling model size—is crucial for advancing LLM intelligence. The research demonstrates that deliberate language representation design can yield substantial performance improvements without modifying model parameters, supported by controlled experiments showing how different linguistic framings of identical tasks trigger different internal feature activations.

AINeutralarXiv – CS AI · May 126/10
🧠

EquiMem: Calibrating Shared Memory in Multi-Agent Debate via Game-Theoretic Equilibrium

Researchers introduce EquiMem, a game-theoretic framework that addresses vulnerabilities in multi-agent debate systems by validating shared memory entries without relying on LLM judgments. The approach treats memory updating as a zero-trust game where agent equilibrium indicates optimal trust levels, outperforming existing safeguards while maintaining minimal computational overhead.

AINeutralarXiv – CS AI · May 126/10
🧠

A Prompt-Aware Structuring Framework for Reliable Reuse of AI-Generated Content in the Agentic Web

Researchers propose a framework that automatically attaches structured metadata to AI-generated content at creation time, including prompts, model information, and confidence scores, enabling verification of reliability and license compliance. This addresses critical risks of chained hallucinations and compliance violations as AI agents increasingly dominate web content generation.

AINeutralarXiv – CS AI · May 126/10
🧠

PiCA: Pivot-Based Credit Assignment for Search Agentic Reinforcement Learning

Researchers introduce PiCA (Pivot-Based Credit Assignment), a novel reinforcement learning mechanism that improves how LLM-based search agents learn from long sequences of actions. By identifying key pivot steps and anchoring rewards to final task outcomes, PiCA addresses critical challenges in credit assignment, delivering 15.2% performance gains on knowledge-intensive QA tasks.

← PrevPage 1558 of 3964Next →
Filters
Sentiment
Importance
Sort
Stay Updated
Everything combined