AINeutralarXiv – CS AI · Jun 257/10
🧠Researchers propose a test-time adaptation approach using semi-supervised learning to detect AI-generated text despite continual distribution shifts post-deployment, such as adversarial humanization attempts, new LLM releases, and temporal changes in human writing patterns. The method achieves 90.5% detection of adversarial AI text compared to 24.1% for commercial detectors, suggesting a more robust framework for real-world AI text detection.
AIBullisharXiv – CS AI · Jun 57/10
🧠Researchers introduce AdaMEM, a test-time adaptive memory framework that enables language agents to dynamically adjust behavior during inference without updating model parameters. The system combines persistent offline trajectory memory with dynamically generated on-the-fly strategy memory, demonstrating 11-13% performance improvements on complex reasoning and web interaction tasks.
AI × CryptoBullisharXiv – CS AI · May 297/10
🤖Researchers propose TEMG-TTA, a novel machine learning framework combining temporal motif analysis with test-time adaptation to improve anomaly detection on blockchain networks. The approach addresses critical challenges in detecting evolving fraudulent transaction patterns and out-of-distribution anomalies, demonstrating 54.88% performance improvement over existing graph-based detection methods across five real-world datasets.
AIBullisharXiv – CS AI · May 287/10
🧠Researchers propose HiSME, a hierarchical skill meta-evolving framework that enables AI agents to continuously improve both their skills and the strategies used to evolve those skills at test-time, without expensive model parameter updates. The approach learns meta-skills from task execution traces and demonstrates higher-quality skill libraries compared to static skill evolving approaches.
AIBullisharXiv – CS AI · Apr 77/10
🧠Researchers developed StableTTA, a training-free method that significantly improves AI model accuracy on ImageNet-1K, with 33 models achieving over 95% accuracy and several surpassing 96%. The method allows lightweight architectures to outperform Vision Transformers while using 95% fewer parameters and 89% less computational cost.
AIBullisharXiv – CS AI · Mar 267/10
🧠Researchers developed SyTTA, a test-time adaptation framework that improves large language models' performance in specialized domains without requiring additional labeled data. The method achieved over 120% improvement on agricultural question answering tasks using just 4 extra tokens per query, addressing the challenge of deploying LLMs in domains with limited training data.
🏢 Perplexity
AIBullisharXiv – CS AI · Mar 56/10
🧠Researchers introduce MASS, a meta-learning framework that enables large language models to self-adapt at test time by generating synthetic training data and performing targeted self-updates. The system uses bilevel optimization to meta-learn data-attribution signals and optimize synthetic data through scalable meta-gradients, showing effectiveness in mathematical reasoning tasks.
AIBullisharXiv – CS AI · Mar 56/10
🧠Researchers introduce PhysMem, a memory framework that enables vision-language model robot planners to learn physical principles through real-time interaction without updating model parameters. The system records experiences, generates hypotheses, and verifies them before application, achieving 76% success on brick insertion tasks compared to 23% for direct experience retrieval.
AIBullisharXiv – CS AI · Mar 37/103
🧠Researchers introduce VITA, a zero-shot value function learning method that enhances Vision-Language Models through test-time adaptation for robotic manipulation tasks. The system updates parameters sequentially over trajectories to improve temporal reasoning and generalizes across diverse environments, outperforming existing autoregressive VLM methods.
AIBullisharXiv – CS AI · Mar 37/104
🧠Researchers introduce Self-Harmony, a new test-time reinforcement learning framework that improves AI model accuracy by having models solve problems and rephrase questions simultaneously. The method uses harmonic mean aggregation instead of majority voting to select stable answers, achieving state-of-the-art results across 28 of 30 reasoning benchmarks without requiring human supervision.
AIBullisharXiv – CS AI · Feb 277/108
🧠Researchers propose AgentDropoutV2, a test-time framework that optimizes multi-agent systems by dynamically correcting or removing erroneous outputs without requiring retraining. The system acts as an active firewall with retrieval-augmented rectification, achieving 6.3 percentage point accuracy gains on math benchmarks while preventing error propagation between AI agents.
AINeutralarXiv – CS AI · Jun 236/10
🧠Researchers propose SAFER, a training-free framework that enhances the robustness of test-time adaptation (TTA) methods against adversarial attacks on contaminated data streams. The method uses stochastic augmentation and reliability-guided prediction pooling to maintain performance while mitigating domain shift without requiring source data access.
AINeutralarXiv – CS AI · Jun 196/10
🧠Researchers introduce SPOT-E, a test-time method that improves vision-language models' performance on evidence-intensive tasks by using entropy-shaping to identify and highlight critical visual information. The technique works without retraining frozen VLMs and demonstrates consistent improvements across benchmarks while maintaining robustness under visual corruption.
AIBullisharXiv – CS AI · Jun 116/10
🧠Researchers introduce MODF-SIR, a multi-agent framework using lightweight multimodal large language models enhanced with knowledge distillation for social intelligence reasoning. The system identifies long-tail events through explicit text formatting and integrates test-time adaptation with Chain-of-Thought prompting, achieving state-of-the-art results on multiple benchmarks with only 30% of standard training data.
🏢 Hugging Face
AINeutralarXiv – CS AI · Jun 106/10
🧠Researchers introduce EEVEE, a test-time prompt learning framework that enables large language model agents to adapt across multiple datasets and domains simultaneously. The system uses a router mechanism to partition inputs into task clusters and employs co-evolution strategies to optimize prompt configurations, achieving significant performance improvements over existing methods on heterogeneous data streams.
AINeutralarXiv – CS AI · Jun 96/10
🧠Researchers introduce DOME, a domain encoder that improves test-time adaptation by explicitly modeling sample-specific domain shifts rather than inferring a single global distribution. The method leverages vision-language pretraining and sparse domain banks to achieve state-of-the-art performance on multiple benchmarks, suggesting that structured domain representation outweighs algorithmic complexity.
AIBullisharXiv – CS AI · Jun 86/10
🧠Researchers introduce SS-TPT, a new defense mechanism that improves the adversarial robustness of vision-language models like CLIP through intelligent test-time prompt tuning. The method uses stability and suitability scores to filter reliable augmented views, achieving better robustness while maintaining practical inference speeds without the computational slowdown of previous approaches.
AIBullisharXiv – CS AI · Jun 46/10
🧠Researchers propose LifeSkill, a reinforcement learning framework that enables LLM agents to continuously learn and adapt during test-time interactions rather than relying on static parameters. The system combines skill extraction with real-time parameter updates, achieving 7% performance improvement over existing lifelong learning baselines on benchmark tasks.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers introduce Demo2Reward, a test-time optimization technique that improves Vision-Language Model (VLM) reward models by refining prompts based on a small number of expert demonstrations. The method reduces false positives in reward prediction without requiring additional model training, enabling more effective reinforcement learning in robotics applications including real-world scenarios.
AINeutralarXiv – CS AI · Jun 16/10
🧠Researchers introduce TIED (Transformation-Inverting Energy Diffusion), a novel machine learning method that recovers inverse transformations on Lie groups using diffusion sampling. The approach improves neural network robustness to input transformations at test time, with applications in image processing and physics-informed modeling.
AINeutralarXiv – CS AI · May 286/10
🧠Researchers introduce the first theoretical framework for analyzing test-time adaptation (TTA) in machine learning, establishing recovery complexity bounds that reveal fundamental limits on how quickly models can adapt to non-stationary data streams without labeled data. The work provides mathematical guarantees for TTA learnability and identifies an intrinsic trade-off between adaptivity and information constraints.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers present a unified mathematical framework for Test-Time Adaptation (TTA) in autoregressive generative models, decomposing entropy minimization into token-level policy gradient and entropy losses. Validated on Whisper ASR across 20+ domains, the approach demonstrates consistent performance improvements and reconciles previously disparate adaptation methods under a single theoretical foundation.
AIBullisharXiv – CS AI · Apr 76/10
🧠Researchers introduce CONTXT, a lightweight neural network adaptation method that improves AI model performance when deployed on data different from training data. The technique uses simple additive and multiplicative transforms to modulate internal representations, providing consistent gains across both discriminative and generative models including LLMs.
AIBullisharXiv – CS AI · Mar 116/10
🧠Researchers introduce PRECEPT, a new framework for AI language model agents that improves knowledge retrieval and adaptation through structured rule learning and conflict-aware memory systems. The framework shows significant performance improvements over existing methods, with 41% better first-try accuracy and enhanced compositional reasoning capabilities.
AIBullisharXiv – CS AI · Mar 36/107
🧠Researchers introduce ROSA2, a framework that improves Large Language Model interactions by simultaneously optimizing both prompts and model parameters during test-time adaptation. The approach outperformed baselines by 30% on mathematical tasks while reducing interaction turns by 40%.
