Leaderboards, eval harnesses and ablations — the contested business of deciding which model is actually better.
arXiv:2607. 16736v1 Announce Type: cross Abstract: This paper presents RealDESED, a real-world domestic sound event detection (SED) benchmark comprising 5,710 audio recordings collected by 652 participants in their homes.
arXiv:2607. 16685v1 Announce Type: cross Abstract: Conditional diffusion models have become a powerful and flexible framework for learning complex conditional distributions from labeled data.
arXiv:2607. 18199v1 Announce Type: cross Abstract: Not all training samples contribute equally to large language model fine-tuning.
arXiv:2607. 17610v1 Announce Type: cross Abstract: Automatic image colorization enables large-scale and low-cost reuse of grayscale media (e.
arXiv:2607. 17108v1 Announce Type: new Abstract: In multi-hop RAG evaluation, a top-k answer score can hide two different failures: the retrieval window may drop part of the support chain, or it may contain support in a form the adapted reader does not use well.
arXiv:2607. 17166v1 Announce Type: new Abstract: Transformer-based large language models (LLMs) continue to achieve state-of-the-art performance across various natural language processing tasks.
arXiv:2607. 16251v1 Announce Type: new Abstract: Spatio-Temporal Foundation Models (STFMs) aim to learn generalizable representations of complex dynamical systems across space and time.
arXiv:2607. 16999v1 Announce Type: cross Abstract: The Credit Assignment Problem (CAP) is fundamental to developing efficient and explainable Reinforcement Learning (RL) agents.
arXiv:2607. 18226v1 Announce Type: new Abstract: Causal discovery methods have shown strong performance in temporal systems, but they typically rely on regular and discrete lag structures, limiting their applicability to regularly sampled data.
arXiv:2607. 17601v1 Announce Type: cross Abstract: Accurate protein-ligand binding affinity prediction is central to computational drug discovery, yet modern docking engines frequently disagree without indicating which prediction to trust.
arXiv:2607. 17582v1 Announce Type: new Abstract: Approximate Nearest Neighbor Search (ANNS) plays a pivotal role in modern deep learning pipelines.
arXiv:2607. 16768v1 Announce Type: new Abstract: Learning with noisy labels is a fundamental problem in training reliable deep neural networks.
arXiv:2407. 04900v2 Announce Type: replace Abstract: Numerous existing studies have examined the performance of Sample Average Approximation (SAA) in the fundamental newsvendor problem.
arXiv:2607. 16969v1 Announce Type: new Abstract: Predictive maintenance relies on accurate Remaining Useful Life estimation, often formulated using survival analysis over multivariate time-series data.
arXiv:2607. 17317v1 Announce Type: cross Abstract: Autonomous systems rely on a perception module to navigate through dynamic environments.
arXiv:2607. 16252v1 Announce Type: cross Abstract: Low-Rank Adaptation (LoRA) is a widely used parameter-efficient fine-tuning (PEFT) method for large language models.
arXiv:2603. 07598v2 Announce Type: replace Abstract: Chain-of-thought (CoT) reasoning improves problem solving, but long think traces increase inference cost.
arXiv:2607. 17724v1 Announce Type: cross Abstract: Coordinating payload transfers between subsystems is a critical challenge in lifelong Multi-Agent Pickup and Delivery (MAPD).
arXiv:2605. 30664v2 Announce Type: replace Abstract: Subgoal-based policy tree search, which uses a policy to guide search, is effective for complex single-agent deterministic problems but often relies on explicit subgoal generation that can incur substantial overhead and hinders scalability.
arXiv:2607. 17708v1 Announce Type: new Abstract: Multi-task neural solvers aim to handle multiple Vehicle Routing Problem (VRP) variants within a unified model, avoiding separate training for each constraint combination.