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

4080119159 · May 202619922001200920172026
48 results for reputation scores

Two novel algorithms improve distributed machine learning in the presence of Byzantine adversaries.

problem Improving distributed machine learning in the presence of Byzantine adversaries.
method Two novel stochastic gradient descent algorithms, ByGARS and ByGARS++, using reputation scores for gradient aggregation.
result Robust to any number of multiplicative noise Byzantine adversaries and converge for strongly convex loss functions.

Well-defined formal definitions for sentiment and opinion are extended to incorporate the necessary elements to provide a formal quantitative definition of reputation. This definition takes the form of a time-based index, in which each element is a function of a collection of opinions mined during a given time period. …

2017-05-28abs ↗pdf ↗

A dealer manages quotes and rejection rules to control slippage risk in FX markets.

problem Managing inventory risk and latency risk in OTC FX market making.
method Dynamic programming and adiabatic-quadratic approximation to optimize quotes and rejection rules.
result Developed a method to optimize quotes and rejection rules for managing slippage risk.

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.

Reducing barriers to entry in large-scale ML markets, study shows multi-objective learning can lower data requirements.

problem Barriers to entry in emerging markets for large-scale machine learning models.
method Defined a multi-objective high-dimensional regression framework to study reputational damage and data requirements.
result The number of data points needed for a new company to enter the market can be significantly smaller than the incumbent company's dataset size.

We propose a continuum model for the description of buyer and seller dynamics in an Internet market. The relevant variables are the research effort of buyers and the sellers' reputation building process. We show that, if a commercial web-site gives consumers the possibility to rate credibly sellers they bargained with,…

2002-07-04abs ↗pdf ↗

Model analyzes how firms balance full disclosure with selective disclosure to maintain a good reputation.

problem Managing reputation in financial markets through voluntary disclosure.
method Developed a dynamic model with two disclosure strategies: candid and sparing, using a piecewise-deterministic model.
result Firms are rewarded for full disclosure but may switch to selective disclosure to avoid potential downgrades.

Reproducibility of modeling is a problem that exists for any machine learning practitioner, whether in industry or academia. The consequences of an irreproducible model can include significant financial costs, lost time, and even loss of personal reputation (if results prove unable to be replicated). This paper will fi…

2018-10-09abs ↗pdf ↗

TadGAN detects anomalies in time series data using GANs and LSTM.

problem Challenges in detecting anomalies in time series data, especially without labeled data.
method TadGAN uses Generative Adversarial Networks (GANs) with LSTM Recurrent Neural Networks to capture temporal correlations and compute anomaly scores.
result TadGAN outperforms 8 baseline methods in most cases, achieving the highest averaged F1 score.

As the number of contributors to online peer-production systems grows, it becomes increasingly important to predict whether the edits that users make will eventually be beneficial to the project. Existing solutions either rely on a user reputation system or consist of a highly specialized predictor that is tailored to …

2018-01-12abs ↗pdf ↗

The persistence of racial inequality in the U.S. labor market against a general backdrop of formal equality of opportunity is a troubling phenomenon that has significant ramifications on the design of hiring policies. In this paper, we show that current group disparate outcomes may be immovable even when hiring decisio…

2017-11-30abs ↗pdf ↗

The paper proposes a fair and private decentralized deep learning framework.

problem Ensuring fairness and privacy in collaborative deep learning.
method A reputation system and differential privacy are used. FDPDDL framework is built with two stages: initialisation and update.
result FDPDDL achieves high fairness, comparable accuracy to centralised and distributed frameworks, and better accuracy than standalone.

Research shows higher damages may encourage more disclosure in corporate disputes.

problem How to resolve disputes over undisclosed material events in a way that encourages voluntary disclosure.
method Dynamic continuous-time model of management's equilibrium disclosure decision.
result Increased damages may lead to an endogenous increase in voluntary disclosure.

Social networks offer a ready channel for fake and misleading news to spread and exert influence. This paper examines the performance of different reputation algorithms when applied to a large and statistically significant portion of the news that are spread via Twitter. Our main result is that simple crowdsourcing-bas…

2019-02-10abs ↗pdf ↗

Neural network models have a reputation for being black boxes. We propose to monitor the features at every layer of a model and measure how suitable they are for classification. We use linear classifiers, which we refer to as "probes", trained entirely independently of the model itself. This helps us better understand …

2016-10-05abs ↗pdf ↗

New algorithm reduces regret in strategic prediction problem.

problem Designing an IC algorithm with sublinear regret for strategic experts.
method Developed a new algorithm WSU-UX and proved a worst-case regret bound.
result WSU-UX suffers a Ω(T2/3)Ω(T^{2/3}) lower bound on regret.

The paper assesses fairness in AI for financial services, using statistical methods.

problem Unintentional bias and insufficient model validation in AI applications.
method Statistical methods for imbalanced data treatment and bias mitigation.
result Fairness evaluation metrics applied to a credit card default payment example.

This paper clarifies Bitcoin's volatility and predictability across daily, weekly, and monthly scales.

problem Clarify Bitcoin's volatility and predictability across different time scales.
method Using daily, weekly, and monthly closing prices and log-returns data, analyze volatility and predictability.
result Bitcoin exhibits high volatility and high predictability, with different behaviors at different time scales.

Clarifies model-based RL's theoretical issues and counterexamples for popular losses.

problem Model-based reinforcement learning's empirical performance vs. theoretical properties and popular loss functions.
method Analyzes empirical and theoretical aspects of model-based RL and constructs counterexamples for losses.
result MuZero loss fails in stochastic and deterministic environments, leading to exponential sample complexity.

Delegated votes in Uniswap DAO favor parties with less self-owned votes and a16z-affiliated entities.

problem Incentives for vote delegation in decentralized governance systems.
method Analysis of Uniswap governance DAO using vote delegation data.
result Vote delegation patterns suggest window-dressing around decentralization and merit-based delegation.

Both generative adversarial networks (GAN) in unsupervised learning and actor-critic methods in reinforcement learning (RL) have gained a reputation for being difficult to optimize. Practitioners in both fields have amassed a large number of strategies to mitigate these instabilities and improve training. Here we show …

2016-10-06abs ↗pdf ↗

Detecting faults and SLA violations in a timely manner is critical for telecom providers, in order to avoid loss in business, revenue and reputation. At the same time predicting SLA violations for user services in telecom environments is difficult, due to time-varying user demands and infrastructure load conditions. In…

2015-09-04abs ↗pdf ↗

The problem of searching for experts in a given academic field is hugely important in both industry and academia. We study exactly this issue with respect to a database of authors and their publications. The idea is to use Latent Semantic Indexing (LSI) and Latent Dirichlet Allocation (LDA) to perform topic modelling i…

2013-11-25abs ↗pdf ↗

Machine learning impacts computational math, offering new functions approximations.

problem Machine learning's black box nature hinders further progress in computational math.
method Analyzes machine learning's impact on computational math and vice versa.
result Integrating computational math with machine learning can enhance both fields.

In 1970, E. M. Andreev published a classification of all three-dimensional compact hyperbolic polyhedra having non-obtuse dihedral angles. Given a combinatorial description of a polyhedron, CC, Andreev's Theorem provides five classes of linear inequalities, depending on CC, for the dihedral angles, which are necessar…

2006-01-07abs ↗pdf ↗

This work improves likelihood of score-based diffusion ODEs using high-order denoising score matching.

problem The gap between maximum likelihood and score matching objectives for score-based diffusion ODEs.
method High-order denoising score matching to maximize likelihood.
result Score-based diffusion ODEs achieve better likelihood on synthetic and CIFAR-10 data.

Nonnegative matrix factorization (NMF) has an established reputation as a useful data analysis technique in numerous applications. However, its usage in practical situations is undergoing challenges in recent years. The fundamental factor to this is the increasingly growing size of the datasets available and needed in …

2015-05-18abs ↗pdf ↗

A new method improves data generation quality by correcting score mismatches.

problem Score mismatch issue in conditional score-based data generation methods.
method Denoising Likelihood Score Matching (DLSM) loss for classifier training.
result The proposed method outperforms previous methods on Cifar-10 and Cifar-100 benchmarks.

New scoring rules improve probabilistic classification model evaluation.

problem Traditional scoring rules misalign with the preference for correct classifications.
method Introduces Penalized Brier Score (PBS) and Penalized Logarithmic Loss (PLL) to modify proper scoring rules.
result PBS and PLL better identify optimal checkpoints and early stopping points, leading to superior F1 scores.