Page 71 of 148

AllHigh signalRecent
5898 articles
arXiv cs.CL·

CodeBind: Decoupled Representation Learning for Multimodal Alignment with Unified Compositional Codebook

CodeBind introduces a multimodal alignment framework using shared-specific compositional codebooks. The method decomposes representations into semantic shared components and modality-unique components, validated across 9 modalities (text, image, video, audio, depth, thermal, tactile, 3D point cloud, EEG) achieving state-of-the-art performance in classification and retrieval tasks.

EmbeddingsVisionRobotics
SIG
72
HYP
25
arXiv cs.CL·

AdaSwitch: Adaptive Switching between Small and Large Agents for Effective Cloud-Local Collaborative Learning

AdaSwitch proposes a cloud-local collaborative paradigm where a local agent (small LLM) handles simple tasks and requests assistance from a cloud agent (large LLM) for complex reasoning. The adaptive mechanism detects local errors and dynamically switches. Evaluation on 7 benchmarks (mathematical reasoning, complex QA) shows performance improvement with reduced computational overhead.

AI AgentsMulti-agentReasoning
SIG
72
HYP
25
arXiv cs.AI·

Multi-Party Multi-Objective Optimization as Consensus Search: Runtime Analysis of Cross-Party Recombination

Theoretical study of multi-objective evolutionary algorithms for multi-party optimization (MPMOP). On MP-JCG benchmark, payoff-guided mutation requires Θ(n²) fitness evaluations to cross a gap region, while CPR-NSGA-II achieves O(n log n) via cross-party recombination. Runtime analysis on BPBOMST (multi-party minimum spanning tree) with instance-parameterized bounds.

Multi-agentBenchmarksPapers
SIG
72
HYP
08
arXiv cs.AI·

Distinguishable Deletion: Unifying Knowledge Erasure and Refusal for Large Language Model Unlearning

Distinguishable Deletion (D²) unifies knowledge deletion and refusal for LLM unlearning. The method uses an energy index to erase undesirable knowledge in latent representations rather than specific tokens, avoiding biased deletion and re-emergence of harmful content. Energy-based Unlearning Alignment (EUA) applies this mechanism at training and inference.

AI safetyAlignmentPapers
SIG
72
HYP
25
arXiv cs.AI·

From Imitation to Interaction: Mastering Game of Schnapsen with Shallow Reinforcement Learning

Shallow neural network agents master the card game Schnapsen through reinforcement learning. RLBot, trained via asynchronous Monte Carlo updates, outperforms MLPBot (supervised imitation) and achieves statistically significant wins against RdeepBot, a search-based baseline. Combining learned value functions with deeper lookahead during gameplay improves performance.

Reinforcement learningBenchmarksPapers
SIG
72
HYP
15
arXiv cs.CL·

"The Whole Is Greater Than the Sum of Its Parts": A Compatibility-Aware Multi-Teacher CoT Distillation Framework

COMPACT, a multi-teacher CoT distillation framework, adaptively fuses supervisions from multiple LLMs into compact student models. It dynamically weights teacher gradients using three metrics: graph-based consensus, mutual-information-based adaptability, and loss-based difficulty. Achieves SOTA results across benchmarks while mitigating catastrophic forgetting.

ReasoningFine-tuningPapers
SIG
72
HYP
25
arXiv cs.AI·

New Insight of Variance reduce in Zero-Order Hard-Thresholding: Mitigating Gradient Error and Expansivity Contradictions

New zeroth-order hard-thresholding algorithm with variance reduction for ℓ0-constrained optimization. Addresses SZOHT's limitation on random directions by mitigating conflict between ZO gradient deviation and hard-thresholding expansivity. Improved convergence rates validated on ridge regression and black-box adversarial attacks.

Reinforcement learning
SIG
72
HYP
15
arXiv cs.AI·

Prompt Compression in Diffusion Large Language Models: Evaluating LLMLingua-2 on LLaDA

Study of prompt compression on LLaDA, an 8B-parameter DLLM, using LLMLingua-2. Evaluation on GSM8K, DUC2004, ShareGPT at 2× compression ratio shows semantic preservation does not guarantee stability in diffusion models: mathematical reasoning degrades substantially while summarization remains robust. Autoregressive compression methods do not transfer uniformly to DLLMs.

Prompt engineeringBenchmarksReasoning
SIG
72
HYP
15