Research
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,695 papers · 148 categories

Trend · papers per month

204408612816 · Jun 202019922001200920172026
48 results for Web Content Optimization

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.

Optimization is commonly employed to determine the content of web pages, such as to maximize conversions on landing pages or click-through rates on search engine result pages. Often the layout of these pages can be decoupled into several separate decisions. For example, the composition of a landing page may involve dec…

2018-10-22abs ↗pdf ↗

Perceptual ad-blocking is a novel approach that detects online advertisements based on their visual content. Compared to traditional filter lists, the use of perceptual signals is believed to be less prone to an arms race with web publishers and ad networks. We demonstrate that this may not be the case. We describe att…

2018-11-08abs ↗pdf ↗

Owners of a web-site are often interested in analysis of groups of users of their site. Information on these groups can help optimizing the structure and contents of the site. In this paper we use an approach based on formal concepts for constructing taxonomies of user groups. For decreasing the huge amount of concepts…

2009-05-09abs ↗pdf ↗

Cross-lingual document alignment aims to identify pairs of documents in two distinct languages that are of comparable content or translations of each other. In this paper, we exploit the signals embedded in URLs to label web documents at scale with an average precision of 94.5% across different language pairs. We mine …

2019-11-10abs ↗pdf ↗

Much of the data being created on the web contains interactions between users and items. Stochastic blockmodels, and other methods for community detection and clustering of bipartite graphs, can infer latent user communities and latent item clusters from this interaction data. These methods, however, typically ignore t…

2015-05-25abs ↗pdf ↗

Linear NDCG is used for measuring the performance of the Web content quality assessment in ECML/PKDD Discovery Challenge 2010. In this paper, we will prove that the DCG error equals a new pair-wise loss.

2013-03-11abs ↗pdf ↗

Generative models predict page quality without training, useful for low-resource settings.

problem Detecting low-quality content in web articles.
method Human evaluation and analysis of 500 million web articles.
result Generative models can predict page quality without training, useful for low-resource settings.

We generalize to webs of any codimension results already known in codimension one. Given a holomorphic dd-web W\cal W of codimension qq (qn1)(q\leq n-1) in an ambiant nn-dimensional holomorphic manifold UU, we define for any integer pp (1pq)(1\leq p\leq q) the condition for such a web to be \emph{pp-ordinary} ((resp.…

2017-12-04abs ↗pdf ↗

Greedy algorithm nearly outperforms exploration in contextual bandits.

problem Balancing exploration and exploitation in online learning.
method Smoothed analysis of the greedy algorithm in linear contextual bandits.
result Greedy algorithm nearly matches Bayesian regret rate under diversity conditions, with regret at most O(T1/3)O(T^{1/3}).

On many social networking web sites such as Facebook and Twitter, resharing or reposting functionality allows users to share others' content with their own friends or followers. As content is reshared from user to user, large cascades of reshares can form. While a growing body of research has focused on analyzing and c…

2014-03-18abs ↗pdf ↗

The web contains a vast corpus of HTML tables. They can be used to provide direct answers to many web queries. We focus on answering two classes of queries with those tables: those seeking lists of entities (e.g., `cities in california') and those seeking superlative entities (e.g., `largest city in california'). The m…

2020-01-10abs ↗pdf ↗

Efficiently projects points onto polytopes, especially useful in web-scale applications.

problem Efficiently projecting points onto polytopes in large-scale applications.
method Developed a vertex-oriented incremental algorithm for polytope projection, tailored for simplex and unit-box cut polytopes.
result Majority of projections lie on vertices of polytopes, leading to significant performance improvements.

In this paper we show that two seemingly unrelated problems in economics, the hypothesis of integrability and the hypothesis of additive separability are linked by the absence of curvature of connections on webs naturally associated with each problem.

2009-01-01abs ↗pdf ↗

Study optimizes compute usage for LLM web agents, improving performance.

problem High compute costs and narrow focus on single-step tasks limit LLM web agents.
method Two-stage pipeline: SFT followed by on-policy RL, with hyperparameter optimization.
result Combining SFT and on-policy RL requires 55% less compute to match peak SFT performance.

Most classification methods are based on the assumption that data conforms to a stationary distribution. The machine learning domain currently suffers from a lack of classification techniques that are able to detect the occurrence of a change in the underlying data distribution. Ignoring possible changes in the underly…

2012-01-04abs ↗pdf ↗

RB-Modulation trains free diffusion models without external adapters.

problem Training-free personalization of diffusion models with style and content control.
method Stochastic optimal control with a style descriptor and cross-attention aggregation.
result Precise content and style extraction and control without external adapters.

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…

2006-05-04abs ↗pdf ↗

Classifies hexagonal circular 3-webs with cubic polar curves.

problem Classifying hexagonal circular 3-webs with algebraic polar curves of degree three.
method Analyzes hexagonal circular 3-webs on unit sphere with polar points on a twisted cubic.
result Completes the classification of hexagonal circular 3-webs with algebraic polar curves of degree three.

We construct flat 3-webs via semi-simple geometric Frobenius manifolds of dimension three and give geometric interpretation of the Chern connection of the web. These webs turned out to be biholomorphic to the characteristic webs on the solutions of the corresponding associativity equation. We show that such webs are he…

2011-08-09abs ↗pdf ↗

We give various results and applications using the connection (E,)(E,\nabla) associated with a dd-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…

2007-02-12abs ↗pdf ↗

We investigate the linearizability problem for different classes of 4-webs in the plane. In particular, we apply a recently found in [AGL] the linearizability conditions for 4-webs in the plane to confirm that a 4-web MW (Mayrhofer's web) with equal curvature forms of its 3-subwebs and a nonconstant basic invariant is …

2002-09-22abs ↗pdf ↗

In the present paper we study geometric structures associated with webs of hypersurfaces. We prove that with any geodesic (n+2)-web on an n-dimensional manifold there is naturally associated a unique projective structure and, provided that one of web foliations is pointed, there is also associated a unique affine struc…

2008-12-11abs ↗pdf ↗

Learning from multiple-relational data which contains noise, ambiguities, or duplicate entities is essential to a wide range of applications such as statistical inference based on Web Linked Data, recommender systems, computational biology, and natural language processing. These tasks usually require working with very …

2016-04-03abs ↗pdf ↗

Improves content allocation in educational platforms with sparse data.

problem Imbalanced content allocation and delayed convergence in adaptive strategies.
method Introduces WAPTS, an algorithm that refines Thompson Sampling for data-sparse environments.
result Demonstrates earlier and more reliable identification of promising treatments.