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

3.0%6.0%9.0%12.0% · Jul 201919922001200920172026
48 results for experimental platform

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.

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.

Platform combines RL and language models to study narrative influence on AI decisions.

problem Understanding how narrative elements shape AI decision-making.
method Dual-system architecture with reinforcement learning and language model integration.
result Initial experiments show narrative frameworks can influence AI decision-making.

Speed bumps reduce but do not fully eliminate investment in fast trading technology.

problem Limiting low-latency trading to curb investment in fast trading technology.
method Built an experimental trading platform to test the effects of speed bumps on investment in fast trading technology.
result Asymmetric speed bumps reduce investment in speed by only 20%, and increasing the magnitude further reduces investment by 8.33%. Symmetric speed bumps have no effect on investment levels.

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.

Secure social recommendation framework using secret sharing.

problem Privacy concerns and reluctance to share social data in recommender systems.
method Secret Sharing based Matrix Multiplication (SSMM) protocol for secure data sharing and collaborative recommendation.
result SeSoRec framework improves recommendation performance and is secure.

In E-commerce advertising, where product recommendations and product ads are presented to users simultaneously, the traditional setting is to display ads at fixed positions. However, under such a setting, the advertising system loses the flexibility to control the number and positions of ads, resulting in sub-optimal p…

2018-09-10abs ↗pdf ↗

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.

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 ↗

This paper uses bandit algorithms to reduce the cost of user interface experimentation in online retail.

problem Reducing the cost of user interface experimentation in online retail.
method Modeling user interface experimentation as an opportunistic bandit problem, reducing the cost of exploration.
result Significant regret reduction and improved contextual information for testing.

The paper proposes a new method to improve microcredit decisions by modeling sequential loan interactions.

problem Improving microcredit decision-making by addressing population bias and model generalization.
method The authors introduce a multi-stage interaction sequence (MSIS) method that models sequential loan interactions and uses a hierarchical attention module to leverage interaction information.
result The MSIS method effectively remedies population bias and improves model generalization on a real loan data set.

Stochastic simulation techniques employed for the analysis of portfolios of insurance/reinsurance risk, often referred to as `Aggregate Risk Analysis', can benefit from exploiting state-of-the-art high-performance computing platforms. In this paper, parallel methods to speed-up aggregate risk analysis for supporting re…

2013-08-12abs ↗pdf ↗

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.

Convolutional autoencoders improve personalized recommendations from image-based data.

problem Lack of personalized recommendations in gastronomic platforms using image data.
method Used convolutional autoencoders to extract features from images and improve personalized recommendations.
result Convolutional autoencoders outperform standard deep features in image-based personalized recommendation systems.

Predicts fine-grained OD matrices for ridesharing platforms to optimize supply-demand balance.

problem Accurately predicting spatial-temporal OD demands for ridesharing platforms.
method OD-CED model combining unsupervised space coarsening and encoder-decoder architecture.
result Significant improvement in prediction accuracy (45% RMSE reduction, 60% WAPE reduction).

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 ↗

The paper tackles the issue of preferential attachment in targeted display advertising by developing domain-adaptation approaches.

problem Skewed distribution of data leads to preferential attachment towards high-budget partners.
method Develops domain-adaptation approaches to predict interested users for low-budget partners.
result Proposed approaches outperform other domain-adaptation methods across different points of campaigns.

In this paper we study the real time deployment of deep learning algorithms in low resource computational environments. As the use case, we compare the accuracy and speed of neural networks for smile detection using different neural network architectures and their system level implementation on NVidia Jetson embedded p…

2018-07-10abs ↗pdf ↗

The paper optimizes A/B tests by balancing lift and cost in large-scale settings.

problem Balancing lift and cost in A/B tests for large-scale experimentation.
method Empirical Bayes approach using a greedy knapsack algorithm to rank experiments based on lift-to-cost ratio, incorporating local false discovery rate (lfdr).
result The proposed method maximizes expected profit while controlling false discovery rate, demonstrating superior performance in large-scale settings.

Designs efficient factorial experiments for product design under budget constraints.

problem Designing effective experiments for product design with limited traffic and overlapping experiments.
method Two-stage design: first stage samples and infers performance, second stage selects a final policy.
result The method outperforms one-shot tensor completion and unstructured best-arm benchmarks.