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

Trend · papers per month

4896143191 · Jun 202019922001200920172026
48 results for Alibaba Group

We consider a context-based dynamic pricing problem of online products, which have low sales. Sales data from Alibaba, a major global online retailer, illustrate the prevalence of low-sale products. For these products, existing single-product dynamic pricing algorithms do not work well due to insufficient data samples.…

2019-02-17abs ↗pdf ↗

Click-through rate prediction is an essential task in industrial applications, such as online advertising. Recently deep learning based models have been proposed, which follow a similar Embedding\&MLP paradigm. In these methods large scale sparse input features are first mapped into low dimensional embedding vectors, a…

2017-06-21abs ↗pdf ↗

RODMAN improves ML-based disk failure prediction accuracy in cloud environments.

problem Imperfect data quality in real-world cloud environments degrades ML-based disk failure prediction accuracy.
method RODMAN uses three data preprocessing techniques: failure-type filtering, spline-based data filling, and automated pre-failure backtracking.
result RODMAN significantly improves prediction accuracy compared to no preprocessing.

Graph Convolution Networks (GCNs) are becoming more and more popular for learning node representations on graphs. Though there exist various developments on sampling and aggregation to accelerate the training process and improve the performances, limited works focus on dealing with the dimensional information imbalance…

2019-07-04abs ↗pdf ↗

SIM models user interests from long sequential behavior data, improving click-through rate prediction.

problem Challenges in capturing user interests with long user behavior sequences.
method SIM uses a cascaded search paradigm with two units: General Search Unit and Exact Search Unit.
result SIM achieves significant CTR and RPM lifts in Alibaba's display advertising system.

Online advertising in E-commerce platforms provides sellers an opportunity to achieve potential audiences with different target goals. Ad serving systems (like display and search advertising systems) that assign ads to pages should satisfy objectives such as plenty of audience for branding advertisers, clicks or conver…

2019-09-29abs ↗pdf ↗

ComiRec framework predicts user interests for personalized recommendations.

problem Predicting user interests from sequential behavior data.
method ComiRec framework captures multiple user interests and balances recommendation accuracy and diversity.
result ComiRec achieves significant improvements over state-of-the-art models in sequential recommendation.

Federated learning was proposed with an intriguing vision of achieving collaborative machine learning among numerous clients without uploading their private data to a cloud server. However, the conventional framework requires each client to leverage the full model for learning, which can be prohibitively inefficient fo…

2019-11-06abs ↗pdf ↗

CatGCN improves GCNs by modeling feature interactions for categorical node features.

problem Suboptimal initial node representations in GCNs due to lack of feature interaction modeling.
method Integrates explicit interaction modeling (local and global) into initial node representation learning for categorical node features.
result CatGCN enhances initial node representations through feature interaction modeling, leading to improved model performance.

FIVES generates high-order interactive features efficiently and effectively.

problem Automating the generation of high-order interactive features in tabular data.
method Formulates interactive feature generation as edge search on a feature graph, using a GNN and adjacency tensor.
result FIVES outperforms state-of-the-art methods in various datasets and real-world applications.

CAN approximates explicit feature interactions for CTR prediction.

problem Learning explicit feature interactions from sparse features.
method Co-Action Network approximates explicit pairwise feature interactions without introducing too many additional parameters.
result CAN outperforms state-of-the-art CTR models and the cartesian product method.

IPO Finance Agent evaluates LLMs on SpaceX IPO due diligence, surpassing Finance Agent v2.

problem Evaluating language models on financial tasks like IPO due diligence.
method Introducing IPO Finance Agent and an evaluator-optimizer pipeline.
result The best-performing model reaches 79.4% accuracy at 0.30 USD per query.

New link groups are derived from torus necklaces, connecting braid groups to reflection groups.

problem Understanding the relationship between braid groups and reflection groups.
method Constructing torus necklaces and linking them to braid groups of JJ-reflection groups.
result Link groups of torus necklaces are precisely braid groups of JJ-reflection groups, with meridians as braid reflections.

The study proves super-rigidity of Gromov's random monster group for various types of groups.

problem Super-rigidity of Gromov's random monster group in various group types.
method Proof of morphisms having finite image and introduction of hereditary super-rigidity.
result Gromov's random monster group has super-rigidity and hereditary super-rigidity with respect to certain groups.

We study the structure of the virtual braid group. It is shown that the virtual braid group is a semi--direct product of the virtual pure braid group and the symmetric group. Also, it is shown that the virtual pure braid group is a semi--direct product of free groups. From these results we obtain a normal form of words…

2004-07-23abs ↗pdf ↗

Virtual twin groups map to symmetric groups, revealing automorphism structure.

problem Understanding homomorphisms between virtual twin groups and symmetric groups.
method Using irreducible right-angled Coxeter groups and right-angled Artin groups.
result A complete description of homomorphisms between virtual twin groups and symmetric groups, including the structure of the automorphism group of VTnVT_n.

The study restricts groups in graph of groups structures.

problem Realizing groups as fundamental groups of graph of groups with restricted vertex groups.
method Analyzes restrictions on groups that can be realized and applies to manifold construction.
result Places constraints on groups that can be realized in graph of groups structures.

New Garside structures found for torus knot groups and related braid groups.

problem Finding Garside structures for torus knot groups and related braid groups.
method Introducing a new Garside monoid M(n,m)\mathcal{M}(n,m) for (n,m)(n,m)-torus knot groups and other braid groups.
result New Garside structures for (n,m)(n,m)-torus knot groups and related braid groups are constructed.

Logarithmic separation profile in hyperbolic groups shows hierarchical structure.

problem Understanding hierarchical structure in hyperbolic groups with logarithmic separation.
method Proving groups with logarithmic separation split over cyclic groups and providing counterexamples.
result Not all groups with hierarchical structure have logarithmic separation profile.

We describe a procedure for constructing a generalized Thompson group out of a family of groups that is equipped with what we call a cloning system. The previously known Thompson groups F, V, Vbr and Fbr arise from this procedure using, respectively, the systems of trivial groups, symmetric groups, braid groups and pur…

2014-05-21abs ↗pdf ↗

The study restricts normal subgroups of Kähler groups, proving specific cases and general restrictions.

problem Characterizing normal subgroups of Kähler groups.
method Analyzing embeddings and conjugation actions of surface groups and one-ended hyperbolic groups.
result Restrictions on normal subgroups of Kähler groups, including virtual direct products and surface group properties.

Study fundamental groups of geometric transformation groups using loop spaces.

problem Understanding fundamental groups of geometric transformation groups.
method Use differential forms on loop spaces to prove infinite fundamental groups.
result Proves infinite fundamental groups for specific geometric transformation groups.

We discuss dense embeddings of surface groups and fully residually free groups in topological groups. We show that a compact topological group contains a nonabelian dense free group of finite rank if and only if it contains a dense surface group. Also, we obtain a characterization of those Lie groups which admit a dens…

2006-02-27abs ↗pdf ↗

We exhibit a family of infinite, finitely-presented, nilpotent-by-abelian groups. Each member of this family is a solvable S-arithmetic group that is related to Baumslag-Solitar groups, and everyone of these groups has a quasi-isometry group that is virtually a product of a solvable real Lie group and a solvable p-adic…

2005-07-09abs ↗pdf ↗

The study shows that certain groups can be uniquely identified by their finite abelian summands.

problem Identifying groups based on their finite abelian summands.
method Analyzing hyperbolic groups as graphs of free groups with cyclic edge groups.
result Free products of free and surface groups are profinitely rigid.

In this paper, we briefly review some of the known results concerning the cohomological structures of the mapping class group of surfaces, the outer automorphism group of free groups, the diffeomorphism group of surfaces as well as various subgroups of them such as the Torelli group, the IA outer automorphism group of …

2005-07-15abs ↗pdf ↗

The paper studies actions on Bass-Serre trees and identifies new CC^*-simple groups.

problem Investigating actions of fundamental groups on Bass-Serre trees and their CC^*-algebraic properties.
method Analyzing boundary actions of fundamental groups of graphs of groups on their Bass-Serre trees.
result Identification of new families of CC^*-simple groups, including tubular groups and certain graphs of groups.

In this article we define the twisted product of groups as the generalization of the semidirect product of groups. We will find the necessary and sufficient condition in order that the twisted product of groups to be a group. In particular, for two copies of the same group, the twisted product of group by itself throug…

1997-03-03abs ↗pdf ↗