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

Trend · papers per month

4895143190 · May 202619922001200920172026
48 results for matching platform

A new online learning problem, CAB, tackles matching platforms to maximize user satisfaction.

problem Maximizing matches in a matching platform can lead to dissatisfaction and churn.
method Developed CAB, an online learning problem that maximizes arm satisfaction, and analyzed algorithms like UCB and Thompson sampling.
result CAB-UCB achieves higher cumulative satisfaction than baselines in experiments.

We consider the problem faced by a service platform that needs to match limited supply with demand but also to learn the attributes of new users in order to match them better in the future. We introduce a benchmark model with heterogeneous "workers" (demand) and a limited supply of "jobs" that arrive over time. Job typ…

2016-03-15abs ↗pdf ↗

An online labor platform faces an online learning problem in matching workers with jobs and using the performance on these jobs to create better future matches. This learning problem is complicated by the rise of complex tasks on these platforms, such as web development and product design, that require a team of worker…

2018-09-18abs ↗pdf ↗

A matching in a two-sided market often incurs an externality: a matched resource may become unavailable to the other side of the market, at least for a while. This is especially an issue in online platforms involving human experts as the expert resources are often scarce. The efficient utilization of experts in these p…

2017-03-02abs ↗pdf ↗

Taobao, as the largest online retail platform in the world, provides billions of online display advertising impressions for millions of advertisers every day. For commercial purposes, the advertisers bid for specific spots and target crowds to compete for business traffic. The platform chooses the most suitable ads to …

2017-02-27abs ↗pdf ↗

Spacematch matches office workers with suitable workspaces based on their preferences.

problem Matching workers with suitable workspaces in ABW environments.
method Developed a web-based mobile app to collect occupant preferences and IoT sensors for real-time environmental feedback.
result Occupant preferences can be segmented and matched to build a recommendation platform.

Dynamic assortment problem on two-sided platform with unknown parameters

problem Optimizing assortment display in an online platform with incomplete information and heterogeneous customers
method Data-driven algorithm that learns choice parameters while optimizing revenue
result Worst-case regret grows polylogarithmically over time

Enhances community detection in correlated networks with node attributes.

problem Community detection in multiple networks with correlated node attributes and edges.
method Introduced the correlated Contextual Stochastic Block Model (CSBM), developed a two-step matching procedure.
result Algorithm recovers exact node correspondence, enabling enhanced community detection.

The paper analyzes RfQ processes on MD2C platforms using probabilistic models.

problem Analyzing the negotiation process on MD2C platforms to ensure dealers' profitability.
method Probabilistic graphical models and causal inference.
result Generative models can match predictive accuracy of discriminative models while enforcing business requirements.

Modern online platforms rely on effective rating systems to learn about items. We consider the optimal design of rating systems that collect binary feedback after transactions. We make three contributions. First, we formalize the performance of a rating system as the speed with which it recovers the true underlying ran…

2018-06-18abs ↗pdf ↗

Stable matching, a classical model for two-sided markets, has long been studied with little consideration for how each side's preferences are learned. With the advent of massive online markets powered by data-driven matching platforms, it has become necessary to better understand the interplay between learning and mark…

2019-06-12abs ↗pdf ↗

Study shows how competition affects learning in matching markets, proving it's possible to balance stability, fairness, and regret.

problem How competition affects learning in matching markets and the impossibility of simultaneously guaranteeing stability and low optimal regret.
method Modeling a two-sided matching market with bandit learners and adding components of costs and transfers.
result It is possible to simultaneously guarantee stability, low optimal regret, fairness in the distribution of regret, and high social welfare.

Consider a platform that wants to learn a personalized policy for each user, but the platform faces the risk of a user abandoning the platform if she is dissatisfied with the actions of the platform. For example, a platform is interested in personalizing the number of newsletters it sends, but faces the risk that the u…

2018-02-23abs ↗pdf ↗

New algorithm for decentralized matching markets without prior preference rankings.

problem Decentralized two-sided matching markets without known preference rankings.
method Epoch-based CA-ETC algorithm for decentralized matching markets.
result Achieves player optimal expected regret of O(T_0 (K log T / T_0 Δ^2)^(1/γ) + T_0 (T / T_0)^γ).

The democratization of machine learning (ML) has led to ML-based machine vision systems for autonomous driving, traffic monitoring, and video surveillance. However, true democratization cannot be achieved without greatly simplifying the process of collecting groundtruth for training and testing these systems. This grou…

2018-11-08abs ↗pdf ↗

Collectives can manipulate learning platforms by coordinated data submission, requiring strategic assessments and algorithms.

problem Collectives can influence learning platforms by altering data, posing risks and requiring strategic planning.
method Developed a theoretical and algorithmic framework to understand and mitigate collective manipulation of learning platforms.
result Demonstrated the need for strategic assessments and implementable coordination algorithms to prevent collective manipulation.

AI platforms disrupt investment by personalizing deal sourcing and insights.

problem Lack of scalable, personalized, and privacy-compliant deal sourcing and insights solutions.
method Development of in-house AI platforms that interact directly with funds and learn from interactions.
result AI platforms provide smarter, personalized use cases for funds, offering a competitive advantage.

Recent advances in artificial intelligence have been driven by the presence of increasingly realistic and complex simulated environments. However, many of the existing environments provide either unrealistic visuals, inaccurate physics, low task complexity, restricted agent perspective, or a limited capacity for intera…

2018-09-07abs ↗pdf ↗

A method for fast, accurate cross-temporal forecasts using machine learning.

problem Inconsistent forecasts across different levels of platform data.
method Non-linear hierarchical forecast reconciliation using machine learning.
result Automated direct production of reconciled forecasts for high-frequency decision making.

Training deep learning models is compute-intensive and there is an industry-wide trend towards hardware specialization to improve performance. To systematically benchmark deep learning platforms, we introduce ParaDnn, a parameterized benchmark suite for deep learning that generates end-to-end models for fully connected…

2019-07-24abs ↗pdf ↗

Nowadays, privacy preserving machine learning has been drawing much attention in both industry and academy. Meanwhile, recommender systems have been extensively adopted by many commercial platforms (e.g. Amazon) and they are mainly built based on user-item interactions. Besides, social platforms (e.g. Facebook) have ri…

2020-02-06abs ↗pdf ↗

Study shows how repetition affects learning in bandit settings, providing algorithms with sublinear regret.

problem Effect of persistence of engagement on learning in stochastic multi-armed bandit settings.
method Novel algorithms that achieve sublinear regret under temporal constraints.
result Additive effect of priming on regret upper bound, matching popular algorithms in absence of priming.

Unified platform for statistical and machine learning in bioinformatics.

problem Workflow inefficiencies in using multiple tools for data analysis.
method Automated hyperparameter optimization, feature importance analysis, statistical tests.
result Accelerates biological discovery workflows with methodological soundness.

Study optimizes crowdfunding platform offerings based on customer behavior.

problem Maximizing crowdfunding platform revenue through optimal product assortment.
method Multinomial logit model and machine learning methods (multivariate regression, classification) for revenue prediction.
result Optimal assortments can significantly increase platform revenue.