y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto
🤖All94,516🧠AI22,940⛓️Crypto17,363💎DeFi1,799🤖AI × Crypto1,480📰General50,934

AI × Crypto News Feed

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

94518 articles
AIBullisharXiv – CS AI · Jun 26/10
🧠

Coding Agent Is Good As World Simulator

Researchers propose an agentic framework that constructs physics-based world models through executable simulation code rather than video inference, using coordinated planning, code generation, visual review, and physics analysis agents. The approach demonstrates superior physical accuracy and instruction fidelity compared to video-based models, with applications in driving simulation and robotics.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Capturing LLM Capabilities via Evidence-Calibrated Query Clustering

Researchers introduce ECC (Evidence-Calibrated Query Clustering), an algorithm that improves how AI systems evaluate large language model capabilities by organizing queries into groups that reflect actual performance requirements rather than surface-level semantics. The method outperforms existing clustering approaches by 17-18 percentage points and shows practical value in downstream applications like query routing.

AINeutralarXiv – CS AI · Jun 26/10
🧠

LLM-Guided Communication for Cooperative Multi-Agent Reinforcement Learning

Researchers propose LMAC, an LLM-driven communication protocol for multi-agent reinforcement learning that enables agents to reconstruct shared state information more accurately and uniformly. The approach iteratively refines communication strategies using explicit state-awareness criteria, demonstrating substantial performance improvements over existing communication baselines across multiple MARL benchmarks.

AINeutralarXiv – CS AI · Jun 26/10
🧠

LC-ERD: Mining Latent Logic for Self-Evolving Reasoning via Consistency-Regulated Reward Decomposition

Researchers introduce LC-ERD, a framework for improving Large Language Model reasoning by mining high-quality supervision signals through consistency-regulated reward decomposition. The method addresses critical challenges in self-aligned LLM training by reducing label noise, providing granular step-level guidance, and preventing distributional collapse, demonstrating potential improvements in reasoning quality and generalization.

AINeutralarXiv – CS AI · Jun 26/10
🧠

When Does Multi-Agent RL Improve LLM Workflows? Workflow, Scale, and Policy-Sharing Tradeoffs

Researchers investigate when multi-agent reinforcement learning improves large language model workflows, comparing shared versus isolated policy training approaches across three model scales. The study reveals that policy-sharing is a conditional design tradeoff rather than a universal stability solution, with performance dependent on workflow topology, task type, and model scale rather than policy architecture alone.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Hypothesis Generation and Inductive Inference in Children and Language Models

Researchers compared how human children and large language models approach inductive reasoning tasks under uncertainty, finding both similarities and critical differences in their information-seeking strategies. While LLMs replicate children's adaptive responses to environmental structure, they exhibit distinct biases toward over-observation and instruction compliance, suggesting fundamentally different underlying computational principles govern their decision-making.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Test-Time Deep Thinking to Explore Implicit Rules

Researchers introduce Test-Time Exploration (TTExplore), a framework that enables large language model agents to infer and navigate implicit rules through a specialized reasoning component. The approach trains a 7B model called Exp-Thinker using a novel reinforcement learning pipeline that achieves 14-19 point performance improvements on embodied AI tasks by leveraging task-level rewards to evaluate reasoning quality.

AINeutralarXiv – CS AI · Jun 26/10
🧠

c-TPE: Tree-structured Parzen Estimator with Inequality Constraints for Expensive Hyperparameter Optimization

Researchers propose c-TPE, an enhanced Bayesian optimization method that extends the Tree-structured Parzen Estimator to handle inequality constraints in hyperparameter optimization. The method addresses practical real-world limitations like memory and latency constraints while maintaining strong performance, demonstrating superiority over existing approaches across 81 expensive optimization problems.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Stability Analysis of Sharpness-Aware Minimization

Researchers reveal that Sharpness-Aware Minimization (SAM), a popular deep learning training method, has convergence instability near saddle points and may actually escape saddle points more poorly than standard gradient descent. The study demonstrates that momentum and batch-size adjustments are critical for mitigating these instabilities and achieving strong generalization performance.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Tree-Structured Parzen Estimator: Understanding Its Algorithm Components and Their Roles for Better Empirical Performance

Researchers have conducted a comprehensive ablation study of Tree-Structured Parzen Estimator (TPE), a widely-used Bayesian optimization method, to clarify the role of each control parameter and improve its empirical performance. The study provides actionable recommendations for parameter tuning in machine learning frameworks like Hyperopt and Optuna, with implementations now available through OptunaHub.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Score Function Gradient Estimation to Widen the Applicability of Decision-Focused Learning

Researchers propose a new decision-focused learning method using score function gradient estimation and stochastic smoothing to train machine learning models that directly optimize for task performance rather than prediction accuracy. The approach removes restrictive assumptions about problem structure, extending applicability to nonlinear objectives, constrained optimization, and two-stage stochastic problems.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Recent Advances in Multi-modal 3D Intelligence: A Comprehensive Survey and Evaluation

A comprehensive survey of multi-modal 3D intelligence research reveals significant advances in combining 3D data with complementary modalities like camera images and textual descriptions, addressing critical gaps in autonomous driving and world simulation applications. The systematic review categorizes existing methods and benchmarks recent approaches, highlighting both strengths and limitations while identifying future research opportunities.

AIBullisharXiv – CS AI · Jun 26/10
🧠

AutoEval Done Right: Using Synthetic Data for Model Evaluation

Researchers propose statistically sound algorithms for evaluating machine learning models using synthetic data generated by AI systems, reducing reliance on expensive human annotations. The approach maintains unbiased results while improving sample efficiency by up to 50% in GPT-4 experiments, addressing a significant bottleneck in ML development.

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

Perturbation Effects on Accuracy and Fairness among Similar Individuals

Researchers introduce Robust Individual Fairness (RIF), a new evaluation framework that exposes how adversarial perturbations simultaneously compromise both prediction accuracy and fairness in neural networks. The proposed RIFair tool reveals hidden vulnerabilities that traditional robustness-only or fairness-only testing overlooks across multiple datasets and architectures.

🏢 Meta
AINeutralarXiv – CS AI · Jun 26/10
🧠

DAG-Plan: Generating Directed Acyclic Dependency Graphs for Dual-Arm Cooperative Planning

Researchers introduce DAG-Plan, a novel task planning framework for dual-arm robots that uses Directed Acyclic Graphs to represent complex task dependencies and enable parallel execution. By leveraging LLMs as a single semantic parser rather than iterative query system, the approach achieves 48% higher success rates and 84% better efficiency than existing methods on benchmark testing.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Agricultural Landscape Understanding At Country-Scale

Researchers have developed the first national-scale agricultural mapping system that identifies not just crop fields but also trees and water bodies across smallholder farming systems. The system uses advanced segmentation and post-processing techniques to create fine-grained land use maps accessible via a public API at agri.withgoogle.com, supporting applications in precision agriculture, policy-making, and sustainability.

AINeutralarXiv – CS AI · Jun 25/10
🧠

Implicit Regularization for Multi-label Feature Selection

Researchers propose a novel feature selection method for multi-label learning using implicit regularization and label embedding instead of traditional sparse penalization techniques. The approach leverages Hadamard product parameterization to reduce bias and potentially enable benign overfitting, showing promise on benchmark datasets.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Self-supervised Monocular Depth and Pose Estimation for Endoscopy with Latent Priors

Researchers propose a self-supervised framework for monocular depth and pose estimation in endoscopy using a Generative Latent Bank and VAE to improve 3D mapping of the gastrointestinal tract. The method achieves superior performance over existing self-supervised approaches on standard endoscopic datasets without requiring synthetic training data.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Introduction to Graph Neural Networks for Machine Learning Engineers

A comprehensive survey introduces graph neural networks (GNNs) through an encoder-decoder framework, demonstrating their effectiveness across various graph analytics tasks. The paper emphasizes critical challenges like oversmoothing and oversquashing in GNN training, providing experimental insights on how network performance scales with training data and graph complexity.

AIBullisharXiv – CS AI · Jun 26/10
🧠

Efficient Weighted Sampling via Score-based Generative Models

Researchers propose a training-free weighted sampling framework using pretrained score-based generative models that achieves 1.2–4.7× speedups over existing methods. The approach avoids computationally expensive derivatives and resampling steps by incorporating lightweight guidance and adaptive scheduling, demonstrating effectiveness from synthetic experiments to large-scale applications like Stable Diffusion XL.

🧠 Stable Diffusion
AINeutralarXiv – CS AI · Jun 26/10
🧠

ShapeLib: Designing a library of programmatic 3D shape abstractions with Large Language Models

ShapeLib is a new method that leverages Large Language Models to automatically design libraries of reusable 3D shape abstractions from user-provided descriptions and exemplar shapes. The system validates these abstractions through geometric reasoning and develops recognition networks that generalize across shape distributions, enabling interpretable programmatic interfaces for 3D modeling tasks.

AIBullisharXiv – CS AI · Jun 26/10
🧠

EuroBERT: Scaling Multilingual Encoders for European Languages

Researchers introduce EuroBERT, a family of multilingual encoder models that apply recent advances from generative AI to improve vector representations across European and global languages. The models outperform existing alternatives on retrieval, classification, and coding tasks while supporting sequences up to 8,192 tokens, with code and checkpoints publicly released.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Enhancing Layer Attention Efficiency through Pruning Redundant Retrievals

Researchers propose Efficient Layer Attention (ELA), a novel neural network architecture that reduces redundancy in layer attention mechanisms through KL divergence quantification and Enhanced Beta Quantile Mapping. The approach achieves 30% faster training times while improving performance on image classification and object detection tasks.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Ideas in Inference-time Scaling can Benefit Generative Pre-training Algorithms

Researchers challenge the conventional autoregressive versus diffusion model dichotomy, arguing that distinguishing between inference procedures (sequence expansion versus state refinement) matters more than model families. The paper advocates designing inference algorithms before training objectives, highlighting that training methods cannot compensate for flawed inference architectures, with implications for improving generative AI efficiency.

AIBullisharXiv – CS AI · Jun 26/10
🧠

A Lightweight Context-Driven Training-Free Network for Scene Text Segmentation and Recognition

Researchers propose a training-free, lightweight framework for scene text recognition that leverages pre-trained models and context-driven understanding to achieve state-of-the-art performance with significantly reduced computational requirements. The approach uses attention-based segmentation and semantic evaluation to enable faster inference suitable for real-time deployment scenarios.

← PrevPage 1368 of 3781Next →
Filters
Sentiment
Importance
Sort
Stay Updated
Everything combined