NishiSearch

Web This site Trusted

30 result(s) for “okapi bm25 site terms com pp site github com site lemma world site w3c github io site:arxiv.org” of 64 matched · page 2 · 1082 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 terms com pp site github com site lemmy world site w3c github io site:arxiv.org?

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

Stabilization of First-Order Partial Integro-Differential Equations with

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

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

Raising Rivals’ Costs on Hybrid Platforms: The Complementarity of Fees

https://arxiv.org/html/2608.02800v1
com in China, Walmart Marketplace and Target Plus in the United States, Otto in Germany, Flipkart in India, and Rakuten in Japan

[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

Mitigating Distribution Shift in Stock Price Data via Return-Volatility

https://arxiv.org/html/2508.20108v2
Extensive experiments on real-world datasets demonstrate that ReVol enhances the performance of the state-of-the-art backbone models in most cases, achieving an average improvement of more than 0

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

[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

Bandwidth-Free Inference for Recursive Nonlinear Impulse Response

https://arxiv.org/html/2608.02943v1
After projection through the recursion, the quantile terms admit a residual-rank-and-spacing representation, yielding feasible inference without innovation-density estimation or quantile smoothing

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$

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

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

Mathematical Finance Apr 2021

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

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

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

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)

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

United We Stand: Decentralized Multi-Agent Planning With Attrition

https://arxiv.org/html/2407.08254v2
Results suggest that, in the presence of frequent failures, our solution improves substantially over the best existing approaches in terms of global utility and scalability

Logic in Computer Science

https://arxiv.org/list/cs.LO/new
AI) The Shapes Constraint Language (SHACL) is a W3C recommendation to express syntactic constraints, called shapes, on RDF graphs

Learning Equilibrium with Estimated Payoffs in Population Games

https://arxiv.org/html/2407.06328v2
I Introduction II Preliminaries and Problem Description II-A Task Allocation Game Model II-B Learning Rule, Stochastic Alarm Clock, and Evolutionary Dynamics Model II-C Payoff Vector Estimation III Convergence Analysis and Revision Rate

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]

Forthcoming in SIAM Journal on Financial Mathematics Decentralised

https://arxiv.org/html/2309.08431v3
Finance and Automated Market Making: Predictable Loss and Optimal Liquidity Provision 1 Introduction 2 Constant function markets and concentrated liquidity 2.1 Constant function markets 2.2 Concentrated liquidity markets 3 The wealth of

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

Eliminating Majority Illusion is Easy

https://arxiv.org/html/2407.20187v1
1 Introduction 1.1 The Illusion Elimination Problem 1.2 Our Contributions. 1.3 Related Work. 2 Preliminaries 3 Majority Illusion Addition Elimination (MIAE) 3.1 A First Attempt 3.2 A Second Attempt 3.3 A TDI System 3.4 A Polynomial Time

1 Introduction

https://arxiv.org/html/2511.06451v1
Problem statement and motivation. Thesis: risk-neutral pricing as a structured operator. From selective scan to a risk-neutral operator layer. Geometry in the loop: Q-Align and convex–monotone decoding. Spectral stability as a first-class

1 Introduction

https://arxiv.org/html/2407.15077v2
2 Problem Definition 3 Method 3.1 Monotonic Improvement of B2MAPO scheme 3.2 B2MAPO Framework 3.2.1 Batch Sequence Generation Layer 3.2.2 Batch by Batch Policy Optimization Layer 4 DAG-based B2MAPO Algorithm 4.1 Hierarchical DAG