NishiSearch

Web This site Trusted

30 result(s) for “okapi bm25 site hotchips pp site github com site vi do union it site can kernel site:arxiv.org” of 56 matched · 1428 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

Report GitHub Issue

https://arxiv.org/html/2608.02613v1
Instead, it falls on local, personal agents to effectively and safely maintain/utilize such dense person-person (PP) and person-agent (PA) interaction histories

Artificial Intelligence

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

Report GitHub Issue

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

1 Introduction

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

Report GitHub Issue

https://arxiv.org/html/2609.03027v1
Report GitHub Issue Description: arXiv is now an independent nonprofit

Rainfall is rough

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

Report GitHub Issue

https://arxiv.org/html/2609.02852v1
, chain-of-thought monitoring, constitutional self-critique, activation probing for linguistically-defined feature vectors) can never be completely sound; the model sandbox will always need isolation techniques whose guarantees do not depend on reading a model’s linguistic state at all

Report GitHub Issue

https://arxiv.org/html/2607.22511v2
Because a machine-checked proof establishes only that a formal statement follows from its assumptions—not that the statement faithfully captures the intended scientific claim—the pipeline augments kernel verification with a statement audit that compares each formal theorem against the informal claim it is intended

1 Introduction

https://arxiv.org/html/2407.16741v3
edu Abstract Software is one of the most powerful tools that we humans have at our disposal; it allows a skilled programmer to interact with the world in complex and profound ways

Report GitHub Issue

https://arxiv.org/html/2608.02612v1
Recent studies have therefore examined how to automatically derive optimization problems from natural-language descriptions, but existing benchmarks focus on settings where objectives and constraints can be written explicitly as mathematical expressions

Software Engineering

https://arxiv.org/list/cs.SE/new
Yet it remains unclear when further evolution helps, how successful and failed trajectories shape revision, and whether extra test-time computation can recover the same gains

[2608.03883] DS@GT-ARC at eRisk 2026 Task 3: Sparse, Semantic, and LLM

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

[2608.03860] SciRet: A Compute-Aware Empirical Study of Retrieval and

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

[2104.08663] BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of

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

Stabilization of First-Order Partial Integro-Differential Equations with

https://arxiv.org/html/2608.02851v1
Although several related problems can be transformed into comparable forms [redaud2022stabilizing], they do not directly address the PIDE setting considered here

Information Retrieval

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

Report GitHub Issue

https://arxiv.org/html/2609.03371v1
Report GitHub Issue Description: arXiv is now an independent nonprofit

Statistics Theory Mar 2024

https://arxiv.org/list/math.ST/2024-03
00186 [pdf, html, other] Title: Warped Kernel Estimator for I

Information Retrieval

https://arxiv.org/list/cs.IR/new
To handle it, KGD assigns them to separate parameter sets: a refreshable encoder owns behavioral knowledge, while a task learner reads contextualized encoder states through read-only cross-attention and writes task-specific geometry through Anchored Calibration Residual (ACR) orthogonal to the pretrained embedding

Hardware Architecture

https://arxiv.org/list/cs.AR/new
Our analysis shows that, despite its limited write performance, HBF can significantly improve the batch size, throughput, and flexibility of LLM-serving systems while reducing the minimum GPU requirements, but realizing these benefits critically depends on sustaining HBM-comparable read bandwidth and requires

[2608.12700] A Contract-Grade Verifier for LLM-Generated GPU Kernels

https://arxiv.org/abs/2608.12700
Those rates come from a single loose test: run the kernel on a few random inputs at one fixed shape and accept it if the output is close to a reference

Microstructural Foundations of Rough Noise1footnote

https://arxiv.org/html/2607.29442v2
Abstract Recently, it has been proposed to model the microstructure noise in prices by a continuous-time process with continuous sample paths that are rougher than those of a standard Brownian motion

Computation and Language

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

Report GitHub Issue

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

[2204.04218] Multimodal Multi-Head Convolutional Attention with Various

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

Instrumentation and Methods for Astrophysics

https://arxiv.org/list/astro-ph.IM/new
It is generally known how various relativistic effects affect a given astrometric observation

Databases

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

[2608.01651] Bole: Efficient Tree Speculation for Hybrid-Attention

https://arxiv.org/abs/2608.01651
Bole transforms the linear-attention recurrence into a tree-structured closed form and realizes it with a resource-efficient GPU kernel, verifying all proposal nodes in parallel and accelerating linear-attention tree verification by 3

A Heterogeneous Spatiotemporal GARCH Model: A Predictive Framework for

https://arxiv.org/html/2508.20101v1
The model combines classical GARCH(pp, qq) dynamics with spatially correlated innovations and spatially varying parameters, estimated using local likelihood methods

Distributed, Parallel, and Cluster Computing

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