Research Reality Cards

Dense arXiv abstracts distilled into 3-bullet builder takeaways. No hype, no padding.

60 / 60 papers
🧪Test?

Crossing the Gender Binary: Modelling Gendered Reference in Science Fiction and General Fiction

Core Claim

Science fiction exhibits a stronger tendency to degender terms and place masculine terms in feminine contexts compared to general fiction.

Method / Result

The model predicts a masculine term about twice as often when masking 'woman' compared to predicting a feminine term when masking 'man'.

Limitations

The study's findings may be limited by the specific corpora used and the potential biases in the RoBERTa model.

2610.190286h ago
🧪Test?

ClawLoop: Self-Improving Agents via Harness-Native Training Loop

Not provided in the abstract

Core Claim

ClawLoop enables self-improvement of LLM-based agents without external teacher models, resulting in consistent performance gains across multiple benchmarks.

Method / Result

ClawLoop yields consistent improvements on SkillsBench, Claw-Eval-Live, and ClawGym-Bench.

Limitations

The framework's reliance on the initial loop model may limit generalizability to other models.

2610.141186h ago
🧪Test?

Long-Horizon-Terminal-Bench 2.0: Automating Diverse Task Construction and Measuring Sustained Agent Progress

Not provided

Core Claim

LHTB 2.0 provides a broader and more process-aware testbed for evaluating agent execution over extended periods, correcting previous defects and extending tasks.

Method / Result

LHTB 2.0 includes 77 tasks across 13 domains, with a significant increase in evaluation horizon from 90 minutes to three hours.

Limitations

The reliance on specific parameterized reference implementations may limit generalizability and reproducibility of results.

2610.141466h ago
🧪Test?

Correction Training for Diffusion Models

Not provided in the content

Core Claim

The proposed correction step significantly enhances sample quality in diffusion models, achieving performance competitive with classifier-free guidance (CFG).

Method / Result

Substantial improvement in FID scores for unguided and unconditional generation.

Limitations

The paper does not specify authors or provide detailed reproducibility metrics.

2610.141366h ago
🧪Test?

MonoMIP: Multi-Height Inverse Perspective Mapping for Monocular 3D Object Detection

Author1, Author2, Author3 +2 more

Core Claim

MonoMIP achieves state-of-the-art performance on KITTI and Waymo benchmarks for monocular 3D object detection without requiring extra training data.

Method / Result

Achieved 25.84% Moderate AP3D|R40 on KITTI validation set.

Limitations

The method may require specific configurations for the multi-height inverse perspective mapping that could affect reproducibility.

2610.190716h ago
🧪Test?

Following the Flow the Law Requires: Training Voice Agents to Transfer to Unseen Regulated Procedures in Debt Collection

Not specified in the provided content

Core Claim

A small, self-hosted policy can be trained to follow regulated procedures it has never seen, achieving a scenario pass rate increase from 15/43 to 40/43.

Method / Result

Documented checks improved from 67-71% to 93-100% after training.

Limitations

The audit of the shared specification found defects that were not exposed by its own metric.

2610.188816h ago
🧪Test?

Do Perturbation Predictors Learn Gene Interactions? Diagnosing Extrapolation in Agentic Screening

Z. Gao, A. Author, B. Author +2 more

Core Claim

The study demonstrates that a simple additive prediction method can outperform specialized neural predictors in terms of consistency and reliability when predicting unseen gene combinations.

Method / Result

Additive disagreement (AD) is shown to be a consistent and informative measure across all evaluated datasets.

Limitations

The conventional confidence signals used in the models are inconsistent across datasets and models, which raises concerns about reproducibility.

2610.188806h ago
🧪Test?

WorldMemBench: A Comprehensive Benchmark for Memory of Video World Models

Not provided in the abstract

Core Claim

WorldMemBench provides a systematic testbed for diagnosing memory failures and guiding the development of persistent, temporally coherent video worlds.

Method / Result

Evaluated nine representative models, revealing that strong static retention does not imply reliable dynamic state evolution.

Limitations

The study indicates that memory degradation occurs beyond the first return, which may complicate reproducibility in dynamic scenarios.

2610.190636h ago
🧪Test?

Artificiality's First Exam: An LLM-Referenced C-test for Supraintelligence

Author1, Author2, Author3 +2 more

Core Claim

The paper introduces the first test based on Levin's Kt using LLMs, enabling the generation of high-difficulty items that can be certified before being solvable by current AI or human testers.

Method / Result

A battery of certified items was administered to twelve LLMs, revealing agent characteristic curves that decrease with difficulty, indicating a new high-difficulty testing region.

Limitations

The main limitation is the potential difficulty in reproducing the high-difficulty items and ensuring consistent certification across different LLMs.

2610.140056h ago
🧪Test?

Token Utility for On-Policy Distillation via Local Trust-Region Optimization

Author1, Author2, Author3 +2 more

Core Claim

The proposed Fisher Utility Weighting (FUW) method significantly improves performance in on-policy distillation across multiple benchmarks compared to matched uniform methods.

Method / Result

FUW improves over matched uniform OPD under reverse-KL by 1.35-4.0 macro points and forward-KL by 1.08-2.71 macro points.

Limitations

The paper does not provide extensive details on the implementation of the proposed method, which may hinder reproducibility.

2610.188836h ago
🧪Test?

Do Vision CIL Methods Transfer to Protein? A Diagnostic Benchmark of Frozen Protein Encoders

Z. Gao, A. Author, B. Author +2 more

Core Claim

No existing class-incremental learning methods transfer reliably across different protein encoders, highlighting the need for encoder-aware approaches.

Method / Result

Nine CIL methods were evaluated across five protein encoders with no reliable transfer observed.

Limitations

The instability in results is attributed to weak gradient signals and heterogeneity in embedding geometry, which complicates reproducibility.

2610.188796h ago
🧪Test?

Why Do VLMs Fail at Remote Physiological Measurement? Rethinking with Physiological Grounding and Numerical Alignment

Not provided

Core Claim

The proposed VITAL framework improves cross-domain estimation performance on multiple rPPG datasets while maintaining the general visual understanding capability of VLMs.

Method / Result

VITAL enhances generative heart rate estimation reliability through structured numerical alignment.

Limitations

The paper does not specify the authors or provide details on the reproducibility of the experiments.

2610.190526h ago
🧪Test?

Inverse Reasoning Models for Efficient Post-Training and Verification from Answer-Only Data

Not provided in the abstract

Core Claim

The proposed inverse reasoning model significantly improves performance on reasoning tasks, doubling pass@1 on hard prompts and outperforming rejection-sampling self-distillation metrics.

Method / Result

A single offline distillation round from the inverse model roughly doubles pass@1 on hard prompts.

Limitations

The method relies on the quality of the inverse reasoning model and may not generalize across all tasks.

2610.188786h ago
🧪Test?

Action Jets: Learning the Local Shape of the Action-conditioned Data Manifold

Author1, Author2, Author3 +2 more

Core Claim

The Action Jet network allows planners to evaluate multiple action candidates over short horizons with over 300x speedup in inference time compared to traditional methods.

Method / Result

Scoring sixteen candidates from a single extraction is over 300x faster than with either source generator.

Limitations

The method's performance may vary based on the quality of the data used for training the Action Jet network.

2610.190076h ago
🧪Test?

The Silent Failures in Agentic Data Science

Author1, Author2, Author3 +2 more

Core Claim

The paper demonstrates that existing evaluations of agentic data science overlook critical methodological failures, emphasizing the need for a comprehensive analysis of failure modes.

Method / Result

The analysis identified that the majority of agentic solutions contain at least one failure mode across 220 data science tasks.

Limitations

The evaluations primarily focus on predictive performance, which may mask underlying methodological issues.

2610.141156h ago
🧪Test?

Evaluating Large Language Models for Multilingual Abstractive Summarization: A Comprehensive Study of English and Bengali

Author1, Author2, Author3 +2 more

Core Claim

The evaluation reveals that strong English summarization performance does not necessarily transfer to Bengali, emphasizing the need for comprehensive evaluation frameworks for low-resource languages.

Method / Result

GPT-5.6 Luna leads several English lexical metrics but LLaMA 3.3 70B achieves the highest ROUGE and BLEU scores in Bengali.

Limitations

Different evaluation methods produce varying model rankings, indicating limitations in relying on a single metric for assessment.

2610.190036h ago
🧪Test?

How Far Can Coding Agents Go in Visual Generation?

Not provided in the abstract

Core Claim

Coding agents can achieve competitive results in compositional accuracy for image generation while maintaining a consistent internal representation of scene content.

Method / Result

Achieved competitive results in zero-shot drawing tasks on a 200-prompt benchmark.

Limitations

The agents exhibit limitations in perceptual richness compared to traditional generative models.

2610.190256h ago
🧪Test?

Can LLMs Access their World Knowledge for Event Prediction?

Author1, Author2, Author3 +2 more

Core Claim

LLMs can become effective event forecasters when provided with natural-language descriptions and a separation of event semantics from prediction space.

Method / Result

LLMs substantially outperform description-free variants and non-LLM baselines when using event descriptions, with a benchmark of ~150K events tested.

Limitations

The study may be limited by the specific design of the DescribeEvent benchmark and the potential variability in LLM capabilities.

2610.190216h ago
🧪Test?

Joint Subspace Sparse Attention for Efficient Long-Context Decoding

Not provided in the abstract

Core Claim

JSSA achieves up to 6.43 times the decoding throughput of full-KV attention at 128K context while maintaining high accuracy.

Method / Result

Achieves up to 6.43× the decoding throughput of full-KV attention.

Limitations

The method may not provide measurable improvement in certain settings when refining the exact objective.

2610.190266h ago
🧪Test?

Lotus: Learning to Understand Time-series by Learning to Forecast

Not provided in the abstract

Core Claim

LOTUS achieves the best average performance on downstream tasks with minimal trainable parameters, outperforming the strongest matched baseline by 3.36%.

Method / Result

59.91% accuracy across six downstream evaluation datasets.

Limitations

The paper does not specify potential limitations or reproducibility concerns.

2610.188776h ago
🧪Test?

TerraAgent: Demonstration-Grounded Multi-Agent Reasoning for Long-Context Remote Sensing Visual Question Answering

Author1, Author2, Author3 +2 more

Core Claim

AVA improves average accuracy by up to 2.40 points over the strongest same-setting baselines while significantly reducing the prior-only answer rate and hallucination rate.

Method / Result

Increases visual-dependency score from 0.28 to 0.49.

Limitations

The framework's performance is evaluated without fine-tuning, which may limit its adaptability to specific use cases.

2610.125173d ago
🧪Test?

AutoIndexer: Flexible-Order Decoding by Training Causal Models on Chains of Edits

Author1, Author2, Author3 +2 more

Core Claim

AutoIndexer enables post-generation context-editing capabilities that surpass those of most autoregressive and diffusion models without sacrificing performance on standard benchmarks.

Method / Result

Exhibits post-generation context-editing capabilities that most autoregressive and diffusion models lack.

Limitations

The robustness to erroneous context may vary based on the quality of perturbation training data.

2610.125453d ago
🧪Test?

Know What You Don't Know: Agentic Data Synthesis by Evolving Generation Space for Closed-Loop Learning

Not provided in the content

Core Claim

EvoSyn improves average task success by 13.3 points over the strongest synthesis baseline while producing higher-quality synthetic experiences.

Method / Result

Improved average task success by 13.3 points.

Limitations

The paper does not specify potential limitations or reproducibility concerns.

2610.125933d ago
🧪Test?

TraceICL: Thread-Resolved Demonstration Curation with Consistency Calibration for Robust Multimodal In-Context Learning

Not specified in the provided content

Core Claim

AVA improves performance on vision-language benchmarks by an average of +1.7 points, with gains of up to +2.4 points on VizWiz, while maintaining robustness against noisy demonstrations.

Method / Result

+1.7 points average improvement on five vision-language benchmarks with interleaved 4-shot prompts.

Limitations

No specific authors or detailed methodology provided, which may hinder reproducibility.

2610.125163d ago
🧪Test?

SWE-Duel: Towards a Self-Scaling Arena for Coding Agents

Not specified in the provided content

Core Claim

SWE-Duel successfully demonstrates a self-scaling benchmark where coding agents evaluate each other, leading to a significant performance difference based on task authoring capability.

Method / Result

GPT-5.5 with Codex CLI repaired 98.3% of the defects it reviewed.

Limitations

The study's results may be limited by the specific repositories and languages used, which may not generalize to all coding environments.

2610.125693d ago
🧪Test?

Contextual Correction of Parallel Drafts for Speculative Decoding

Not provided in the abstract

Core Claim

DCOCO achieves up to 6.6x speedup over vanilla decoding while maintaining high throughput across various configurations.

Method / Result

DCOCO outperforms competing methods by 6-23% across 4-32 concurrent requests.

Limitations

The paper does not specify the authors or provide detailed reproducibility guidelines.

2610.125703d ago
🧪Test?

Scaling Multi-Teacher Distillation for Digital Pathology

Not provided in the abstract

Core Claim

The proposed method allows for training compact student encoders that are up to 10x more efficient than larger teacher foundation models while matching or outperforming their performance.

Method / Result

Achieved up to 10x efficiency in training compact student encoders compared to larger teacher models.

Limitations

The paper does not specify potential limitations or reproducibility concerns.

2610.125743d ago
🧪Test?

Behind-the-Meter Photovoltaic Visibility from Net Smart Meters: Deployment Regimes and Operational Insights

Not provided in the content

Core Claim

The deployment regime significantly influences error variation in PV disaggregation models, more so than model choice itself.

Method / Result

The best model achieved a daylight mean absolute error (MAE) of 0.104 kW on seen households, increasing to 0.185 kW on unseen households.

Limitations

The study's findings may vary based on the specific deployment regime and the adaptation to new regions, which could limit generalizability.

2610.125273d ago
🧪Test?

MIRAGE: Metric Inference and Reliability-Aware Gaussian Estimation from Feed-Forward Vision

Not provided in the abstract

Core Claim

MIRAGE achieves accurate metric trajectory estimation, outperforming COLMAP in computational efficiency for vision-only benchmarks.

Method / Result

MIRAGE establishes accurate 6-DoF reference trajectories for a new vision-only benchmark.

Limitations

Scarcity of long-horizon monocular benchmarks for large-scale indoor reconstruction may limit reproducibility.

2610.125683d ago
🧪Test?

CLUE: A Contrastive Learning Framework for Unsupervised Event Type Induction and Annotation

Pratik Maitra, Author 2, Author 3 +2 more

Core Claim

The CLUE framework effectively automates event type induction and annotation, reducing reliance on manual processes.

Method / Result

The framework utilizes contrastive loss guided clustering for event type induction.

Limitations

The effectiveness of the method may vary based on the dataset's domain and scope, which could affect reproducibility.

2610.125803d ago
🧪Test?

Kairos: Toward a Byte-Level Foundation Model for Every Modality

Fabien Frfr

Core Claim

The implementation of Kairos optimizes convergence for a byte-level foundation model across multiple modalities, achieving a minimum loss near $10^{-3}$ with specific attention mechanisms.

Method / Result

The two attention variants tested reach a minimum loss near $10^{-3}$ after 3,000 steps.

Limitations

The study does not address generalization, multimodal training, or comparison with existing models, which raises concerns about the reproducibility of results.

2610.124953d ago
🧪Test?

An Input-Dependent Readout Phase for Resonant Sequence Models

Not provided in the abstract

Core Claim

The input-dependent phase improves performance on longer sequences, reducing perplexity from 12.81 to 3.76 when tested beyond training length.

Method / Result

Achieved a perplexity reduction from 12.81 to 3.76 on 1024 tokens after training on 256 tokens.

Limitations

The learned phase does not improve retrieval and is limited by the model's exposure to training history.

2610.124963d ago
🧪Test?

Faithfulness Without Anchors: A Position Paper on the Structural Misalignments of Explainable AI Faithfulness Metrics for Feature Importance

Not specified in the provided content

Core Claim

The paper identifies five major shortcomings of existing faithfulness metrics in XAI and suggests four research directions to enhance their reliability.

Method / Result

The paper outlines five major shortcomings of current faithfulness metrics.

Limitations

Existing metrics for quantifying faithfulness are either infeasible or computationally expensive.

2610.124933d ago
🧪Test?

EliteTable: Self-Improving Program Search for Executable Control Policies

Not provided in the abstract

Core Claim

EliteTable demonstrates significant improvement in candidate scores across six Gymnasium control tasks, with some tasks achieving score ceilings in the first generation.

Method / Result

Candidate-score medians rose in all six tasks over ten generations.

Limitations

Comparisons and ablations are needed to establish EliteTable's relative performance and the contributions of its components.

2610.125363d ago
🧪Test?

One Model to Loop Them All: Elastic Latent Recurrence for Language Models

Not provided in the abstract

Core Claim

ELR enables looped language models to achieve non-recurrent model accuracy at one loop without additional cost, while allowing for improved accuracy with more loops.

Method / Result

At one loop, ELR models are 0.52 points below and 1.04 points above their matched baseline on a ten-task average.

Limitations

The paper does not specify author names or provide detailed reproducibility metrics.

2610.125823d ago
🧪Test?

CircuitTree: Composing Circuits into A Syllable Transcriber

Not provided in the abstract

Core Claim

The proposed CircuitTree method enables the composition of multiple circuits into a single model that can classify syllables with 64.8% accuracy.

Method / Result

Achieved 64.8% accuracy in transcribing open syllables, within 1.2 points of a 66.0% ceiling.

Limitations

The method's effectiveness may depend on the specific circuits used and their pruning from HuBERT.

2610.125203d ago
🧪Test?

SpireBench: Evaluating Long-Horizon Strategic Play of Agentic Models with Slay the Spire

Not provided

Core Claim

SpireBench demonstrates that while frontier models can match average human players in Slay the Spire, they significantly lag behind expert players, particularly in long-term strategic decision-making.

Method / Result

20 large language models were tested, with frontier models matching average human performance but falling short against experts as run length increased.

Limitations

Models do not improve from the memories they write across runs, often leading to incorrect and overly cautious decisions.

2610.125963d ago
🧪Test?

Algebraic Integer Quantization for Machine Learning Applications

Not specified in the provided content

Core Claim

Algebraic integer quantization (AIQ) achieves competitive accuracy compared to the MX format for large language model inference while enabling error-free integer arithmetic.

Method / Result

AIQ demonstrates competitive accuracy across diverse models and benchmarks at equivalent bit-per-parameter budgets.

Limitations

Generalizations to higher-order algebraic integers are still a promising direction and may not be fully explored in the current work.

2610.124943d ago
🧪Test?

Equal-Budget Monte Carlo Tree Search versus Randomized-Restart List Scheduling for DAG Workflows: A Controlled Equal-Budget Computational Study

Author1, Author2, Author3 +2 more

Core Claim

MCTS is 2.88% worse than randomized-restart list scheduling under equal budget conditions, indicating that simpler methods can outperform MCTS in certain scenarios.

Method / Result

At a budget of 2048 evaluated schedules, MCTS is 2.88% worse than the randomized-restart method.

Limitations

Results are confined to a controlled synthetic domain with limited task and processor configurations, raising concerns about generalizability.

2610.125423d ago
🧪Test?

CORAL-KV: Compact Cross-Layer Prediction and Residual Coding for Autoregressive Video KV Caches

Not provided in the abstract

Core Claim

Coral-KV improves PSNR by up to 4.95 dB while reducing cache memory usage by up to 48% compared to existing methods.

Method / Result

Improved PSNR by 4.95 dB while using 37% less cache memory on MAGI-1.

Limitations

The paper does not provide specific details on the implementation or datasets used for reproducibility.

2610.125143d ago
🧪Test?

A Camera-Native Stereo VR180 Dataset

Lulin Xuan, Author 2, Author 3 +2 more

Core Claim

The dataset includes 1,211 samples of stereo video clips and stills, released in camera-native formats along with lens calibration and conversion tools.

Method / Result

Native-fisheye coding required 38% more bitrate than half-equirectangular coding at equal viewport quality across all tested clips.

Limitations

The dataset is limited to recordings from specific cameras, which may affect generalizability to other systems.

2610.106076d ago
🧪Test?

SLVR: Structured Latent Visual Reasoning via Human-like Reasoning Flows

B. Gao, Y. Zhang, X. Wang +2 more

Core Claim

SLVR significantly improves multimodal reasoning benchmarks with structured latent supervision, achieving absolute gains of +9.4 on MMVP and +14.2 on BLINK Relation.

Method / Result

Achieved absolute gains of +9.4 on MMVP and +14.2 on BLINK Relation.

Limitations

The method's reliance on specific training signals may limit generalizability to other tasks or datasets.

2610.105636d ago
🧪Test?

Agent-Controlled Forgetting for Tool-Using Agents: Reversible Context Curation in Practice

Not specified in the provided content

Core Claim

The method achieved a 50% reduction in cumulative input tokens and significantly lowered API costs while maintaining functionality.

Method / Result

Used 50% fewer cumulative input tokens, resulting in an estimated API cost of USD 1.28-1.44 versus approximately USD 4.38.

Limitations

The method did not fully satisfy follow-up evaluations and showed variability in performance across different tasks.

2610.105906d ago
🧪Test?

Large Language Model-Assisted Preparation of Transportation Management Plans: A Case Study with WisDOT WisTMP System

Zihao Sheng, Author 2, Author 3 +2 more

Core Claim

The framework significantly improves the efficiency of TMP preparation by fine-tuning multiple open-source LLMs.

Method / Result

Fine-tuning improves performance across standard text generation metrics.

Limitations

LLMs tend to over-generate strategies and struggle with project-specific justifications and accurate cost estimates.

2610.106506d ago
🧪Test?

Cognitive Thermometers: Machine Learning and Logical Complexity

Author1, Author2, Author3 +2 more

Core Claim

Machine learning models can serve as 'cognitive thermometers' that bridge the gap between symbolic logic and connectionist AI, offering a unified approach to measuring semantic complexity.

Method / Result

Emerging evidence shows that logic and machine learning often yield converging results on relative complexity.

Limitations

The reliance on specific logical languages may limit the generalizability of the findings.

2610.107246d ago
🧪Test?

MESSENGER: Memory-Enhanced Sequential Scene Flow Estimation via Autoregressive Next-Frame Forecasting

Liu Jiuming, Author 2, Author 3 +2 more

Core Claim

MESSENGER achieves state-of-the-art performance in long-horizon future extrapolation, reducing EPE3D by 71.6% on nuScenes and 67.7% on Argoverse 2.

Method / Result

Reduces EPE3D by 71.6% on nuScenes.

Limitations

The computational overhead may increase with more input frames, potentially affecting reproducibility in resource-constrained environments.

2610.107596d ago
🧪Test?

Synthesis Through Simulation: Generating Coherent Enterprise Data via Scalable Agent-System Interaction

Not specified in the provided content

Core Claim

The Synthesis Through Simulation (STS) framework guarantees structural validity of generated data while achieving 0.88 average marginal fidelity and 100% constraint satisfaction across ten environments without access to database schemas.

Method / Result

Achieved 0.88 average marginal fidelity and 100% constraint satisfaction across all ten environments.

Limitations

The framework's effectiveness may be limited by the specific environments and the lack of access to database schemas.

2610.105496d ago
🧪Test?

Verification and Self-Improvement in Agentic AI: Foundations and Limits

Core Claim

The study proves that independent majority amplification preserves well-defined languages in the context of agentic AI self-improvement.

Method / Result

Exact verification is established as the zero-randomness case, with placement and completeness results.

Limitations

The framework's reliance on explicit complexity assumptions may limit reproducibility and general applicability.

2610.106116d ago
🧪Test?

Lossy Compressive Text Autoencoders

Not provided in the content

Core Claim

The proposed autoencoder achieves compressed representations comparable to lossless text compression algorithms at 2.24 bits per byte while maintaining good reconstruction and performance on downstream tasks.

Method / Result

Achieves 2.24 bits per byte compression on web text data.

Limitations

The paper does not specify the authors, which may affect reproducibility and validation of results.

2610.107386d ago
🧪Test?

LinSlot: Exploiting Linear Representation hypothesis for unsupervised attribute discovery from slot based object representation

Not provided

Core Claim

The proposed architecture effectively discovers disentangled object and attribute representations, demonstrating empirical evidence for the Linear Representation Hypothesis in slot space.

Method / Result

Improvements in DCI scores over state-of-the-art methods.

Limitations

The paper does not specify the authors, which may limit reproducibility and verification of results.

2610.107226d ago
🧪Test?

When Routing Reveals Membership: Privacy Leakage from MoE Router Telemetry

Not provided in the abstract

Core Claim

Router telemetry can significantly enhance membership inference attacks on fine-tuned MoE models, increasing true positive rates by 2.7–9.4 percentage points.

Method / Result

Router telemetry improves membership inference over a strong output-signal ensemble by 2.7–9.4 percentage points at 1% false positive rate.

Limitations

The study's findings may be limited by the specific architectures and data domains tested, which could affect generalizability.

2610.106166d ago
🧪Test?

Coverage, Not Difficulty, Sets How Much Synthetic Data an Activation Probe Needs

Author1, Author2, Author3 +2 more

Core Claim

The number of synthetic samples needed for activation probes is determined by coverage rather than the difficulty of the data, with a median half-gain size of 7-11 samples across different concepts.

Method / Result

Probes for high-stakes and harmful situations plateau with as few as 80 samples, while instruction probes require several times more.

Limitations

The variance in results is significantly influenced by the concept and distribution, which may affect reproducibility across different contexts.

2610.105946d ago
🧪Test?

Diffu-LoRA: A Novel Low-Rank Adaptation for Personalized Diffusion Models

Not provided in the abstract

Core Claim

Diffu-LoRA achieves improved subject fidelity and prompt alignment in personalized diffusion models compared to traditional fine-tuning methods.

Method / Result

Experiments show improved overall subject fidelity and prompt alignment relative to evaluated fine-tuning baselines.

Limitations

The paper does not specify the authors or provide detailed reproducibility guidelines.

2610.105506d ago
🧪Test?

Wieszcz-XIX: A 3.1-Billion-Word Corpus of Pre-1918 Polish and Temporally Bounded Language Models Trained From Scratch

Not specified in the provided content

Core Claim

The authors created a 6.75 billion token corpus from 294,369 documents, which is over three orders of magnitude larger than existing annotated datasets for pre-1918 Polish.

Method / Result

The character error rate on a hand-corrected sample is 0.68%, with 45% of sampled passages being uncorrectable.

Limitations

The models trained on this corpus reproduce period-specific prejudices, including antisemitic statements.

2610.105926d ago
🧪Test?

SPERA: Spherical Prior EEG Foundation Model with Geometry- and Frequency-Aware Latent Prediction

Author1, Author2, Author3 +2 more

Core Claim

SPERA achieves the highest average balanced accuracy across nine downstream tasks in clinical, cognitive, and BCI applications, demonstrating its effectiveness as a general-purpose EEG model.

Method / Result

Pretrained on approximately 80,000 hours of EEG data from 29,048 subjects across 106 datasets.

Limitations

The model's performance may vary across different recording conditions, which could affect reproducibility.

2610.105716d ago
🧪Test?

Seeing Through the Glare: A Multi-Source Benchmark and Ocular-Adaptive Pixel MeanFlow for Eyeglass Reflection Removal

Not provided in the abstract

Core Claim

OcuFlow achieves superior reflection removal quality and ocular fidelity, outperforming existing methods significantly in user studies.

Method / Result

OcuFlow received 67.32% of user selections in a blind study, 6.2 times the next-best share.

Limitations

Existing datasets cover limited reflection conditions, which may affect generalization to complex real-world scenarios.

2610.107036d ago
🧪Test?

An Explainable Header-Centric Framework for Large-Scale Semantic Table Interpretation and Data Quality Assessment

Not provided in the abstract

Core Claim

The framework effectively maps headers to 39 interpretable types and assesses data quality issues, providing a reusable workflow for semantic annotation and quality monitoring.

Method / Result

Evaluated across 120,000 header columns with broad practical coverage across noisy real-world metadata.

Limitations

The official evaluation results were modest, indicating potential issues with benchmark granularity and ontology-selection effects.

2610.105416d ago
🧪Test?

The Harness as the Only Mutable Surface: Compliance-Bounded Self-Evolution of LLM Agents in Credit Pipelines, with a Measured Admission Gate

Author1, Author2, Author3 +2 more

Core Claim

Self-evolution of LLM agents can be effectively managed by confining changes to a runtime harness, allowing for reviewable adaptations without altering model weights.

Method / Result

The gated loop admitted 144 of 7,449 candidate changes, none of which worsened error on held-out history.

Limitations

The gate's fixed tolerance blocked correct replacements in half the seeds at the highest structural severity.

2610.106296d ago
🧪Test?

Temporal transformer CAN encoder with federated lightweight heads for anomaly detection

Author1, Author2, Author3 +2 more

Core Claim

The proposed framework improves anomaly detection in in-vehicle networks by effectively capturing subtle temporal and contextual anomalies through a lightweight Transformer encoder and federated learning.

Method / Result

Achieved robust anomaly detection performance while maintaining efficiency and privacy.

Limitations

The reliance on open-source datasets may limit generalizability to real-world scenarios.

2610.106136d ago
🧪Test?

Freeze the Decoder, Heal the Encoder: Parameter-Efficient Adaptation for SVD-Based KV-Cache Compression

Not provided in the abstract

Core Claim

Freezing the decoder and healing only the encoder achieves parity with other methods while using 3x fewer trainable parameters and 3x less optimizer-state memory.

Method / Result

Achieved a real measured saving of 3x fewer trainable parameters and 3x less optimizer-state memory.

Limitations

The results are based on a specific compression ratio and may not generalize across different configurations or models.

2610.105526d ago