Web This site Trusted
30 result(s) for “okapi bm25 site hotchips pp site github com site text of de site www kernel org site:arxiv.org” of 56 matched · 951 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: newest result fetched 25 d ago · median age of these results 25 d · 1 of 30 carry a fetch time
The query asks the model to recall the topic of an earlier conversation about Tesla; the gold answer is anchored in one specific session about Pooja’s dig site
from the top result below
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/2608.03048v1
To address these issues, we propose PI-Mem (Parallel-Iterative Memory), a mechanism that processes all chunks in parallel and iteratively refines a shared memory over a bounded number of turns
https://arxiv.org/html/2607.27099v1
Analysis of high-frequency rainfall data (at the minute scale over several years) indicates that critical Hawkes processes with heavy-tailed power-law kernels yield a superior fit relative to classical models and alternative kernel specifications
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/2609.03027v1
Report GitHub Issue
Description:
arXiv is now an independent nonprofit
https://arxiv.org/html/2609.02852v1
Report GitHub Issue
Description:
arXiv is now an independent nonprofit
https://arxiv.org/html/2607.22511v2
A statement can be free of sorry and still be mathematically uninformative: a definition may reduce to True; or an unproven step may be introduced as an axiom that the kernel accepts
https://arxiv.org/html/2407.16741v3
2 Agent Runtime: How Execution of Actions Results in Observations
2
https://arxiv.org/html/2608.02612v1
2 Behavioral Analysis of LLMs as Meta-Solvers
Sensitivity to Problem Domains and Difficulties
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.03411v1
com
Abstract
Accurate Uncertainty Quantification (UQ) is critical for reliable deployment of Large Language Models (LLMs), yet traditional probability-based metrics often fail to capture the model’s true epistemic state
https://arxiv.org/html/2508.02739v1
, Jian Li1
Abstract
The success of large-scale pre-training paradigm, exemplified by Large Language Models (LLMs), has inspired the development of Time Series Foundation Models (TSFMs)
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/2511.06451v1
Relations to prior art (coverage of all references)
https://arxiv.org/list/cs.CV/new
0 achieves state-of-the-art or leading performance on text-to-3D generation and 3D editing benchmarks, while exhibiting strong understanding and part-generation capabilities
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/html/2608.02851v1
To establish their well-posedness, the kernel domain is partitioned along characteristic lines into a finite number of triangular subregions, and the kernel solution is constructed successively in the preceding subregion to the next one
https://arxiv.org/abs/2104.08663
We leverage a careful selection of 18 publicly available datasets from diverse text retrieval tasks and domains and evaluate 10 state-of-the-art retrieval systems including lexical, sparse, dense, late-interaction and re-ranking architectures on the BEIR benchmark
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/2608.02851v1
To establish their well-posedness, the kernel domain is partitioned along characteristic lines into a finite number of triangular subregions, and the kernel solution is constructed successively in the preceding subregion to the next one
https://arxiv.org/list/math.ST/2024-03
00186 [pdf, html, other]
Title: Warped Kernel Estimator for I
https://arxiv.org/html/2607.29442v2
Microstructural Foundations of Rough Noise1footnote 1footnoteFootnotefootnotesFootnotes1footnote 1We are grateful to Carsten Chong for fruitful discussions on rough noise
https://arxiv.org/list/cs.IR/recent
CL) [pdf, html, other]
Title: SciRet: A Compute-Aware Empirical Study of Retrieval and Reranking for Scientific RAG
Kaysarul Anas Apurba, Md
https://arxiv.org/abs/2204.04218
Our attention module uses the convolution operation to perform joint spatial-channel attention on multiple concatenated input tensors, where the kernel (receptive field) size controls the reduction rate of the spatial attention, and the number of convolutional filters controls the reduction rate of the channel
https://arxiv.org/abs/2608.12700
We build the instrument that checks correctness properly: a contract-grade verifier of twelve adversarial gates, each a property a correct kernel must satisfy, several of them tolerance-free, so no choice of threshold can explain a failure away
https://arxiv.org/html/2609.03371v1
Report GitHub Issue
Description:
arXiv is now an independent nonprofit
https://arxiv.org/list/cs.DB/new
DB)
Large language models have made natural language interfaces to databases (NLIDB) newly credible, but LLM text-to-SQL systems fail in a way that matters for deployment: a hallucinated column or a mis-aggregated total yields a fluent wrong answer, indistinguishable at the point of use from a right one
https://arxiv.org/list/cs.IR/new
We provide the core implementation of KGD at this https URL
https://arxiv.org/abs/2512.09590
Using an extension of the exponential-affine transformation formula for those processes, we establish in the long run the existence of limiting distributions, which (unlike in the case of classical affine diffusion processes) may depend on the initial state of the process, unless the Volterra kernel coincides with the