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

Trend · papers per month

128256384512 · Jun 202019922001200920172026
48 results for Prediction Web

There are two theories describing the linearizability of 3-webs: one is developed in the article "On the linearizability of 3-webs" (Nonlinear analysis 47, (2001) pp.2643-2654) and another in the article "On the Blaschke conjecture for 3-webs" (J. Geom. Anal. 16, 1 (2006), 69-115). Unfortunately, they cannot be both co…

2017-12-23abs ↗pdf ↗

Cyber attacks are growing in frequency and severity. Over the past year alone we have witnessed massive data breaches that stole personal information of millions of people and wide-scale ransomware attacks that paralyzed critical infrastructure of several countries. Combating the rising cyber threat calls for a multi-p…

2018-06-08abs ↗pdf ↗

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.

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 ↗

Among the proposed network models, the hidden variable (or good get richer) one is particularly interesting, even if an explicit empirical test of its hypotheses has not yet been performed on a real network. Here we provide the first empirical test of this mechanism on the world trade web, the network defined by the tr…

2004-03-01abs ↗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 ↗

Developed R package for creating nomograms for any ML algorithms.

problem Creating nomograms for any machine learning algorithms.
method Formulated a function to transform ML prediction models into nomograms, requiring specific datasets.
result Created 5 types of nomograms for various ML algorithms and predictor types.

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.

Paper combines scalable BMF algorithms for web-scale datasets.

problem High computational cost of Bayesian Matrix Factorization.
method Combines Posterior Propagation and asynchronous distributed implementation.
result Substantial improvements in scalability on web-scale datasets.

In the economic literature, geographic distances are considered fundamental factors to be included in any theoretical model whose aim is the quantification of the trade between countries. Quantitatively, distances enter into the so-called gravity models that successfully predict the weight of non-zero trade flows. Howe…

2012-10-11abs ↗pdf ↗

We present a projectively invariant description of planar linear 3-webs. For a non-hexagonal 3-web, we introduce family of projective torsion-free Cartan connections, the web leaves being geodesics for each member of the family, and give a web linearization criterion. Finally, we propose an algorithm for resolving the …

2017-08-07abs ↗pdf ↗

Much information available on the web is copied, reused or rephrased. The phenomenon that multiple web sources pick up certain information is often called trend. A central problem in the context of web data mining is to detect those web sources that are first to publish information which will give rise to a trend. We p…

2012-06-27abs ↗pdf ↗

In this paper we study the linearizability problem for 3-webs on a 2-dimensional manifold. With an explicit computation based on the theory developed in the paper "On the linearizability of 3-webs" (Nonlinear analysis 47, (2001) pp. 2643-2654), we examine a 3-web whose linearizability was claimed in the same paper. We …

2006-02-23abs ↗pdf ↗

Veronese webs appear as the natural way of passing to the quotient of curves in the projective space. In thi paper, we give the link between classical multidimensionnal webs and veronse webs by mean of interpolation.

2004-08-18abs ↗pdf ↗

In this paper, we reconstruct Kuperberg's G2G_2 web space. We introduce a new web (a trivalent diagram) and new relations between Kuperberg's web diagrams and the new diagram. Using the G2G_2 webs, we define crossing formulas corresponding to R-matrices associated to some G2G_2 irreducible representations and calculate…

2015-03-29abs ↗pdf ↗

Gronwall conjecture states that a planar 3-web which admits more than one distinct linearization is locally equivalent to an algebraic web. We give a partial answer to the conjecture in the affirmative for the class of planar 3-webs with the web curvature that vanishes to order three at a point. The differential relati…

2011-02-01abs ↗pdf ↗

We find relative differential invariants of orders eight and nine for a planar nonparallelizable 3-web such that their vanishing is necessary and sufficient for a 3-web to be linearizable. This solves the Blaschke conjecture for 3-webs. As a side result, we show that the number of linearizations in the Gronwall conject…

2004-11-21abs ↗pdf ↗

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.

2017-10-13abs ↗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.

Many modern data mining applications are concerned with the analysis of datasets in which the observations are described by paired high-dimensional vectorial representations or "views". Some typical examples can be found in web mining and genomics applications. In this article we present an algorithm for data clusterin…

2012-02-02abs ↗pdf ↗

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…

2012-02-29abs ↗pdf ↗

We study non-flat planar 3-webs with infinitesimal symmetries. Using multi-dimensional Schwarzian derivative we give a criterion for linearization of such webs and present a projective classification thereof. Using this classification we show that the Gronwall conjecture is true for 3-webs admitting infinitesimal symme…

2014-11-04abs ↗pdf ↗

Critical to evaluating the capacity, scalability, and availability of web systems are realistic web traffic generators. Web traffic generation is a classic research problem, no generator accounts for the characteristics of web robots or crawlers that are now the dominant source of traffic to a web server. Administrator…

2017-12-15abs ↗pdf ↗

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.

2009-09-03abs ↗pdf ↗

Functors from web categories differ despite similar definitions.

problem Distinguishing between combinatorial and gauge-theoretic evaluations of webs.
method Exhibited a counterexample showing JJ^\sharp restricted to planar webs is not JJ^\flat.
result Restriction of JJ^\sharp to planar webs is distinct from JJ^\flat.