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

136271407542 · Jun 202019922001200920172026
48 results for Expected Discriminatory Information

Expands Bayesian experiment design framework to account for model discrepancies.

problem Model misspecification in Bayesian optimal experiment design.
method Introduces Expected General Information Gain and Expected Discriminatory Information criteria.
result Demonstrates improved robustness and detection capabilities in experiment design.

The study compares uniform-price and discriminatory auctions in terms of learning difficulty.

problem Comparing the learning difficulty of uniform-price and discriminatory multi-unit auctions.
method Characterization of learning difficulty through regret minimization in both full-information and bandit feedback settings.
result Regret scales similarly for both auction formats under full-information, but uniform-price auctions can achieve faster learning rates.

Procedure for determining less discriminatory alternatives in AI audits with limited resources.

problem Difficulty in proving less discriminatory alternatives in AI audits due to resource constraints.
method Closed-form upper bound for loss-fairness Pareto frontier, enabling claimants to fit PFs without training large models.
result A scaling law for loss-fairness Pareto frontiers, allowing claimants to determine if an LDA exists with limited resources.

We observe standard transfer learning can improve prediction accuracies of target tasks at the cost of lowering their prediction fairness -- a phenomenon we named discriminatory transfer. We examine prediction fairness of a standard hypothesis transfer algorithm and a standard multi-task learning algorithm, and show th…

2017-07-03abs ↗pdf ↗

This paper defines less discriminatory algorithms and explores their feasibility.

problem Creating algorithms that are less discriminatory while meeting business needs.
method Formal definition of less discriminatory algorithms, evaluation of feasibility, and search for alternatives.
result Formal definitions of less discriminatory algorithms face challenges due to lack of held-out data, necessitating a reliance on reasonableness standards.

Automated decision making systems are increasingly being used in real-world applications. In these systems for the most part, the decision rules are derived by minimizing the training error on the available historical data. Therefore, if there is a bias related to a sensitive attribute such as gender, race, religion, e…

2018-01-13abs ↗pdf ↗

LDA-XGB1 balances fairness and accuracy in lending models.

problem Fair lending practices and model interpretability in binary classification.
method Biobjective optimization using binning and information value, leveraging XGBoost.
result Achieves effective balance between accuracy, fairness, and interpretability.

New metric MADD assesses fairness of predictive student models.

problem Predictive student models can be biased and unfair, leading to discrimination.
method Proposes MADD metric to analyze model's discriminatory behaviors.
result Fair predictive performance does not guarantee fair behaviors or outcomes.

As algorithms increasingly inform and influence decisions made about individuals, it becomes increasingly important to address concerns that these algorithms might be discriminatory. The output of an algorithm can be discriminatory for many reasons, most notably: (1) the data used to train the algorithm might be biased…

2017-11-22abs ↗pdf ↗

A new framework separates classifier calibration and discrimination.

problem Combining reliability and resolution in probabilistic predictions.
method Manokhin Probability Matrix separates reliability and resolution using Spiegelhalter Z-statistic and AUC-ROC.
result Classifiers are categorized into four archetypes: Eagle, Bull, Sloth, and Mole.

Paper exposes vulnerabilities in interpreting machine learning models using adversarial attacks on PD plots.

problem Vulnerability of permutation-based interpretation methods, particularly PD plots, to adversarial attacks.
method Adversarial framework to manipulate black-box models and produce deceptive PD plots.
result It is possible to hide discriminatory behaviors in machine learning models through interpretation tools like PD plots.

A new method identifies class-specific covariates in multi-class prediction tasks.

problem Identifying covariates specifically associated with one or more outcome classes in multi-class prediction tasks.
method Introducing multi forests (MuFs) with multi-way and binary splits to measure class-associated discriminatory ability.
result The multi-class VIM specifically ranks class-associated covariates highly, unlike conventional VIMs.

Ensuring that classifiers are non-discriminatory or fair with respect to a sensitive feature (e.g., race or gender) is a topical problem. Progress in this task requires fixing a definition of fairness, and there have been several proposals in this regard over the past few years. Several of these, however, assume either…

2019-01-24abs ↗pdf ↗

A new algorithm for efficiently removing specific classes from a model without retraining.

problem Class forgetting in machine learning models.
method Estimating retain and forget spaces using SVD, removing shared information, and updating weights.
result Achieved up to 1.38% accuracy improvement on ImageNet dataset with minimal samples.

A machine learning model may exhibit discrimination when used to make decisions involving people. One potential cause for such outcomes is that the model uses a statistical proxy for a protected demographic attribute. In this paper we formulate a definition of proxy use for the setting of linear regression and present …

2018-10-16abs ↗pdf ↗

The paper examines the stability of binary choice models using Gini index and scoring indicators.

problem Stability and discriminatory power of binary choice models.
method Derives the real Gini index and incorporates PSI and KS statistics into the model.
result The real Gini index should be less than the calculated Gini index when the population distribution changes.

Active inference minimizes expected free energy for optimal behavior.

problem Understanding and optimizing behavior in complex systems.
method Combines Bayesian decision theory, optimal Bayesian design, and the free energy principle.
result Active inference emerges as a unified framework for information-seeking, utility maximization, and goal-directed behavior.

The paper tackles fair set-valued classification under demographic parity constraints.

problem Set-valued classification can amplify discriminatory bias, especially in multiclass settings.
method Proposes two strategies: an oracle-based method and a proxy method, both aiming to satisfy demographic parity and expected size constraints.
result Established distribution-free convergence rates and excess-risk bounds for both methods.

The paper tackles fair representation learning by smoothing feature mappings.

problem Legal liability for discriminatory use of data by organizations.
method Mapping features to a fair representation space, certifying fairness through chi-squared mutual information.
result Smoothing representation distribution provides generalization guarantees of fairness and maintains accuracy for downstream tasks.

Research shows that information asymmetry affects how quickly companies adjust their capital structure and expected returns.

problem The relationship between capital structure adjustment speed and expected returns is influenced by information asymmetry.
method A hybrid data regression model was used to test the hypotheses based on data from 120 companies in the Tehran Stock Exchange.
result Information asymmetry positively affects the relationship between capital structure adjustment speed and expected returns.

FairMixRep learns fair representations from mixed data types.

problem Representation learning in mixed numerical and categorical data with fairness constraints.
method Efficient encoder-decoder framework + fairness constraints.
result Excellent performance in preserving information and fairness in mixed data representations.

Overrides of credit ratings are important correctives of ratings that are determined by statistical rating models. Financial institutions and banking regulators agree on this because on the one hand errors with ratings of corporates or banks can have fatal consequences for the lending institutions and on the other hand…

2012-03-10abs ↗pdf ↗

Data-driven algorithms play a large role in decision making across a variety of industries. Increasingly, these algorithms are being used to make decisions that have significant ramifications for people's social and economic well-being, e.g. in sentencing, loan approval, and policing. Amid the proliferation of such sys…

2018-09-24abs ↗pdf ↗

Study on optimal information acquisition in Kyle model with entropy cost.

problem Optimal information acquisition in Kyle model with entropy cost.
method Continuous signals are optimal, and any signal with a logit posterior distribution yields the same ex-ante value.
result Posterior expected payoff becomes normally distributed as information acquisition cost increases.

Estimates expected information gain using density approximations and dimension reduction.

problem Estimating expected information gain in nonlinear and non-Gaussian settings.
method Flexible transport-based schemes for EIG estimation, optimal sample allocation, and gradient-based upper bounds on mutual information.
result Optimal sample allocation and dimension reduction schemes improve EIG estimation accuracy and convergence rate.

The paper confirms a conjecture about optimal expected utility in markets with insider information.

problem Optimal expected utility in markets with insider information.
method An extension of the Black-Scholes-Merton model with a sequence of discrete-time economies.
result Optimal expected utility converges to the classic model when conditions are met.

We study the informational efficiency of a market with a single traded asset. The price initially differs from the fundamental value, about which the agents have noisy private information (which is, on average, correct). A fraction of traders revise their price expectations in each period. The price at which the asset …

2010-09-26abs ↗pdf ↗

Paper proposes an unbiased optimization method for Bayesian experimental design.

problem Maximizing expected information gain in Bayesian experimental design.
method Randomized multilevel Monte Carlo (MLMC) method combined with stochastic gradient descent.
result An unbiased estimator for the gradient of expected information gain.

New method improves robustness of Bayesian experimental design.

problem Bayesian experimental design's sensitivity to prior distribution changes.
method Introduces robust expected information gain (REIG) and uses KL-divergence ambiguity sets.
result REIG stabilizes sampling-based EIG estimation and compensates for prior variability.

New method corrects active learning for distribution shifts and outliers.

problem Conventional active learning methods fail to account for test-time distribution.
method JEPIG, a hybrid of BALD and EPIG, maximizes expected predictive information gain.
result JEPIG outperforms conventional methods in active learning with distribution shifts.

For distributions P\mathbb{P} and Q\mathbb{Q} with different supports or undefined densities, the divergence D(PQ)\textrm{D}(\mathbb{P}||\mathbb{Q}) may not exist. We define a Spread Divergence D~(PQ)\tilde{\textrm{D}}(\mathbb{P}||\mathbb{Q}) on modified P\mathbb{P} and Q\mathbb{Q} and describe sufficient conditions for t…

2018-11-21abs ↗pdf ↗

Fairness is a critical trait in decision making. As machine-learning models are increasingly being used in sensitive application domains (e.g. education and employment) for decision making, it is crucial that the decisions computed by such models are free of unintended bias. But how can we automatically validate the fa…

2018-07-02abs ↗pdf ↗

The paper calculates the value of information in high-dimensional decision making.

problem Determining the value of acquiring new information in high-dimensional decision problems.
method Using tools from sub-Gaussian processes and generic chaining for asymptotic analysis.
result Asymptotic results on the expected value of information as dimensionality increases.