Web This site Trusted
30 result(s) for “okapi bm25 site hotchips pp site github com site of de site developers code com site:arxiv.org” of 37 matched · 854 ms
Scope: Nishi’s own index (our crawl + Common Crawl) — not the whole live web. Some sites block all automated crawlers (anti-bot walls), so their pages may be absent here even though we never filter lawful content.
Freshness: no result on this page carries a fetch time yet (indexed before the fetch epoch was stored beside the doc)
Please refer to the source code for the most up-to-date list of skills: https://github
from the top result below
https://arxiv.org/html/2407.16741v3
OpenDevin), a platform for the development of powerful and flexible AI agents that interact with the world in similar ways to those of a human developer: by writing code, interacting with a command line, and browsing the web
https://arxiv.org/html/2608.02613v1
(3) Search latency bites only at very small reader: on a Spark GB10 edge node, memory-search adds a moderate and fixed 8787/77/4848 ms (BM25-RAG/Memobase/MemSearch) that composes a small part of TTFT for most reader-backend combinations
https://arxiv.org/list/cs.AI/new
However, their performance heavily depends on the clarity and completeness of data semantics
https://arxiv.org/html/2403.08299v1
They often do not leverage all IDE capabilities such as invoking linters, compilers, or executing command-line operations, and consequently, developers still need to manually validate syntax and ensure the correctness of AI-generated code, execute the codebase, and inspect error logs
https://arxiv.org/list/cs.SE/new
Through an analysis of 1,966 open source projects, 1,355 Github issues, 444 CVE reports, and 361 StackOverflow posts, we systematically map the feature support and real-world usage of globs across six common ecosystems that utilize globs
https://arxiv.org/html/2608.03048v1
com/JetAstra/PI-Mem
Introduction
The ability to reason over long contexts is increasingly important for large language models (LLMs), supporting applications such as long-document question answering (Gemini Team 2025; Yang et al
https://arxiv.org/html/2608.02668v1
Both prove to be members of a one-parameter family of angular retractions, pp-SpheretNorm, whose rotation angle saturates rather than growing without bound
https://arxiv.org/html/2407.02518v2
com
Abstract
Large language models (LLMs) for code are typically trained to align with natural language instructions to closely follow their intentions and requirements
https://arxiv.org/html/2608.03063v1
Our code is available at https://github
https://arxiv.org/html/2501.13956v1
com
Abstract
We introduce Zep, a novel memory layer service for AI agents that outperforms the current state-of-the-art system, MemGPT, in the Deep Memory Retrieval (DMR) benchmark
https://arxiv.org/html/2508.16279v1
Developers can use these agents out of the box or treat them as starting points for further customization
https://arxiv.org/html/2402.03300v3
com/deepseek-ai/DeepSeek-Math
Abstract
Mathematical reasoning poses a significant challenge for language models due to its complex and structured nature
https://arxiv.org/list/cs.CL/new
(3) Search latency bites only at very small reader: on a Spark GB10 edge node, memory-search adds a moderate and fixed 87/7/48 ms (BM25-RAG/Memobase/MemSearch) that composes a small part of TTFT for most reader-backend combinations
https://arxiv.org/html/2608.02918v1
Biscainho are with SMT, DEL/Poli & PEE/COPPE, Federal University of Rio de Janeiro, Brazil (corresponding e-mail: wallace
https://arxiv.org/html/2608.03011v1
AS] 04 Aug 2026
Towards Real-world Environment-aware Zero-shot Text-to-speech Synthesis via Disentangled Audio Infilling
Ye-Xin Lu, Xin Wang, Yang Ai, Hui-Peng Du, Zhen-Hua Ling, and Junichi Yamagishi This work is the extended version of our conference paper [1] published at IEEE International Conference on
https://arxiv.org/html/2607.22511v2
The source code, formal library, and run records are available at https://github
https://arxiv.org/html/2509.22186v2
\metadata
[* Equal contribution ✉ Corresponding author ‡\ddagger Project leader] \correspondenceConghui He, \metadata[Code:]https://github
https://arxiv.org/html/2608.02609v1
Code and pretrained model: https://github
https://arxiv.org/html/2608.02612v1
Our code and dataset are available at https://github
https://arxiv.org/html/2210.00131v4
Code and open-source demos available at https://github
https://arxiv.org/html/2508.19205v1
com/microsoft/VibeVoice
Hugging Face: microsoft/VibeVoice
Demo: aka
https://arxiv.org/html/2407.17789v2
The source code is released on GitHub111https://github
https://arxiv.org/html/2608.03446v1
com/KathyHaem/cla-metrics
2 Background and Related Work
Cross-lingual alignment
https://arxiv.org/html/2608.02616v1
com
Abstract
We present the first independent, systematic evaluation of OpenAI’s Privacy Filter (OPF), a 1
https://arxiv.org/html/2608.00785v1
com
Abstract
Content discovery systems depend on relevance judgment for search quality evaluation, but human annotation faces inter-annotator disagreement and scaling costs
https://arxiv.org/abs/2608.03883
The task requires systems to rank candidate Reddit sentences according to their relevance to each of the 18 symptoms in the Adult ADHD Self-Report Scale (ASRS-v1
https://arxiv.org/abs/2608.03860
The pipeline combines sentence-window chunking, BM25, BGE-M3 dense retrieval, reciprocal rank fusion, optional cross-encoder reranking, and grounded answer generation
https://arxiv.org/abs/2104.08663
Benchmark for Zero-shot Evaluation of Information Retrieval Models, by Nandan Thakur and 4 other authors
View PDF HTML (experimental)
Abstract:Existing neural information retrieval (IR) models have often been studied in homogeneous and narrow settings, which has considerably limited insights into their out-of
https://arxiv.org/list/cs.IR/new
We provide the core implementation of KGD at this https URL
https://arxiv.org/html/2407.03956v3
Solving such problems has been extensively studied, from simple mathematical problems in the subfield of word problem solving to applications like automated code generation by Large Language Models (LLMs) (Mukherjee and Garain, 2009; Chen et al