Web This site Trusted
30 result(s) for “okapi bm25 site www eyespy cy site can kernel org site www kernel org site:arxiv.org” of 233 matched · 1127 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
Lean 4 checks kernel analogues for positions, evidence, clocks, monitors, atomicity, and branch source retention; 88 tests, 3,534 bounded checks, and 32 Lean/Python runtime-kernel cases bound the implementation claim to the checked cases
https://arxiv.org/list/cs.LG/2024-12
3251-3298
Showing up to 50 entries per page: fewer | more | all
[1] arXiv:2412
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/list/cond-mat/new
The mixed anomaly between these is accommodated by the not-on-site action of the symmetries
https://arxiv.org/html/2608.02851v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/abs/2608.12700
A kernel can pass that test and still be silently wrong
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/html/2607.27099v1
org perpetual non-exclusive license
arXiv:2607
https://arxiv.org/html/2608.02612v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/list/cs.DB/new
We propose an architectural pattern for such systems, a trusted kernel with a generative shell, resting on one invariant: a component that can fabricate may influence which question the system answers, never which value it returns
https://arxiv.org/list/econ/new
up to 2000 entries per page: fewer | more | all
New submissions (showing 21 of 21 entries)
[1] arXiv:2608
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/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/list/math.ST/new
If \(T_\star\) is the selected physical trajectory length and \(a_\star=\sqrt m\,T_\star\), a terminal-depth transfer argument yields restricted conductance and warm-start mixing without lazifying either kernel
https://arxiv.org/html/2501.13956v1
2 Knowledge Graph Construction
2.1 Episodes
2.2 Semantic Entities and Facts
2.2.1 Entities
2.2.2 Facts
2.2.3 Temporal Extraction and Edge Invalidation
2.3 Communities
3 Memory Retrieval
3.1 Search
3.2 Reranker
4 Experiments
4.1 Choice
https://arxiv.org/html/2608.03048v1
for large language models, as recent recurrent-memory approaches face two inherent challenges: sequential chunk-wise updates can overwrite early critical evidence with later irrelevant content, and serial inter-chunk dependencies limit parallelism and cause latency to increase with context length
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/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/list/cs.OS/new
Applications may therefore slow down before the kernel kills a process
https://arxiv.org/abs/2609.14858
Across algorithm engineering, mathematical optimization, and GPU kernel engineering, \textsc{Dream-RSI} achieves competitive or improved discovery quality while substantially reducing discovery cost in several settings
https://arxiv.org/html/2511.06451v1
Spectral safety and discrete Green kernel
https://arxiv.org/abs/1202.3424
2 includes support for MPI, OpenMP, and the Intel Math Kernel Library (MKL)
https://arxiv.org/html/2609.03027v1
Report GitHub Issue
Description:
arXiv is now an independent nonprofit
https://arxiv.org/list/cs.AR/new
more | all
New submissions (showing 4 of 4 entries)
[1] arXiv:2608
https://arxiv.org/list/astro-ph.IM/new
In particular, the maximal light deflection of a given Solar System body can be easily estimated for a given observer
https://arxiv.org/html/2609.02852v1
Report GitHub Issue
Description:
arXiv is now an independent nonprofit
https://arxiv.org/html/2607.29442v2
In an asymptotic framework inspired by Rosenbaum2018, we show that the rescaled price process converges to a Bachelier-type semimartingale plus a Gaussian moving average whose kernel is determined explicitly by the trawl function
https://arxiv.org/html/2609.03371v1
Report GitHub Issue
Description:
arXiv is now an independent nonprofit