Web This site Trusted
30 result(s) for “okapi bm25 site terms com pp site learn ca site chayatex com site can kernel org site:arxiv.org” of 64 matched · 1159 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 24 d ago · median age of these results 24 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
We evaluate five open-weight readers with Vanilla context, BM25-RAG, Oracle retrieval, Memobase, and MemSearch as memory backends
https://arxiv.org/list/cs.AI/new
We demonstrate that it can self-assemble functional circuits from scratch and rapidly re-route logic around permanent, previously unseen hardware faults
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/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/2609.03027v1
EPIC can achieve 𝒪(NlogN)\mathcal{O}(N\log N) computational scaling for dense aperture arrays and has been demonstrated on the Long Wavelength Array (LWA) station in Sevilleta (USA) using Graphics Processing Unit (GPU)
https://arxiv.org/html/2609.02852v1
Learn more ×
The Implications of Linguistic Illegibility for LLM Security
James Mickens Affiliation: Harvard University Email: mickens@g
https://arxiv.org/html/2607.27099v1
org perpetual non-exclusive license
arXiv:2607
https://arxiv.org/list/cs.CV/new
Ultimately, this work recasts world modeling into an agent-centric paradigm, establishing a roadmap for building world proxies that empower agents to plan better, learn faster, and evolve continually
https://arxiv.org/pdf/2608.03157
4 4C0M8$SH Rpk4>e8Q{ћPp/I1Mc2^Q#T#NrFRKcl w'0I}J U h+`d@Wul `r0= hJlf6'hީ&8bA| kJwԄFLŷJ6Q,'DU {P_GObiwI& zkHF)Ҫ0 ^SogR7C68W l2N *cO 8S
https://arxiv.org/list/math/new
Their finite iterates can develop rapidly increasing numbers of linear pieces, making them a natural test case for the expressive power of deep neural networks
https://arxiv.org/pdf/2006.15704
@ Pefjͬ*@ ygVw/wO }. ̲.(L𣸼{ }/Z! $ m1L@8K|ںWP4k F'bP4Jꏴ8yu8/q Eꗹ=?tU?TsE \tMpj{Asjk'N˓A' ߛz ]#csM_&cY +B7q^
https://arxiv.org/pdf/2508.04671
485 ] /Info 411 0 R /Root 187 0 R /Size 670 /Prev 2921183 /ID [] >> stream xcbdg`b`8 $;A. H0 > X`$$,@ P)$A@{A ayY@* $xM@ D(201* (1J cr]0 -Qb% 0T endstream endobj 187 0 obj >
https://arxiv.org/abs/2608.03883
Our systems combine sparse BM25 retrieval, evidence-aware rescoring for self-referential symptom reports, embedding-based reranking, query-prototype expansion, and LLM-based reranking
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
Our results show BM25 is a robust baseline and re-ranking and late-interaction-based models on average achieve the best zero-shot performances, however, at high computational costs
https://arxiv.org/list/cs.IR/recent
02048 [pdf, html, other]
Title: SmartGR: Hierarchy and Beam-Aware Knowledge Distillation for Generative Recommendation
Ziheng Zhang, Yu Cui, Bohao Wang, Yong He, Chao Yu, Chuan Yuan, Wujie Sun, Can Wa
https://arxiv.org/list/cs.IR/new
IR)
Industrial recommenders increasingly adopt the pretrain-then-transfer paradigm, yet behavioral distribution drift raises two questions: what to learn from behavior sequences, and how to transfer the learned knowledge while the pretrained model is continually refreshed
https://arxiv.org/list/cs.CL/new
LG)
Half a million cuneiform clay tablets survive in museums worldwide, yet modern users can neither read nor write in the world's oldest writing system, leaving a 4,000-year cultural barrier that existing NLP tools have only partially addressed
https://arxiv.org/abs/2608.12700
A kernel can pass that test and still be silently wrong
https://arxiv.org/abs/2204.04218
In many situations, computed tomography (CT) or magnetic resonance imaging (MRI) techniques capture several scans (modes) during a single investigation, which can jointly be used (in a multimodal fashion) to further boost the quality of super-resolution results
https://arxiv.org/abs/2608.02851v1
The design relies on two affine Volterra transformations involving both Fredholm- and Volterra-type integral terms, which results in a four-PIDE kernel equations
https://arxiv.org/list/math.ST/2024-03
00186 [pdf, html, other]
Title: Warped Kernel Estimator for I
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
https://arxiv.org/abs/2608.01651
We present Bole, a kernel--runtime co-design that enables efficient tree speculation for hybrid-attention LLMs
https://arxiv.org/html/2608.02851v1
The design relies on two affine Volterra transformations involving both Fredholm- and Volterra-type integral terms, which results in a four-PIDE kernel equations
https://arxiv.org/list/cs.DC/new
SE)
Automating GPU kernel optimization remains difficult in practice: generated variants can violate correctness constraints, runtime measurements are noisy, and search often stalls early
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
com/All-Hands-AI/OpenHands
Slack http://bit
https://arxiv.org/abs/2609.14858
Our key insight is that accumulated discovery history can serve as a replay simulator over the realized search space
https://arxiv.org/abs/1202.3424
, dust particles), but may also be 1-d or 2-d periodic arrays of "target unit cells", which can be used to study absorption, scattering, and electric fields around arrays of nanostructures