y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto
🤖All95,044🧠AI22,940⛓️Crypto17,363💎DeFi1,799🤖AI × Crypto1,480📰General51,462

AI × Crypto News Feed

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

95047 articles
AIBullisharXiv – CS AI · Jun 16/10
🧠

Post-Training LLMs as Better Decision-Making Agents: A Regret-Minimization Approach

Researchers introduce Iterative Regret-Minimization Fine-Tuning (Iterative RMFT), a post-training method that improves LLMs' decision-making capabilities by iteratively distilling low-regret trajectories back into models. The approach addresses fundamental limitations in how LLMs handle online decision problems without relying on rigid algorithmic templates, demonstrating improvements across multiple model architectures.

🧠 GPT-4
AINeutralarXiv – CS AI · Jun 16/10
🧠

Agentic Physical AI toward a Domain-Specific Foundation Model for Energy Systems: A Case Study on Nuclear Reactor Control

Researchers propose a domain-specific foundation model for safety-critical physical systems using a compact 360M-parameter language model trained on synthetic nuclear reactor simulations rather than general-purpose vision-language models. The approach demonstrates significant reliability improvements in controlled environments but is positioned as one component within a broader verification architecture, not a standalone safety solution.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Regret-Based Federated Causal Discovery with Unknown Interventions

Researchers introduce I-PERI, a federated causal discovery algorithm that handles unknown client-level interventions across decentralized systems. The method advances privacy-preserving causal inference by recovering tighter equivalence classes when clients operate under heterogeneous, undisclosed policies—addressing a critical gap between theoretical causal discovery methods and real-world deployment constraints.

AINeutralarXiv – CS AI · Jun 16/10
🧠

NEMO: Execution-Aware Optimization Modeling via Autonomous Coding Agents

NEMO is an AI system that converts natural language descriptions of optimization problems into executable mathematical code using autonomous coding agents. The approach achieves state-of-the-art results on optimization benchmarks by treating code execution as a first-class constraint, ensuring generated solutions are functional by design rather than relying on specialized language models that often produce broken code.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Diagnosing the Reliability of LLM-as-a-Judge via Item Response Theory

Researchers introduce a diagnostic framework using Item Response Theory (IRT) to assess the reliability of Large Language Models used as automated judges. The framework evaluates LLM judges on two dimensions: intrinsic consistency (stability under prompt variations) and human alignment (correspondence with human assessments), providing practical guidance for identifying unreliability sources.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Discovering Differences in Strategic Behavior Between Humans and LLMs

Researchers used AlphaEvolve to compare strategic behavior between humans and Large Language Models in game theory scenarios, discovering that frontier LLMs demonstrate more sophisticated strategic thinking than humans in iterated rock-paper-scissors. This finding highlights critical differences in how AI systems and humans approach strategic decision-making, with implications for deploying LLMs in competitive and social contexts.

AINeutralarXiv – CS AI · Jun 16/10
🧠

PlanningBench: Generating Scalable and Verifiable Planning Data for Evaluating and Training Large Language Models

Researchers introduce PlanningBench, a framework for generating scalable and verifiable planning datasets to evaluate and train large language models on complex task coordination. The system uses a constraint-driven synthesis pipeline with adaptive difficulty control and finds that current frontier LLMs struggle with coupled constraints, though reinforcement learning on verified data improves performance across planning and instruction-following tasks.

AINeutralarXiv – CS AI · Jun 16/10
🧠

BoxLitE: A Faithful Knowledge Base Embedding Based on Convex Optimization

BoxLitE introduces a new knowledge base embedding model for DL-Lite ontologies that leverages convex optimization to represent hierarchical conceptual knowledge. The research demonstrates that faithful embeddings can be mathematically formulated as convex optimization problems, combining classical knowledge graph embeddings with ontology-based reasoning.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Cross-Modal Attention Calibration for LVLM Hallucination Mitigation

Researchers propose Cross-Modal Attention Calibration (CMAC), a training-free method to reduce hallucinations in large vision-language models by addressing position bias and spurious correlations between visual and textual modalities. The approach combines an Inter-Modality Decoding module with contrastive mechanisms and a position calibration component to improve consistency between visual inputs and generated outputs.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Auto-Discovery-Bench: Diagnosing Structured State Tracking in Oracle-Guided Discovery

Researchers introduce Auto-Discovery-Bench, a diagnostic benchmark that tests AI agents' ability to maintain and update structured beliefs through iterative hypothesis-intervention-feedback cycles. The benchmark reveals that performance degrades significantly with increased complexity variables, and identifies limitations in long-range structured information integration as a key bottleneck for scientific discovery agents.

AIBullisharXiv – CS AI · Jun 16/10
🧠

Unraveling LoRA Interference: Orthogonal Subspaces for Robust Model Merging

Researchers propose Orthogonal Subspaces for Robust model Merging (OSRM), a technique that addresses performance degradation when combining multiple LoRA-fine-tuned language models into single multi-task systems. By constraining LoRA subspaces prior to fine-tuning, the method reduces task interference while maintaining individual task accuracy and improving compatibility with existing merging algorithms.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Who Gets Credit or Blame? Attributing Accountability in Modern AI Systems

Researchers propose a framework to attribute AI model behavior to specific development stages (pretraining, fine-tuning, alignment), enabling accountability tracking without model retraining. The method quantifies how each stage contributes to model outputs and can identify spurious correlations, advancing transparency in AI development.

AINeutralarXiv – CS AI · Jun 16/10
🧠

DISCO: Mitigating Bias in Deep Learning with Conditional Distance Correlation

Researchers introduce DISCO, a machine learning framework that uses conditional distance correlation to mitigate dataset bias in deep learning models. By grounding the approach in causal theory through the Standard Anti-Causal Model (SAM), the method achieves competitive performance across multiple datasets while requiring fewer hyperparameters than existing bias mitigation techniques.

AIBullisharXiv – CS AI · Jun 16/10
🧠

PictSure: Pretraining Embeddings Matters for In-Context Learning Image Classifiers

PictSure introduces a vision-only in-context learning framework for few-shot image classification that demonstrates representation quality from pretraining is the critical bottleneck, not fusion-layer training diversity. The researchers release open-source models and an MCP server enabling few-shot image classification integration directly into LLM-based systems.

🏢 Hugging Face
AINeutralarXiv – CS AI · Jun 15/10
🧠

Residual Reservoir Memory Networks

Researchers introduce Residual Reservoir Memory Networks (ResRMNs), a novel untrained RNN architecture combining linear and non-linear reservoirs with residual orthogonal temporal connections to improve long-term sequence propagation. The approach demonstrates performance advantages over conventional Reservoir Computing models on time-series and classification tasks.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Target-Agnostic Calibration under Distribution Shift with Frequency-Aware Gradient Rectification

Researchers propose Frequency-aware Gradient Rectification (FGR), a training framework that improves neural network calibration under distribution shifts without requiring access to target domains. The method uses low-pass filtering to reduce spurious patterns while maintaining in-distribution performance through geometric constraint projection.

AIBullisharXiv – CS AI · Jun 16/10
🧠

SAEmnesia: Erasing Concepts in Diffusion Models with Supervised Sparse Autoencoders

Researchers introduce SAEmnesia, a supervised sparse autoencoder framework that enables efficient concept unlearning in diffusion models by binding concepts to individual neurons. The method reduces computational overhead by 96.67% compared to existing approaches and achieves 9.22% improvement on benchmark tests, with demonstrated robustness against adversarial attacks.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Spectral Collapse Drives Loss of Plasticity in Deep Continual Learning

Researchers identify that deep neural networks lose plasticity during continual learning due to Hessian spectral collapse, where curvature information vanishes and prevents gradient-based optimization. The study proposes regularization techniques combining high effective feature rank maintenance and L2 penalties to preserve learning capacity across sequential tasks.

AINeutralarXiv – CS AI · Jun 16/10
🧠

PAC-Bayesian Reinforcement Learning Trains Generalizable Policies

Researchers have developed a novel PAC-Bayesian generalization bound for reinforcement learning that addresses the sequential data dependencies problem, enabling non-vacuous generalization certificates for off-policy algorithms like Soft Actor-Critic. The work introduces PB-SAC, an algorithm that leverages this bound to guide exploration while maintaining competitive performance on continuous control tasks.

AIBullisharXiv – CS AI · Jun 16/10
🧠

Boundary-Guided Policy Optimization for Memory-efficient RL of Diffusion Large Language Models

Researchers propose Boundary-Guided Policy Optimization (BGPO), a memory-efficient reinforcement learning algorithm for diffusion large language models that addresses a critical bottleneck in likelihood function approximation. By constructing a specially designed lower bound that enables gradient accumulation across samples while maintaining mathematical equivalence to traditional objectives, BGPO achieves superior performance on math, coding, and planning tasks with significantly reduced memory overhead.

AINeutralarXiv – CS AI · Jun 16/10
🧠

CaptionFormer: Unified Segmentation, Tracking, and Captioning for Spatio-Temporal Objects

Researchers introduce CaptionFormer, an end-to-end model that simultaneously detects, segments, tracks, and captions objects in video sequences. The work addresses Dense Video Object Captioning by generating synthetic training data using vision-language models and extends existing datasets, achieving state-of-the-art results across multiple benchmarks.

AIBullisharXiv – CS AI · Jun 16/10
🧠

Mixture of Horizons in Action Chunking

Researchers propose Mixture of Horizons (MoH), a novel technique for vision-language-action models in robotics that processes action sequences at multiple time scales simultaneously to balance long-term planning with short-term precision. The method achieves state-of-the-art performance on robotic manipulation tasks, reaching 99% success rate on LIBERO benchmarks while enabling 2.5x faster inference through adaptive horizon selection.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Reasoning-Aware Multimodal Fusion for Hateful Video Detection

Researchers introduce RAMF (Reasoning-Aware Multimodal Fusion), a machine learning framework designed to detect hateful content in videos by combining visual, audio, and textual data with adversarial reasoning. The method achieves 3-7% performance improvements over existing approaches, addressing the challenge of identifying nuanced hate speech in increasingly complex online video content.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Conditional Coverage Diagnostics for Conformal Prediction

Researchers introduce Excess Risk of Target Coverage (ERT), a new metric framework for evaluating conditional coverage in conformal prediction systems. The approach reformulates coverage assessment as a classification problem, providing more statistically powerful diagnostics than existing methods while offering conservative estimates of miscoverage and enabling distinction between over- and under-coverage effects.

← PrevPage 1390 of 3802Next →
Filters
Sentiment
Importance
Sort
Stay Updated
Everything combined