y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto

#research News & Analysis

The #research tag covers 919 indexed articles, with 15 published in the last 30 days. Recent coverage remains predominantly neutral at 73.3%, though bullish sentiment has declined 33.7 percentage points compared to the previous quarter, suggesting a cooling in tone. ArXiv's computer science and AI section dominates the source list, alongside research updates from Microsoft and OpenAI. Gemini, Llama, and GPT-4 are the most frequently discussed models in tagged articles, which often intersect with #machine-learning, #llm, and #artificial-intelligence topics. Cryptocurrency tokens including NEAR, LINK, and ETH appear regularly alongside this tag. Scan the article list below to explore recent developments.

sentiment · last 30d (15 articles) · -33.7pp bullish vs prior 90d
Top sources:arXiv – CS AI · 770Microsoft Research Blog · 3OpenAI News · 3MIT News – AI · 3The Register – AI · 2
Most-discussed entities:Gemini · 12Llama · 11GPT-4 · 8Claude · 8GPT-5 · 7
1035 articles
AIBullisharXiv – CS AI · Mar 36/108
🧠

GRAD-Former: Gated Robust Attention-based Differential Transformer for Change Detection

Researchers introduce GRAD-Former, a novel AI framework for detecting changes in satellite imagery that outperforms existing methods while using fewer computational resources. The system uses gated attention mechanisms and differential transformers to more efficiently identify semantic differences in very high-resolution satellite images.

AIBullisharXiv – CS AI · Mar 36/106
🧠

VisNec: Measuring and Leveraging Visual Necessity for Multimodal Instruction Tuning

Researchers developed VisNec, a framework that identifies which training samples truly require visual reasoning for multimodal AI instruction tuning. The method achieves equivalent performance using only 15% of training data by filtering out visually redundant samples, potentially making multimodal AI training more efficient.

AI × CryptoBullisharXiv – CS AI · Mar 37/1010
🤖

Communication-Efficient Quantum Federated Learning over Large-Scale Wireless Networks

Researchers present a novel quantum federated learning framework for large-scale wireless networks that combines quantum computing with privacy-preserving federated learning. The study introduces a sum-rate maximization approach using quantum approximate optimization algorithm (QAOA) that achieves over 100% improvement in performance compared to conventional methods.

AIBullisharXiv – CS AI · Mar 36/106
🧠

Monocular 3D Object Position Estimation with VLMs for Human-Robot Interaction

Researchers developed a Vision-Language Model capable of estimating 3D object positions from monocular RGB images for human-robot interaction. The model achieved a median accuracy of 13mm and can make acceptable predictions for robot interaction in 25% of cases, representing a five-fold improvement over baseline methods.

AINeutralarXiv – CS AI · Mar 36/106
🧠

Self-Anchoring Calibration Drift in Large Language Models: How Multi-Turn Conversations Reshape Model Confidence

Researchers identified Self-Anchoring Calibration Drift (SACD), where large language models show systematic confidence changes when building on their own outputs in multi-turn conversations. Testing Claude Sonnet 4.6, Gemini 3.1 Pro, and GPT-5.2 revealed model-specific patterns, with Claude showing decreasing confidence and significant calibration errors, while GPT-5.2 exhibited opposite behavior in open-ended domains.

$NEAR
AIBearisharXiv – CS AI · Mar 37/108
🧠

VidDoS: Universal Denial-of-Service Attack on Video-based Large Language Models

Researchers have discovered VidDoS, a new universal attack framework that can severely degrade Video-based Large Language Models by causing extreme computational resource exhaustion. The attack increases token generation by over 205x and inference latency by more than 15x, creating critical safety risks in real-world applications like autonomous driving.

AIBullisharXiv – CS AI · Mar 36/107
🧠

Mean-Flow based One-Step Vision-Language-Action

Researchers developed a Mean-Flow based One-Step Vision-Language-Action (VLA) approach that dramatically improves robotic manipulation efficiency by eliminating iterative sampling requirements. The new method achieves 8.7x faster generation than SmolVLA and 83.9x faster than Diffusion Policy in real-world robotic experiments.

AIBullisharXiv – CS AI · Mar 36/104
🧠

Towards Principled Dataset Distillation: A Spectral Distribution Perspective

Researchers propose Class-Aware Spectral Distribution Matching (CSDM), a new dataset distillation method that addresses performance issues on imbalanced datasets. The technique achieves 14% improvement over existing methods on CIFAR-10-LT with enhanced stability on long-tailed data distributions.

AIBullisharXiv – CS AI · Mar 36/103
🧠

A Graph Meta-Network for Learning on Kolmogorov-Arnold Networks

Researchers developed WS-KAN, the first weight-space architecture designed specifically for Kolmogorov-Arnold Networks (KANs), which learns directly from neural network parameters. The study shows KANs share permutation symmetries with MLPs and introduces a graph representation to better understand their computation structure.

AIBullisharXiv – CS AI · Mar 36/103
🧠

Probabilistic Kernel Function for Fast Angle Testing

Researchers have developed new probabilistic kernel functions for angle testing in high-dimensional spaces that achieve 2.5x-3x faster query speeds than existing graph-based algorithms. The approach uses deterministic projection vectors with reference angles instead of random Gaussian distributions, improving performance in similarity search applications.

AIBullisharXiv – CS AI · Mar 36/102
🧠

Inner Loop Inference for Pretrained Transformers: Unlocking Latent Capabilities Without Training

Researchers propose a new inference technique called "inner loop inference" that improves pretrained transformer models' performance by repeatedly applying selected layers during inference without additional training. The method yields consistent but modest accuracy improvements across benchmarks by allowing more refinement of internal representations.

AIBullisharXiv – CS AI · Mar 36/103
🧠

Learning from Complexity: Exploring Dynamic Sample Pruning of Spatio-Temporal Training

Researchers have developed ST-Prune, a dynamic sample pruning technique that accelerates training of deep learning models for spatio-temporal forecasting by intelligently selecting the most informative data samples. The method significantly improves training efficiency while maintaining or enhancing model performance on real-world datasets from transportation, climate science, and urban planning domains.

AIBullisharXiv – CS AI · Mar 36/104
🧠

Learning to Explore with Parameter-Space Noise: A Deep Dive into Parameter-Space Noise for Reinforcement Learning with Verifiable Rewards

Researchers introduce PSN-RLVR, a new reinforcement learning method that uses parameter-space noise to improve AI exploration and reasoning capabilities. The technique addresses limitations in existing approaches by enabling better discovery of new problem-solving strategies rather than just reweighting existing solutions.

AINeutralarXiv – CS AI · Mar 36/104
🧠

Vision-DeepResearch Benchmark: Rethinking Visual and Textual Search for Multimodal Large Language Models

Researchers introduce Vision-DeepResearch Benchmark (VDR-Bench) with 2,000 VQA instances to better evaluate multimodal AI systems' visual and textual search capabilities. The benchmark addresses limitations in existing evaluations where answers could be inferred without proper visual search, and proposes a multi-round cropped-search workflow to improve model performance.

$NEAR
AIBullisharXiv – CS AI · Mar 37/106
🧠

Token-level Data Selection for Safe LLM Fine-tuning

Researchers have developed TOSS, a new framework for safely fine-tuning large language models that operates at the token level rather than sample level. The method identifies and removes unsafe tokens while preserving task-specific information, demonstrating superior performance compared to existing sample-level defense methods in maintaining both safety and utility.

AIBearisharXiv – CS AI · Mar 36/103
🧠

GNN Explanations that do not Explain and How to find Them

Researchers have identified critical failures in Self-explainable Graph Neural Networks (SE-GNNs) where explanations can be completely unrelated to how the models actually make predictions. The study reveals that these degenerate explanations can hide the use of sensitive attributes and can emerge both maliciously and naturally, while existing faithfulness metrics fail to detect them.

AINeutralarXiv – CS AI · Mar 35/103
🧠

FIRE: Frobenius-Isometry Reinitialization for Balancing the Stability-Plasticity Tradeoff

Researchers propose FIRE, a new reinitialization method for deep neural networks that balances stability and plasticity when learning from nonstationary data. The method uses mathematical optimization to maintain prior knowledge while adapting to new tasks, showing superior performance across visual learning, language modeling, and reinforcement learning domains.

AIBullisharXiv – CS AI · Mar 36/104
🧠

Prompt and Parameter Co-Optimization for Large Language Models

Researchers introduce MetaTuner, a new framework that combines prompt optimization with fine-tuning for Large Language Models, using shared neural networks to discover optimal combinations of prompts and parameters. The approach addresses the discrete-continuous optimization challenge through supervised regularization and demonstrates consistent performance improvements across benchmarks.

AIBullisharXiv – CS AI · Mar 36/102
🧠

Characteristic Root Analysis and Regularization for Linear Time Series Forecasting

Researchers present a systematic study of linear models for time series forecasting, focusing on characteristic roots in temporal dynamics and introducing two regularization strategies (Reduced-Rank Regression and Root Purge) to address noise-induced spurious roots. The work achieves state-of-the-art results by combining classical linear systems theory with modern machine learning techniques.

AIBullisharXiv – CS AI · Mar 36/102
🧠

SWE-MiniSandbox: Container-Free Reinforcement Learning for Building Software Engineering Agents

Researchers introduced SWE-MiniSandbox, a container-free method for training software engineering AI agents using reinforcement learning that reduces disk usage to 5% and environment setup time to 25% of traditional container-based approaches. The system uses kernel-level isolation and lightweight pre-caching instead of bulky container images while maintaining comparable performance.

AIBullisharXiv – CS AI · Mar 36/104
🧠

FMIP: Joint Continuous-Integer Flow For Mixed-Integer Linear Programming

Researchers have developed FMIP, a new generative AI framework that models both integer and continuous variables simultaneously to solve Mixed-Integer Linear Programming problems more efficiently. The approach reduces the primal gap by 41.34% on average compared to existing baselines and is compatible with various downstream solvers.

← PrevPage 26 of 42Next →