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

19385675 · Jun 202019922001200920172026
48 results for fair compensation

Proposes a compensation mechanism for improving individual forecast confidence.

problem Difficult to assess the quality of individual probabilistic forecasts and their utilities.
method Compensation mechanism based on fair bets and online learning.
result The proposed mechanism cannot be exploited and ensures forecasted utility matches actual utility.

This paper tackles fair online decision-making in contextual bandits, achieving optimal performance and fairness.

problem Fairness in online decision-making systems under strategic manipulation.
method Develops algorithms for linear and smooth reward functions, maintaining fairness and optimal regret.
result Achieves nearly minimax-optimal regret with strong fairness guarantees, even in the presence of attacks.

Q-learning methods represent a commonly used class of algorithms in reinforcement learning: they are generally efficient and simple, and can be combined readily with function approximators for deep reinforcement learning (RL). However, the behavior of Q-learning methods with function approximation is poorly understood,…

2019-02-26abs ↗pdf ↗

The Canonical Regression Quantile method predicts CEO compensation and future performance.

problem Determining fair CEO compensation and its impact on company performance.
method Canonical Regression Quantile method to assess CEO pay and performance.
result The method can predict future CEO performance and distinguish over/underpaid CEOs.

The paper simplifies calculus for semimartingales using multiplicative compensation.

problem Developing a formula for complex-valued semimartingales to simplify stochastic calculus.
method Multiplicative compensation for complex-valued semimartingales.
result The stochastic exponential of complex-valued semimartingales becomes a true martingale after compensation.

The paper proposes multicalibration to improve matching in graphs with imperfect predictors.

problem Finding the best matching in graphs with imperfect predictors.
method Introduces multicalibration as a fairness notion to ensure unbiasedness on protected sets of contexts.
result Constructing a multicalibrated predictor that outperforms standard optimal rules in matching algorithms.

We propose and study the known-compensation multi-arm bandit (KCMAB) problem, where a system controller offers a set of arms to many short-term players for TT steps. In each step, one short-term player arrives to the system. Upon arrival, the player aims to select an arm with the current best average reward and receiv…

2018-11-05abs ↗pdf ↗

The paper introduces Absolute Shapley Value to handle negative contributions in machine learning model training.

problem Negative marginal contributions in machine learning model training.
method Investigates three philosophies: Original Shapley Value, Zero Shapley Value, and Absolute Shapley Value.
result Absolute Shapley Value significantly outperforms other definitions in evaluating data importance.

A machine learning model for PMD compensation in dual-polarization systems.

problem Compensating for polarization-mode dispersion (PMD) in dual-polarization systems.
method Model-based machine learning approach using the split-step Fourier method for the Manakov-PMD equation.
result The model converges to within 1% of peak dB performance after 428 iterations, achieving a 0.30 dB reduction in effective signal-to-noise ratio compared to PMD-free case.

This paper proposes a new method to fairly value data in federated learning.

problem Fairly valuing decentralized data contributions in federated learning.
method Variant of Shapley value (federated Shapley value) that is efficient and respects the order of data contributions.
result The federated Shapley value can reflect the real utility of data sources and enhance system robustness, security, and efficiency.

Extends compactness theory to variable-coefficient pseudo-differential operators on manifolds.

problem Compensated compactness for pseudodifferential operators on vector bundles.
method Establishes a theorem for weakly convergent sequences of sections under a pseudo-differential operator.
result Quadratic form converges in distributional sense under certain conditions.

We present two statistical causes for the distortion of correlations on high-frequency financial data. We demonstrate that the asynchrony of trades as well as the decimalization of stock prices has a large impact on the decline of the correlation coefficients towards smaller return intervals (Epps effect). These distor…

2010-09-30abs ↗pdf ↗

In recent years, unsupervised/weakly-supervised conditional generative adversarial networks (GANs) have achieved many successes on the task of modeling and generating data. However, one of their weaknesses lies in their poor ability to separate, or disentangle, the different factors that characterize the representation…

2020-01-23abs ↗pdf ↗

A second order self-adjoint operator Δ=S2+UΔ=S\partial^2+U is uniquely defined by its principal symbol SS and potential UU if it acts on half-densities. We analyse the potential UU as a compensating field (gauge field) in the sense that it compensates the action of coordinate transformations on the second derivatives in…

2015-09-18abs ↗pdf ↗

The study proves a theorem on Riemannian manifolds for wedge products of weakly convergent differential forms.

problem Analyzing the limiting behavior of wedge products of weakly convergent differential forms on Riemannian manifolds.
method Formulating and proving compensated compactness theorems for wedge products of differential forms on closed Riemannian manifolds.
result The theorem generalizes the div-curl lemma for vectorfields and applies to critical regularity exponents.

This paper explores how enforcing equivariance constraints limits neural network expressivity and proposes compensatory model size increases.

problem The impact of enforcing equivariance constraints on the expressive power of neural networks.
method Examined 2-layer ReLU networks, analyzed boundary hyperplanes and channel vectors, and constructed upper bounds on model size required for compensation.
result Enforcing equivariance constraints reduces the expressive power of neural networks, but this can be compensated by increasing model size.

Two simple methods learn fair metrics from data to improve fairness in ML tasks.

problem Lack of widely accepted fair metrics for many ML tasks hinders individual fairness adoption.
method Presented two simple ways to learn fair metrics from various data types.
result Fair training with learned metrics improves fairness on three ML tasks.

New concept of within-group fairness improves AI fairness without sacrificing accuracy.

problem Fairness issues in AI models treating individuals in the same sensitive group unfairly.
method Introducing within-group fairness, proposing mathematical definitions, and developing learning algorithms.
result Improves within-group fairness without sacrificing accuracy and between-group fairness.

A new fairness metric for decision-making algorithms, conditioning on known fair variables.

problem Fairness issues in decision-making systems.
method Conditional fairness metric, Derivable Conditional Fairness Regularizer (DCFR), adversarial representation.
result Traditional fairness notations are special cases of the new conditional fairness notation.

Paper proposes a modified fairness constraint to address shortcomings of counterfactual fairness.

problem Counterfactual fairness is not a necessary condition for algorithmic fairness.
method Analyzed hypothetical scenario and explicated discrimination to develop causal relevance fairness.
result Causal relevance fairness is a modified constraint that circumvents shortcomings of counterfactual fairness.

DFL framework improves action and outcome fairness in policy learning.

problem Fairness in policy learning, especially action and outcome fairness.
method Integrates action and outcome fairness into a multi-objective optimization problem using a lexicographic weighted Tchebyshev method.
result DFL framework improves both action and outcome fairness with minimal value reduction.

The paper connects counterfactual fairness to robust prediction and group fairness using causal context.

problem The challenge of ensuring fairness in AI systems when counterfactuals cannot be directly observed.
method Using causal context to bridge counterfactual fairness, robust prediction, and group fairness.
result Counterfactual fairness is equivalent to group fairness metrics in specific contexts.

New fairness notion helps identify fair auditors for evaluating decision-support systems.

problem Identifying fair auditors to evaluate decision-support systems for bias.
method Introducing a non-comparative fairness notion based on desired system properties.
result The proposed fairness notion provides guarantees in terms of comparative fairness.

Paper introduces non-linear discounting models for default compensation and climate valuation.

problem Valuation of non-replicable value and damage under default risk.
method Develops two models: one for risk-neutralising discounting and another for survival probability dependent discounting.
result Non-decaying discount factors (negative discount rates) are possible under certain scenarios.