y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto
🤖All99,256🧠AI22,940⛓️Crypto17,363💎DeFi1,799🤖AI × Crypto1,480📰General55,674

AI × Crypto News Feed

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

99256 articles
AINeutralarXiv – CS AI · May 126/10
🧠

Sketch-and-Verify: Structured Inference-Time Scaling via Program Sketching

Sketch-and-Verify is an inference-time scaling technique that improves small language model performance by having the LLM generate multiple algorithmic strategies as program sketches, then filling and verifying them. On HumanEval+, this approach delivers superior cost-performance within a model tier compared to flat sampling, though upgrading to a stronger model tier remains more effective than scaling test-time compute on smaller models.

🧠 Gemini
AINeutralarXiv – CS AI · May 126/10
🧠

Attention-based graph neural networks: a survey

A comprehensive survey paper systematizes recent advances in attention-based graph neural networks (GNNs), proposing a two-level taxonomy spanning three developmental stages: graph recurrent attention networks, graph attention networks, and graph transformers. The work addresses a gap in literature by providing structured analysis of how attention mechanisms enhance GNNs' ability to learn discriminative features while filtering noise in graph-structured data.

AINeutralarXiv – CS AI · May 126/10
🧠

Semantic Voting: Execution-Grounded Consensus for LLM Code Generation

Researchers demonstrate that execution-based voting methods for LLM code generation significantly outperform text-based majority voting by 18-52 percentage points. The study reveals that input quality—particularly sketch-based generation—matters far more than the aggregation algorithm itself, challenging assumptions about how to select optimal code outputs.

AINeutralarXiv – CS AI · May 126/10
🧠

Core-Halo Decomposition: Decentralizing Large-Scale Fixed-Point Problems

Researchers propose Core-Halo decomposition, a novel approach to solving large-scale fixed-point problems in decentralized systems that separates write ownership from read-only evaluation context. Unlike standard strict decomposition methods that create structural bias by truncating dependencies, Core-Halo aligns with block-dependence structures to enable faithful implementation of the original fixed-point problem across distributed multi-agent systems while maintaining parallelism benefits.

AINeutralarXiv – CS AI · May 126/10
🧠

PrepBench: How Far Are We from Natural-Language-Driven Data Preparation?

Researchers introduce PrepBench, a new benchmark for evaluating how well large language models can handle natural language-driven data preparation tasks. The benchmark reveals that despite recent LLM advances, current models still struggle significantly with translating user intent into executable data preparation workflows, particularly when handling ambiguous requirements and complex real-world datasets.

AINeutralarXiv – CS AI · May 126/10
🧠

Structure-Centric Graph Foundation Model via Geometric Bases

Researchers propose Structure-Centric Graph Foundation Models (SCGFM), a novel approach that treats graph topology as the primary source of transferable knowledge using geometric bases and Gromov-Wasserstein distances. The method addresses key limitations in existing graph foundation models by handling structural heterogeneity and incompatible node feature spaces, demonstrating improved generalization across both in-domain and cross-domain graph tasks.

AIBullisharXiv – CS AI · May 126/10
🧠

Gate-and-Merge: Zero-shot Compositional Personalization of Vision Language Models

Researchers present Gate-and-Merge, a zero-shot framework enabling vision-language models to recognize and compose multiple user-defined concepts without requiring co-occurrence training data. The approach uses lightweight LoRA adapters for individual concepts and employs a gating mechanism to merge them intelligently at inference time, maintaining concept integrity while enabling compositional personalization.

AINeutralarXiv – CS AI · May 126/10
🧠

REAP: Reinforcement-Learning End-to-End Autonomous Parking with Gaussian Splatting Simulator for Real2Sim2Real Transfer

Researchers introduce REAP, a reinforcement learning-based autonomous parking system that uses Gaussian Splatting to simulate real-world environments for training, then transfers the model to physical vehicles. The method addresses limitations of traditional multi-stage parking approaches by jointly optimizing perception and planning, achieving successful parking in extreme scenarios like mechanical slots.

AINeutralarXiv – CS AI · May 126/10
🧠

AdaPreLoRA: Adafactor Preconditioned Low-Rank Adaptation

AdaPreLoRA addresses a fundamental challenge in fine-tuning large language models by proposing a new optimization method that combines Adafactor preconditioning with Low-Rank Adaptation. The technique achieves competitive or superior performance across multiple benchmarks while maintaining memory efficiency comparable to standard LoRA optimizers.

AINeutralarXiv – CS AI · May 126/10
🧠

Narrative Landscape: Mapping Narrative Dispositions Across LLMs

Researchers have developed a quantitative framework for measuring and visualizing how different large language models exhibit stable behavioral patterns in their outputs. By testing six frontier models across controlled narrative tasks, they identified a spectrum of model dispositions ranging from rigid to exploratory, revealing that instruction types can fundamentally alter selection patterns even when traditional metrics suggest similarity.

AINeutralarXiv – CS AI · May 126/10
🧠

MeshFIM: Local Low-Poly Mesh Editing via Fill-in-the-Middle Autoregressive Generation

MeshFIM introduces a Fill-in-the-Middle autoregressive framework that enables local editing of low-poly meshes without regenerating entire structures. The technology allows targeted mesh region refinement while preserving surrounding geometry, addressing a critical limitation in current mesh generation workflows through specialized techniques including boundary enforcement, topological preservation, and a gated geometry encoder.

AINeutralarXiv – CS AI · May 126/10
🧠

Communicating Sound Through Natural Language

Researchers introduce Lexical Acoustic Coding (LAC), a framework enabling LLM agents to transmit audio through natural language by converting sound into interpretable acoustic descriptors and verbalizing them as English text. The approach frames audio transmission as a quantization problem, balancing vocabulary size, transmission rate, and fidelity while keeping the transmitted text editable and human-readable.

AIBullisharXiv – CS AI · May 126/10
🧠

Omni-scale Learning-based Sequential Decision Framework for Order Fulfillment of Tote-handling Robotic Systems

Researchers propose OLSF-TRS, a machine learning framework combining reinforcement learning with combinatorial optimization to improve order fulfillment decisions in tote-handling robotic systems used across e-commerce and logistics. The system achieves near-optimal performance on small-scale deployments and reduces tote movements by 8-12% in large-scale scenarios compared to existing heuristic approaches.

AINeutralarXiv – CS AI · May 126/10
🧠

A Reconfigurable Multiplier Architecture for Error-Resilient Applications in RISC-V Core

Researchers have developed a reconfigurable multiplier architecture for RISC-V processors that dynamically adjusts between exact and approximate computation modes to optimize energy efficiency in neural network inference. The design achieves 44-68% power reduction depending on mode while maintaining computational performance, with demonstrated energy consumption of 1.21 pJ/instruction for matrix multiplication operations.

AINeutralarXiv – CS AI · May 126/10
🧠

cuRegOT: A GPU-Accelerated Solver for Entropic-Regularized Optimal Transport

Researchers introduce cuRegOT, a GPU-accelerated solver that significantly improves the speed of entropic-regularized optimal transport computations through algorithmic optimizations like amortized symbolic analysis and fused kernels. The breakthrough addresses a critical computational bottleneck in machine learning by outperforming existing GPU-based solvers while maintaining theoretical convergence guarantees.

AINeutralarXiv – CS AI · May 126/10
🧠

Deterministic Decomposition of Stochastic Generative Dynamics

Researchers propose Bridge Matching, a novel framework that decomposes stochastic generative model dynamics into deterministic transport and diffusion-induced osmotic effects. This decomposition enables more interpretable and controllable generative sampling by separately parameterizing how probability mass moves versus how stochastic fluctuations affect the process.

AINeutralarXiv – CS AI · May 126/10
🧠

PPU-Bench:Real World Benchmark for Personalized Partial Unlearning in Vision Language Models

Researchers introduce PPU-Bench, a benchmark for testing personalized partial unlearning in multimodal AI models, addressing the challenge of selectively removing sensitive memorized information while preserving model utility. The study reveals significant trade-offs between forgetting target knowledge and retaining non-target facts, proposing Boundary-Aware Optimization as a solution for fine-grained factual control.

AINeutralarXiv – CS AI · May 126/10
🧠

Curvature-Aware Captioning:Leveraging Geodesic Attention for 3D Scene Understanding

Researchers introduce Curvature-Aware Captioning, a novel framework using non-Euclidean geodesic attention mechanisms to improve 3D scene understanding from point cloud data. The approach combines Oblique and Lorentz space geometries to simultaneously achieve precise object localization and coherent scene descriptions, demonstrating state-of-the-art results on ScanRefer and Nr3D benchmarks.

AIBullisharXiv – CS AI · May 126/10
🧠

SimReg: Achieving Higher Performance in the Pretraining via Embedding Similarity Regularization

Researchers introduce SimReg, an embedding similarity regularization technique for large language model pretraining that improves training efficiency by encouraging similar token representations to cluster together while separating different tokens. The approach achieves over 30% faster training convergence and 1% improvement in zero-shot performance across standard benchmarks.

AINeutralarXiv – CS AI · May 126/10
🧠

Compressed Video Aggregator: Content-driven Module for Efficient Micro-Video Recommendation

Researchers propose Compressed Video Aggregator (CVA), a lightweight module that improves micro-video recommendation systems by decoupling video processing from preference learning. The method reduces training time and GPU memory by orders of magnitude while maintaining or improving performance through intelligent frame selection based on video titles.

AIBearisharXiv – CS AI · May 126/10
🧠

FraudBench: A Multimodal Benchmark for Detecting AI-Generated Fraudulent Refund Evidence

Researchers introduce FraudBench, a multimodal benchmark dataset designed to detect AI-generated fraudulent refund evidence in e-commerce, food delivery, and travel services. The study reveals that current AI detection systems struggle significantly with claim-conditioned fake-damage detection, with specialized detectors failing to reliably distinguish synthetic fraud from authentic evidence.

AIBullisharXiv – CS AI · May 126/10
🧠

VECTOR-Drive: Tightly Coupled Vision-Language and Trajectory Expert Routing for End-to-End Autonomous Driving

VECTOR-Drive introduces a tightly coupled vision-language-action framework for autonomous driving that balances semantic reasoning with motion planning through expert routing. Built on Qwen2.5-VL-3B, the system achieves 88.91 Driving Score on Bench2Drive by routing vision-language tokens to semantic experts while handling trajectory computation separately, demonstrating advances in multimodal AI for real-world driving tasks.

AINeutralarXiv – CS AI · May 126/10
🧠

The Grounding Gap: How LLMs Anchor the Meaning of Abstract Concepts Differently from Humans

Researchers studying 21 large language models found a significant 'grounding gap' in how LLMs understand abstract concepts compared to humans. While LLMs rely heavily on word associations, they systematically underreproduce emotional and internal-state properties, achieving maximum correlation of r=0.37 versus human-to-human baselines above r=0.9. The findings suggest current models can identify grounding dimensions when explicitly queried but fail to recruit them naturally during free generation.

AINeutralarXiv – CS AI · May 126/10
🧠

Generating Leakage-Free Benchmarks for Robust RAG Evaluation

Researchers introduce SeedRG, a benchmark generation pipeline that addresses knowledge leakage in retrieval-augmented generation (RAG) evaluation by creating novel, structurally similar test instances that cannot be answered from language models' existing parametric memory. The approach tackles the critical problem of benchmark aging, where reused datasets become less effective for evaluation as their content gets absorbed into model training.

AINeutralarXiv – CS AI · May 126/10
🧠

Geometrically Constrained Stenosis Editing in Coronary Angiography via Entropic Optimal Transport

Researchers have developed OT-Bridge Editor, an AI method that uses optimal transport theory to synthesize realistic coronary angiography images with artificial stenosis lesions. The technique achieves 27.8% improvement in stenosis detection performance on benchmark datasets, addressing the critical shortage of high-quality medical imaging training data.

← PrevPage 1567 of 3971Next →
Filters
Sentiment
Importance
Sort
Stay Updated
Everything combined