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

AI × Crypto News Feed

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

100474 articles
AIBullisharXiv – CS AI · May 116/10
🧠

MPD$^2$-Router: Mask-aware Multi-expert Prior-regularized Dual-head Deferral Router in Glaucoma Screening and Diagnosis

MPD²-Router is a machine learning framework that improves glaucoma screening by intelligently routing difficult cases between AI systems and human experts based on availability, uncertainty, and image quality. The system achieves better clinical outcomes than AI-alone approaches while maintaining balanced expert utilization across multiple international datasets.

AIBullisharXiv – CS AI · May 116/10
🧠

VecCISC: Improving Confidence-Informed Self-Consistency with Reasoning Trace Clustering and Candidate Answer Selection

Researchers propose VecCISC, an optimization framework for weighted majority voting in large language models that reduces computational costs by 47% while maintaining accuracy. The method filters redundant or hallucinated reasoning traces using semantic similarity before evaluation, addressing the expensive overhead of confidence-scoring multiple candidate answers.

AIBullisharXiv – CS AI · May 116/10
🧠

Consensus Entropy: Harnessing Multi-VLM Agreement for Self-Verifying and Self-Improving OCR

Researchers introduce Consensus Entropy (CE), a training-free metric that improves OCR quality by measuring agreement across multiple Vision-Language Models, achieving 42.1% F1 score improvements over existing methods. The technique enables self-verifying OCR without supervision, addressing a critical gap in automated error detection for data generation pipelines used in LLM training.

AINeutralarXiv – CS AI · May 116/10
🧠

CommFuse: Hiding Tail Latency via Communication Decomposition and Fusion for Distributed LLM Training

Researchers introduce CommFuse, a novel communication-computation overlap technique that eliminates tail latency in distributed LLM training by decomposing collective operations into peer-to-peer communications. The method improves efficiency for both tensor parallelism and data parallelism across GPU/TPU/NPU clusters, achieving higher throughput and model FLOPS utilization compared to existing solutions.

AINeutralarXiv – CS AI · May 116/10
🧠

Evaluating Prompt Injection Defenses for Educational LLM Tutors: Security-Usability-Latency Trade-offs

Researchers evaluated prompt-injection defenses for educational LLM tutors, revealing inherent trade-offs between security, usability, and speed. A multi-layer safeguard pipeline achieved 46.34% attack bypass with zero false positives and 2.50ms latency, while competing systems like NeMo Guardrails eliminated bypasses but suffered 16.22% false positive rates and 1.3-second delays.

AINeutralarXiv – CS AI · May 116/10
🧠

Domain-level metacognitive monitoring in frontier LLMs: A 33-model atlas

Researchers evaluated metacognitive monitoring across 33 frontier LLMs using 47,151 MMLU benchmark items, finding significant domain-level variation masked by aggregate performance scores. Applied/Professional knowledge domains showed consistently strong self-monitoring (AUROC .742), while Formal Reasoning and Natural Science proved most challenging, with implications for targeted model deployment.

🏢 OpenAI🏢 Anthropic🧠 Gemini
AINeutralarXiv – CS AI · May 116/10
🧠

Multimodal synthesis of MRI and tabular data with diffusion in a joint latent space via cross-attention

Researchers have developed a multimodal latent diffusion model that simultaneously synthesizes MRI brain scans and clinical tabular data (age, sex, body measurements) within a shared latent space using cross-attention mechanisms. Tested on over 10,000 participants from the German National Cohort, the system generates anatomically plausible synthetic medical data where image and tabular attributes remain coherently aligned, representing the first successful joint modeling of volumetric medical images with mixed-type clinical data.

AINeutralarXiv – CS AI · May 116/10
🧠

The Single-File Test: A Longitudinal Public-Interface Evaluation of First-Output LLM Web Generation with Social Reach Tracking

A comprehensive eight-week study evaluated 68 HTML generations from four major LLM families (GPT, Gemini, Grok, Claude) in standardized web generation tasks, finding Claude delivered the most consistent performance while questioning assumptions about reasoning time and social media predictability. The research reveals significant evaluation bias in LLM-as-judge systems and that code verbosity correlates more with model architecture than prompt specificity.

🧠 Claude🧠 Gemini🧠 Grok
AIBullisharXiv – CS AI · May 116/10
🧠

Visual Text Compression as Measure Transport

Researchers propose a new theoretical framework for understanding visual text compression (VTC) using measure transport theory, which reveals that token savings don't reliably predict performance gains. They develop label-free methods to identify when visual encoding helps or hurts performance, achieving 70% accuracy in matching oracle decisions and improving average task scores by 3.3% while reducing tokens by 10.3%.

AINeutralarXiv – CS AI · May 116/10
🧠

Edge Deep Learning in Computer Vision and Medical Diagnostics: A Comprehensive Survey

A comprehensive academic survey examines edge deep learning—the integration of deep learning with edge computing—and its applications in computer vision and medical diagnostics. The paper categorizes hardware platforms, reviews model optimization techniques like compression and lightweight design, and identifies future challenges for deploying neural networks on resource-constrained devices.

AINeutralarXiv – CS AI · May 116/10
🧠

Agentic Coding Needs Proactivity, Not Just Autonomy

Researchers propose that coding agents need to move beyond autonomy toward proactivity—the ability to anticipate developer needs, connect signals across tools, and make unsolicited but valuable interventions. The work introduces a taxonomy of proactivity levels and evaluation metrics (Insight Decision Quality, Context Grounding Score, Learning Lift) to measure whether agent behavior genuinely improves development workflows rather than merely increasing activity.

AINeutralarXiv – CS AI · May 116/10
🧠

OmicsLM: A Multimodal Large Language Model for Multi-Sample Omics Reasoning

Researchers introduce OmicsLM, a multimodal large language model that interprets transcriptomic data by combining quantitative gene expression profiles with natural language processing. Trained on 5.5 million examples across 70 task types, the model outperforms specialized omics tools and general LLMs on language-guided biological reasoning tasks, advancing AI applications in genomic research.

AINeutralarXiv – CS AI · May 116/10
🧠

Beyond Factor Aggregation: Gauge-Aware Low-Rank Server Representations for Federated LoRA

Researchers propose GLoRA, a gauge-aware federated learning framework that improves parameter-efficient adaptation of large language models by aggregating semantic updates rather than raw LoRA factors. The method addresses a fundamental mathematical limitation in existing federated LoRA systems and demonstrates consistent performance improvements across heterogeneous client scenarios.

AIBullisharXiv – CS AI · May 116/10
🧠

Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning

Researchers propose gated QKAN-FWP, a quantum-inspired machine learning framework that combines Fast Weight Programmers with quantum-inspired Kolmogorov-Arnold Networks using single-qubit circuits. The model achieves superior performance on time-series forecasting tasks with 12.5k parameters while maintaining compatibility with current NISQ quantum processors, demonstrating practical viability for near-term quantum computing applications.

AIBullisharXiv – CS AI · May 116/10
🧠

STDA-Net: Spectrogram-Based Domain Adaptation for cross-dataset Sleep Stage Classification

Researchers propose STDA-Net, a deep learning framework for sleep stage classification that uses 2D spectrograms instead of traditional 1D EEG signals, combined with domain adaptation techniques to work across different datasets. The method achieves 89.03% accuracy and demonstrates superior stability compared to existing approaches, advancing automated sleep staging technology.

AINeutralarXiv – CS AI · May 116/10
🧠

Geometric Kolmogorov--Arnold Network (GeoKAN)

Researchers introduce Geometric Kolmogorov-Arnold Networks (GeoKANs), an advancement in KAN-type neural networks that learn geometry-adapted coordinate systems rather than relying on fixed Euclidean inputs. By adapting a diagonal Riemannian metric during training, GeoKAN redistributes computational capacity toward regions of rapid variation, making it particularly effective for physics-informed learning and differential equation problems.

AINeutralarXiv – CS AI · May 116/10
🧠

A Statistical Framework for Algorithmic Collective Action with Multiple Collectives

Researchers propose the first statistical framework for Algorithmic Collective Action (ACA) involving multiple independent collectives attempting to coordinate changes in shared data to influence AI classifier behavior. The framework provides computable bounds on collective success while accounting for varying sizes, strategies, and goal alignment across groups, with applications to climate adaptation in smart cities.

AIBullisharXiv – CS AI · May 116/10
🧠

Gradient Extrapolation-Based Policy Optimization

Researchers propose GXPO, a new policy optimization technique for reinforcement learning that approximates multi-step lookahead using only three backward passes instead of many, improving large language model reasoning performance by 1.65-5.00 points over standard GRPO while achieving up to 4x step speedup.

🧠 Llama
AINeutralarXiv – CS AI · May 116/10
🧠

R$^3$L: Reasoning 3D Layouts from Relative Spatial Relations

R³L is a new framework that improves 3D layout generation by addressing errors in relative spatial reasoning through invariant spatial decomposition and consistent spatial imagination. The approach tackles the problem of error accumulation in multi-hop reasoning tasks, producing more physically feasible and semantically consistent layouts than previous methods leveraging Multimodal Large Language Models.

AINeutralarXiv – CS AI · May 115/10
🧠

A Linear-Transformer Hybrid for SNP-Based Genotype-to-Phenotype Prediction in Grapevine

Researchers developed LiT-G2P, a hybrid machine learning model combining linear genetic effects with Transformer-based neural networks to predict plant traits from DNA sequences in grapevines. The approach achieved superior prediction accuracy for leaf and trichome density across multiple years, demonstrating practical applications for genomic selection in agricultural breeding.

AIBullisharXiv – CS AI · May 116/10
🧠

Revisiting Adam for Streaming Reinforcement Learning

Researchers challenge the conventional wisdom that deep reinforcement learning requires replay buffers by demonstrating that classical update methods like C51 perform competitively in streaming online settings when paired with proper optimization techniques. The study identifies two critical properties—bounded objective derivatives and variance-adjusted weight updates—as essential for stable learning, leading to a new algorithm called Adaptive Q(λ) that substantially outperforms existing streaming approaches.

AIBullisharXiv – CS AI · May 116/10
🧠

VITA-QinYu: Expressive Spoken Language Model for Role-Playing and Singing

Researchers unveiled VITA-QinYu, an expressive spoken language model that extends beyond natural conversation to generate role-playing and singing through a hybrid speech-text architecture. The model achieves state-of-the-art performance on conversational benchmarks while demonstrating superior expressiveness in non-conversational tasks, with researchers open-sourcing the code and providing a streaming-capable demo.

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.

← PrevPage 1607 of 4019Next →
Filters
Sentiment
Importance
Sort
Stay Updated
Everything combined