Web This site Trusted
30 result(s) for “okapi bm25 site terms com pp site github com site lemma would site it apache org site:arxiv.org” of 62 matched · page 2 · 909 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 would site it apache org site:arxiv.org?
Freshness: no result on this page carries a fetch time yet (indexed before the fetch epoch was stored beside the doc)
https://arxiv.org/html/2608.02851v1
org perpetual non-exclusive license
arXiv:2608
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
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
https://arxiv.org/html/2607.26405v1
It then formulates the system-level problem of partitioning currencies into multi-currency pools, which is solved using a hierarchical agglomerative clustering algorithm
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
https://arxiv.org/html/2508.20108v2
, 2023) reduces the distribution difference; however, it does not fully align the distributions
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$
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
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
https://arxiv.org/list/q-fin.MF/2021-04
A lacuna in the proof of the old Lemma 3
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
https://arxiv.org/html/2608.02943v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2608.03573v1
org perpetual non-exclusive license
arXiv:2608
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
https://arxiv.org/list/cs.AR/new
Continuous improvement in storage density over decades has led NAND flash memory to play a vital role in modern computing systems, but it also comes at a cost of significant reliability degradation
https://arxiv.org/list/cs.IT/new
IT)
Suppressive interference, high-dynamic motion of the receiving platform, and carrier-phase RTK lead satellite navigation to one fundamental question: when the receiver actively participates in observation formation through its array geometry, channel states, weights, and signal-processing rules, how can the
https://arxiv.org/list/cs.SY/new
The standard tools, classical and modern, each fail quantifiably: probing is punished before it pays, commitment is fatal at sub-disturbance excitation once adaptation is necessary, optimism degenerates to tie-breaking or pays asymptotically at least twice the optimum, and regret certificates are blind to the worst
https://arxiv.org/html/2407.00419v1
Two natural assumptions in such settings are that: 1) all agents in the population are individually rational learners, and 2) when any two members of the population are paired together, with high-probability they will achieve at least the same utility as they would under some Pareto efficient equilibrium strategy
https://arxiv.org/list/cs.CR/new
We show that a natural pairwise-correlation extension to three or more stages is invalid because it gives a lower rather than an upper bound, and derive a valid spanning-tree alternative
https://arxiv.org/html/2407.08254v2
It is based on the use of a global reward function for the estimation of each agent’s local contribution, and regret matching for coordination
https://arxiv.org/html/2407.06328v2
Within the standard framework, it is generally assumed that all agents have perfect knowledge of these payoffs
https://arxiv.org/html/2407.20441v1
To do so, it uses potentially stale agents’ TD update directions, where the staleness is a consequence of the delays
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/2407.20187v1
A node v∈V𝑣𝑉v\in Vitalic_v ∈ italic_V is then under (majority) illusion if it has strictly more red neighbours than blue neighbours
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
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
https://arxiv.org/html/2407.04889v1
(2019b); however, in general settings it is not known how to best play against mean-based learners, even if the agent knows everything about the learners, and can predict with certainty what actions they would take as a function of the history of play
https://arxiv.org/html/2407.15077v2
Although sequentially updating policies agent-by-agent in an appropriate order improves policy performance, it is prone to low efficiency due to sequential execution, resulting in longer model training and execution time
https://arxiv.org/pdf/1811.12628
ioAJyU# LFg¡C}zO7tXW,۽ݭDZbn; ] ,= h粂7'6m.>tv }u/|8 pqMP7f3E( )ֽa\dYD3,V:A3 K+r :t4!4}wLod#౭6?q2UdQL %ʔc7_Vo1qo
https://arxiv.org/html/2407.18010v2
Since acting at each available opportunity would accumulate prohibitively large costs, the resulting decision problem is one in which players must make strategic decisions about when to execute actions in addition to their choice of action