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

3876113151 · Jun 202019922001200920172026
48 results for user participation threshold

Bayesian nonparametric model predicts user activity and intervention success.

problem Predicting user activity and intervention success in online experiments.
method Bayesian nonparametric approach to model user heterogeneity and derive user activity predictions.
result The proposed method outperforms existing approaches in predicting user activity and intervention success.

Federated Learning tackles limited user participation with a new risk-aware approach.

problem Limited availability of users in federated learning environments.
method Random Access Model (RAM) and Conditional Value-at-Risk (CVaR) to design a risk-aware federated learning algorithm.
result The proposed approach achieves significantly improved performance under various setups compared to standard federated learning.

Paper proposes incentive mechanism to encourage participation in federated learning.

problem Users are reluctant to participate in federated learning due to privacy concerns.
method Formulated as a two-stage Stackelberg game, designed an incentive mechanism to select and compensate users.
result Demonstrated effectiveness of the proposed incentive mechanism through simulations.

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}).

FedAVOT improves federated learning by aligning user distributions.

problem Partial client participation leads to biased and unstable updates in federated learning.
method Formulates aggregation as masked optimal transport to align availability and importance distributions.
result Achieves a standard O(1/√T) rate, independent of the number of participating users per round.

This work analyzes how users and services adapt to reduce risk, leading to specialization.

problem Adaptation of users and services to reduce risk affects learning and performance.
method Analyzed a class of dynamics where users allocate participation and services update parameters.
result Repeated myopic updates with multiple learners lead to better outcomes than repeated risk minimization.

This paper explores BTC-denominated prediction markets to avoid stablecoin opportunity costs.

problem Opportunity costs and loss of BTC exposure when converting to stablecoins.
method Analyzes three methods of liquidity provision: cross-market making, automated market making, and DeFi redirection.
result Cross-market making provides the best user risk profile but requires active liquidity.

We construct the Google matrices of bitcoin transactions for all year quarters during the period of January 11, 2009 till April 10, 2013. During the last quarters the network size contains about 6 million users (nodes) with about 150 million transactions. From PageRank and CheiRank probabilities, analogous to trade imp…

2019-06-04abs ↗pdf ↗

Artemis framework improves distributed learning with bidirectional compression and partial participation.

problem Learning in distributed or federated settings with communication constraints and device partial participation.
method Artemis framework using bidirectional compression, memory mechanism, and Polyak-Ruppert averaging.
result Fast rates of convergence (linear up to a threshold) under weak assumptions on stochastic gradients.

The increasing adoption of machine learning tools has led to calls for accountability via model interpretability. But what does it mean for a machine learning model to be interpretable by humans, and how can this be assessed? We focus on two definitions of interpretability that have been introduced in the machine learn…

2019-02-09abs ↗pdf ↗

A new federated learning framework ensures fairness and robustness.

problem Collaborative fairness and adversarial robustness in federated learning.
method RFFL framework with a reputation mechanism to identify and remove non-contributing or malicious participants.
result RFFL achieves high fairness and robustness to different types of adversaries.

In this paper we present a review of the existing typologies of Internet service users. We zoom in on social networking services including blogs and crowdsourcing websites. Based on the results of the analysis of the considered typologies obtained by means of FCA we developed a new user typology of a certain class of I…

2013-11-30abs ↗pdf ↗

Financial exchange operators cater to the needs of their users while simultaneously ensuring compliance with the financial regulations. In this work, we focus on the operators' commitment for fair treatment of all competing participants. We first discuss unbounded temporal fairness and then investigate its implementati…

2019-11-20abs ↗pdf ↗

User contributions in the form of posts, comments, and votes are essential to the success of online communities. However, allowing user participation also invites undesirable behavior such as trolling. In this paper, we characterize antisocial behavior in three large online discussion communities by analyzing users who…

2015-04-02abs ↗pdf ↗

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.

The paper develops methods to predict the probability of achieving a user goal in a task, ensuring the system alerts when the probability falls below a threshold.

problem Ensuring an autonomous system achieves the user's goal with calibrated probability estimates.
method Invertible conformal prediction using Probability-space Conformalized Quantile Regression (PCQR) to produce well-calibrated conditional prediction intervals.
result The method produces well-calibrated probabilities that the cumulative reward will fall within a user-specified target interval, with finite-sample guarantees.

Critical volatility triggers log-normal to power-law transitions in interconnected systems.

problem Understanding the transition from log-normal to power-law distributions in interconnected systems.
method Analyzing an infinite option-on-option chain model, deriving a critical volatility threshold.
result A critical volatility threshold of approximately 250.66% for unconditional cases, dropping to 125.3% with selective survival.

Study connects database alignment and planted matching using Gaussian features.

problem Identify matching between correlated user features in anonymized databases.
method Derived results for database alignment and planted matching, showing connections and thresholds.
result Performance thresholds for database alignment converge to planted matching when feature dimensionality is sufficiently high.

Paper improves recommendation systems by optimizing sequence of items for clicks.

problem Improving recommendation systems robustness against bots and clicks.
method Minimizing pairwise ranking loss over sequences of items, with thresholds to prevent bot influence.
result The proposed algorithms converge and outperform existing methods in various ranking measures.

Federated learning (FL) rests on the notion of training a global model in a decentralized manner. Under this setting, mobile devices perform computations on their local data before uploading the required updates to improve the global model. However, when the participating clients implement an uncoordinated computation …

2019-11-04abs ↗pdf ↗

UCFE benchmarks LLMs in financial tasks with human feedback.

problem Evaluating LLMs' financial task performance and user satisfaction.
method Hybrid approach combining human expert evaluations and dynamic interactions.
result Significant alignment between benchmark scores and human preferences (Pearson correlation coefficient of 0.78).

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 ↗

Financial exchanges provide incentives for limit order book (LOB) liquidity provision to certain market participants, termed designated market makers or designated sponsors. While quoting requirements typically enforce the activity of these participants for a certain portion of the day, we argue that liquidity demand t…

2015-08-18abs ↗pdf ↗

Autonomous robots often encounter challenging situations where their control policies fail and an expert human operator must briefly intervene, e.g., through teleoperation. In settings where multiple robots act in separate environments, a single human operator can manage a fleet of robots by identifying and teleoperati…

2019-09-22abs ↗pdf ↗

Community moderation drifts towards majority, study finds.

problem How to ensure crowd-sourced moderation systems trust and reward accurate evaluations.
method Consensus-based auditing with a two-stage algorithm that weights contributors by the stability of their past residuals.
result Minority contributors' evaluations drift towards the majority, and their participation share falls on controversial topics.

We present our solution to the job recommendation task for RecSys Challenge 2016. The main contribution of our work is to combine temporal learning with sequence modeling to capture complex user-item activity patterns to improve job recommendations. First, we propose a time-based ranking model applied to historical obs…

2016-08-11abs ↗pdf ↗

Paper explores fair classification with bounded disparity using finite datasets.

problem Ensuring fairness in binary classification with protected groups.
method Minimax optimal approach with fairness constraints and demographic disparity control.
result Proposes FairBayes-DDP+ method that achieves minimax lower bound on fairness-aware excess risk.

The efficiency of a modern economy depends on what we call the Value-Tracking Hypothesis: that market prices of key assets broadly track some underlying value. This can be expected if a sufficient weight of market participants are valuation-based traders, buying and selling an asset when its price is, respectively, bel…

2019-03-23abs ↗pdf ↗

Propagates adversarial robustness in federated learning.

problem Heterogeneous federated users with non-iid data and limited resources.
method Adversarial robustness propagation through batch-normalization.
result Federated models achieve remarkable robustness even with limited adversarial training.

MIM-Reasoner learns seed users for maximizing influence in multiplex networks.

problem Maximizing influence in multiplex networks with multiple layers of social interactions.
method Combining reinforcement learning with probabilistic graphical models.
result Established a theoretical guarantee for MIM-Reasoner's performance.

New algorithms for set union in differential privacy improve efficiency and accuracy.

problem Efficiently discovering items from private user data in natural language processing.
method Developed algorithms that allow users to contribute items in a dependent fashion, guided by a policy with contractive properties.
result New algorithms significantly outperform existing mechanisms in terms of efficiency and accuracy.