y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto
🤖All100,525🧠AI22,940⛓️Crypto17,363💎DeFi1,799🤖AI × Crypto1,480📰General56,943

AI × Crypto News Feed

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

100525 articles
AINeutralarXiv – CS AI · May 116/10
🧠

Distributional Process Reward Models: Calibrated Prediction of Future Rewards via Conditional Optimal Transport

Researchers propose using conditional optimal transport to improve calibration of Process Reward Models (PRMs) used in AI inference-time scaling, addressing the problem of overestimated success probabilities. The method enables better confidence bounds for mathematical reasoning tasks and improves downstream performance in Best-of-N selection frameworks.

AINeutralarXiv – CS AI · May 116/10
🧠

A Rod Flow Model for Adam at the Edge of Stability

Researchers extend rod flow modeling to Adam and other adaptive gradient methods, enabling more accurate continuous-time analysis of optimizer behavior at the edge of stability. This advancement bridges a gap in theoretical understanding of momentum-based optimization algorithms critical to modern deep learning.

AINeutralarXiv – CS AI · May 116/10
🧠

Why DDIM Hallucinates More than DDPM: A Theoretical Analysis of Reverse Dynamics

Researchers provide theoretical analysis demonstrating that DDIM (deterministic diffusion model) generates more hallucinations than DDPM (stochastic diffusion model) when sampling from multi-modal distributions. The study proves that stochastic noise in DDPM helps escape local modes, while DDIM can become trapped between modes, with implications for improving generative AI sampling algorithms.

AINeutralarXiv – CS AI · May 116/10
🧠

IntentGrasp: A Comprehensive Benchmark for Intent Understanding

Researchers introduce IntentGrasp, a comprehensive benchmark dataset for evaluating how well large language models understand user intent across 12 diverse domains. Testing 20 frontier LLMs reveals widespread performance gaps, with most models scoring below 60% accuracy and many performing worse than random chance on challenging subsets, while a proposed fine-tuning method achieves 20-30+ point improvements.

🧠 GPT-5🧠 Claude🧠 Gemini
AINeutralarXiv – CS AI · May 116/10
🧠

PAMPOS: Causal Transformer-based Trajectory Prediction for Attack-Agnostic Misbehavior Detection in V2X Networks

Researchers present PAMPOS, a causal transformer-based system that detects misbehavior in Vehicle-to-Everything (V2X) networks by identifying deviations from learned normal driving patterns, achieving up to 98% AUC without requiring labeled attack data during training. This unsupervised approach addresses a critical security gap where cryptographic mechanisms alone cannot prevent insider falsification attacks in connected vehicle systems.

AINeutralarXiv – CS AI · May 116/10
🧠

LLM-Guided Open Hypothesis Learning from Autonomous Scanning Probe Microscopy Experiments

Researchers have developed an open hypothesis-learning framework that combines symbolic regression with large language models to autonomously discover physical laws from scanning probe microscopy experiments. Rather than optimizing within predefined objectives, the system generates and evaluates candidate physical models directly from experimental data, demonstrating success in characterizing ferroelectric domain switching behavior.

AINeutralarXiv – CS AI · May 116/10
🧠

How to Compress KV Cache in RL Post-Training? Shadow Mask Distillation for Memory-Efficient Alignment

Researchers propose Shadow Mask Distillation to address the memory bottleneck created by KV cache compression during reinforcement learning post-training of large language models. The technique tackles the critical off-policy bias that emerges when compressed contexts are used during rollout generation while full contexts are used for parameter updates, a problem that amplifies instability in RL optimization.

AIBullisharXiv – CS AI · May 116/10
🧠

Knowledge Transfer Scaling Laws for 3D Medical Imaging

Researchers demonstrate that different 3D medical imaging domains (CT, MRI, PET) transfer knowledge asymmetrically during pretraining, following predictable power-law patterns. By optimizing data allocation based on these transfer dynamics, they achieve up to 58% performance gains over proportional sampling, revealing a hub-and-island structure where certain domains act as foundational knowledge sources for others.

AIBullisharXiv – CS AI · May 116/10
🧠

Don't Retrain, Align: Adapting Autoregressive LMs to Diffusion LMs via Representation Alignment

Researchers introduce REPR-ALIGN, a method that converts autoregressive language models into diffusion language models by aligning their internal representations rather than retraining from scratch. The approach achieves up to 4x training acceleration and demonstrates that semantic structures learned through next-token prediction can transfer across different generation orders.

AINeutralarXiv – CS AI · May 116/10
🧠

MELD: Multi-Task Equilibrated Learning Detector for AI-Generated Text

Researchers introduce MELD, an advanced AI-generated text detector that uses multi-task learning to improve robustness against adversarial attacks, transfer across unseen models and domains, and maintain low false-positive rates. The detector outperforms most open-source competitors and matches leading commercial systems on public benchmarks.

AINeutralarXiv – CS AI · May 116/10
🧠

Same Signal, Opposite Meaning: Direction-Informed Adaptive Learning for LLM Agents

Researchers demonstrate that adaptive compute gates for LLM agents produce unstable and reversible signals across different environments and models, where the same confidence metric predicts both beneficial and harmful outcomes. They propose DIAL, a learned gating mechanism trained through counterfactual exploration, which outperforms fixed-direction baselines by accounting for task-specific utility directions.

AINeutralarXiv – CS AI · May 116/10
🧠

In-Context Credit Assignment via the Core

Researchers propose a new mechanism for fairly distributing compensation among creators whose intellectual property appears in AI model context windows, using cooperative game theory's least core solution. The approach efficiently approximates fair value distribution while requiring significantly fewer computational resources than existing methods.

AINeutralarXiv – CS AI · May 116/10
🧠

Bridging the Last Mile of Circuit Design: PostEDA-Bench, a Hierarchical Benchmark for PPA Convergence and DRC Fixing

Researchers introduce PostEDA-Bench, a hierarchical benchmark for evaluating LLM-based agents in Electronic Design Automation tasks, specifically targeting Design Rule Check (DRC) fixing and Power-Performance-Area (PPA) optimization. Testing eight LLMs across 145 tasks reveals significant performance gaps, with best success rates of 36.66% for complex DRC reasoning and only 20% for multi-objective PPA optimization, indicating substantial room for improvement in AI-assisted chip design automation.

AINeutralarXiv – CS AI · May 116/10
🧠

A Generalized Singular Value Theory for Neural Networks

Researchers prove that modern neural networks can be represented using a Generalized Singular Value Decomposition that makes them left-invertible before a final linear layer while preserving norm properties. This mathematical framework enables distance calibration between feature space and input space, with demonstrated applications to adversarial perturbation detection and potential future use in addressing model bias and invertibility.

AINeutralarXiv – CS AI · May 116/10
🧠

Adaptive Memory Decay for Log-Linear Attention

Researchers propose a modification to log-linear attention mechanisms that learns adaptive memory decay parameters directly from input data rather than using fixed values. This approach maintains logarithmic memory growth and log-linear computational complexity while improving long-range context retention, particularly in language modeling and selective recall tasks.

AINeutralarXiv – CS AI · May 116/10
🧠

Kurtosis-Guided Denoising Score Matching for Tabular Anomaly Detection

Researchers introduce K-DSM, a kurtosis-based noise scaling method for denoising score matching that improves tabular anomaly detection without additional model complexity. The approach achieves state-of-the-art performance by adaptively setting noise levels per feature based on marginal distribution shape, reducing hyperparameter tuning burden in scenarios where anomalies are unknown.

AIBullisharXiv – CS AI · May 116/10
🧠

From Surface Learning to Deep Understanding: A Grounded AI Tutoring System for Moodle

Researchers have developed an AI Teaching & Learning Assistant, a Moodle plugin using Retrieval-Augmented Generation (RAG) to provide students with Socratic tutoring while enabling educators to supervise content generation. The system grounds LLM responses in teacher-provided materials to minimize hallucinations and misinformation, achieving high faithfulness scores (0.97) and strong user satisfaction (4.00/5.00 rating).

AINeutralarXiv – CS AI · May 116/10
🧠

AI and Consciousness: Shifting Focus Towards Tractable Questions

A researcher argues that directly determining whether AI systems possess consciousness is currently intractable, but studying how people perceive AI consciousness is tractable and consequential. As the public increasingly attributes human-like consciousness to AI systems, this perception is reshaping ethical standards, user experience design, and linguistic norms across society.

AINeutralarXiv – CS AI · May 116/10
🧠

Decentralized Time-Varying Optimization for Streaming Data via Temporal Weighting

Researchers propose a decentralized gradient descent framework for optimizing time-varying objectives across distributed networks processing streaming data. The work analyzes tracking error using temporal weighting strategies, showing uniform weighting achieves O(1/t) convergence while exponential discounting maintains non-vanishing error floors, with implications for distributed machine learning systems.

AINeutralarXiv – CS AI · May 116/10
🧠

$f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses

Researchers present a unified theoretical framework for f-divergence regularized Reinforcement Learning from Human Feedback (RLHF), moving beyond the standard reverse KL approach. The work introduces two novel algorithms with provable efficiency guarantees, achieving O(log T) regret bounds and establishing the first theoretical performance guarantees for online RLHF under general f-divergence regularization.

AIBullisharXiv – CS AI · May 116/10
🧠

Group of Skills: Group-Structured Skill Retrieval for Agent Skill Libraries

Researchers introduce Group of Skills (GoSkills), a new method for organizing and retrieving skills in AI agent libraries that presents skills as structured execution contexts rather than flat lists. The approach improves agent performance on benchmark tasks while maintaining efficiency and doesn't require changes to existing agent systems.

AINeutralarXiv – CS AI · May 116/10
🧠

PLOT: Progressive Localization via Optimal Transport in Neural Causal Abstraction

Researchers introduce PLOT (Progressive Localization via Optimal Transport), a new framework for mechanistic interpretability that efficiently identifies causal variables in neural networks through optimal transport coupling rather than computationally expensive searches. The method significantly speeds up causal abstraction analysis while maintaining competitive accuracy, offering practical advantages for large-scale AI interpretability research.

AINeutralarXiv – CS AI · May 116/10
🧠

Drawing Lines in Psychological Space: What K-means Clustering Reveals in Simulated and Real Psychometric Data

Researchers demonstrate that K-means clustering, a widely-used statistical method in psychological research, can produce apparently meaningful subgroups even when analyzing data without genuine underlying categories. Testing the method on simulated data and the SMARVUS international psychometric dataset reveals that geometric partitioning around centroids may create the illusion of real psychological typologies rather than identifying them.

AINeutralarXiv – CS AI · May 116/10
🧠

LensVLM: Selective Context Expansion for Compressed Visual Representation of Text

LensVLM is a new inference framework that enables Vision Language Models to process highly compressed images of text by selectively expanding relevant sections, achieving 4.3x compression while maintaining accuracy comparable to full-resolution processing. The approach combines learned tool selection with post-training techniques to overcome the fundamental limitation that compressed text becomes illegible to standard vision encoders.

← PrevPage 1608 of 4021Next →
Filters
Sentiment
Importance
Sort
Stay Updated
Everything combined