y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto
🤖All93,211🧠AI22,940⛓️Crypto17,363💎DeFi1,799🤖AI × Crypto1,480📰General49,629
🧠

AI

22,940 AI articles curated from 50+ sources with AI-powered sentiment analysis, importance scoring, and key takeaways.

22940 articles
AINeutralarXiv – CS AI · Jun 96/10
🧠

Comparative evaluation of training strategies using partially labelled datasets for segmentation of white matter hyperintensities and stroke lesions in FLAIR MRI

Researchers developed and evaluated six training strategies for deep learning models to segment white matter hyperintensities and stroke lesions in MRI scans using partially labeled datasets. Pseudolabeling emerged as the most effective approach, successfully leveraging 2,052 MRI volumes with incomplete annotations to create reliable automated segmentation tools for cerebral small vessel disease monitoring.

AINeutralarXiv – CS AI · Jun 96/10
🧠

UA-DCM: Uncertainty-aware Causal Decision Making via Effect Bound Decomposition

Researchers introduce UA-DCM, a framework that distinguishes between causal effect uncertainty that can be resolved with more data versus uncertainty inherent to unobserved confounding. By decomposing effect bounds through max-min optimization, the method helps practitioners determine whether additional sampling will improve decision-making or if alternative approaches like randomized trials are necessary.

AINeutralarXiv – CS AI · Jun 96/10
🧠

DIVERGE: Diversity-Enhanced RAG for Open-Ended Information Seeking

Researchers introduce DIVERGE, a new retrieval-augmented generation (RAG) framework that addresses a critical limitation in current AI systems: their inability to generate diverse, multiple perspectives for open-ended questions. The system achieves approximately 2x greater diversity in outputs without sacrificing quality by using iterative reflection and diversity-aware retrieval strategies.

AIBullisharXiv – CS AI · Jun 96/10
🧠

Variational Speculative Decoding: Rethinking Draft Training from Token Likelihood to Sequence Acceptance

Researchers propose Variational Speculative Decoding (VSD), a novel training method that improves LLM inference speed by optimizing draft models to better align with actual decoding requirements. By reformulating draft training as variational inference and incorporating path-level utilities, VSD achieves up to 9.6% speedup improvements over existing methods like EAGLE-3.

AIBullisharXiv – CS AI · Jun 96/10
🧠

Generative Reasoning Re-ranker

Researchers introduce Generative Reasoning Re-ranker (GR2), an advanced framework that leverages large language models to improve recommendation system rankings through semantic ID tokenization, high-quality reasoning traces, and reinforcement learning optimization. The system demonstrates 2.4% improvement over existing state-of-the-art methods, addressing critical scalability challenges in industrial recommendation systems.

AINeutralarXiv – CS AI · Jun 96/10
🧠

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage

Researchers present a theoretical framework for offline reinforcement learning that answers a fundamental open question negatively: Q*-realizability and Bellman completeness alone are insufficient for sample-efficient learning under partial coverage. The work introduces a decision-estimation framework that improves sample complexity bounds for practical algorithms like Conservative Q-Learning and extends theoretical understanding to previously unexplored settings.

AIBullisharXiv – CS AI · Jun 96/10
🧠

Know More, Know Clearer: A Meta-Cognitive Framework for Knowledge Augmentation in Large Language Models

Researchers propose a meta-cognitive framework that improves Large Language Models by distinguishing between mastered knowledge, confused understanding, and missing information. The approach uses internal confidence signals to guide targeted knowledge augmentation and calibrate model certainty with actual accuracy, addressing a critical gap where LLMs often exhibit overconfidence despite knowledge deficiencies.

AINeutralarXiv – CS AI · Jun 96/10
🧠

Condition-Gated Reasoning for Context-Dependent Biomedical Question Answering

Researchers introduce CondMedQA, a new benchmark for biomedical question answering that accounts for patient-specific conditions, and propose Condition-Gated Reasoning (CGR), a framework that builds condition-aware knowledge graphs to ensure medical reasoning adapts to individual patient contexts rather than assuming uniform knowledge application.

AINeutralarXiv – CS AI · Jun 95/10
🧠

Training-Free Intelligibility-Guided Observation Addition for Noisy ASR

Researchers propose a training-free method for improving automatic speech recognition in noisy environments by intelligently fusing noisy and speech-enhanced audio based on intelligibility estimates. The approach eliminates the need for trained neural predictors, reducing complexity while maintaining robustness across diverse speech enhancement and ASR model combinations.

AINeutralarXiv – CS AI · Jun 96/10
🧠

Kernel Affine Hull Machines as Compute-Efficient Encoders for Frozen Semantic Spaces

Researchers propose Kernel Affine Hull Machines (KAHM) as a lightweight alternative to transformer-based neural encoders for semantic search in frozen representation spaces. The method achieves 8.53x faster query encoding while maintaining competitive retrieval performance, offering practical efficiency gains for production deployment scenarios.

AINeutralarXiv – CS AI · Jun 96/10
🧠

Neuron-Anchored Rule Extraction for Large Language Models via Contrastive Hierarchical Ablation

Researchers introduce MechaRule, a novel method for extracting interpretable symbolic rules from large language models by identifying and ablating sparse neuron activations that drive specific behaviors. The technique achieves 97% recall of high-impact neurons while requiring only 2.14% of the computational cost of exhaustive ablation, demonstrating effectiveness on arithmetic reasoning and jailbreak detection tasks.

AINeutralarXiv – CS AI · Jun 96/10
🧠

Self-Mined Hardness for Safety Fine-Tuning

Researchers developed a novel safety fine-tuning method for large language models that uses the model's own outputs to identify difficult adversarial prompts, rather than relying on curated datasets. This approach significantly reduces jailbreak attack success rates on Llama models while introducing a tradeoff: increased refusal on benign prompts that resemble jailbreaks, which can be partially mitigated through mixed training strategies.

🧠 Llama
AIBullisharXiv – CS AI · Jun 96/10
🧠

APEX: Large-scale Multi-task Aesthetic-Informed Popularity Prediction for AI-Generated Music

Researchers introduce APEX, a machine learning framework that predicts popularity of AI-generated music by analyzing both engagement metrics and aesthetic quality across 211k songs from platforms like Suno and Udio. The model demonstrates strong generalization capabilities when tested on unseen generative music systems, suggesting that aesthetic dimensions are crucial predictors of music popularity in the AI-generated music landscape.

AIBullisharXiv – CS AI · Jun 96/10
🧠

Margin-Adaptive Confidence Ranking for Reliable LLM Judgement

Researchers address a critical flaw in LLM confidence estimation for achieving human-AI agreement by developing a learned confidence estimator with theoretical generalization guarantees. This approach improves upon prior methods that assume confidence monotonically correlates with disagreement risk, offering practical benefits for aligning AI systems with human judgment.

AIBullisharXiv – CS AI · Jun 96/10
🧠

Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMs

Researchers introduce Ghosted Layers, a training-free method to recover performance degradation in layer-pruned large language models by solving an activation alignment problem through optimal linear operators. The technique uses a small calibration set to reconstruct hidden state mismatches introduced by pruning, maintaining efficiency gains while improving accuracy and perplexity across multiple LLM architectures.

🏢 Perplexity
AINeutralarXiv – CS AI · Jun 96/10
🧠

Evaluating Design Video Generation: Metrics for Compositional Fidelity

Researchers have developed the first standardized automated evaluation framework for design video generation, addressing a gap in benchmarking generative video models used for animation tasks. The framework evaluates across four dimensions—layout fidelity, motion correctness, temporal quality, and content fidelity—eliminating subjective human evaluation and enabling consistent progress measurement in the field.

AIBullisharXiv – CS AI · Jun 96/10
🧠

WhiteTesseract: Reframing the Interpretation of Cultural Heritage through XR and Conversational AI

WhiteTesseract combines extended reality (XR) and conversational AI to enhance cultural heritage exhibitions by enabling personalized, context-aware interpretation of artworks while preserving the physical viewing experience. A controlled study at a Monet exhibition demonstrated that the system nearly tripled average viewing time (35.3 to 98.3 seconds) and prompted 60% of visitor-AI interactions to move beyond factual queries into analytical and emotional engagement.

🧠 Claude
AIBullisharXiv – CS AI · Jun 96/10
🧠

LEAP: Learnable End-to-End Adaptive Pruning of Large Language Models

Researchers introduce LEAP, a new technique for pruning large language models that uses learnable per-weight masks to achieve better accuracy than existing layer-wise methods, particularly at aggressive sparsity levels. The approach replaces earlier intractable parameterization methods with a Bernoulli-via-Gumbel-sigmoid relaxation, demonstrating 2.59 points average improvement over ADMM across multiple LLM families.

AINeutralarXiv – CS AI · Jun 96/10
🧠

Diagnosing Multi-step Reasoning Failures in Black-box LLMs via Stepwise Confidence Attribution

Researchers introduce Stepwise Confidence Attribution (SCA), a framework for diagnosing where large language models fail in multi-step reasoning tasks without requiring access to the model's internal parameters. The method identifies problematic reasoning steps by measuring confidence alignment with consensus patterns across correct solutions, improving self-correction accuracy by up to 13.5%.

AINeutralarXiv – CS AI · Jun 96/10
🧠

Causal Unlearning in Collaborative Optimization: Exact and Approximate Influence Reversal under Adversarial Contributions

Researchers present HF-KCU, a federated learning method that efficiently removes clients' data contributions while maintaining privacy compliance, achieving 47.75x speedup over retraining while preserving model accuracy. The technique uses Krylov subspace approximations and causal weighting to handle data deletion requests in production systems without compromising unaffected participants.

AIBullisharXiv – CS AI · Jun 96/10
🧠

DySink: Dynamic Frame Sinks for Autoregressive Long Video Generation

Researchers introduce DySink, a novel framework for autoregressive long video generation that dynamically selects relevant historical frames instead of using static early-frame anchors. The method addresses the problem of outdated context degrading video quality and introduces a sink anomaly gate to prevent content collapse, demonstrating improvements in temporal consistency for minute-long videos.

AIBullisharXiv – CS AI · Jun 96/10
🧠

How Many Tools Should an LLM Agent See? A Chance-Corrected Answer

Researchers propose Bits-over-Random (BoR), a chance-corrected metric to determine optimal tool shortlist sizes for LLM agents, and develop a reinforcement learning approach that dynamically adjusts how many tools to show per query. Testing across benchmarks with 20-3,251 tools demonstrates that adaptive shortlists significantly improve both tool retrieval and LLM selection accuracy while reducing cognitive overload.

🧠 Claude🧠 Sonnet
AINeutralarXiv – CS AI · Jun 96/10
🧠

Riemannian-Manifold Steering: Geometry-Aware Generative Autoencoders for Label-Free Steering

Researchers introduce a Riemannian-manifold framework for steering language models that eliminates the need for labeled data or predefined topologies. The method approximates output-space geometry using a learned encoder trained on concept tokens, enabling more natural intervention trajectories across diverse tasks without per-prompt labeling.

AINeutralarXiv – CS AI · Jun 96/10
🧠

Polynomial Context-Truncation Sensitivity in Autoregressive Language Models: Sequential Wyner-Ziv Bounds for KV Cache Compression

Researchers develop theoretical bounds for KV cache compression in language models, discovering that context sensitivity decays polynomially rather than exponentially. Their findings enable more efficient memory-aware cache policies that reduce memory requirements while maintaining model performance, with practical implications for deploying larger models on resource-constrained systems.

← PrevPage 336 of 918Next →
Filters
Sentiment
Importance
Sort
Stay Updated
Everything combined