y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto

#parameter-optimization News & Analysis

8 articles tagged with #parameter-optimization. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

8 articles
AIBullisharXiv – CS AI · Jun 237/10
🧠

Scaling Linear Mode Connectivity and Merging to Billion Parameter Pretrained Transformers

Researchers propose a scalable framework for linear mode connectivity (LMC) that enables merging of billion-parameter pretrained transformers through dual bidirectional optimization. The method achieves near-zero loss barriers on language models and maintains strong performance on vision models, demonstrating that resolving parameter symmetries allows large AI models to be merged via simple linear interpolation paths.

AIBullisharXiv – CS AI · Apr 147/10
🧠

AtlasKV: Augmenting LLMs with Billion-Scale Knowledge Graphs in 20GB VRAM

Researchers introduce AtlasKV, a parametric knowledge integration method that enables large language models to leverage billion-scale knowledge graphs while consuming less than 20GB of VRAM. Unlike traditional retrieval-augmented generation (RAG) approaches, AtlasKV integrates knowledge directly into LLM parameters without requiring external retrievers or extended context windows, reducing inference latency and computational overhead.

AINeutralarXiv – CS AI · Jun 236/10
🧠

Essential Subspace Merging for Multi-Task Learning

Researchers propose Essential Subspace Merging (ESM), a training-free method that combines multiple task-specific models into a single multi-task model by identifying and orthogonalizing principal component directions while suppressing interference-causing noise. The approach demonstrates that most inter-task interference stems from accumulated energy in non-essential directions rather than core task-relevant updates, enabling efficient model consolidation across multiple domains.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Finding the Minimal Parameter Budget for Implicit Reasoning: A Data Complexity Driven Scaling Law for Language Models

Researchers have identified a scaling law determining the minimal parameter budget needed for language models to perform implicit reasoning without explicit chain-of-thought supervision. Through controlled experiments on synthetic knowledge graphs, they discovered that optimally-sized models can reliably reason over approximately 0.008 bits of information per parameter, establishing a principled relationship between model capacity and data complexity.

AINeutralarXiv – CS AI · May 296/10
🧠

Orthogonal Concept Erasure for Diffusion Models

Researchers propose Orthogonal Concept Erasure (OCE), a new method for removing undesired content from diffusion models that uses multiplicative parameter updates instead of additive ones. OCE achieves faster, more precise concept erasure while preserving model generative quality, capable of erasing up to 100 concepts in 4.3 seconds.

AIBullisharXiv – CS AI · May 286/10
🧠

SkillGrad: Optimizing Agent Skills Like Gradient Descent

SkillGrad introduces a gradient-descent-inspired framework for automatically optimizing LLM agent skills, treating skill packages as parameters to be refined through task execution feedback and systematic diagnosis. The method outperforms existing training-based approaches by 6.7 percentage points on benchmark tasks, demonstrating measurable improvements in agent reliability and capability.

AINeutralarXiv – CS AI · May 286/10
🧠

SmartIterator: Visual Analytics Workflows for Supervising Unsupervised Data Grouping

SmartIterator is a visual analytics framework that helps data scientists systematically evaluate and choose between multiple unsupervised learning results across parameter sweeps. The approach operationalizes structured six-phase workflows for three clustering and topic-modeling method families, enabling informed decision-making by visualizing data grouping quality, stability, membership confidence, and domain context simultaneously.

AINeutralarXiv – CS AI · Apr 156/10
🧠

Polynomial Expansion Rank Adaptation: Enhancing Low-Rank Fine-Tuning with High-Order Interactions

Researchers propose Polynomial Expansion Rank Adaptation (PERA), a novel fine-tuning method that enhances Low-Rank Adaptation (LoRA) by incorporating high-order polynomial interactions into low-rank factors. PERA improves the expressive capacity of LLM fine-tuning without increasing computational costs, demonstrating consistent performance gains across benchmarks while maintaining the efficiency benefits of rank-constrained adaptation.