Web This site Trusted
30 result(s) for “okapi bm25 site terms com pp site github com site lemma would site lemma would site:arxiv.org” of 80 matched · page 2 · 1092 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 lemmy would 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
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/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/2407.16741v3
com/All-Hands-AI/OpenHands
Slack http://bit
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/html/2608.02668v1
com/hazdzz/deep_connection \ncudata[Correspondence]Jie Zhang (),
Correspondence: Cheng-Fang Su ()
“Geometry is not true, it is advantageous
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.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
https://arxiv.org/html/2608.03063v1
8 pp in a production fraud detector serving billion-scale transaction traffic
https://arxiv.org/html/2608.02942v1
×
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 arXiv
Why HTML? Report Issue Back to Abstract Download PDF
https://arxiv.org/html/2607.29442v2
1footnoteFootnotefootnotesFootnotes1footnote 1We are grateful to Carsten Chong for fruitful discussions on rough noise. We benefitted from comments by and discussions with Kim Christensen, Mikko Pakkanen, Bent Jesper Christensen, and Mikkel
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/cs.IT/new
However, the existing works have difficulty accommodating user heterogeneity in terms of communication channel quality, expected quality-of-service (QoS) targets, and the available local energy
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
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
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/list/math/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
Mathematics
New submissions
Cross-lists
Replacements
See recent articles
Showing
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/q-fin.MF/2021-04
A lacuna in the proof of the old Lemma 3
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
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
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
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
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
https://arxiv.org/html/2407.20441v1
I Introduction
II System Model and Problem Formulation
III Main result
IV Proof of the main result
V Simulations
VI Conclusion and Future Work
Finite-Time Analysis of Asynchronous Multi-Agent TD Learning
Nicolò Dal Fabbro, Arman Adibi
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/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
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
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/2608.02918v1
Miranda is also with LCTI, Télécom Paris, IP Paris, France
https://arxiv.org/html/2407.05763v1
1 Introduction
2 Preliminaries
2.1 Graph Theory
2.2 Generalized Homogeneity
3 Problem Statement
4 Basic Idea of the Observer Design
5 Homogeneous Observer Design
5.1 Globally Homogeneous Distributed Observer
5.2 Locally Homogeneous