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

2805598391,118 · Jun 202019922001200920172026
48 results for web data

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 ↗

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 ↗

The topology of SU(3)SU(3)-representation varieties of the fundamental groups of planar webs so that the meridians are sent to matrices with trace equal to 1-1 are explored, and compared to data coming from spider evaluation of the webs. Corresponding to an evaluation of a web as a spider is a rooted tree. We associate t…

2017-05-16abs ↗pdf ↗

WebGUM learns web navigation from multimodal data, outperforming previous methods.

problem Limited generalization from domain-specific models in web navigation.
method Instruction-following multimodal agent trained on vision-language foundation models.
result Significant improvement in web navigation performance on benchmarks.

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 ↗

Publicly pretraining models on Web data may undermine differential privacy.

problem The use of large Web-scraped datasets in differential privacy models.
method Critical review of leveraging pretrained models on public datasets for differential privacy.
result Publicizing pretrained models as 'private' could harm trust and generalize poorly.

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 ↗

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 ↗

A detailed understanding of users contributes to the understanding of the Web's evolution, and to the development of Web applications. Although for new Web platforms such a study is especially important, it is often jeopardized by the lack of knowledge about novel phenomena due to the sparsity of data. Akin to human tr…

2019-10-16abs ↗pdf ↗

We study natural bases for two constructions of the irreducible representation of the symmetric group corresponding to [n,n,n][n,n,n]: the {\em reduced web} basis associated to Kuperberg's combinatorial description of the spider category; and the {\em left cell basis} for the left cell construction of Kazhdan and Lusztig. I…

2013-07-24abs ↗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 ↗

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 ↗

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 ↗

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 ↗

The paper develops personalized DAG models for web user behavior.

problem Understanding user behavior transitions between websites with user heterogeneity and network dependency.
method Personalized Binomial DAG models with network-structured covariates, embedding network structure into a dimension-reduced covariate, learning node neighborhoods, and exploring variance-mean relation.
result The proposed algorithm outperforms state-of-the-art competitors in heterogeneous data.

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.

The study generalizes Blaschke curvature for higher-dimensional webs and identifies infinite classes of isomorphism.

problem Understanding the structure and classification of (n+1)(n+1)-webs by curves in nn-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.