y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto
🤖All98,793🧠AI22,940⛓️Crypto17,363💎DeFi1,799🤖AI × Crypto1,480📰General55,211

AI × Crypto News Feed

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

98064 articles
AIBullisharXiv – CS AI · May 127/10
🧠

Entropy-informed Decoding: Adaptive Information-Driven Branching

Researchers introduce Entropy-informed Decoding (EDEN), a novel framework that optimizes how large language models generate text by dynamically adjusting computational effort based on output uncertainty. The method matches or exceeds the performance of traditional beam search while using fewer computational expansions, particularly improving results on complex tasks like mathematical reasoning and code generation.

AIBearisharXiv – CS AI · May 127/10
🧠

Why Do Aligned LLMs Remain Jailbreakable: Refusal-Escape Directions, Operator-Level Sources, and Safety-Utility Trade-off

Researchers identify Refusal-Escape Directions (RED) as mathematical perturbation vectors that explain why aligned LLMs remain vulnerable to jailbreaks. The study reveals structural vulnerabilities arise from fundamental trade-offs between safety mechanisms and model utility, with normalization and residual connections as key exploitable components.

AIBullisharXiv – CS AI · May 127/10
🧠

MolWorld: Molecule World Models for Actionable Molecular Optimization

Researchers introduce MolWorld, a novel AI framework that optimizes molecular structures for drug discovery by modeling actionable pathways between molecules. Unlike existing methods, MolWorld ensures discovered candidates are chemically reachable from known compounds through valid intermediate steps, making them practically viable for lead optimization.

AIBearisharXiv – CS AI · May 127/10
🧠

Benchmarking Compositional Generalisation for Machine Learning Interatomic Potentials

Researchers have created a benchmark to test whether machine learning interatomic potentials can generalize to unseen molecules by learning underlying chemical principles. The study reveals that state-of-the-art models, including foundation models trained on millions of molecules, fail significantly on out-of-distribution examples, with errors often 10x higher than on training data.

AIBullisharXiv – CS AI · May 127/10
🧠

Debugging the Debuggers: Failure-Anchored Structured Recovery for Software Engineering Agents

Researchers present PROBE, a framework that improves how AI software engineering agents recover from failures by converting runtime telemetry into structured diagnoses and bounded recovery guidance. The system achieves 65% diagnosis accuracy and 21.8% recovery rates on previously unresolved cases, with a prototype deployed at Microsoft showing practical viability without disrupting existing workflows.

AIBullisharXiv – CS AI · May 127/10
🧠

Event Fields: Learning Latent Event Structure for Waveform Foundation Models

Researchers introduce a novel waveform foundation model that represents physiological signals as latent event processes rather than sequential tokens, using self-supervised learning to capture clinically meaningful structure. The approach demonstrates improved performance on medical benchmarks including arrhythmia classification and hemodynamic prediction, suggesting event-centric representations may be more suitable for healthcare AI than traditional sequence-based methods.

AIBullisharXiv – CS AI · May 127/10
🧠

SlimQwen: Exploring the Pruning and Distillation in Large MoE Model Pre-training

Researchers present SlimQwen, a systematic study of compression techniques for mixture-of-experts (MoE) language models during pretraining. The work demonstrates that pruning pretrained MoE models outperforms training smaller architectures from scratch, and proposes progressive pruning combined with knowledge distillation as the most effective compression strategy, successfully compressing Qwen3-Next-80A3B to 23A2B while maintaining competitive performance.

AIBearisharXiv – CS AI · May 127/10
🧠

Explanation Fairness in Large Language Models: An Empirical Analysis of Disparities in How LLMs Justify Decisions Across Demographic Groups

Researchers have identified systematic fairness disparities in how large language models explain their decisions across demographic groups, introducing the Explanation Fairness Taxonomy (EFT) to measure five dimensions of explanation inequality. Testing five major LLMs across hiring, medical, credit, and legal domains reveals statistically significant disparities in explanation quality, with stylistic inequalities appearing resistant to prompt-based fixes and likely embedded in model pre-training.

🧠 GPT-4🧠 Claude
AINeutralarXiv – CS AI · May 127/10
🧠

Unlearners Can Lie: Evaluating and Improving Honesty in LLM Unlearning

Researchers identify critical honesty failures in Large Language Model unlearning methods, where models hallucinate or behave inconsistently after attempting to forget harmful training data. They propose ReVa, a representation-alignment procedure that significantly improves model honesty by better acknowledging forgotten knowledge while maintaining utility on retained information.

AINeutralarXiv – CS AI · May 127/10
🧠

AgentCollabBench: Diagnosing When Good Agents Make Bad Collaborators

Researchers introduced AgentCollabBench, a diagnostic benchmark revealing critical vulnerabilities in multi-agent AI systems where constraints silently fail during peer collaboration. The study demonstrates that communication topology—not model capability alone—determines whether safeguards survive information handoffs between agents, exposing structural weaknesses invisible to standard outcome-based evaluation.

🧠 GPT-4🧠 Gemini🧠 Llama
AIBullisharXiv – CS AI · May 127/10
🧠

BubbleSpec: Turning Long-Tail Bubbles into Speculative Rollout Drafts for Synchronous Reinforcement Learning

Researchers introduce BubbleSpec, a framework that optimizes Reinforcement Learning training for Large Language Models by exploiting idle GPU time during synchronous rollouts. The method uses speculative decoding to pre-generate draft outputs during wait periods, achieving 50% reduction in decoding steps and up to 1.8x throughput improvement while maintaining mathematical exactness.

AIBearisharXiv – CS AI · May 127/10
🧠

LLM-Agnostic Semantic Representation Attack

Researchers have developed Semantic Representation Attack (SRA), a novel adversarial technique that bypasses LLM safety mechanisms by targeting semantic meaning rather than specific text patterns. The method achieves 99.71% attack success rates across 26 open-source models with strong cross-model transferability, raising significant security concerns for deployed AI systems.

AIBullisharXiv – CS AI · May 127/10
🧠

Geometry Guided Self-Consistency for Physical AI

Researchers introduce KeyStone, an inference-time method that improves physical AI model performance by generating multiple candidate action trajectories in parallel and selecting the most physically coherent one using geometric clustering. The technique achieves up to 13.3% improvement in task success rates across vision-language-action and world-action models without additional latency or training costs.

AIBullisharXiv – CS AI · May 127/10
🧠

Continuous Latent Contexts Enable Efficient Online Learning in Transformers

Researchers demonstrate that transformer models equipped with continuous latent context tokens can efficiently implement online learning algorithms without parameter updates. A small GPT-2-style model trained with this approach outperforms much larger language models on synthetic online prediction tasks, suggesting a promising architectural direction for adaptive AI systems.

AIBullisharXiv – CS AI · May 127/10
🧠

MC-RFM: Geometry-Aware Few-Shot Adaptation via Mixed-Curvature Riemannian Flow Matching

Researchers introduce MC-RFM, a novel framework for efficiently adapting frozen vision models to new tasks using mixed-curvature Riemannian geometry. The method represents adapted features on a product manifold combining hyperbolic and Euclidean spaces, outperforming existing parameter-efficient adaptation techniques across multiple benchmarks and backbone architectures.

AIBullisharXiv – CS AI · May 127/10
🧠

G-Zero: Self-Play for Open-Ended Generation from Zero Data

Researchers introduce G-Zero, a verifier-free framework that enables large language models to improve autonomously through self-play without relying on external judges or proxy models. The approach uses an intrinsic reward mechanism called Hint-δ to identify and address the Generator model's blind spots, achieving scalable self-evolution across unverifiable domains.

AINeutralarXiv – CS AI · May 127/10
🧠

MathConstraint: Automated Generation of Verified Combinatorial Reasoning Instances for LLMs

Researchers introduced MathConstraint, an adaptive benchmark for testing large language models' combinatorial reasoning abilities using constraint satisfaction problems with automated verification. The benchmark reveals significant performance gaps between frontier models, with accuracy dropping from 72-87% on easier instances to 18-66% on harder ones, while tool access via Python solvers roughly doubles performance.

🧠 GPT-5
AIBullisharXiv – CS AI · May 127/10
🧠

Uncovering Intra-expert Activation Sparsity for Efficient Mixture-of-Expert Model Execution

Researchers demonstrate that Mixture of Experts (MoE) models contain substantial underutilized sparsity within individual experts that can be exploited without modifying model parameters. By implementing intra-expert activation sparsity in vLLM, they achieve up to 2.5x speedup in MoE layer execution, offering a practical optimization path for efficient large language model deployment.

AIBullisharXiv – CS AI · May 127/10
🧠

Kaczmarz Linear Attention

Researchers propose Kaczmarz Linear Attention (KLA), an improved algorithm for long-context language modeling that replaces empirically-learned coefficients with mathematically-derived key-norm-normalized step sizes. KLA outperforms existing linear attention baselines like Gated DeltaNet while maintaining computational efficiency and enabling stable processing of up to 65K token contexts.

🏢 Perplexity
AIBearisharXiv – CS AI · May 127/10
🧠

Causal Stories from Sensor Traces: Auditing Epistemic Overreach in LLM-Generated Personal Sensing Explanations

Researchers identified epistemic overreach in LLM-generated explanations of personal sensing data, where AI systems produce coherent-sounding narratives about anomalous days without sufficient evidentiary support. Testing 14,922 explanations across three LLM families revealed that models routinely attribute causes without data justification, and this problem persists even when provided richer context or explicit instructions to constrain claims.

🧠 Llama
AIBullisharXiv – CS AI · May 127/10
🧠

Bridging Modalities, Spanning Time: Structured Memory for Ultra-Long Agentic Video Reasoning

Researchers introduce MAGIC-Video, a training-free framework that enables multimodal AI systems to process and reason about ultra-long videos spanning days or weeks by combining a structured memory graph with narrative chains. The system outperforms existing baselines on multiple benchmarks, addressing a critical limitation where current LLMs can only handle tens of minutes of video despite having million-token context windows.

AIBullisharXiv – CS AI · May 127/10
🧠

PARD-2: Target-Aligned Parallel Draft Model for Dual-Mode Speculative Decoding

PARD-2 introduces a dual-mode speculative decoding framework that accelerates large language model inference by up to 6.94× through improved draft model training aligned with token acceptance rather than prediction accuracy. The advancement uses Confidence-Adaptive Token optimization to enable single draft models to operate in both target-dependent and target-independent modes, significantly outperforming existing methods like EAGLE-3.

🧠 Llama
AIBullisharXiv – CS AI · May 127/10
🧠

DUET: Optimize Token-Budget Allocation for Reinforcement Learning with Verifiable Rewards

Researchers introduce DUET, a method for optimizing token allocation in reinforcement learning with verifiable rewards that jointly controls which prompts receive rollouts and how long each rollout runs. The technique achieves superior reasoning quality on math and coding benchmarks while using 50% fewer tokens than baseline methods, suggesting efficiency gains don't require sacrificing model performance.

🧠 Llama
AIBearisharXiv – CS AI · May 127/10
🧠

When Child Inherits: Modeling and Exploiting Subagent Spawn in Multi-Agent Networks

Researchers have identified critical security vulnerabilities in multi-agent AI networks where compromised parent agents can propagate malicious instructions to spawned subagents through inherited memory. The study demonstrates how current LLM frameworks violate trust boundaries via insecure memory inheritance and weak resource controls, turning localized agent compromises into systemic network risks.

🧠 ChatGPT
AIBullisharXiv – CS AI · May 127/10
🧠

Towards Autonomous Railway Operations: A Semi-Hierarchical Deep Reinforcement Learning Approach to the Vehicle Rescheduling Problem

Researchers introduce a semi-hierarchical deep reinforcement learning approach to optimize railway vehicle rescheduling and traffic management. The method outperforms traditional operational research and monolithic RL baselines by nearly doubling train arrivals while maintaining low deadlock rates, demonstrating viable autonomous railway operations at scale.

← PrevPage 386 of 3923Next →
Filters
Sentiment
Importance
Sort
Stay Updated
Everything combined