This paper explores two classes of model adaptation methods for Web search ranking: Model Interpolation and error-driven learning approaches based on a boosting algorithm. The results show that model interpolation, though simple, achieves the best results on all the open test sets where the test data is very different …
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “web search ranking”
DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systemscs.IR
DCN-V2 improves deep & cross network for web-scale learning to rank systems.
problem Efficiently learning feature interactions in large-scale recommender systems.
method Proposes DCN-V2, an improved framework for deep & cross network learning.
result DCN-V2 outperforms state-of-the-art algorithms on benchmark datasets.
E-Commerce (E-Com) search is an emerging important new application of information retrieval. Learning to Rank (LETOR) is a general effective strategy for optimizing search engines, and is thus also a key technology for E-Com search. While the use of LETOR for web search has been well studied, its use for E-Com search h…
Non-stationarity appears in many online applications such as web search and advertising. In this paper, we study the online learning to rank problem in a non-stationary environment where user preferences change abruptly at an unknown moment in time. We consider the problem of identifying the K most attractive items and…
We find an invariant characterization of planar webs of maximum rank. For 4-webs, we prove that a planar 4-web is of maximum rank three if and only if it is linearizable and its curvature vanishes. This result leads to the direct web-theoretical proof of the Poincaré's theorem: a planar 4-web of maximum rank is lineari…
Traditional approaches to ranking in web search follow the paradigm of rank-by-score: a learned function gives each query-URL combination an absolute score and URLs are ranked according to this score. This paradigm ensures that if the score of one URL is better than another then one will always be ranked higher than th…
Le rang des tissus de Nakaimath.DG
Proves Nakai webs have rank 0 or 1, provides examples.
problem Classifying the rank of Nakai's webs.
method Analyzes cross-ratios and foliations to prove rank.
result Nakai webs have rank 0 or 1.
Samuelson's Websmath.DG
In the present paper we define Samuelson's webs and their rank. The main result of the paper is the proof that the rank of the Samuelson webs does not exceed 6, as well as finding the conditions under which this rank is maximal for the general Samuelson webs as well as for their singular cases.
Transforms web content for better visibility in AI-driven search engines.
problem Disruption of traditional SEO by generative AI search engines.
method Fine-tunes a BART-base transformer on synthetically generated training data.
result Significant improvements in ROUGE-L and BLEU scores, and substantial visibility gains in generative search responses.
The abstract discusses maximal rank 4-webs formed by confocal conics and their properties.
problem Characterizing confocal conics using 4-webs of maximal rank.
method Examining three different 4-webs formed by confocal conics and proving they are of maximal rank.
result Confocal conics are characterized from the web theory viewpoint.
Proposes causal modeling for intersectional fairness in rankings.
problem Fairness in rankings, especially intersectional fairness.
method Causal modeling approach for intersectional fairness, flexible ranking computation.
result Experimental evaluation shows the approach's effectiveness under different assumptions.
We give various results and applications using the connection associated with a -web. Precisely, we exhibit fundamental invariants of the web related to the differential equation of first order which presents the web. They cast some new lights on the connection and its construction, both conceptually an…
The curvature of web curves is studied in 3D manifolds.
problem Understanding the maximal rank of web structures in 3D.
method Defined a tautological connection on a bundle whose curvature vanishes for maximal rank.
result Exceptional 6-web and its subwebs in 3D have maximal rank.
The study generalizes Blaschke curvature for higher-dimensional webs and identifies infinite classes of isomorphism.
problem Understanding the structure and classification of -webs by curves in -dimensional manifolds.
method Definition and analysis of generalized Blaschke curvature, construction of isomorphism classes, and identification of invariants.
result There are infinitely many classes of isomorphism for 4-webs by curves of rank one in 3-dimensional space.
The authors found necessary and sufficient conditions for Samuelson's web to be of maximum rank.
We present old and recent results on rank problems and linearizability of geodesic planar webs.
Time-aware fact-checking improves veracity predictions for time-sensitive claims.
problem Fact-checking decisions should consider temporal information of claims and evidence.
method Investigated four temporal ranking methods to optimize evidence ranking for fact-checking models.
result Time-aware evidence ranking surpasses relevance assumptions and improves veracity predictions for time-sensitive claims.
Search is a prominent channel for discovering products on an e-commerce platform. Ranking products retrieved from search becomes crucial to address customer's need and optimize for business metrics. While learning to Rank (LETOR) models have been extensively studied and have demonstrated efficacy in the context of web …
We propose the Legendrian web in a contact three manifold as a second order generalization of the planar web. An Abelian relation for a Legendrian web is analogously defined as an additive equation among the first integrals of its foliations. For a class of Legendrian -webs defined by simple second order ODE's, w…
We present an example of a 6-web W (6, 3, 2) of codimension two and of maximum rank on a six-dimensional manifold which is not almost Grassmannizable.
New algorithm achieves near-optimal performance in dueling bandit problem.
problem Optimizing decision-making in dueling bandit problems with limited adaptive rounds.
method Developed a batched algorithm that matches the asymptotic regret bounds of sequential algorithms under the Condorcet condition.
result Asymptotic regret of in rounds.
A search engine recommends to the user a list of web pages. The user examines this list, from the first page to the last, and clicks on all attractive pages until the user is satisfied. This behavior of the user can be described by the dependent click model (DCM). We propose DCM bandits, an online learning variant of t…
Extends effect variable concept to finite states for web search evaluation.
problem Finding effect of variant variables in changes of observable variables.
method Theoretical analysis and simultaneous distribution decomposition.
result States of extreme effect variable are minimally affected by variant and highly different in observable variable.
Algorithm learns diverse rankings for search engines.
problem Designing algorithms for search engines to rank diverse items.
method LDR (Learning Diverse Rankings) algorithm, efficient learning based on users' feedback.
result Algorithm achieves optimal ranking performance with regret.
A deformation of the authors' instanton homology for webs is constructed by introducing a local system of coefficients. In the case that the web is planar, the rank of the deformed instanton homology is equal to the number of Tait colorings of the web.
Retrieving the most similar objects in a large-scale database for a given query is a fundamental building block in many application domains, ranging from web searches, visual, cross media, and document retrievals. State-of-the-art approaches have mainly focused on capturing the underlying geometry of the data manifolds…
Study uses web search data to analyze tech startups growth.
problem Analyzing growth dynamics of tech startups.
method Utilized Google Trends data for 241 US-based tech startups.
result Web search traffic correlates positively with tech startup growth.
A search engine usually outputs a list of web pages. The user examines this list, from the first web page to the last, and chooses the first attractive page. This model of user behavior is known as the cascade model. In this paper, we propose cascading bandits, a learning variant of the cascade model where the obje…
Online learning to rank is a core problem in information retrieval and machine learning. Many provably efficient algorithms have been recently proposed for this problem in specific click models. The click model is a model of how the user interacts with a list of documents. Though these results are significant, their im…
Geodesic flows with specific integrals are linked to special 4-webs.
problem Characterizing geodesic flows with commuting quadratic integrals.
method Characterization through geodesic 4-webs and geometric hypothesis.
result Metrics of Stäckel type for geodesic flows with specific integrals.
The abstract theorem is extended to higher genus surfaces.
problem Generalizing the web trace theorem to higher genus surfaces.
method Geometric derivation and spin geometry of embedded loops.
result Expansion of twisted Kasteleyn matrices for higher genus surfaces.
TableQnA answers web queries about lists and superlatives from HTML tables.
problem Answer web queries about lists and superlatives from HTML tables.
method Extract intent from queries, use structure-aware matching, and train models with automatic data generation.
result Significantly higher precision and coverage for list and superlative queries.
We extend the recently introduced theory of Lovasz-Bregman (LB) divergences (Iyer & Bilmes 2012) in several ways. We show that they represent a distortion between a "score" and an "ordering", thus providing a new view of rank aggregation and order based clustering with interesting connections to web ranking. We show ho…
We extend the recently introduced theory of Lovasz-Bregman (LB) divergences (Iyer & Bilmes, 2012) in several ways. We show that they represent a distortion between a 'score' and an 'ordering', thus providing a new view of rank aggregation and order based clustering with interesting connections to web ranking. We show h…
Many web systems rank and present a list of items to users, from recommender systems to search and advertising. An important problem in practice is to evaluate new ranking policies offline and optimize them before they are deployed. We address this problem by proposing evaluation algorithms for estimating the expected …
Efficiently selects nearest neighbors for labeling to speed up active learning.
problem Intractable active learning and search for large-scale unlabeled data.
method Restricts candidate pool to nearest neighbors of labeled set.
result Achieved similar performance to global approach but reduced computational cost by up to 3 orders of magnitude.
The method of random projections has become a standard tool for machine learning, data mining, and search with massive data at Web scale. The effective use of random projections requires efficient coding schemes for quantizing (real-valued) projected data into integers. In this paper, we focus on a simple 2-bit coding …
AI predicts stock winners with 2.43 Sharpe ratio, but returns are highly concentrated.
problem Predicting stock returns with AI, focusing on identifying top winners.
method Deployed a state-of-the-art LLM to autonomously search the web for stock attractiveness, avoiding look-ahead bias.
result AI can generate alpha by identifying top winners, but returns are highly concentrated.
Investigates webs related to cluster algebras and polylogarithms.
problem Understanding webs associated with cluster algebras and polylogarithms.
method Introducing AMP webs and analyzing their properties, proving results and conjectures.
result Many webs associated with polylogarithms and cluster algebras are AMP webs.
This paper studies the evaluation of policies that recommend an ordered set of items (e.g., a ranking) based on some context---a common scenario in web search, ads, and recommendation. We build on techniques from combinatorial bandits to introduce a new practical estimator that uses logged data to estimate a policy's p…
Since time immemorial, people have been looking for ways to organize scientific knowledge into some systems to facilitate search and discovery of new ideas. The problem was partially solved in the pre-Internet era using library classifications, but nowadays it is nearly impossible to classify all scientific and popular…
We generalize to webs of any codimension results already known in codimension one. Given a holomorphic -web of codimension in an ambiant -dimensional holomorphic manifold , we define for any integer the condition for such a web to be \emph{-ordinary} resp.…
The Gronwall conjecture states that a planar 3-web of foliations which admits more than one distinct linearizations is locally equivalent to an algebraic web. We propose an analogue of the Gronwall conjecture for the 3-web of foliations by Legendrian curves in a contact three manifold. The Legendrian Gronwall conjectur…
Higher-Order Ranking and Link Prediction: From Closing Triangles to Closing Higher-Order Motifscs.LG
In this paper, we introduce the notion of motif closure and describe higher-order ranking and link prediction methods based on the notion of closing higher-order network motifs. The methods are fast and efficient for real-time ranking and link prediction-based applications such as web search, online advertising, and re…
Embedded markup of Web pages has seen widespread adoption throughout the past years driven by standards such as RDFa and Microdata and initiatives such as schema.org, where recent studies show an adoption by 39% of all Web pages already in 2016. While this constitutes an important information source for tasks such as W…
We present a MAPLE program for the explicit computation of the curvature of calibrated ordinary webs in codimension one in any dimension (recall that all planar webs are calibrated and ordinary). The vanishing of this curvature means the maximality of the rank. We give some first examples.
With the growth of user-generated content, we observe the constant rise of the number of companies, such as search engines, content aggregators, etc., that operate with tremendous amounts of web content not being the services hosting it. Thus, aiming to locate the most important content and promote it to the users, the…
The SO(3) instanton homology recently introduced by the authors associates a finite-dimensional vector space over the field of two elements to every embedded trivalent graph (or "web"). The present paper establishes a skein exact triangle for this instanton homology, as well as a realization of the octahedral axiom. Fr…