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

Trend · papers per month

223445668890 · Jun 202019922001200920172026
48 results for algorithmic platforms

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.

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 ↗

A monitoring procedure improves machine learning forecasts for digital platforms.

problem Maintaining accurate and stable forecasts for data streams at digital platforms.
method Developed a monitoring procedure to determine when to retrain machine learning algorithms.
result Monitor-based retraining produces accurate forecasts compared to benchmarks.

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 ↗

Optimal bidding strategy for multi-platform ad auctions under budget constraints.

problem Optimizing ad placements for budget-constrained advertisers across multiple platforms.
method Developed an optimal bidding strategy for non-incentive-compatible auctions with budget constraints.
result Maximized total utility across auctions while satisfying budget constraints in expectation.

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

Study shows small groups can influence machine learning algorithms.

problem How small groups can influence machine learning algorithms deployed on digital platforms.
method Proposed a theoretical model and conducted experiments on a large-scale language model.
result Small groups can exert significant control over machine learning algorithms.

Modeling incentives for content creators on algorithm-curated platforms.

problem Maximizing exposure for content creators on algorithmic platforms.
method Formalized exposure game model, proving effects of algorithmic choices on equilibria, proposing tools for finding equilibria.
result Algorithmic choices significantly affect content exposure and creator behavior.

Study shows online learning algorithms incentivize low-quality content, proposing new algorithms to improve quality.

problem Online learning algorithms in content recommender systems incentivize producers to create low-quality content.
method Analyzed the game between producers and content quality, designed new learning algorithms to incentivize high effort and quality.
result New algorithms incentivize producers to invest high effort and achieve high user welfare, improving content quality.

Study personalizes user experience to maximize rewards with patience budget.

problem Maximizing rewards for a platform while respecting user patience.
method Proposes bandit algorithms for sequential choice with feedback models.
result Upper and lower bounds on regret of order O(N2/3)O(N^{2/3}) and Ω(N2/3)Ω(N^{2/3}).

User strategization undermines algorithmic trustworthiness.

problem User strategic behavior corrupts algorithmic data and trust.
method Modeling user-platform interactions as a game, analyzing strategic behavior's short-term benefits and long-term harms.
result User strategization can initially benefit platforms but ultimately harms their ability to make accurate decisions.

Look-ahead reasoning helps predict strategic user behavior on learning platforms.

problem Optimization criteria on learning platforms do not reflect users' priorities.
method Formalized level-k thinking and contrasted collective and selfish behavior.
result Coordination benefits users but does not offer higher-level reasoning advantages in the long run.

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.

VegasFlow accelerates complex simulations across various hardware platforms.

problem Complex calculations and simulations requiring high-dimensional integrals.
method Monte Carlo integration techniques using Vegas algorithm and TensorFlow.
result Significantly faster performance on various hardware platforms.

COBRA addresses strategic behavior in online platforms by ensuring truthful reporting without monetary incentives.

problem Ensuring truthful reporting from strategic agents in online platforms.
method Proposes COBRA, an algorithm for contextual bandits involving strategic agents that disincentivizes strategic behavior.
result COBRA achieves sub-linear regret guarantee and incentive compatibility without monetary incentives.

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.

Developing a visual platform for faster astronomical source cataloging.

problem Speeding up cataloging of large area surveys in radio astronomy.
method Integration of advanced source finding and classification tools into a visual analytic platform.
result Improvement and acceleration of cataloging process in astronomical surveys.

Deep learning has delivered its powerfulness in many application domains, especially in image and speech recognition. As the backbone of deep learning, deep neural networks (DNNs) consist of multiple layers of various types with hundreds to thousands of neurons. Embedded platforms are now becoming essential for deep le…

2017-12-13abs ↗pdf ↗

In this paper we consider an online recommendation setting, where a platform recommends a sequence of items to its users at every time period. The users respond by selecting one of the items recommended or abandon the platform due to fatigue from seeing less useful items. Assuming a parametric stochastic model of user …

2019-01-23abs ↗pdf ↗

(ABRIDGED) In previous work, two platforms have been developed for testing computer-vision algorithms for robotic planetary exploration (McGuire et al. 2004b,2005; Bartolo et al. 2007). The wearable-computer platform has been tested at geological and astrobiological field sites in Spain (Rivas Vaciamadrid and Riba de S…

2009-10-28abs ↗pdf ↗

New method identifies how platforms can influence consumer behavior.

problem Estimating the causal effect of digital platforms on consumption.
method General causal inference problem, focusing on observational designs, and explicitly modeling consumption dynamics.
result Exogenous variation in consumption and responsive algorithmic control actions are sufficient for identifying steerability of consumption.

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.

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.

Federated Learning speeds up speech recognition training by 7x and reduces error rate by 6%.

problem Training acoustic models for speech recognition tasks in a federated manner.
method Hierarchical optimization and dynamic gradient aggregation methods.
result Significant improvement in training convergence speed and model performance.

New framework analyzes LLM personalization trade-offs under congestion.

problem Tension between personalization and resource sharing in LLMs.
method Developed a statistical-economic framework to model user incentives.
result Congestion can flip rankings of SFT and ICL, and offers both methods never hurt profits.

As mobile devices become more and more popular, mobile gaming has emerged as a promising market with billion-dollar revenues. A variety of mobile game platforms and services have been developed around the world. A critical challenge for these platforms and services is to understand the churn behavior in mobile games, w…

2019-01-14abs ↗pdf ↗