NishiSearch

Web This site Trusted

30 result(s) for “okapi bm25 site hotchips pp site github com site does cercos dev site lemma world site:arxiv.org” of 66 matched · page 2 · 529 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.

Did you mean okapi bm25 site hotchips pp site github com site does cercos dev site lemmy world site:arxiv.org?

Freshness: no result on this page carries a fetch time yet (indexed before the fetch epoch was stored beside the doc)

Condensed Matter

https://arxiv.org/list/cond-mat/new
The mixed anomaly between these is accommodated by the not-on-site action of the symmetries

Untitled Document

https://arxiv.org/html/2607.28294v1
A second scheme preserves the realized count and sets the number of events in the bootstrap world as n∗=n​(T)n^{\ast}=n(T)

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

Multi-Currency AMMs for Decentralized FOREX Markets: Feasibility

https://arxiv.org/html/2607.26405v1
After World War II, the stable US economy with its dollar attached to the gold standard made it an attractive peg codified through the 1944 Bretton Woods Agreement

Optimal testing in a class of nonregular models

https://arxiv.org/html/2403.16413v3
For testing a simple null hypothesis against a simple alternative one, Neyman-Pearson’s fundamental lemma yields an optimal power property of the likelihood ratio test even for the case of parameter-dependent support

Asymptotic Equivalence of Immediate and Deferred Acceptance

https://arxiv.org/html/2607.24970v2
In this paper, we ask: does IA produce meaningfully better average ranks than DA, conditional on truth-telling

Report GitHub Issue

https://arxiv.org/html/2608.02942v1
On-policy distillation aligns supervision with student-visited states, but it does not determine how far a transition should advance

Stabilization of First-Order Partial Integro-Differential Equations with

https://arxiv.org/html/2608.02851v1
Their approach, remaining confined to the ODE framework, does not–at least in a straightforward manner–extend to the reverse delay configuration

Microstructural Foundations of Rough Noise1footnote

https://arxiv.org/html/2607.29442v2
That is, does there exist a tick-by-tick model, replicating the salient features of ultrahigh-frequency prices, whose scaling limit is of the form Yt=Xt+ZtY_{t}=X_{t}+Z_{t} with ZZ a continuous-time rough process

Stochastic Choice with Advertising

https://arxiv.org/html/2608.03504v1
com/wp-content/uploads/2025/04/IAB_PwC-Internet-Ad-Revenue-Report-Full-Year-2024

1 Introduction

https://arxiv.org/html/2407.15077v2
Meanwhile, the sequential updates of HAPPO and A2PO are established upon the assumption that each agent’s update does not depend on and impact the policies of others

Information Retrieval

https://arxiv.org/list/cs.IR/new
Skip to main content System maintenance August 4th and 5th Learn more × Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Information Retrieval New submissions Cross-lists Replacements See recent

Machine Learning Dec 2022

https://arxiv.org/list/cs.LG/2022-12
Skip to main content System maintenance August 4th and 5th Learn more × Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Machine Learning Authors and titles for December 2022 Total of 2004 entries : 1

SFT Conflicts, RL Coexists: A Theoretical and Empirical Analysis of

https://arxiv.org/html/2608.03573v1
Multi-Task Learning Paradigms for LLMs Report GitHub Issue × Title: Content selection saved. Describe the issue below: Description: Submit without GitHub Submit in GitHub arXiv is now an independent nonprofit! Learn more × Back to

Information Theory

https://arxiv.org/list/cs.IT/new
The physical world is not changed by a reconfiguration of the observer, but its complex representation in the observation world is

On the Complexity of Learning to Cooperate with Populations of Socially

https://arxiv.org/html/2407.00419v1
nl Abstract Artificially intelligent agents deployed in the real-world will require the ability to reliably cooperate with humans (as well as other, heterogeneous AI agents)

Finite-Time Analysis of Asynchronous Multi-Agent TD Learning

https://arxiv.org/html/2407.20441v1
However, in real-world multi-agent systems, inter-node communication imposes strong constraints, such as limited link capacity and transmission delays [4, 5, 6]

Stochastic Games with Minimally Bounded Action Costs

https://arxiv.org/html/2407.18010v2
Currently however, the theory of stochastic games in discrete-time does not include a treatment that handles impulse control

[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

[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

[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

Information Retrieval

https://arxiv.org/list/cs.IR/recent
Skip to main content System maintenance August 4th and 5th Learn more × Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Information Retrieval Authors and titles for recent submissions Wed, 5 Aug 2026

Computational Geometry

https://arxiv.org/list/cs.CG/new
PR) The Johnson--Lindenstrauss lemma asserts that every set of $n$ points in $d$-dimensional Euclidean space embeds into $O(\varepsilon^{-2}\log n)$-dimensional Euclidean space with distortion at most $1+\varepsilon$

Mathematical Finance Apr 2021

https://arxiv.org/list/q-fin.MF/2021-04
A lacuna in the proof of the old Lemma 3

Data Structures and Algorithms

https://arxiv.org/list/cs.DS/new
Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Data Structures and Algorithms New submissions Cross-lists Replacements See recent articles Showing new listings for Monday, 17 August

Hardware Architecture

https://arxiv.org/list/cs.AR/new
Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Hardware Architecture New submissions Cross-lists Replacements See recent articles Showing new listings for Monday, 17 August 2026

Systems and Control

https://arxiv.org/list/cs.SY/new
Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Systems and Control New submissions Cross-lists Replacements See recent articles Showing new listings for Monday, 17 August 2026 Total

Cryptography and Security

https://arxiv.org/list/cs.CR/new
Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Cryptography and Security New submissions Cross-lists Replacements See recent articles Showing new listings for Friday, 7 August 2026

[2203.08771] Searches for Baryon Number Violation in Neutrino

https://arxiv.org/abs/2203.08771
Dev and 37 other authors View PDF HTML (experimental) Abstract:Baryon number conservation is not guaranteed by any fundamental symmetry within the Standard Model, and therefore has been a subject of experimental and theoretical scrutiny for decades

United We Stand: Decentralized Multi-Agent Planning With Attrition

https://arxiv.org/html/2407.08254v2
1 Introduction 2 Related Work 3 Problem Formulation 3.1 Multi-agent planning with attrition 4 Attritable MCTS with Regret Minimization 4.1 Overview of the A-MCTS algorithm 4.2 Regret Matching For Cooperative Coordination 4.3 Analysis and